/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe007_power.opt-thin001_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:11:31,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:11:31,800 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 12:11:31,804 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:11:31,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:11:31,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:11:31,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:11:31,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:11:31,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:11:31,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:11:31,831 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:11:31,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:11:31,832 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:11:31,833 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:11:31,833 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:11:31,833 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:11:31,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:11:31,833 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:11:31,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:11:31,834 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:11:31,834 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:11:31,834 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:11:31,834 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:11:31,835 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:11:31,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:11:31,835 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:11:31,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:11:31,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:11:31,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:11:31,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:11:31,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:11:31,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:11:31,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:11:31,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:11:31,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:11:31,837 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 12:11:32,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:11:32,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:11:32,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:11:32,092 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:11:32,092 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:11:32,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe007_power.opt-thin001_power.opt.i [2023-08-26 12:11:33,028 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:11:33,224 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:11:33,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe007_power.opt-thin001_power.opt.i [2023-08-26 12:11:33,245 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d06a5d6a3/911abb3f133d4c21997ffb2e8adebc61/FLAGf8247b635 [2023-08-26 12:11:33,255 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d06a5d6a3/911abb3f133d4c21997ffb2e8adebc61 [2023-08-26 12:11:33,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:11:33,257 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:11:33,259 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:11:33,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:11:33,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:11:33,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@749de7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33, skipping insertion in model container [2023-08-26 12:11:33,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,307 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:11:33,578 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:11:33,589 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:11:33,613 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 12:11:33,614 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 12:11:33,648 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:11:33,675 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:11:33,676 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:11:33,680 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:11:33,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33 WrapperNode [2023-08-26 12:11:33,681 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:11:33,682 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:11:33,682 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:11:33,682 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:11:33,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,716 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,745 INFO L138 Inliner]: procedures = 176, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 188 [2023-08-26 12:11:33,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:11:33,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:11:33,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:11:33,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:11:33,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,773 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,777 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,780 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:11:33,780 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:11:33,780 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:11:33,783 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:11:33,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:11:33,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:11:33,813 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 12:11:33,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 12:11:33,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 12:11:33,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:11:33,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 12:11:33,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:11:33,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:11:33,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:11:33,847 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 12:11:33,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 12:11:33,847 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 12:11:33,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 12:11:33,847 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 12:11:33,848 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 12:11:33,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:11:33,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 12:11:33,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:11:33,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:11:33,850 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 12:11:33,967 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:11:33,968 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:11:34,371 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:11:34,726 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:11:34,727 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:11:34,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:11:34 BoogieIcfgContainer [2023-08-26 12:11:34,729 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:11:34,730 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:11:34,730 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:11:34,732 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:11:34,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:11:33" (1/3) ... [2023-08-26 12:11:34,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374185f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:11:34, skipping insertion in model container [2023-08-26 12:11:34,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33" (2/3) ... [2023-08-26 12:11:34,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374185f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:11:34, skipping insertion in model container [2023-08-26 12:11:34,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:11:34" (3/3) ... [2023-08-26 12:11:34,735 INFO L112 eAbstractionObserver]: Analyzing ICFG safe007_power.opt-thin001_power.opt.i [2023-08-26 12:11:34,747 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:11:34,747 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2023-08-26 12:11:34,747 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:11:34,836 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 12:11:34,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 167 transitions, 349 flow [2023-08-26 12:11:34,933 INFO L124 PetriNetUnfolderBase]: 3/164 cut-off events. [2023-08-26 12:11:34,933 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:11:34,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 164 events. 3/164 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 221 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-08-26 12:11:34,938 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 167 transitions, 349 flow [2023-08-26 12:11:34,943 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 164 transitions, 337 flow [2023-08-26 12:11:34,945 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:11:34,961 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 164 transitions, 337 flow [2023-08-26 12:11:34,963 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 164 transitions, 337 flow [2023-08-26 12:11:34,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 164 transitions, 337 flow [2023-08-26 12:11:35,029 INFO L124 PetriNetUnfolderBase]: 3/164 cut-off events. [2023-08-26 12:11:35,029 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:11:35,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 164 events. 3/164 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 221 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-08-26 12:11:35,033 INFO L119 LiptonReduction]: Number of co-enabled transitions 5058 [2023-08-26 12:11:42,882 INFO L134 LiptonReduction]: Checked pairs total: 22799 [2023-08-26 12:11:42,882 INFO L136 LiptonReduction]: Total number of compositions: 146 [2023-08-26 12:11:42,891 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:11:42,895 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;@4d469aff, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:11:42,895 INFO L358 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2023-08-26 12:11:42,897 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:11:42,897 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 12:11:42,897 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:11:42,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:42,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:11:42,898 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-08-26 12:11:42,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:42,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1062, now seen corresponding path program 1 times [2023-08-26 12:11:42,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:42,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101130057] [2023-08-26 12:11:42,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:42,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:42,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:42,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:42,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101130057] [2023-08-26 12:11:42,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101130057] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:42,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:42,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:11:42,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415671469] [2023-08-26 12:11:42,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:43,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:11:43,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:43,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:11:43,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:11:43,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 313 [2023-08-26 12:11:43,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 66 transitions, 141 flow. Second operand has 2 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:43,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:43,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 313 [2023-08-26 12:11:43,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:44,417 INFO L124 PetriNetUnfolderBase]: 10206/14559 cut-off events. [2023-08-26 12:11:44,417 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-26 12:11:44,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29135 conditions, 14559 events. 10206/14559 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 1252. Compared 93801 event pairs, 10206 based on Foata normal form. 0/7652 useless extension candidates. Maximal degree in co-relation 29124. Up to 14504 conditions per place. [2023-08-26 12:11:44,496 INFO L140 encePairwiseOnDemand]: 291/313 looper letters, 40 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2023-08-26 12:11:44,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 173 flow [2023-08-26 12:11:44,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:11:44,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:11:44,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 308 transitions. [2023-08-26 12:11:44,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49201277955271566 [2023-08-26 12:11:44,507 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 308 transitions. [2023-08-26 12:11:44,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 308 transitions. [2023-08-26 12:11:44,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:44,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 308 transitions. [2023-08-26 12:11:44,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 154.0) internal successors, (308), 2 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:44,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:44,517 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:44,521 INFO L175 Difference]: Start difference. First operand has 74 places, 66 transitions, 141 flow. Second operand 2 states and 308 transitions. [2023-08-26 12:11:44,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 173 flow [2023-08-26 12:11:44,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 12:11:44,525 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 90 flow [2023-08-26 12:11:44,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-26 12:11:44,529 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -24 predicate places. [2023-08-26 12:11:44,529 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 90 flow [2023-08-26 12:11:44,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:44,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:44,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 12:11:44,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:11:44,530 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-08-26 12:11:44,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:44,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1157819103, now seen corresponding path program 1 times [2023-08-26 12:11:44,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:44,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576307190] [2023-08-26 12:11:44,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:44,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:44,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:44,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:44,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576307190] [2023-08-26 12:11:44,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576307190] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:44,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:44,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:11:44,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138264236] [2023-08-26 12:11:44,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:44,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:11:44,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:44,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:11:44,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:11:44,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 313 [2023-08-26 12:11:44,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:44,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:44,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 313 [2023-08-26 12:11:44,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:45,974 INFO L124 PetriNetUnfolderBase]: 9143/13025 cut-off events. [2023-08-26 12:11:45,974 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:11:45,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26101 conditions, 13025 events. 9143/13025 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1128. Compared 88367 event pairs, 1702 based on Foata normal form. 0/7120 useless extension candidates. Maximal degree in co-relation 26098. Up to 10445 conditions per place. [2023-08-26 12:11:46,026 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 64 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-08-26 12:11:46,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 68 transitions, 276 flow [2023-08-26 12:11:46,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:11:46,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:11:46,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-08-26 12:11:46,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46112886048988283 [2023-08-26 12:11:46,028 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-08-26 12:11:46,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-08-26 12:11:46,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:46,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-08-26 12:11:46,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:46,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:46,032 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:46,032 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 90 flow. Second operand 3 states and 433 transitions. [2023-08-26 12:11:46,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 68 transitions, 276 flow [2023-08-26 12:11:46,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 68 transitions, 276 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:11:46,033 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 92 flow [2023-08-26 12:11:46,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-08-26 12:11:46,034 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -23 predicate places. [2023-08-26 12:11:46,034 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 92 flow [2023-08-26 12:11:46,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:46,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:46,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:46,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:11:46,035 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-08-26 12:11:46,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:46,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1532654705, now seen corresponding path program 1 times [2023-08-26 12:11:46,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:46,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698858797] [2023-08-26 12:11:46,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:46,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:46,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:46,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:46,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698858797] [2023-08-26 12:11:46,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698858797] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:46,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:46,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:11:46,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057127575] [2023-08-26 12:11:46,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:46,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:11:46,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:46,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:11:46,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:11:46,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 313 [2023-08-26 12:11:46,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:46,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:46,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 313 [2023-08-26 12:11:46,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:46,877 INFO L124 PetriNetUnfolderBase]: 4154/6026 cut-off events. [2023-08-26 12:11:46,877 INFO L125 PetriNetUnfolderBase]: For 255/255 co-relation queries the response was YES. [2023-08-26 12:11:46,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12330 conditions, 6026 events. 4154/6026 cut-off events. For 255/255 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 34373 event pairs, 4154 based on Foata normal form. 0/3952 useless extension candidates. Maximal degree in co-relation 12326. Up to 5988 conditions per place. [2023-08-26 12:11:46,895 INFO L140 encePairwiseOnDemand]: 305/313 looper letters, 31 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-08-26 12:11:46,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 34 transitions, 142 flow [2023-08-26 12:11:46,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:11:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:11:46,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-08-26 12:11:46,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38977635782747605 [2023-08-26 12:11:46,897 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-08-26 12:11:46,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-08-26 12:11:46,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:46,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-08-26 12:11:46,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:46,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:46,900 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:46,900 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 92 flow. Second operand 3 states and 366 transitions. [2023-08-26 12:11:46,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 34 transitions, 142 flow [2023-08-26 12:11:46,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:11:46,901 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2023-08-26 12:11:46,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-26 12:11:46,902 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -30 predicate places. [2023-08-26 12:11:46,902 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2023-08-26 12:11:46,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:46,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:46,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:46,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:11:46,903 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-08-26 12:11:46,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:46,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1532654704, now seen corresponding path program 1 times [2023-08-26 12:11:46,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:46,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851850610] [2023-08-26 12:11:46,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:46,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:46,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 12:11:46,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:46,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851850610] [2023-08-26 12:11:46,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851850610] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:46,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:46,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:11:46,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425970384] [2023-08-26 12:11:46,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:46,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:11:46,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:46,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:11:46,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:11:46,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 313 [2023-08-26 12:11:46,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:46,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:46,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 313 [2023-08-26 12:11:46,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:47,389 INFO L124 PetriNetUnfolderBase]: 2280/3543 cut-off events. [2023-08-26 12:11:47,389 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:11:47,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7040 conditions, 3543 events. 2280/3543 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 19927 event pairs, 1170 based on Foata normal form. 0/3029 useless extension candidates. Maximal degree in co-relation 7036. Up to 1414 conditions per place. [2023-08-26 12:11:47,400 INFO L140 encePairwiseOnDemand]: 299/313 looper letters, 43 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2023-08-26 12:11:47,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 212 flow [2023-08-26 12:11:47,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:11:47,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:11:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-08-26 12:11:47,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38498402555910544 [2023-08-26 12:11:47,402 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-08-26 12:11:47,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-08-26 12:11:47,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:47,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-08-26 12:11:47,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:47,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:47,406 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:47,406 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 4 states and 482 transitions. [2023-08-26 12:11:47,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 212 flow [2023-08-26 12:11:47,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:11:47,407 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 139 flow [2023-08-26 12:11:47,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2023-08-26 12:11:47,408 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -27 predicate places. [2023-08-26 12:11:47,408 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 139 flow [2023-08-26 12:11:47,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:47,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:47,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:47,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:11:47,409 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-08-26 12:11:47,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:47,409 INFO L85 PathProgramCache]: Analyzing trace with hash 459392882, now seen corresponding path program 1 times [2023-08-26 12:11:47,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:47,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62883573] [2023-08-26 12:11:47,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:47,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:47,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:47,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:47,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62883573] [2023-08-26 12:11:47,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62883573] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:47,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:47,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:11:47,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748047467] [2023-08-26 12:11:47,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:47,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:11:47,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:47,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:11:47,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:11:47,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 313 [2023-08-26 12:11:47,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:47,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:47,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 313 [2023-08-26 12:11:47,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:47,832 INFO L124 PetriNetUnfolderBase]: 2206/3490 cut-off events. [2023-08-26 12:11:47,832 INFO L125 PetriNetUnfolderBase]: For 918/918 co-relation queries the response was YES. [2023-08-26 12:11:47,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9032 conditions, 3490 events. 2206/3490 cut-off events. For 918/918 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 20186 event pairs, 679 based on Foata normal form. 0/3213 useless extension candidates. Maximal degree in co-relation 9026. Up to 2638 conditions per place. [2023-08-26 12:11:47,843 INFO L140 encePairwiseOnDemand]: 309/313 looper letters, 50 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2023-08-26 12:11:47,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 311 flow [2023-08-26 12:11:47,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:11:47,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:11:47,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2023-08-26 12:11:47,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4398296059637913 [2023-08-26 12:11:47,845 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2023-08-26 12:11:47,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2023-08-26 12:11:47,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:47,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2023-08-26 12:11:47,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:47,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:47,847 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:47,847 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 139 flow. Second operand 3 states and 413 transitions. [2023-08-26 12:11:47,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 311 flow [2023-08-26 12:11:47,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 55 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:11:47,850 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 150 flow [2023-08-26 12:11:47,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2023-08-26 12:11:47,850 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -25 predicate places. [2023-08-26 12:11:47,851 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 150 flow [2023-08-26 12:11:47,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:47,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:47,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:47,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:11:47,851 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-08-26 12:11:47,851 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:47,851 INFO L85 PathProgramCache]: Analyzing trace with hash 459393213, now seen corresponding path program 1 times [2023-08-26 12:11:47,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:47,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438448426] [2023-08-26 12:11:47,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:47,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:47,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:47,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438448426] [2023-08-26 12:11:47,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438448426] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:47,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:47,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:11:47,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671900971] [2023-08-26 12:11:47,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:47,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:11:47,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:47,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:11:47,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:11:47,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 313 [2023-08-26 12:11:47,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:47,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:47,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 313 [2023-08-26 12:11:47,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:48,313 INFO L124 PetriNetUnfolderBase]: 2155/3669 cut-off events. [2023-08-26 12:11:48,313 INFO L125 PetriNetUnfolderBase]: For 2242/2242 co-relation queries the response was YES. [2023-08-26 12:11:48,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9520 conditions, 3669 events. 2155/3669 cut-off events. For 2242/2242 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 24112 event pairs, 377 based on Foata normal form. 0/3452 useless extension candidates. Maximal degree in co-relation 9512. Up to 2467 conditions per place. [2023-08-26 12:11:48,325 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 63 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-08-26 12:11:48,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 407 flow [2023-08-26 12:11:48,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:11:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:11:48,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-26 12:11:48,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44621938232161873 [2023-08-26 12:11:48,327 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-26 12:11:48,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-26 12:11:48,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:48,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-26 12:11:48,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:48,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:48,330 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:48,330 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 150 flow. Second operand 3 states and 419 transitions. [2023-08-26 12:11:48,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 407 flow [2023-08-26 12:11:48,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 67 transitions, 397 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:11:48,337 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 152 flow [2023-08-26 12:11:48,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2023-08-26 12:11:48,339 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -24 predicate places. [2023-08-26 12:11:48,341 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 152 flow [2023-08-26 12:11:48,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:48,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:48,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:48,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:11:48,342 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-08-26 12:11:48,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:48,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1356286154, now seen corresponding path program 1 times [2023-08-26 12:11:48,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:48,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742731637] [2023-08-26 12:11:48,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:48,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:48,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:48,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:48,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742731637] [2023-08-26 12:11:48,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742731637] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:48,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:48,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:11:48,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704577055] [2023-08-26 12:11:48,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:48,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:11:48,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:48,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:11:48,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:11:48,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 313 [2023-08-26 12:11:48,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:48,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:48,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 313 [2023-08-26 12:11:48,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:49,080 INFO L124 PetriNetUnfolderBase]: 3542/5684 cut-off events. [2023-08-26 12:11:49,080 INFO L125 PetriNetUnfolderBase]: For 2550/2550 co-relation queries the response was YES. [2023-08-26 12:11:49,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15707 conditions, 5684 events. 3542/5684 cut-off events. For 2550/2550 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 36074 event pairs, 816 based on Foata normal form. 50/5436 useless extension candidates. Maximal degree in co-relation 15698. Up to 2286 conditions per place. [2023-08-26 12:11:49,102 INFO L140 encePairwiseOnDemand]: 309/313 looper letters, 75 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2023-08-26 12:11:49,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 475 flow [2023-08-26 12:11:49,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:11:49,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:11:49,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 544 transitions. [2023-08-26 12:11:49,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43450479233226835 [2023-08-26 12:11:49,104 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 544 transitions. [2023-08-26 12:11:49,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 544 transitions. [2023-08-26 12:11:49,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:49,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 544 transitions. [2023-08-26 12:11:49,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:49,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:49,107 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:49,107 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 152 flow. Second operand 4 states and 544 transitions. [2023-08-26 12:11:49,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 475 flow [2023-08-26 12:11:49,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 79 transitions, 469 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:11:49,110 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 167 flow [2023-08-26 12:11:49,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2023-08-26 12:11:49,110 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -21 predicate places. [2023-08-26 12:11:49,110 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 167 flow [2023-08-26 12:11:49,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:49,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:49,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:49,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:11:49,111 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-08-26 12:11:49,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:49,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1356415868, now seen corresponding path program 1 times [2023-08-26 12:11:49,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:49,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184776515] [2023-08-26 12:11:49,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:49,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:49,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:49,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184776515] [2023-08-26 12:11:49,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184776515] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:49,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:49,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:11:49,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572942591] [2023-08-26 12:11:49,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:49,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:11:49,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:49,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:11:49,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:11:49,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 313 [2023-08-26 12:11:49,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:49,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:49,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 313 [2023-08-26 12:11:49,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:49,723 INFO L124 PetriNetUnfolderBase]: 3314/5340 cut-off events. [2023-08-26 12:11:49,723 INFO L125 PetriNetUnfolderBase]: For 2501/2501 co-relation queries the response was YES. [2023-08-26 12:11:49,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15761 conditions, 5340 events. 3314/5340 cut-off events. For 2501/2501 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 34433 event pairs, 1604 based on Foata normal form. 0/5141 useless extension candidates. Maximal degree in co-relation 15750. Up to 3203 conditions per place. [2023-08-26 12:11:49,741 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 43 selfloop transitions, 6 changer transitions 1/52 dead transitions. [2023-08-26 12:11:49,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 315 flow [2023-08-26 12:11:49,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:11:49,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:11:49,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 456 transitions. [2023-08-26 12:11:49,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36421725239616615 [2023-08-26 12:11:49,743 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 456 transitions. [2023-08-26 12:11:49,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 456 transitions. [2023-08-26 12:11:49,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:49,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 456 transitions. [2023-08-26 12:11:49,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:49,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:49,746 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:49,746 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 167 flow. Second operand 4 states and 456 transitions. [2023-08-26 12:11:49,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 315 flow [2023-08-26 12:11:49,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:11:49,751 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 199 flow [2023-08-26 12:11:49,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2023-08-26 12:11:49,751 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -20 predicate places. [2023-08-26 12:11:49,751 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 199 flow [2023-08-26 12:11:49,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:49,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:49,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:49,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:11:49,752 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-08-26 12:11:49,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:49,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1356286599, now seen corresponding path program 1 times [2023-08-26 12:11:49,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:49,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54238986] [2023-08-26 12:11:49,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:49,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:50,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:50,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54238986] [2023-08-26 12:11:50,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54238986] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:50,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:50,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:11:50,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227394288] [2023-08-26 12:11:50,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:50,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:11:50,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:50,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:11:50,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:11:50,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 313 [2023-08-26 12:11:50,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:50,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:50,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 313 [2023-08-26 12:11:50,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:50,477 INFO L124 PetriNetUnfolderBase]: 3154/5105 cut-off events. [2023-08-26 12:11:50,477 INFO L125 PetriNetUnfolderBase]: For 3929/3929 co-relation queries the response was YES. [2023-08-26 12:11:50,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15784 conditions, 5105 events. 3154/5105 cut-off events. For 3929/3929 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 32906 event pairs, 1272 based on Foata normal form. 75/4981 useless extension candidates. Maximal degree in co-relation 15772. Up to 4222 conditions per place. [2023-08-26 12:11:50,491 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 50 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2023-08-26 12:11:50,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 366 flow [2023-08-26 12:11:50,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:11:50,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:11:50,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2023-08-26 12:11:50,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3793929712460064 [2023-08-26 12:11:50,493 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2023-08-26 12:11:50,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2023-08-26 12:11:50,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:50,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2023-08-26 12:11:50,494 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 12:11:50,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:50,496 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:50,496 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 199 flow. Second operand 4 states and 475 transitions. [2023-08-26 12:11:50,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 366 flow [2023-08-26 12:11:50,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 55 transitions, 356 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 12:11:50,498 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 191 flow [2023-08-26 12:11:50,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2023-08-26 12:11:50,499 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -21 predicate places. [2023-08-26 12:11:50,499 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 191 flow [2023-08-26 12:11:50,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:50,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:50,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:50,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:11:50,499 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-08-26 12:11:50,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:50,500 INFO L85 PathProgramCache]: Analyzing trace with hash -904750439, now seen corresponding path program 1 times [2023-08-26 12:11:50,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:50,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020402326] [2023-08-26 12:11:50,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:50,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:50,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:50,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:50,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020402326] [2023-08-26 12:11:50,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020402326] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:50,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:50,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:11:50,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210683349] [2023-08-26 12:11:50,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:50,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:11:50,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:50,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:11:50,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:11:50,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 313 [2023-08-26 12:11:50,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:50,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:50,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 313 [2023-08-26 12:11:50,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:50,974 INFO L124 PetriNetUnfolderBase]: 2752/4442 cut-off events. [2023-08-26 12:11:50,974 INFO L125 PetriNetUnfolderBase]: For 3444/3446 co-relation queries the response was YES. [2023-08-26 12:11:50,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13307 conditions, 4442 events. 2752/4442 cut-off events. For 3444/3446 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 27614 event pairs, 1384 based on Foata normal form. 60/4345 useless extension candidates. Maximal degree in co-relation 13296. Up to 1848 conditions per place. [2023-08-26 12:11:50,988 INFO L140 encePairwiseOnDemand]: 302/313 looper letters, 48 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2023-08-26 12:11:50,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 383 flow [2023-08-26 12:11:50,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:11:50,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:11:50,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 460 transitions. [2023-08-26 12:11:50,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36741214057507987 [2023-08-26 12:11:50,990 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 460 transitions. [2023-08-26 12:11:50,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 460 transitions. [2023-08-26 12:11:50,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:50,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 460 transitions. [2023-08-26 12:11:50,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:50,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:50,992 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:50,992 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 191 flow. Second operand 4 states and 460 transitions. [2023-08-26 12:11:50,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 383 flow [2023-08-26 12:11:50,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 59 transitions, 377 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:11:50,995 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 255 flow [2023-08-26 12:11:50,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2023-08-26 12:11:50,996 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -18 predicate places. [2023-08-26 12:11:50,996 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 255 flow [2023-08-26 12:11:50,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:50,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:50,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:50,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 12:11:50,996 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-08-26 12:11:50,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:50,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2142521152, now seen corresponding path program 1 times [2023-08-26 12:11:50,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:50,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10710180] [2023-08-26 12:11:50,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:50,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:51,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:51,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:51,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10710180] [2023-08-26 12:11:51,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10710180] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:51,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:51,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:11:51,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442939318] [2023-08-26 12:11:51,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:51,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:11:51,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:51,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:11:51,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:11:51,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 313 [2023-08-26 12:11:51,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 255 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:51,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:51,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 313 [2023-08-26 12:11:51,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:51,542 INFO L124 PetriNetUnfolderBase]: 2739/4417 cut-off events. [2023-08-26 12:11:51,542 INFO L125 PetriNetUnfolderBase]: For 7176/7184 co-relation queries the response was YES. [2023-08-26 12:11:51,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14528 conditions, 4417 events. 2739/4417 cut-off events. For 7176/7184 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 28047 event pairs, 893 based on Foata normal form. 14/4294 useless extension candidates. Maximal degree in co-relation 14516. Up to 3767 conditions per place. [2023-08-26 12:11:51,555 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 65 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-08-26 12:11:51,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 69 transitions, 564 flow [2023-08-26 12:11:51,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:11:51,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:11:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2023-08-26 12:11:51,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4355697550585729 [2023-08-26 12:11:51,556 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 409 transitions. [2023-08-26 12:11:51,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions. [2023-08-26 12:11:51,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:51,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions. [2023-08-26 12:11:51,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:51,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:51,558 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:51,558 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 255 flow. Second operand 3 states and 409 transitions. [2023-08-26 12:11:51,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 69 transitions, 564 flow [2023-08-26 12:11:51,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 536 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-26 12:11:51,569 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 246 flow [2023-08-26 12:11:51,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2023-08-26 12:11:51,569 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -17 predicate places. [2023-08-26 12:11:51,569 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 246 flow [2023-08-26 12:11:51,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:51,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:51,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:51,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 12:11:51,570 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-08-26 12:11:51,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:51,570 INFO L85 PathProgramCache]: Analyzing trace with hash 2017508091, now seen corresponding path program 1 times [2023-08-26 12:11:51,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:51,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820384307] [2023-08-26 12:11:51,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:51,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:51,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:51,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820384307] [2023-08-26 12:11:51,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820384307] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:51,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:51,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:11:51,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187935338] [2023-08-26 12:11:51,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:51,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:11:51,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:51,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:11:51,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:11:51,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 313 [2023-08-26 12:11:51,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 246 flow. Second operand has 7 states, 7 states have (on average 101.85714285714286) internal successors, (713), 7 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:51,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:51,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 313 [2023-08-26 12:11:51,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:52,133 INFO L124 PetriNetUnfolderBase]: 2337/3810 cut-off events. [2023-08-26 12:11:52,133 INFO L125 PetriNetUnfolderBase]: For 4357/4357 co-relation queries the response was YES. [2023-08-26 12:11:52,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12526 conditions, 3810 events. 2337/3810 cut-off events. For 4357/4357 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 23211 event pairs, 990 based on Foata normal form. 58/3782 useless extension candidates. Maximal degree in co-relation 12513. Up to 1825 conditions per place. [2023-08-26 12:11:52,145 INFO L140 encePairwiseOnDemand]: 301/313 looper letters, 57 selfloop transitions, 11 changer transitions 4/74 dead transitions. [2023-08-26 12:11:52,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 74 transitions, 526 flow [2023-08-26 12:11:52,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:11:52,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:11:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 662 transitions. [2023-08-26 12:11:52,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35250266240681577 [2023-08-26 12:11:52,147 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 662 transitions. [2023-08-26 12:11:52,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 662 transitions. [2023-08-26 12:11:52,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:52,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 662 transitions. [2023-08-26 12:11:52,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:52,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 313.0) internal successors, (2191), 7 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:52,151 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 313.0) internal successors, (2191), 7 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:52,151 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 246 flow. Second operand 6 states and 662 transitions. [2023-08-26 12:11:52,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 74 transitions, 526 flow [2023-08-26 12:11:52,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 74 transitions, 516 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:11:52,157 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 323 flow [2023-08-26 12:11:52,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=323, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2023-08-26 12:11:52,158 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2023-08-26 12:11:52,158 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 323 flow [2023-08-26 12:11:52,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.85714285714286) internal successors, (713), 7 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:52,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:52,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:52,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 12:11:52,158 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-08-26 12:11:52,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:52,159 INFO L85 PathProgramCache]: Analyzing trace with hash 760278124, now seen corresponding path program 1 times [2023-08-26 12:11:52,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:52,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289243495] [2023-08-26 12:11:52,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:52,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:52,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:52,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:52,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289243495] [2023-08-26 12:11:52,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289243495] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:52,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:52,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:11:52,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512259256] [2023-08-26 12:11:52,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:52,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:11:52,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:52,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:11:52,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:11:52,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 313 [2023-08-26 12:11:52,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 323 flow. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:52,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:52,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 313 [2023-08-26 12:11:52,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:53,179 INFO L124 PetriNetUnfolderBase]: 4686/7409 cut-off events. [2023-08-26 12:11:53,179 INFO L125 PetriNetUnfolderBase]: For 20211/20228 co-relation queries the response was YES. [2023-08-26 12:11:53,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25576 conditions, 7409 events. 4686/7409 cut-off events. For 20211/20228 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 48630 event pairs, 1078 based on Foata normal form. 53/7304 useless extension candidates. Maximal degree in co-relation 25562. Up to 2974 conditions per place. [2023-08-26 12:11:53,208 INFO L140 encePairwiseOnDemand]: 309/313 looper letters, 113 selfloop transitions, 3 changer transitions 0/117 dead transitions. [2023-08-26 12:11:53,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 117 transitions, 1098 flow [2023-08-26 12:11:53,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:11:53,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:11:53,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2023-08-26 12:11:53,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44009584664536744 [2023-08-26 12:11:53,210 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2023-08-26 12:11:53,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2023-08-26 12:11:53,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:53,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2023-08-26 12:11:53,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:53,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:53,213 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:53,213 INFO L175 Difference]: Start difference. First operand has 62 places, 45 transitions, 323 flow. Second operand 4 states and 551 transitions. [2023-08-26 12:11:53,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 117 transitions, 1098 flow [2023-08-26 12:11:53,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 117 transitions, 1066 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 12:11:53,251 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 330 flow [2023-08-26 12:11:53,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=330, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2023-08-26 12:11:53,251 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-08-26 12:11:53,251 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 330 flow [2023-08-26 12:11:53,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:53,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:53,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:53,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 12:11:53,252 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-08-26 12:11:53,252 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:53,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1881755945, now seen corresponding path program 1 times [2023-08-26 12:11:53,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:53,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806960313] [2023-08-26 12:11:53,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:53,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:53,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:53,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:53,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806960313] [2023-08-26 12:11:53,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806960313] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:53,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:53,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:11:53,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462852562] [2023-08-26 12:11:53,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:53,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 12:11:53,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:53,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 12:11:53,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-08-26 12:11:53,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 313 [2023-08-26 12:11:53,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 330 flow. Second operand has 8 states, 8 states have (on average 99.75) internal successors, (798), 8 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:53,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:53,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 313 [2023-08-26 12:11:53,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:54,017 INFO L124 PetriNetUnfolderBase]: 3388/5376 cut-off events. [2023-08-26 12:11:54,017 INFO L125 PetriNetUnfolderBase]: For 9111/9119 co-relation queries the response was YES. [2023-08-26 12:11:54,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18699 conditions, 5376 events. 3388/5376 cut-off events. For 9111/9119 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 32604 event pairs, 905 based on Foata normal form. 104/5452 useless extension candidates. Maximal degree in co-relation 18682. Up to 2832 conditions per place. [2023-08-26 12:11:54,030 INFO L140 encePairwiseOnDemand]: 303/313 looper letters, 16 selfloop transitions, 3 changer transitions 51/72 dead transitions. [2023-08-26 12:11:54,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 551 flow [2023-08-26 12:11:54,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:11:54,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:11:54,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 740 transitions. [2023-08-26 12:11:54,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3377453217708809 [2023-08-26 12:11:54,032 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 740 transitions. [2023-08-26 12:11:54,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 740 transitions. [2023-08-26 12:11:54,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:54,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 740 transitions. [2023-08-26 12:11:54,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.71428571428571) internal successors, (740), 7 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:54,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 313.0) internal successors, (2504), 8 states have internal predecessors, (2504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:54,036 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 313.0) internal successors, (2504), 8 states have internal predecessors, (2504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:54,036 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 330 flow. Second operand 7 states and 740 transitions. [2023-08-26 12:11:54,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 551 flow [2023-08-26 12:11:54,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 72 transitions, 523 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-08-26 12:11:54,111 INFO L231 Difference]: Finished difference. Result has 60 places, 21 transitions, 94 flow [2023-08-26 12:11:54,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=94, PETRI_PLACES=60, PETRI_TRANSITIONS=21} [2023-08-26 12:11:54,111 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -14 predicate places. [2023-08-26 12:11:54,111 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 21 transitions, 94 flow [2023-08-26 12:11:54,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 99.75) internal successors, (798), 8 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:54,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:54,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:54,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 12:11:54,112 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-08-26 12:11:54,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:54,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1674128800, now seen corresponding path program 1 times [2023-08-26 12:11:54,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:54,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75081508] [2023-08-26 12:11:54,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:54,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:54,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:54,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:54,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75081508] [2023-08-26 12:11:54,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75081508] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:54,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:54,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:11:54,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481324137] [2023-08-26 12:11:54,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:54,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:11:54,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:54,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:11:54,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:11:54,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 313 [2023-08-26 12:11:54,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 21 transitions, 94 flow. Second operand has 7 states, 7 states have (on average 96.85714285714286) internal successors, (678), 7 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:54,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:54,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 313 [2023-08-26 12:11:54,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:54,969 INFO L124 PetriNetUnfolderBase]: 218/367 cut-off events. [2023-08-26 12:11:54,969 INFO L125 PetriNetUnfolderBase]: For 478/478 co-relation queries the response was YES. [2023-08-26 12:11:54,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 367 events. 218/367 cut-off events. For 478/478 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1196 event pairs, 41 based on Foata normal form. 12/373 useless extension candidates. Maximal degree in co-relation 979. Up to 203 conditions per place. [2023-08-26 12:11:54,970 INFO L140 encePairwiseOnDemand]: 305/313 looper letters, 25 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2023-08-26 12:11:54,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 34 transitions, 190 flow [2023-08-26 12:11:54,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:11:54,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:11:54,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 604 transitions. [2023-08-26 12:11:54,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32161874334398294 [2023-08-26 12:11:54,972 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 604 transitions. [2023-08-26 12:11:54,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 604 transitions. [2023-08-26 12:11:54,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:54,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 604 transitions. [2023-08-26 12:11:54,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:54,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 313.0) internal successors, (2191), 7 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:54,975 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 313.0) internal successors, (2191), 7 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:54,975 INFO L175 Difference]: Start difference. First operand has 60 places, 21 transitions, 94 flow. Second operand 6 states and 604 transitions. [2023-08-26 12:11:54,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 34 transitions, 190 flow [2023-08-26 12:11:54,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 34 transitions, 159 flow, removed 5 selfloop flow, removed 13 redundant places. [2023-08-26 12:11:54,977 INFO L231 Difference]: Finished difference. Result has 45 places, 24 transitions, 103 flow [2023-08-26 12:11:54,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=103, PETRI_PLACES=45, PETRI_TRANSITIONS=24} [2023-08-26 12:11:54,977 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -29 predicate places. [2023-08-26 12:11:54,977 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 24 transitions, 103 flow [2023-08-26 12:11:54,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.85714285714286) internal successors, (678), 7 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:54,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:54,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:54,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 12:11:54,978 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-08-26 12:11:54,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:54,978 INFO L85 PathProgramCache]: Analyzing trace with hash 358408983, now seen corresponding path program 1 times [2023-08-26 12:11:54,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:54,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763918313] [2023-08-26 12:11:54,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:54,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:55,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:55,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:55,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763918313] [2023-08-26 12:11:55,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763918313] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:55,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:55,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:11:55,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900829582] [2023-08-26 12:11:55,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:55,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 12:11:55,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:55,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 12:11:55,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-26 12:11:55,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 313 [2023-08-26 12:11:55,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 24 transitions, 103 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 12:11:55,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:55,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 313 [2023-08-26 12:11:55,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:55,756 INFO L124 PetriNetUnfolderBase]: 213/355 cut-off events. [2023-08-26 12:11:55,756 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2023-08-26 12:11:55,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1058 conditions, 355 events. 213/355 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1145 event pairs, 94 based on Foata normal form. 2/355 useless extension candidates. Maximal degree in co-relation 1050. Up to 316 conditions per place. [2023-08-26 12:11:55,757 INFO L140 encePairwiseOnDemand]: 305/313 looper letters, 28 selfloop transitions, 11 changer transitions 0/41 dead transitions. [2023-08-26 12:11:55,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 41 transitions, 254 flow [2023-08-26 12:11:55,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:11:55,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:11:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 599 transitions. [2023-08-26 12:11:55,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31895633652822153 [2023-08-26 12:11:55,759 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 599 transitions. [2023-08-26 12:11:55,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 599 transitions. [2023-08-26 12:11:55,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:55,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 599 transitions. [2023-08-26 12:11:55,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:55,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 313.0) internal successors, (2191), 7 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:55,762 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 313.0) internal successors, (2191), 7 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:55,762 INFO L175 Difference]: Start difference. First operand has 45 places, 24 transitions, 103 flow. Second operand 6 states and 599 transitions. [2023-08-26 12:11:55,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 41 transitions, 254 flow [2023-08-26 12:11:55,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 230 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-26 12:11:55,763 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 183 flow [2023-08-26 12:11:55,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=183, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2023-08-26 12:11:55,763 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -25 predicate places. [2023-08-26 12:11:55,764 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 183 flow [2023-08-26 12:11:55,764 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 12:11:55,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:55,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:55,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 12:11:55,764 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-08-26 12:11:55,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:55,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1776291611, now seen corresponding path program 1 times [2023-08-26 12:11:55,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:55,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777514255] [2023-08-26 12:11:55,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:55,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:55,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:55,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777514255] [2023-08-26 12:11:55,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777514255] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:55,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:55,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:11:55,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939979859] [2023-08-26 12:11:55,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:55,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:11:55,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:55,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:11:55,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:11:55,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 313 [2023-08-26 12:11:55,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:55,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:55,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 313 [2023-08-26 12:11:55,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:55,928 INFO L124 PetriNetUnfolderBase]: 138/250 cut-off events. [2023-08-26 12:11:55,929 INFO L125 PetriNetUnfolderBase]: For 330/330 co-relation queries the response was YES. [2023-08-26 12:11:55,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 849 conditions, 250 events. 138/250 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 841 event pairs, 30 based on Foata normal form. 12/260 useless extension candidates. Maximal degree in co-relation 838. Up to 227 conditions per place. [2023-08-26 12:11:55,929 INFO L140 encePairwiseOnDemand]: 308/313 looper letters, 38 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2023-08-26 12:11:55,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 44 transitions, 325 flow [2023-08-26 12:11:55,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:11:55,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:11:55,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-08-26 12:11:55,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4068157614483493 [2023-08-26 12:11:55,931 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-08-26 12:11:55,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-08-26 12:11:55,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:55,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-08-26 12:11:55,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:55,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:55,933 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:55,933 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 183 flow. Second operand 3 states and 382 transitions. [2023-08-26 12:11:55,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 44 transitions, 325 flow [2023-08-26 12:11:55,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 305 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-08-26 12:11:55,934 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 179 flow [2023-08-26 12:11:55,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2023-08-26 12:11:55,934 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -25 predicate places. [2023-08-26 12:11:55,934 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 179 flow [2023-08-26 12:11:55,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:55,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:55,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:55,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 12:11:55,935 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-08-26 12:11:55,935 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:55,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1742585162, now seen corresponding path program 1 times [2023-08-26 12:11:55,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:55,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732697608] [2023-08-26 12:11:55,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:55,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:56,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:56,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732697608] [2023-08-26 12:11:56,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732697608] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:56,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:56,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 12:11:56,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616104440] [2023-08-26 12:11:56,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:56,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 12:11:56,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:56,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 12:11:56,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-26 12:11:56,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 313 [2023-08-26 12:11:56,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 179 flow. Second operand has 9 states, 9 states have (on average 94.77777777777777) internal successors, (853), 9 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:56,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:56,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 313 [2023-08-26 12:11:56,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:56,960 INFO L124 PetriNetUnfolderBase]: 140/256 cut-off events. [2023-08-26 12:11:56,960 INFO L125 PetriNetUnfolderBase]: For 300/302 co-relation queries the response was YES. [2023-08-26 12:11:56,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 256 events. 140/256 cut-off events. For 300/302 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 817 event pairs, 32 based on Foata normal form. 3/258 useless extension candidates. Maximal degree in co-relation 971. Up to 148 conditions per place. [2023-08-26 12:11:56,961 INFO L140 encePairwiseOnDemand]: 306/313 looper letters, 33 selfloop transitions, 12 changer transitions 0/47 dead transitions. [2023-08-26 12:11:56,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 47 transitions, 335 flow [2023-08-26 12:11:56,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:11:56,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:11:56,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 589 transitions. [2023-08-26 12:11:56,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3136315228966986 [2023-08-26 12:11:56,963 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 589 transitions. [2023-08-26 12:11:56,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 589 transitions. [2023-08-26 12:11:56,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:56,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 589 transitions. [2023-08-26 12:11:56,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:56,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 313.0) internal successors, (2191), 7 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:56,967 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 313.0) internal successors, (2191), 7 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:56,967 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 179 flow. Second operand 6 states and 589 transitions. [2023-08-26 12:11:56,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 47 transitions, 335 flow [2023-08-26 12:11:56,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 47 transitions, 318 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 12:11:56,968 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 213 flow [2023-08-26 12:11:56,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2023-08-26 12:11:56,969 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -21 predicate places. [2023-08-26 12:11:56,969 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 213 flow [2023-08-26 12:11:56,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 94.77777777777777) internal successors, (853), 9 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:56,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:56,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:56,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 12:11:56,969 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-08-26 12:11:56,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:56,970 INFO L85 PathProgramCache]: Analyzing trace with hash 2050498596, now seen corresponding path program 1 times [2023-08-26 12:11:56,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:56,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448808566] [2023-08-26 12:11:56,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:56,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:57,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:57,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:57,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448808566] [2023-08-26 12:11:57,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448808566] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:57,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:57,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:11:57,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204706354] [2023-08-26 12:11:57,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:57,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:11:57,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:57,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:11:57,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:11:57,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 313 [2023-08-26 12:11:57,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 35 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:57,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:57,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 313 [2023-08-26 12:11:57,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:57,160 INFO L124 PetriNetUnfolderBase]: 57/129 cut-off events. [2023-08-26 12:11:57,161 INFO L125 PetriNetUnfolderBase]: For 239/241 co-relation queries the response was YES. [2023-08-26 12:11:57,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 129 events. 57/129 cut-off events. For 239/241 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 361 event pairs, 5 based on Foata normal form. 19/148 useless extension candidates. Maximal degree in co-relation 509. Up to 71 conditions per place. [2023-08-26 12:11:57,161 INFO L140 encePairwiseOnDemand]: 308/313 looper letters, 40 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2023-08-26 12:11:57,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 49 transitions, 396 flow [2023-08-26 12:11:57,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:11:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:11:57,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 507 transitions. [2023-08-26 12:11:57,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049520766773163 [2023-08-26 12:11:57,162 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 507 transitions. [2023-08-26 12:11:57,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 507 transitions. [2023-08-26 12:11:57,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:57,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 507 transitions. [2023-08-26 12:11:57,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:57,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:57,165 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:57,165 INFO L175 Difference]: Start difference. First operand has 53 places, 35 transitions, 213 flow. Second operand 4 states and 507 transitions. [2023-08-26 12:11:57,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 49 transitions, 396 flow [2023-08-26 12:11:57,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 49 transitions, 367 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-26 12:11:57,166 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 201 flow [2023-08-26 12:11:57,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=53, PETRI_TRANSITIONS=34} [2023-08-26 12:11:57,166 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -21 predicate places. [2023-08-26 12:11:57,167 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 34 transitions, 201 flow [2023-08-26 12:11:57,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:57,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:57,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:57,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 12:11:57,167 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-08-26 12:11:57,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:57,167 INFO L85 PathProgramCache]: Analyzing trace with hash 99635429, now seen corresponding path program 1 times [2023-08-26 12:11:57,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:57,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260886048] [2023-08-26 12:11:57,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:57,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:58,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:58,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:58,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260886048] [2023-08-26 12:11:58,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260886048] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:58,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:58,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 12:11:58,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947612701] [2023-08-26 12:11:58,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:58,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 12:11:58,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:58,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 12:11:58,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-08-26 12:11:58,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 313 [2023-08-26 12:11:58,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 34 transitions, 201 flow. Second operand has 9 states, 9 states have (on average 93.88888888888889) internal successors, (845), 9 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:58,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:58,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 313 [2023-08-26 12:11:58,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:58,326 INFO L124 PetriNetUnfolderBase]: 56/126 cut-off events. [2023-08-26 12:11:58,326 INFO L125 PetriNetUnfolderBase]: For 235/235 co-relation queries the response was YES. [2023-08-26 12:11:58,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 126 events. 56/126 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 337 event pairs, 11 based on Foata normal form. 1/127 useless extension candidates. Maximal degree in co-relation 540. Up to 101 conditions per place. [2023-08-26 12:11:58,327 INFO L140 encePairwiseOnDemand]: 306/313 looper letters, 34 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2023-08-26 12:11:58,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 43 transitions, 335 flow [2023-08-26 12:11:58,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:11:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:11:58,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 583 transitions. [2023-08-26 12:11:58,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3104366347177849 [2023-08-26 12:11:58,328 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 583 transitions. [2023-08-26 12:11:58,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 583 transitions. [2023-08-26 12:11:58,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:58,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 583 transitions. [2023-08-26 12:11:58,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.16666666666667) internal successors, (583), 6 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:58,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 313.0) internal successors, (2191), 7 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:58,332 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 313.0) internal successors, (2191), 7 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:58,332 INFO L175 Difference]: Start difference. First operand has 53 places, 34 transitions, 201 flow. Second operand 6 states and 583 transitions. [2023-08-26 12:11:58,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 43 transitions, 335 flow [2023-08-26 12:11:58,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 43 transitions, 312 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-26 12:11:58,333 INFO L231 Difference]: Finished difference. Result has 57 places, 34 transitions, 206 flow [2023-08-26 12:11:58,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=57, PETRI_TRANSITIONS=34} [2023-08-26 12:11:58,333 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -17 predicate places. [2023-08-26 12:11:58,333 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 34 transitions, 206 flow [2023-08-26 12:11:58,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.88888888888889) internal successors, (845), 9 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:58,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:58,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:58,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 12:11:58,334 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-08-26 12:11:58,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:58,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1384459600, now seen corresponding path program 1 times [2023-08-26 12:11:58,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:58,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438847946] [2023-08-26 12:11:58,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:58,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:58,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:58,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:58,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438847946] [2023-08-26 12:11:58,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438847946] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:58,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:58,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:11:58,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154331420] [2023-08-26 12:11:58,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:58,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:11:58,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:58,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:11:58,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:11:58,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 313 [2023-08-26 12:11:58,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 34 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:58,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:58,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 313 [2023-08-26 12:11:58,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:58,513 INFO L124 PetriNetUnfolderBase]: 36/85 cut-off events. [2023-08-26 12:11:58,513 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2023-08-26 12:11:58,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 85 events. 36/85 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 207 event pairs, 2 based on Foata normal form. 8/91 useless extension candidates. Maximal degree in co-relation 355. Up to 34 conditions per place. [2023-08-26 12:11:58,514 INFO L140 encePairwiseOnDemand]: 308/313 looper letters, 35 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2023-08-26 12:11:58,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 47 transitions, 400 flow [2023-08-26 12:11:58,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:11:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:11:58,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 625 transitions. [2023-08-26 12:11:58,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3993610223642173 [2023-08-26 12:11:58,515 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 625 transitions. [2023-08-26 12:11:58,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 625 transitions. [2023-08-26 12:11:58,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:58,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 625 transitions. [2023-08-26 12:11:58,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:58,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 313.0) internal successors, (1878), 6 states have internal predecessors, (1878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:58,518 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 313.0) internal successors, (1878), 6 states have internal predecessors, (1878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:58,518 INFO L175 Difference]: Start difference. First operand has 57 places, 34 transitions, 206 flow. Second operand 5 states and 625 transitions. [2023-08-26 12:11:58,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 47 transitions, 400 flow [2023-08-26 12:11:58,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 47 transitions, 309 flow, removed 10 selfloop flow, removed 10 redundant places. [2023-08-26 12:11:58,519 INFO L231 Difference]: Finished difference. Result has 52 places, 32 transitions, 174 flow [2023-08-26 12:11:58,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=52, PETRI_TRANSITIONS=32} [2023-08-26 12:11:58,519 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -22 predicate places. [2023-08-26 12:11:58,519 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 32 transitions, 174 flow [2023-08-26 12:11:58,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:58,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:58,520 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 12:11:58,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 12:11:58,520 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-08-26 12:11:58,520 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:58,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1169232243, now seen corresponding path program 1 times [2023-08-26 12:11:58,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:58,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118642575] [2023-08-26 12:11:58,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:58,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:11:58,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:11:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:11:58,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:11:58,641 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:11:58,642 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONASSERT (65 of 66 remaining) [2023-08-26 12:11:58,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (64 of 66 remaining) [2023-08-26 12:11:58,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 66 remaining) [2023-08-26 12:11:58,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 66 remaining) [2023-08-26 12:11:58,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 66 remaining) [2023-08-26 12:11:58,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 66 remaining) [2023-08-26 12:11:58,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 66 remaining) [2023-08-26 12:11:58,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 66 remaining) [2023-08-26 12:11:58,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 66 remaining) [2023-08-26 12:11:58,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 66 remaining) [2023-08-26 12:11:58,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 66 remaining) [2023-08-26 12:11:58,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 66 remaining) [2023-08-26 12:11:58,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 66 remaining) [2023-08-26 12:11:58,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 66 remaining) [2023-08-26 12:11:58,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 66 remaining) [2023-08-26 12:11:58,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 66 remaining) [2023-08-26 12:11:58,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 66 remaining) [2023-08-26 12:11:58,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 66 remaining) [2023-08-26 12:11:58,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 66 remaining) [2023-08-26 12:11:58,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 66 remaining) [2023-08-26 12:11:58,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 66 remaining) [2023-08-26 12:11:58,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 66 remaining) [2023-08-26 12:11:58,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 66 remaining) [2023-08-26 12:11:58,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 66 remaining) [2023-08-26 12:11:58,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 66 remaining) [2023-08-26 12:11:58,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 66 remaining) [2023-08-26 12:11:58,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 66 remaining) [2023-08-26 12:11:58,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 66 remaining) [2023-08-26 12:11:58,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 66 remaining) [2023-08-26 12:11:58,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 66 remaining) [2023-08-26 12:11:58,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 66 remaining) [2023-08-26 12:11:58,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 66 remaining) [2023-08-26 12:11:58,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 66 remaining) [2023-08-26 12:11:58,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 66 remaining) [2023-08-26 12:11:58,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 66 remaining) [2023-08-26 12:11:58,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 66 remaining) [2023-08-26 12:11:58,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 66 remaining) [2023-08-26 12:11:58,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 66 remaining) [2023-08-26 12:11:58,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 66 remaining) [2023-08-26 12:11:58,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 66 remaining) [2023-08-26 12:11:58,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 66 remaining) [2023-08-26 12:11:58,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (24 of 66 remaining) [2023-08-26 12:11:58,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 66 remaining) [2023-08-26 12:11:58,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 66 remaining) [2023-08-26 12:11:58,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 66 remaining) [2023-08-26 12:11:58,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 66 remaining) [2023-08-26 12:11:58,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 66 remaining) [2023-08-26 12:11:58,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 66 remaining) [2023-08-26 12:11:58,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 66 remaining) [2023-08-26 12:11:58,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 66 remaining) [2023-08-26 12:11:58,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 66 remaining) [2023-08-26 12:11:58,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 66 remaining) [2023-08-26 12:11:58,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 66 remaining) [2023-08-26 12:11:58,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 66 remaining) [2023-08-26 12:11:58,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 66 remaining) [2023-08-26 12:11:58,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 66 remaining) [2023-08-26 12:11:58,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 66 remaining) [2023-08-26 12:11:58,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 66 remaining) [2023-08-26 12:11:58,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 66 remaining) [2023-08-26 12:11:58,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 66 remaining) [2023-08-26 12:11:58,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 66 remaining) [2023-08-26 12:11:58,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 66 remaining) [2023-08-26 12:11:58,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 66 remaining) [2023-08-26 12:11:58,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 66 remaining) [2023-08-26 12:11:58,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 66 remaining) [2023-08-26 12:11:58,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 66 remaining) [2023-08-26 12:11:58,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 12:11:58,650 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:58,655 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:11:58,656 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:11:58,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:11:58 BasicIcfg [2023-08-26 12:11:58,726 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:11:58,726 INFO L158 Benchmark]: Toolchain (without parser) took 25468.47ms. Allocated memory was 335.5MB in the beginning and 2.3GB in the end (delta: 2.0GB). Free memory was 310.8MB in the beginning and 901.2MB in the end (delta: -590.4MB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. [2023-08-26 12:11:58,726 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 335.5MB. Free memory was 311.9MB in the beginning and 311.8MB in the end (delta: 144.5kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:11:58,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.93ms. Allocated memory is still 335.5MB. Free memory was 310.3MB in the beginning and 286.3MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 12:11:58,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.38ms. Allocated memory is still 335.5MB. Free memory was 286.3MB in the beginning and 283.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 12:11:58,726 INFO L158 Benchmark]: Boogie Preprocessor took 33.81ms. Allocated memory is still 335.5MB. Free memory was 283.5MB in the beginning and 281.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:11:58,727 INFO L158 Benchmark]: RCFGBuilder took 948.51ms. Allocated memory was 335.5MB in the beginning and 455.1MB in the end (delta: 119.5MB). Free memory was 281.4MB in the beginning and 380.7MB in the end (delta: -99.2MB). Peak memory consumption was 52.2MB. Max. memory is 16.0GB. [2023-08-26 12:11:58,727 INFO L158 Benchmark]: TraceAbstraction took 23995.32ms. Allocated memory was 455.1MB in the beginning and 2.3GB in the end (delta: 1.8GB). Free memory was 379.6MB in the beginning and 901.2MB in the end (delta: -521.6MB). Peak memory consumption was 1.3GB. Max. memory is 16.0GB. [2023-08-26 12:11:58,728 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 335.5MB. Free memory was 311.9MB in the beginning and 311.8MB in the end (delta: 144.5kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 421.93ms. Allocated memory is still 335.5MB. Free memory was 310.3MB in the beginning and 286.3MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 63.38ms. Allocated memory is still 335.5MB. Free memory was 286.3MB in the beginning and 283.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.81ms. Allocated memory is still 335.5MB. Free memory was 283.5MB in the beginning and 281.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 948.51ms. Allocated memory was 335.5MB in the beginning and 455.1MB in the end (delta: 119.5MB). Free memory was 281.4MB in the beginning and 380.7MB in the end (delta: -99.2MB). Peak memory consumption was 52.2MB. Max. memory is 16.0GB. * TraceAbstraction took 23995.32ms. Allocated memory was 455.1MB in the beginning and 2.3GB in the end (delta: 1.8GB). Free memory was 379.6MB in the beginning and 901.2MB in the end (delta: -521.6MB). Peak memory consumption was 1.3GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.9s, 171 PlacesBefore, 74 PlacesAfterwards, 164 TransitionsBefore, 66 TransitionsAfterwards, 5058 CoEnabledTransitionPairs, 7 FixpointIterations, 66 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 146 TotalNumberOfCompositions, 22799 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7476, independent: 7013, independent conditional: 0, independent unconditional: 7013, dependent: 463, dependent conditional: 0, dependent unconditional: 463, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2372, independent: 2310, independent conditional: 0, independent unconditional: 2310, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7476, independent: 4703, independent conditional: 0, independent unconditional: 4703, dependent: 401, dependent conditional: 0, dependent unconditional: 401, unknown: 2372, unknown conditional: 0, unknown unconditional: 2372] , Statistics on independence cache: Total cache size (in pairs): 438, Positive cache size: 398, Positive conditional cache size: 0, Positive unconditional cache size: 398, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L717] 0 int __unbuffered_p2_EAX$mem_tmp; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L727] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L728] 0 int __unbuffered_p2_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L730] 0 int __unbuffered_p2_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L738] 0 _Bool y$flush_delayed; [L739] 0 int y$mem_tmp; [L740] 0 _Bool y$r_buff0_thd0; [L741] 0 _Bool y$r_buff0_thd1; [L742] 0 _Bool y$r_buff0_thd2; [L743] 0 _Bool y$r_buff0_thd3; [L744] 0 _Bool y$r_buff1_thd0; [L745] 0 _Bool y$r_buff1_thd1; [L746] 0 _Bool y$r_buff1_thd2; [L747] 0 _Bool y$r_buff1_thd3; [L748] 0 _Bool y$read_delayed; [L749] 0 int *y$read_delayed_var; [L750] 0 int y$w_buff0; [L751] 0 _Bool y$w_buff0_used; [L752] 0 int y$w_buff1; [L753] 0 _Bool y$w_buff1_used; [L755] 0 int z = 0; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice1; [L758] 0 _Bool weak$$choice2; [L850] 0 pthread_t t1940; [L851] FCALL, FORK 0 pthread_create(&t1940, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1940, ((void *)0), P0, ((void *)0))=-1, t1940={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}, z=0] [L852] 0 pthread_t t1941; [L853] FCALL, FORK 0 pthread_create(&t1941, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1941, ((void *)0), P1, ((void *)0))=0, t1940={7:0}, t1941={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L854] 0 pthread_t t1942; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1940={7:0}, t1941={8:0}, t1942={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}, z=0] [L855] FCALL, FORK 0 pthread_create(&t1942, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1942, ((void *)0), P2, ((void *)0))=1, t1940={7:0}, t1941={8:0}, t1942={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}, z=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(y) [L809] 3 y$mem_tmp = y [L810] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] EXPR 3 \read(y) [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L814] 3 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_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L815] 3 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_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_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}, z=0] [L825] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_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}, z=1] [L762] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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}, z=1] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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}, z=1] [L777] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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}, z=1] [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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}, z=1] [L780] 2 y$w_buff1 = y$w_buff0 [L781] 2 y$w_buff0 = 1 [L782] 2 y$w_buff1_used = y$w_buff0_used [L783] 2 y$w_buff0_used = (_Bool)1 [L784] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L784] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L792] 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) [L792] 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) [L793] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 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 [L795] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L772] 1 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1940={7:0}, t1941={8:0}, t1942={5: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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L872] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe007_power.opt-thin001_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 216 locations, 66 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: 23.8s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 592 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 592 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1497 IncrementalHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 2 mSDtfsCounter, 1497 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=330occurred in iteration=13, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 283 NumberOfCodeBlocks, 283 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 241 ConstructedInterpolants, 0 QuantifiedInterpolants, 2885 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 12:11:58,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...