/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe014_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:23:27,620 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:23:27,655 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 18:23:27,658 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:23:27,658 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:23:27,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:23:27,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:23:27,682 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:23:27,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:23:27,685 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:23:27,685 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:23:27,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:23:27,685 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:23:27,686 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:23:27,686 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:23:27,686 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:23:27,686 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:23:27,687 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:23:27,687 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:23:27,687 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:23:27,687 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:23:27,688 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:23:27,688 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:23:27,689 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:23:27,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:23:27,689 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:23:27,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:23:27,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:23:27,689 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:23:27,689 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:23:27,690 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:23:27,690 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:23:27,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:23:27,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:23:27,691 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:23:27,691 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 18:23:27,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:23:27,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:23:27,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:23:27,965 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:23:27,965 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:23:27,968 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe014_power.oepc.i [2023-08-26 18:23:28,965 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:23:29,217 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:23:29,218 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_power.oepc.i [2023-08-26 18:23:29,232 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fce204121/b9d8163e84fa4afd9a0454f9e69c885d/FLAG865d27f70 [2023-08-26 18:23:29,243 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fce204121/b9d8163e84fa4afd9a0454f9e69c885d [2023-08-26 18:23:29,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:23:29,246 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:23:29,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:23:29,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:23:29,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:23:29,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:23:29" (1/1) ... [2023-08-26 18:23:29,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c901cd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:29, skipping insertion in model container [2023-08-26 18:23:29,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:23:29" (1/1) ... [2023-08-26 18:23:29,292 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:23:29,553 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:23:29,560 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:23:29,577 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 18:23:29,578 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 18:23:29,610 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:23:29,638 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:23:29,638 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:23:29,643 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:23:29,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:29 WrapperNode [2023-08-26 18:23:29,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:23:29,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:23:29,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:23:29,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:23:29,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:29" (1/1) ... [2023-08-26 18:23:29,676 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:29" (1/1) ... [2023-08-26 18:23:29,701 INFO L138 Inliner]: procedures = 176, calls = 70, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2023-08-26 18:23:29,701 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:23:29,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:23:29,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:23:29,702 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:23:29,709 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:29" (1/1) ... [2023-08-26 18:23:29,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:29" (1/1) ... [2023-08-26 18:23:29,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:29" (1/1) ... [2023-08-26 18:23:29,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:29" (1/1) ... [2023-08-26 18:23:29,734 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:29" (1/1) ... [2023-08-26 18:23:29,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:29" (1/1) ... [2023-08-26 18:23:29,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:29" (1/1) ... [2023-08-26 18:23:29,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:29" (1/1) ... [2023-08-26 18:23:29,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:23:29,741 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:23:29,741 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:23:29,741 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:23:29,742 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:29" (1/1) ... [2023-08-26 18:23:29,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:23:29,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:23:29,769 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 18:23:29,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 18:23:29,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 18:23:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:23:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:23:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:23:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:23:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:23:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:23:29,800 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:23:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:23:29,801 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:23:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:23:29,801 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:23:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:23:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:23:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:23:29,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:23:29,803 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 18:23:29,922 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:23:29,923 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:23:30,220 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:23:30,536 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:23:30,536 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:23:30,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:23:30 BoogieIcfgContainer [2023-08-26 18:23:30,538 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:23:30,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:23:30,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:23:30,543 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:23:30,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:23:29" (1/3) ... [2023-08-26 18:23:30,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34107792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:23:30, skipping insertion in model container [2023-08-26 18:23:30,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:29" (2/3) ... [2023-08-26 18:23:30,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34107792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:23:30, skipping insertion in model container [2023-08-26 18:23:30,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:23:30" (3/3) ... [2023-08-26 18:23:30,546 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_power.oepc.i [2023-08-26 18:23:30,559 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:23:30,559 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2023-08-26 18:23:30,559 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:23:30,662 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:23:30,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 162 transitions, 339 flow [2023-08-26 18:23:30,769 INFO L124 PetriNetUnfolderBase]: 3/159 cut-off events. [2023-08-26 18:23:30,770 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:23:30,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 159 events. 3/159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 222 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2023-08-26 18:23:30,779 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 162 transitions, 339 flow [2023-08-26 18:23:30,786 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 159 transitions, 327 flow [2023-08-26 18:23:30,788 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:23:30,797 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 159 transitions, 327 flow [2023-08-26 18:23:30,801 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 159 transitions, 327 flow [2023-08-26 18:23:30,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 159 transitions, 327 flow [2023-08-26 18:23:30,834 INFO L124 PetriNetUnfolderBase]: 3/159 cut-off events. [2023-08-26 18:23:30,834 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:23:30,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 159 events. 3/159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 224 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2023-08-26 18:23:30,837 INFO L119 LiptonReduction]: Number of co-enabled transitions 5090 [2023-08-26 18:23:38,220 INFO L134 LiptonReduction]: Checked pairs total: 20554 [2023-08-26 18:23:38,221 INFO L136 LiptonReduction]: Total number of compositions: 148 [2023-08-26 18:23:38,234 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:23:38,239 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;@2455bb4d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:23:38,239 INFO L358 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2023-08-26 18:23:38,240 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:23:38,240 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:23:38,240 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:23:38,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:38,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:23:38,241 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 18:23:38,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:38,244 INFO L85 PathProgramCache]: Analyzing trace with hash 925, now seen corresponding path program 1 times [2023-08-26 18:23:38,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:38,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607257702] [2023-08-26 18:23:38,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:38,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:38,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:38,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:38,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607257702] [2023-08-26 18:23:38,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607257702] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:38,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:38,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:23:38,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532718294] [2023-08-26 18:23:38,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:38,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:23:38,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:38,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:23:38,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:23:38,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 310 [2023-08-26 18:23:38,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 131 flow. Second operand has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:38,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:38,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 310 [2023-08-26 18:23:38,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:39,116 INFO L124 PetriNetUnfolderBase]: 4396/6519 cut-off events. [2023-08-26 18:23:39,117 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:23:39,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12913 conditions, 6519 events. 4396/6519 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 41279 event pairs, 4396 based on Foata normal form. 135/3708 useless extension candidates. Maximal degree in co-relation 12902. Up to 6348 conditions per place. [2023-08-26 18:23:39,148 INFO L140 encePairwiseOnDemand]: 289/310 looper letters, 35 selfloop transitions, 0 changer transitions 0/40 dead transitions. [2023-08-26 18:23:39,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 159 flow [2023-08-26 18:23:39,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:23:39,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:23:39,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 306 transitions. [2023-08-26 18:23:39,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4935483870967742 [2023-08-26 18:23:39,158 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 306 transitions. [2023-08-26 18:23:39,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 306 transitions. [2023-08-26 18:23:39,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:39,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 306 transitions. [2023-08-26 18:23:39,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:39,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 310.0) internal successors, (930), 3 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:39,167 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 310.0) internal successors, (930), 3 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:39,168 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 131 flow. Second operand 2 states and 306 transitions. [2023-08-26 18:23:39,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 159 flow [2023-08-26 18:23:39,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 156 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:23:39,172 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 86 flow [2023-08-26 18:23:39,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-26 18:23:39,175 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -22 predicate places. [2023-08-26 18:23:39,175 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 86 flow [2023-08-26 18:23:39,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:39,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:39,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:23:39,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:23:39,176 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 18:23:39,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:39,182 INFO L85 PathProgramCache]: Analyzing trace with hash 913873, now seen corresponding path program 1 times [2023-08-26 18:23:39,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:39,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687847068] [2023-08-26 18:23:39,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:39,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:39,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:39,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:39,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687847068] [2023-08-26 18:23:39,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687847068] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:39,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:39,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:23:39,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682381050] [2023-08-26 18:23:39,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:39,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:23:39,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:39,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:23:39,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:23:39,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 310 [2023-08-26 18:23:39,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:39,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:39,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 310 [2023-08-26 18:23:39,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:39,802 INFO L124 PetriNetUnfolderBase]: 2605/3908 cut-off events. [2023-08-26 18:23:39,803 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:23:39,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7751 conditions, 3908 events. 2605/3908 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 21792 event pairs, 2605 based on Foata normal form. 0/2595 useless extension candidates. Maximal degree in co-relation 7748. Up to 3806 conditions per place. [2023-08-26 18:23:39,815 INFO L140 encePairwiseOnDemand]: 303/310 looper letters, 30 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-08-26 18:23:39,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 34 transitions, 136 flow [2023-08-26 18:23:39,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:23:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:23:39,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-08-26 18:23:39,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3881720430107527 [2023-08-26 18:23:39,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-08-26 18:23:39,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-08-26 18:23:39,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:39,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-08-26 18:23:39,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:39,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:39,820 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:39,821 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 86 flow. Second operand 3 states and 361 transitions. [2023-08-26 18:23:39,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 34 transitions, 136 flow [2023-08-26 18:23:39,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 136 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:23:39,821 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2023-08-26 18:23:39,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, 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 18:23:39,822 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -26 predicate places. [2023-08-26 18:23:39,822 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2023-08-26 18:23:39,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:39,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:39,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:23:39,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:23:39,823 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 18:23:39,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:39,823 INFO L85 PathProgramCache]: Analyzing trace with hash 913872, now seen corresponding path program 1 times [2023-08-26 18:23:39,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:39,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386654181] [2023-08-26 18:23:39,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:39,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:39,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:39,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:39,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386654181] [2023-08-26 18:23:39,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386654181] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:39,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:39,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:23:39,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032512867] [2023-08-26 18:23:39,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:39,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:23:39,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:39,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:23:39,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:23:39,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 310 [2023-08-26 18:23:39,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:39,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:39,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 310 [2023-08-26 18:23:39,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:40,190 INFO L124 PetriNetUnfolderBase]: 1648/2581 cut-off events. [2023-08-26 18:23:40,190 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:23:40,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5143 conditions, 2581 events. 1648/2581 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 14373 event pairs, 1099 based on Foata normal form. 0/2217 useless extension candidates. Maximal degree in co-relation 5139. Up to 1646 conditions per place. [2023-08-26 18:23:40,198 INFO L140 encePairwiseOnDemand]: 297/310 looper letters, 32 selfloop transitions, 7 changer transitions 1/42 dead transitions. [2023-08-26 18:23:40,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 172 flow [2023-08-26 18:23:40,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:23:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:23:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-08-26 18:23:40,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3849462365591398 [2023-08-26 18:23:40,200 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-08-26 18:23:40,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-08-26 18:23:40,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:40,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-08-26 18:23:40,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:40,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:40,223 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:40,224 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 3 states and 358 transitions. [2023-08-26 18:23:40,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 172 flow [2023-08-26 18:23:40,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 171 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:23:40,225 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 125 flow [2023-08-26 18:23:40,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, 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=3, PETRI_FLOW=125, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2023-08-26 18:23:40,225 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -25 predicate places. [2023-08-26 18:23:40,225 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 125 flow [2023-08-26 18:23:40,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:40,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:40,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:40,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:23:40,226 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 18:23:40,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:40,226 INFO L85 PathProgramCache]: Analyzing trace with hash 152435038, now seen corresponding path program 1 times [2023-08-26 18:23:40,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:40,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143050108] [2023-08-26 18:23:40,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:40,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:40,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:40,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:40,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143050108] [2023-08-26 18:23:40,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143050108] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:40,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:40,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:23:40,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858543832] [2023-08-26 18:23:40,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:40,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:23:40,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:40,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:23:40,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:23:40,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 310 [2023-08-26 18:23:40,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:40,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:40,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 310 [2023-08-26 18:23:40,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:40,618 INFO L124 PetriNetUnfolderBase]: 1227/2107 cut-off events. [2023-08-26 18:23:40,618 INFO L125 PetriNetUnfolderBase]: For 624/666 co-relation queries the response was YES. [2023-08-26 18:23:40,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5112 conditions, 2107 events. 1227/2107 cut-off events. For 624/666 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 12648 event pairs, 507 based on Foata normal form. 0/1956 useless extension candidates. Maximal degree in co-relation 5107. Up to 1279 conditions per place. [2023-08-26 18:23:40,625 INFO L140 encePairwiseOnDemand]: 306/310 looper letters, 46 selfloop transitions, 3 changer transitions 1/57 dead transitions. [2023-08-26 18:23:40,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 291 flow [2023-08-26 18:23:40,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:23:40,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:23:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-26 18:23:40,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4505376344086022 [2023-08-26 18:23:40,627 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-26 18:23:40,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-26 18:23:40,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:40,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-26 18:23:40,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:40,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:40,630 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:40,630 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 125 flow. Second operand 3 states and 419 transitions. [2023-08-26 18:23:40,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 291 flow [2023-08-26 18:23:40,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 57 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:23:40,634 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 124 flow [2023-08-26 18:23:40,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2023-08-26 18:23:40,635 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -25 predicate places. [2023-08-26 18:23:40,635 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 124 flow [2023-08-26 18:23:40,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:40,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:40,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:40,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:23:40,636 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 18:23:40,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:40,636 INFO L85 PathProgramCache]: Analyzing trace with hash 152435272, now seen corresponding path program 1 times [2023-08-26 18:23:40,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:40,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191372137] [2023-08-26 18:23:40,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:40,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:40,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:40,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:40,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191372137] [2023-08-26 18:23:40,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191372137] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:40,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:40,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:23:40,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745411252] [2023-08-26 18:23:40,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:40,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:23:40,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:40,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:23:40,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:23:40,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 310 [2023-08-26 18:23:40,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:40,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:40,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 310 [2023-08-26 18:23:40,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:41,013 INFO L124 PetriNetUnfolderBase]: 1195/2052 cut-off events. [2023-08-26 18:23:41,013 INFO L125 PetriNetUnfolderBase]: For 576/617 co-relation queries the response was YES. [2023-08-26 18:23:41,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5103 conditions, 2052 events. 1195/2052 cut-off events. For 576/617 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 12313 event pairs, 505 based on Foata normal form. 0/1871 useless extension candidates. Maximal degree in co-relation 5097. Up to 1264 conditions per place. [2023-08-26 18:23:41,020 INFO L140 encePairwiseOnDemand]: 307/310 looper letters, 45 selfloop transitions, 3 changer transitions 1/56 dead transitions. [2023-08-26 18:23:41,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 280 flow [2023-08-26 18:23:41,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:23:41,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:23:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2023-08-26 18:23:41,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44516129032258067 [2023-08-26 18:23:41,022 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 414 transitions. [2023-08-26 18:23:41,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 414 transitions. [2023-08-26 18:23:41,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:41,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 414 transitions. [2023-08-26 18:23:41,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:41,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:41,024 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:41,024 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 124 flow. Second operand 3 states and 414 transitions. [2023-08-26 18:23:41,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 280 flow [2023-08-26 18:23:41,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:23:41,026 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 129 flow [2023-08-26 18:23:41,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-26 18:23:41,026 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -24 predicate places. [2023-08-26 18:23:41,026 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 129 flow [2023-08-26 18:23:41,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:41,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:41,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:41,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:23:41,027 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 18:23:41,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:41,027 INFO L85 PathProgramCache]: Analyzing trace with hash 430524293, now seen corresponding path program 1 times [2023-08-26 18:23:41,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:41,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718038543] [2023-08-26 18:23:41,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:41,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:41,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:41,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:41,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718038543] [2023-08-26 18:23:41,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718038543] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:41,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:41,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:23:41,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995104676] [2023-08-26 18:23:41,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:41,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:23:41,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:41,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:23:41,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:23:41,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 310 [2023-08-26 18:23:41,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 129 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 18:23:41,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:41,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 310 [2023-08-26 18:23:41,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:41,504 INFO L124 PetriNetUnfolderBase]: 2377/3680 cut-off events. [2023-08-26 18:23:41,504 INFO L125 PetriNetUnfolderBase]: For 1182/1388 co-relation queries the response was YES. [2023-08-26 18:23:41,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9458 conditions, 3680 events. 2377/3680 cut-off events. For 1182/1388 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 20460 event pairs, 695 based on Foata normal form. 36/3384 useless extension candidates. Maximal degree in co-relation 9451. Up to 2902 conditions per place. [2023-08-26 18:23:41,514 INFO L140 encePairwiseOnDemand]: 307/310 looper letters, 51 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-08-26 18:23:41,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 313 flow [2023-08-26 18:23:41,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:23:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:23:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-08-26 18:23:41,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43870967741935485 [2023-08-26 18:23:41,515 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-08-26 18:23:41,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-08-26 18:23:41,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:41,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-08-26 18:23:41,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:41,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:41,518 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:41,518 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 129 flow. Second operand 3 states and 408 transitions. [2023-08-26 18:23:41,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 313 flow [2023-08-26 18:23:41,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 303 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:23:41,520 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 131 flow [2023-08-26 18:23:41,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2023-08-26 18:23:41,522 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -23 predicate places. [2023-08-26 18:23:41,524 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 131 flow [2023-08-26 18:23:41,525 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 18:23:41,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:41,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:41,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:23:41,525 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 18:23:41,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:41,526 INFO L85 PathProgramCache]: Analyzing trace with hash 414483389, now seen corresponding path program 1 times [2023-08-26 18:23:41,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:41,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219308912] [2023-08-26 18:23:41,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:41,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:41,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:41,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:41,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219308912] [2023-08-26 18:23:41,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219308912] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:41,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:41,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:23:41,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449510038] [2023-08-26 18:23:41,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:41,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:23:41,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:41,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:23:41,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:23:41,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 310 [2023-08-26 18:23:41,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 131 flow. Second operand has 7 states, 7 states have (on average 101.71428571428571) internal successors, (712), 7 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:41,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:41,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 310 [2023-08-26 18:23:41,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:42,197 INFO L124 PetriNetUnfolderBase]: 1794/2893 cut-off events. [2023-08-26 18:23:42,197 INFO L125 PetriNetUnfolderBase]: For 753/753 co-relation queries the response was YES. [2023-08-26 18:23:42,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7941 conditions, 2893 events. 1794/2893 cut-off events. For 753/753 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 17183 event pairs, 585 based on Foata normal form. 0/2710 useless extension candidates. Maximal degree in co-relation 7933. Up to 952 conditions per place. [2023-08-26 18:23:42,206 INFO L140 encePairwiseOnDemand]: 301/310 looper letters, 62 selfloop transitions, 13 changer transitions 0/77 dead transitions. [2023-08-26 18:23:42,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 77 transitions, 400 flow [2023-08-26 18:23:42,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:23:42,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:23:42,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2023-08-26 18:23:42,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37225806451612903 [2023-08-26 18:23:42,208 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 577 transitions. [2023-08-26 18:23:42,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 577 transitions. [2023-08-26 18:23:42,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:42,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 577 transitions. [2023-08-26 18:23:42,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:42,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 310.0) internal successors, (1860), 6 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:42,213 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 310.0) internal successors, (1860), 6 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:42,213 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 131 flow. Second operand 5 states and 577 transitions. [2023-08-26 18:23:42,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 77 transitions, 400 flow [2023-08-26 18:23:42,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 77 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:23:42,216 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 175 flow [2023-08-26 18:23:42,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-08-26 18:23:42,217 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -21 predicate places. [2023-08-26 18:23:42,219 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 175 flow [2023-08-26 18:23:42,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.71428571428571) internal successors, (712), 7 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:42,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:42,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:42,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:23:42,220 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 18:23:42,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:42,220 INFO L85 PathProgramCache]: Analyzing trace with hash 430524060, now seen corresponding path program 1 times [2023-08-26 18:23:42,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:42,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490138170] [2023-08-26 18:23:42,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:42,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:42,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:42,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:42,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490138170] [2023-08-26 18:23:42,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490138170] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:42,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:42,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:23:42,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509060203] [2023-08-26 18:23:42,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:42,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:23:42,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:42,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:23:42,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:23:42,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 310 [2023-08-26 18:23:42,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 175 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:42,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:42,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 310 [2023-08-26 18:23:42,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:42,662 INFO L124 PetriNetUnfolderBase]: 1531/2570 cut-off events. [2023-08-26 18:23:42,662 INFO L125 PetriNetUnfolderBase]: For 1340/1340 co-relation queries the response was YES. [2023-08-26 18:23:42,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7174 conditions, 2570 events. 1531/2570 cut-off events. For 1340/1340 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 15619 event pairs, 801 based on Foata normal form. 60/2591 useless extension candidates. Maximal degree in co-relation 7165. Up to 1756 conditions per place. [2023-08-26 18:23:42,670 INFO L140 encePairwiseOnDemand]: 307/310 looper letters, 49 selfloop transitions, 3 changer transitions 1/59 dead transitions. [2023-08-26 18:23:42,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 59 transitions, 344 flow [2023-08-26 18:23:42,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:23:42,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:23:42,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 477 transitions. [2023-08-26 18:23:42,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38467741935483873 [2023-08-26 18:23:42,672 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 477 transitions. [2023-08-26 18:23:42,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 477 transitions. [2023-08-26 18:23:42,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:42,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 477 transitions. [2023-08-26 18:23:42,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:42,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:42,674 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:42,674 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 175 flow. Second operand 4 states and 477 transitions. [2023-08-26 18:23:42,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 59 transitions, 344 flow [2023-08-26 18:23:42,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 327 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:23:42,678 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 163 flow [2023-08-26 18:23:42,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=46, 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=163, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2023-08-26 18:23:42,679 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -21 predicate places. [2023-08-26 18:23:42,679 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 163 flow [2023-08-26 18:23:42,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:42,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:42,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:42,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:23:42,680 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 18:23:42,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:42,680 INFO L85 PathProgramCache]: Analyzing trace with hash -573981464, now seen corresponding path program 1 times [2023-08-26 18:23:42,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:42,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637790585] [2023-08-26 18:23:42,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:42,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:42,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:42,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:42,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637790585] [2023-08-26 18:23:42,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637790585] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:42,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:42,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:23:42,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540308947] [2023-08-26 18:23:42,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:42,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:23:42,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:42,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:23:42,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:23:42,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 310 [2023-08-26 18:23:42,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 163 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 18:23:42,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:42,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 310 [2023-08-26 18:23:42,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:43,185 INFO L124 PetriNetUnfolderBase]: 2723/4297 cut-off events. [2023-08-26 18:23:43,186 INFO L125 PetriNetUnfolderBase]: For 2551/2631 co-relation queries the response was YES. [2023-08-26 18:23:43,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11339 conditions, 4297 events. 2723/4297 cut-off events. For 2551/2631 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 24487 event pairs, 1491 based on Foata normal form. 32/4105 useless extension candidates. Maximal degree in co-relation 11331. Up to 2957 conditions per place. [2023-08-26 18:23:43,197 INFO L140 encePairwiseOnDemand]: 307/310 looper letters, 54 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-08-26 18:23:43,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 368 flow [2023-08-26 18:23:43,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:23:43,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:23:43,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2023-08-26 18:23:43,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4344086021505376 [2023-08-26 18:23:43,198 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 404 transitions. [2023-08-26 18:23:43,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions. [2023-08-26 18:23:43,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:43,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions. [2023-08-26 18:23:43,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:43,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:43,200 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:43,200 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 163 flow. Second operand 3 states and 404 transitions. [2023-08-26 18:23:43,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 368 flow [2023-08-26 18:23:43,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 62 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:23:43,206 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 167 flow [2023-08-26 18:23:43,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-08-26 18:23:43,206 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -20 predicate places. [2023-08-26 18:23:43,206 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 167 flow [2023-08-26 18:23:43,207 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 18:23:43,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:43,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:43,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:23:43,207 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 18:23:43,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:43,207 INFO L85 PathProgramCache]: Analyzing trace with hash 461422859, now seen corresponding path program 1 times [2023-08-26 18:23:43,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:43,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658288083] [2023-08-26 18:23:43,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:43,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:43,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:43,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:43,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658288083] [2023-08-26 18:23:43,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658288083] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:43,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:43,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:23:43,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103752683] [2023-08-26 18:23:43,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:43,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:23:43,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:43,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:23:43,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:23:43,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 310 [2023-08-26 18:23:43,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:43,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:43,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 310 [2023-08-26 18:23:43,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:43,542 INFO L124 PetriNetUnfolderBase]: 1519/2450 cut-off events. [2023-08-26 18:23:43,542 INFO L125 PetriNetUnfolderBase]: For 1876/1876 co-relation queries the response was YES. [2023-08-26 18:23:43,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7127 conditions, 2450 events. 1519/2450 cut-off events. For 1876/1876 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 13874 event pairs, 752 based on Foata normal form. 15/2388 useless extension candidates. Maximal degree in co-relation 7118. Up to 1082 conditions per place. [2023-08-26 18:23:43,548 INFO L140 encePairwiseOnDemand]: 299/310 looper letters, 41 selfloop transitions, 12 changer transitions 0/55 dead transitions. [2023-08-26 18:23:43,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 55 transitions, 336 flow [2023-08-26 18:23:43,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:23:43,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:23:43,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 452 transitions. [2023-08-26 18:23:43,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36451612903225805 [2023-08-26 18:23:43,549 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 452 transitions. [2023-08-26 18:23:43,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 452 transitions. [2023-08-26 18:23:43,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:43,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 452 transitions. [2023-08-26 18:23:43,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:43,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:43,552 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:43,552 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 167 flow. Second operand 4 states and 452 transitions. [2023-08-26 18:23:43,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 55 transitions, 336 flow [2023-08-26 18:23:43,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 55 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:23:43,556 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 239 flow [2023-08-26 18:23:43,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=239, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2023-08-26 18:23:43,557 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -17 predicate places. [2023-08-26 18:23:43,557 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 239 flow [2023-08-26 18:23:43,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:43,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:43,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:43,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:23:43,557 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 18:23:43,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:43,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1723892752, now seen corresponding path program 1 times [2023-08-26 18:23:43,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:43,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808534526] [2023-08-26 18:23:43,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:43,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:43,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:43,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:43,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808534526] [2023-08-26 18:23:43,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808534526] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:43,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:43,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:23:43,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985094437] [2023-08-26 18:23:43,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:43,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:23:43,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:43,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:23:43,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:23:43,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 310 [2023-08-26 18:23:43,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 239 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:43,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:43,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 310 [2023-08-26 18:23:43,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:43,971 INFO L124 PetriNetUnfolderBase]: 1232/2120 cut-off events. [2023-08-26 18:23:43,971 INFO L125 PetriNetUnfolderBase]: For 2475/2483 co-relation queries the response was YES. [2023-08-26 18:23:43,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6575 conditions, 2120 events. 1232/2120 cut-off events. For 2475/2483 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 12922 event pairs, 258 based on Foata normal form. 8/2099 useless extension candidates. Maximal degree in co-relation 6565. Up to 1528 conditions per place. [2023-08-26 18:23:43,980 INFO L140 encePairwiseOnDemand]: 307/310 looper letters, 46 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-08-26 18:23:43,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 425 flow [2023-08-26 18:23:43,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:23:43,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:23:43,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2023-08-26 18:23:43,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4344086021505376 [2023-08-26 18:23:43,981 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 404 transitions. [2023-08-26 18:23:43,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions. [2023-08-26 18:23:43,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:43,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions. [2023-08-26 18:23:43,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:43,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:43,983 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:43,983 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 239 flow. Second operand 3 states and 404 transitions. [2023-08-26 18:23:43,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 425 flow [2023-08-26 18:23:43,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 418 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:23:43,992 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 243 flow [2023-08-26 18:23:43,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=52, 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=243, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-08-26 18:23:43,993 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -15 predicate places. [2023-08-26 18:23:43,993 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 243 flow [2023-08-26 18:23:43,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:43,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:43,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:43,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:23:43,993 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 18:23:43,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:43,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1419204346, now seen corresponding path program 1 times [2023-08-26 18:23:43,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:43,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522142414] [2023-08-26 18:23:43,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:43,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:44,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:44,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522142414] [2023-08-26 18:23:44,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522142414] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:44,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:44,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:23:44,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232890410] [2023-08-26 18:23:44,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:44,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:23:44,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:44,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:23:44,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:23:44,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 310 [2023-08-26 18:23:44,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 243 flow. Second operand has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:44,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:44,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 310 [2023-08-26 18:23:44,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:44,437 INFO L124 PetriNetUnfolderBase]: 1346/2183 cut-off events. [2023-08-26 18:23:44,437 INFO L125 PetriNetUnfolderBase]: For 2221/2221 co-relation queries the response was YES. [2023-08-26 18:23:44,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6971 conditions, 2183 events. 1346/2183 cut-off events. For 2221/2221 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 12145 event pairs, 597 based on Foata normal form. 33/2199 useless extension candidates. Maximal degree in co-relation 6959. Up to 1054 conditions per place. [2023-08-26 18:23:44,445 INFO L140 encePairwiseOnDemand]: 299/310 looper letters, 51 selfloop transitions, 12 changer transitions 3/68 dead transitions. [2023-08-26 18:23:44,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 68 transitions, 495 flow [2023-08-26 18:23:44,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:23:44,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:23:44,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 651 transitions. [2023-08-26 18:23:44,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2023-08-26 18:23:44,447 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 651 transitions. [2023-08-26 18:23:44,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 651 transitions. [2023-08-26 18:23:44,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:44,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 651 transitions. [2023-08-26 18:23:44,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:44,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 310.0) internal successors, (2170), 7 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:44,451 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 310.0) internal successors, (2170), 7 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:44,451 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 243 flow. Second operand 6 states and 651 transitions. [2023-08-26 18:23:44,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 68 transitions, 495 flow [2023-08-26 18:23:44,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 68 transitions, 485 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:23:44,458 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 320 flow [2023-08-26 18:23:44,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=60, PETRI_TRANSITIONS=45} [2023-08-26 18:23:44,459 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -10 predicate places. [2023-08-26 18:23:44,459 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 320 flow [2023-08-26 18:23:44,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:44,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:44,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:44,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:23:44,460 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 18:23:44,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:44,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2054079394, now seen corresponding path program 1 times [2023-08-26 18:23:44,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:44,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283239134] [2023-08-26 18:23:44,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:44,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:44,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:44,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:44,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283239134] [2023-08-26 18:23:44,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283239134] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:44,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:44,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:23:44,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397898058] [2023-08-26 18:23:44,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:44,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:23:44,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:44,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:23:44,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:23:44,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 310 [2023-08-26 18:23:44,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 320 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:44,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:44,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 310 [2023-08-26 18:23:44,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:45,207 INFO L124 PetriNetUnfolderBase]: 3403/5401 cut-off events. [2023-08-26 18:23:45,208 INFO L125 PetriNetUnfolderBase]: For 10655/10965 co-relation queries the response was YES. [2023-08-26 18:23:45,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17692 conditions, 5401 events. 3403/5401 cut-off events. For 10655/10965 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 32891 event pairs, 1222 based on Foata normal form. 98/5358 useless extension candidates. Maximal degree in co-relation 17679. Up to 2497 conditions per place. [2023-08-26 18:23:45,224 INFO L140 encePairwiseOnDemand]: 306/310 looper letters, 108 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2023-08-26 18:23:45,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 120 transitions, 1112 flow [2023-08-26 18:23:45,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:23:45,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:23:45,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 667 transitions. [2023-08-26 18:23:45,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43032258064516127 [2023-08-26 18:23:45,226 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 667 transitions. [2023-08-26 18:23:45,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 667 transitions. [2023-08-26 18:23:45,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:45,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 667 transitions. [2023-08-26 18:23:45,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:45,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 310.0) internal successors, (1860), 6 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:45,229 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 310.0) internal successors, (1860), 6 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:45,229 INFO L175 Difference]: Start difference. First operand has 60 places, 45 transitions, 320 flow. Second operand 5 states and 667 transitions. [2023-08-26 18:23:45,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 120 transitions, 1112 flow [2023-08-26 18:23:45,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 120 transitions, 1071 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:23:45,247 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 328 flow [2023-08-26 18:23:45,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=57, 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=5, PETRI_FLOW=328, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2023-08-26 18:23:45,247 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -7 predicate places. [2023-08-26 18:23:45,247 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 328 flow [2023-08-26 18:23:45,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:45,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:45,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:45,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 18:23:45,248 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 18:23:45,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:45,248 INFO L85 PathProgramCache]: Analyzing trace with hash -4926190, now seen corresponding path program 2 times [2023-08-26 18:23:45,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:45,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261377234] [2023-08-26 18:23:45,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:45,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:46,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:46,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:46,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261377234] [2023-08-26 18:23:46,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261377234] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:46,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:46,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:23:46,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758046711] [2023-08-26 18:23:46,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:46,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 18:23:46,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:46,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 18:23:46,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-26 18:23:46,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 310 [2023-08-26 18:23:46,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 328 flow. Second operand has 9 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:46,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:46,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 310 [2023-08-26 18:23:46,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:46,915 INFO L124 PetriNetUnfolderBase]: 2466/4070 cut-off events. [2023-08-26 18:23:46,916 INFO L125 PetriNetUnfolderBase]: For 6529/6541 co-relation queries the response was YES. [2023-08-26 18:23:46,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14195 conditions, 4070 events. 2466/4070 cut-off events. For 6529/6541 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 26296 event pairs, 788 based on Foata normal form. 20/4052 useless extension candidates. Maximal degree in co-relation 14179. Up to 3335 conditions per place. [2023-08-26 18:23:46,932 INFO L140 encePairwiseOnDemand]: 301/310 looper letters, 70 selfloop transitions, 15 changer transitions 0/88 dead transitions. [2023-08-26 18:23:46,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 88 transitions, 700 flow [2023-08-26 18:23:46,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:23:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:23:46,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 875 transitions. [2023-08-26 18:23:46,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31362007168458783 [2023-08-26 18:23:46,935 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 875 transitions. [2023-08-26 18:23:46,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 875 transitions. [2023-08-26 18:23:46,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:46,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 875 transitions. [2023-08-26 18:23:46,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.22222222222223) internal successors, (875), 9 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:46,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 310.0) internal successors, (3100), 10 states have internal predecessors, (3100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:46,939 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 310.0) internal successors, (3100), 10 states have internal predecessors, (3100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:46,940 INFO L175 Difference]: Start difference. First operand has 63 places, 47 transitions, 328 flow. Second operand 9 states and 875 transitions. [2023-08-26 18:23:46,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 88 transitions, 700 flow [2023-08-26 18:23:46,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 88 transitions, 685 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:23:46,963 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 472 flow [2023-08-26 18:23:46,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=472, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2023-08-26 18:23:46,963 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 3 predicate places. [2023-08-26 18:23:46,964 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 472 flow [2023-08-26 18:23:46,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:46,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:46,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:46,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 18:23:46,964 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 18:23:46,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:46,964 INFO L85 PathProgramCache]: Analyzing trace with hash 286479098, now seen corresponding path program 3 times [2023-08-26 18:23:46,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:46,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374074127] [2023-08-26 18:23:46,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:46,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:47,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:47,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:47,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374074127] [2023-08-26 18:23:47,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374074127] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:47,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:47,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:23:47,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782312666] [2023-08-26 18:23:47,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:47,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 18:23:47,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:47,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 18:23:47,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-26 18:23:47,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 310 [2023-08-26 18:23:47,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 472 flow. Second operand has 9 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:47,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:47,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 310 [2023-08-26 18:23:47,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:48,529 INFO L124 PetriNetUnfolderBase]: 2458/4058 cut-off events. [2023-08-26 18:23:48,529 INFO L125 PetriNetUnfolderBase]: For 7482/7494 co-relation queries the response was YES. [2023-08-26 18:23:48,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14831 conditions, 4058 events. 2458/4058 cut-off events. For 7482/7494 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 26286 event pairs, 307 based on Foata normal form. 16/4043 useless extension candidates. Maximal degree in co-relation 14811. Up to 2729 conditions per place. [2023-08-26 18:23:48,542 INFO L140 encePairwiseOnDemand]: 302/310 looper letters, 82 selfloop transitions, 31 changer transitions 0/116 dead transitions. [2023-08-26 18:23:48,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 116 transitions, 1019 flow [2023-08-26 18:23:48,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 18:23:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 18:23:48,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1070 transitions. [2023-08-26 18:23:48,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31378299120234604 [2023-08-26 18:23:48,545 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1070 transitions. [2023-08-26 18:23:48,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1070 transitions. [2023-08-26 18:23:48,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:48,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1070 transitions. [2023-08-26 18:23:48,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 97.27272727272727) internal successors, (1070), 11 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:48,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 310.0) internal successors, (3720), 12 states have internal predecessors, (3720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:48,550 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 310.0) internal successors, (3720), 12 states have internal predecessors, (3720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:48,550 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 472 flow. Second operand 11 states and 1070 transitions. [2023-08-26 18:23:48,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 116 transitions, 1019 flow [2023-08-26 18:23:48,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 116 transitions, 1007 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-08-26 18:23:48,575 INFO L231 Difference]: Finished difference. Result has 88 places, 74 transitions, 730 flow [2023-08-26 18:23:48,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=730, PETRI_PLACES=88, PETRI_TRANSITIONS=74} [2023-08-26 18:23:48,576 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 18 predicate places. [2023-08-26 18:23:48,576 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 74 transitions, 730 flow [2023-08-26 18:23:48,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:48,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:48,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:48,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 18:23:48,576 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 18:23:48,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:48,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1045664424, now seen corresponding path program 1 times [2023-08-26 18:23:48,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:48,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998209441] [2023-08-26 18:23:48,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:48,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:48,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:48,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:48,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998209441] [2023-08-26 18:23:48,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998209441] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:48,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:48,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:23:48,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847671618] [2023-08-26 18:23:48,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:48,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 18:23:48,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:48,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 18:23:48,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-08-26 18:23:48,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 310 [2023-08-26 18:23:48,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 74 transitions, 730 flow. Second operand has 9 states, 9 states have (on average 96.66666666666667) internal successors, (870), 9 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:48,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:48,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 310 [2023-08-26 18:23:48,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:49,375 INFO L124 PetriNetUnfolderBase]: 2887/4698 cut-off events. [2023-08-26 18:23:49,375 INFO L125 PetriNetUnfolderBase]: For 12517/12535 co-relation queries the response was YES. [2023-08-26 18:23:49,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17910 conditions, 4698 events. 2887/4698 cut-off events. For 12517/12535 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 30698 event pairs, 1261 based on Foata normal form. 81/4751 useless extension candidates. Maximal degree in co-relation 17884. Up to 2020 conditions per place. [2023-08-26 18:23:49,392 INFO L140 encePairwiseOnDemand]: 297/310 looper letters, 81 selfloop transitions, 30 changer transitions 8/122 dead transitions. [2023-08-26 18:23:49,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 122 transitions, 1216 flow [2023-08-26 18:23:49,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:23:49,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:23:49,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 844 transitions. [2023-08-26 18:23:49,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3403225806451613 [2023-08-26 18:23:49,394 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 844 transitions. [2023-08-26 18:23:49,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 844 transitions. [2023-08-26 18:23:49,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:49,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 844 transitions. [2023-08-26 18:23:49,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 105.5) internal successors, (844), 8 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:49,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 310.0) internal successors, (2790), 9 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:49,398 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 310.0) internal successors, (2790), 9 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:49,398 INFO L175 Difference]: Start difference. First operand has 88 places, 74 transitions, 730 flow. Second operand 8 states and 844 transitions. [2023-08-26 18:23:49,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 122 transitions, 1216 flow [2023-08-26 18:23:49,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 122 transitions, 1156 flow, removed 15 selfloop flow, removed 4 redundant places. [2023-08-26 18:23:49,443 INFO L231 Difference]: Finished difference. Result has 94 places, 78 transitions, 842 flow [2023-08-26 18:23:49,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=842, PETRI_PLACES=94, PETRI_TRANSITIONS=78} [2023-08-26 18:23:49,443 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 24 predicate places. [2023-08-26 18:23:49,443 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 78 transitions, 842 flow [2023-08-26 18:23:49,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 96.66666666666667) internal successors, (870), 9 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:49,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:49,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:49,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 18:23:49,444 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 18:23:49,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:49,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1761595590, now seen corresponding path program 1 times [2023-08-26 18:23:49,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:49,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507474008] [2023-08-26 18:23:49,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:49,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:49,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:49,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:49,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507474008] [2023-08-26 18:23:49,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507474008] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:49,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:49,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:23:49,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651148938] [2023-08-26 18:23:49,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:49,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:23:49,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:49,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:23:49,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:23:49,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 310 [2023-08-26 18:23:49,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 78 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:49,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:49,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 310 [2023-08-26 18:23:49,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:49,875 INFO L124 PetriNetUnfolderBase]: 1295/2446 cut-off events. [2023-08-26 18:23:49,875 INFO L125 PetriNetUnfolderBase]: For 10334/10365 co-relation queries the response was YES. [2023-08-26 18:23:49,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9860 conditions, 2446 events. 1295/2446 cut-off events. For 10334/10365 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 16593 event pairs, 312 based on Foata normal form. 53/2482 useless extension candidates. Maximal degree in co-relation 9832. Up to 2064 conditions per place. [2023-08-26 18:23:49,883 INFO L140 encePairwiseOnDemand]: 305/310 looper letters, 72 selfloop transitions, 4 changer transitions 5/98 dead transitions. [2023-08-26 18:23:49,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 98 transitions, 1127 flow [2023-08-26 18:23:49,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:23:49,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:23:49,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2023-08-26 18:23:49,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268817204301075 [2023-08-26 18:23:49,884 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2023-08-26 18:23:49,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2023-08-26 18:23:49,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:49,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2023-08-26 18:23:49,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:49,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:49,887 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:49,887 INFO L175 Difference]: Start difference. First operand has 94 places, 78 transitions, 842 flow. Second operand 3 states and 397 transitions. [2023-08-26 18:23:49,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 98 transitions, 1127 flow [2023-08-26 18:23:49,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 98 transitions, 1112 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-26 18:23:49,907 INFO L231 Difference]: Finished difference. Result has 94 places, 76 transitions, 800 flow [2023-08-26 18:23:49,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=800, PETRI_PLACES=94, PETRI_TRANSITIONS=76} [2023-08-26 18:23:49,907 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 24 predicate places. [2023-08-26 18:23:49,907 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 76 transitions, 800 flow [2023-08-26 18:23:49,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:49,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:49,908 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 18:23:49,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 18:23:49,908 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 18:23:49,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:49,908 INFO L85 PathProgramCache]: Analyzing trace with hash -418257201, now seen corresponding path program 1 times [2023-08-26 18:23:49,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:49,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233096049] [2023-08-26 18:23:49,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:49,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23: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 18:23:50,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:50,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233096049] [2023-08-26 18:23:50,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233096049] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:50,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:50,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:23:50,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198880930] [2023-08-26 18:23:50,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:50,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:23:50,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:50,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:23:50,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:23:50,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 310 [2023-08-26 18:23:50,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 76 transitions, 800 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:50,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:50,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 310 [2023-08-26 18:23:50,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:50,155 INFO L124 PetriNetUnfolderBase]: 427/967 cut-off events. [2023-08-26 18:23:50,155 INFO L125 PetriNetUnfolderBase]: For 3715/3723 co-relation queries the response was YES. [2023-08-26 18:23:50,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4149 conditions, 967 events. 427/967 cut-off events. For 3715/3723 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5831 event pairs, 56 based on Foata normal form. 72/1028 useless extension candidates. Maximal degree in co-relation 4120. Up to 563 conditions per place. [2023-08-26 18:23:50,158 INFO L140 encePairwiseOnDemand]: 305/310 looper letters, 63 selfloop transitions, 7 changer transitions 19/100 dead transitions. [2023-08-26 18:23:50,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 100 transitions, 1085 flow [2023-08-26 18:23:50,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:23:50,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:23:50,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 527 transitions. [2023-08-26 18:23:50,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2023-08-26 18:23:50,159 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 527 transitions. [2023-08-26 18:23:50,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 527 transitions. [2023-08-26 18:23:50,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:50,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 527 transitions. [2023-08-26 18:23:50,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:50,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:50,161 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:50,161 INFO L175 Difference]: Start difference. First operand has 94 places, 76 transitions, 800 flow. Second operand 4 states and 527 transitions. [2023-08-26 18:23:50,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 100 transitions, 1085 flow [2023-08-26 18:23:50,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 100 transitions, 1056 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-26 18:23:50,168 INFO L231 Difference]: Finished difference. Result has 93 places, 56 transitions, 496 flow [2023-08-26 18:23:50,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=496, PETRI_PLACES=93, PETRI_TRANSITIONS=56} [2023-08-26 18:23:50,169 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 23 predicate places. [2023-08-26 18:23:50,169 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 56 transitions, 496 flow [2023-08-26 18:23:50,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:50,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:50,169 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 18:23:50,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 18:23:50,170 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 18:23:50,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:50,170 INFO L85 PathProgramCache]: Analyzing trace with hash 713816253, now seen corresponding path program 1 times [2023-08-26 18:23:50,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:50,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160725363] [2023-08-26 18:23:50,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:50,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:50,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:50,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:50,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160725363] [2023-08-26 18:23:50,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160725363] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:50,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:50,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:23:50,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58255915] [2023-08-26 18:23:50,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:50,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:23:50,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:50,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:23:50,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:23:50,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 310 [2023-08-26 18:23:50,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 56 transitions, 496 flow. Second operand has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:50,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:50,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 310 [2023-08-26 18:23:50,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:50,513 INFO L124 PetriNetUnfolderBase]: 939/1953 cut-off events. [2023-08-26 18:23:50,514 INFO L125 PetriNetUnfolderBase]: For 7277/7283 co-relation queries the response was YES. [2023-08-26 18:23:50,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8120 conditions, 1953 events. 939/1953 cut-off events. For 7277/7283 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 12740 event pairs, 213 based on Foata normal form. 16/1954 useless extension candidates. Maximal degree in co-relation 8093. Up to 834 conditions per place. [2023-08-26 18:23:50,518 INFO L140 encePairwiseOnDemand]: 307/310 looper letters, 83 selfloop transitions, 3 changer transitions 16/110 dead transitions. [2023-08-26 18:23:50,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 110 transitions, 1157 flow [2023-08-26 18:23:50,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:23:50,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:23:50,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 531 transitions. [2023-08-26 18:23:50,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4282258064516129 [2023-08-26 18:23:50,520 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 531 transitions. [2023-08-26 18:23:50,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 531 transitions. [2023-08-26 18:23:50,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:50,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 531 transitions. [2023-08-26 18:23:50,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:50,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:50,522 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:50,522 INFO L175 Difference]: Start difference. First operand has 93 places, 56 transitions, 496 flow. Second operand 4 states and 531 transitions. [2023-08-26 18:23:50,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 110 transitions, 1157 flow [2023-08-26 18:23:50,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 110 transitions, 1035 flow, removed 16 selfloop flow, removed 9 redundant places. [2023-08-26 18:23:50,530 INFO L231 Difference]: Finished difference. Result has 88 places, 55 transitions, 427 flow [2023-08-26 18:23:50,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=427, PETRI_PLACES=88, PETRI_TRANSITIONS=55} [2023-08-26 18:23:50,531 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 18 predicate places. [2023-08-26 18:23:50,531 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 55 transitions, 427 flow [2023-08-26 18:23:50,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:50,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:50,531 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 18:23:50,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 18:23:50,531 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 18:23:50,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:50,531 INFO L85 PathProgramCache]: Analyzing trace with hash 416149591, now seen corresponding path program 2 times [2023-08-26 18:23:50,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:50,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134186842] [2023-08-26 18:23:50,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:50,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:50,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:50,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:50,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134186842] [2023-08-26 18:23:50,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134186842] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:50,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:50,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:23:50,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779252131] [2023-08-26 18:23:50,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:50,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:23:50,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:50,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:23:50,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:23:50,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 310 [2023-08-26 18:23:50,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 55 transitions, 427 flow. Second operand has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:50,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:50,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 310 [2023-08-26 18:23:50,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:50,904 INFO L124 PetriNetUnfolderBase]: 1200/2514 cut-off events. [2023-08-26 18:23:50,905 INFO L125 PetriNetUnfolderBase]: For 7105/7107 co-relation queries the response was YES. [2023-08-26 18:23:50,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9973 conditions, 2514 events. 1200/2514 cut-off events. For 7105/7107 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 17463 event pairs, 338 based on Foata normal form. 16/2518 useless extension candidates. Maximal degree in co-relation 9948. Up to 1485 conditions per place. [2023-08-26 18:23:50,912 INFO L140 encePairwiseOnDemand]: 306/310 looper letters, 86 selfloop transitions, 6 changer transitions 22/122 dead transitions. [2023-08-26 18:23:50,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 122 transitions, 1110 flow [2023-08-26 18:23:50,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:23:50,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:23:50,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 663 transitions. [2023-08-26 18:23:50,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42774193548387096 [2023-08-26 18:23:50,914 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 663 transitions. [2023-08-26 18:23:50,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 663 transitions. [2023-08-26 18:23:50,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:50,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 663 transitions. [2023-08-26 18:23:50,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:50,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 310.0) internal successors, (1860), 6 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:50,917 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 310.0) internal successors, (1860), 6 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:50,917 INFO L175 Difference]: Start difference. First operand has 88 places, 55 transitions, 427 flow. Second operand 5 states and 663 transitions. [2023-08-26 18:23:50,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 122 transitions, 1110 flow [2023-08-26 18:23:50,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 122 transitions, 1051 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-08-26 18:23:50,928 INFO L231 Difference]: Finished difference. Result has 89 places, 58 transitions, 438 flow [2023-08-26 18:23:50,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=438, PETRI_PLACES=89, PETRI_TRANSITIONS=58} [2023-08-26 18:23:50,928 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 19 predicate places. [2023-08-26 18:23:50,928 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 58 transitions, 438 flow [2023-08-26 18:23:50,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:50,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:50,929 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 18:23:50,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 18:23:50,929 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 18:23:50,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:50,929 INFO L85 PathProgramCache]: Analyzing trace with hash 841084579, now seen corresponding path program 3 times [2023-08-26 18:23:50,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:50,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951882285] [2023-08-26 18:23:50,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:50,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:51,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:51,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951882285] [2023-08-26 18:23:51,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951882285] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:51,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:51,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:23:51,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805824950] [2023-08-26 18:23:51,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:51,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:23:51,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:51,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:23:51,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:23:51,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 310 [2023-08-26 18:23:51,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 58 transitions, 438 flow. Second operand has 5 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:51,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:51,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 310 [2023-08-26 18:23:51,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:51,312 INFO L124 PetriNetUnfolderBase]: 461/1052 cut-off events. [2023-08-26 18:23:51,312 INFO L125 PetriNetUnfolderBase]: For 2567/2670 co-relation queries the response was YES. [2023-08-26 18:23:51,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4085 conditions, 1052 events. 461/1052 cut-off events. For 2567/2670 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 7063 event pairs, 50 based on Foata normal form. 167/1150 useless extension candidates. Maximal degree in co-relation 4061. Up to 389 conditions per place. [2023-08-26 18:23:51,316 INFO L140 encePairwiseOnDemand]: 305/310 looper letters, 40 selfloop transitions, 10 changer transitions 18/73 dead transitions. [2023-08-26 18:23:51,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 73 transitions, 638 flow [2023-08-26 18:23:51,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:23:51,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:23:51,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 645 transitions. [2023-08-26 18:23:51,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161290322580645 [2023-08-26 18:23:51,317 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 645 transitions. [2023-08-26 18:23:51,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 645 transitions. [2023-08-26 18:23:51,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:51,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 645 transitions. [2023-08-26 18:23:51,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:51,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 310.0) internal successors, (1860), 6 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:51,320 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 310.0) internal successors, (1860), 6 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:51,320 INFO L175 Difference]: Start difference. First operand has 89 places, 58 transitions, 438 flow. Second operand 5 states and 645 transitions. [2023-08-26 18:23:51,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 73 transitions, 638 flow [2023-08-26 18:23:51,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 73 transitions, 542 flow, removed 13 selfloop flow, removed 13 redundant places. [2023-08-26 18:23:51,323 INFO L231 Difference]: Finished difference. Result has 75 places, 37 transitions, 242 flow [2023-08-26 18:23:51,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=242, PETRI_PLACES=75, PETRI_TRANSITIONS=37} [2023-08-26 18:23:51,323 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 5 predicate places. [2023-08-26 18:23:51,323 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 37 transitions, 242 flow [2023-08-26 18:23:51,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:51,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:51,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:51,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 18:23:51,324 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 18:23:51,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:51,324 INFO L85 PathProgramCache]: Analyzing trace with hash -389366318, now seen corresponding path program 1 times [2023-08-26 18:23:51,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:51,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293767396] [2023-08-26 18:23:51,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:51,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:23:51,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:23:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:23:51,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:23:51,468 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:23:51,469 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONASSERT (59 of 60 remaining) [2023-08-26 18:23:51,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 60 remaining) [2023-08-26 18:23:51,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 60 remaining) [2023-08-26 18:23:51,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 60 remaining) [2023-08-26 18:23:51,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 60 remaining) [2023-08-26 18:23:51,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 60 remaining) [2023-08-26 18:23:51,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 60 remaining) [2023-08-26 18:23:51,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 60 remaining) [2023-08-26 18:23:51,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 60 remaining) [2023-08-26 18:23:51,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 60 remaining) [2023-08-26 18:23:51,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 60 remaining) [2023-08-26 18:23:51,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 60 remaining) [2023-08-26 18:23:51,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 60 remaining) [2023-08-26 18:23:51,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 60 remaining) [2023-08-26 18:23:51,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 60 remaining) [2023-08-26 18:23:51,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 60 remaining) [2023-08-26 18:23:51,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 60 remaining) [2023-08-26 18:23:51,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 60 remaining) [2023-08-26 18:23:51,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 60 remaining) [2023-08-26 18:23:51,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 60 remaining) [2023-08-26 18:23:51,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 60 remaining) [2023-08-26 18:23:51,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 60 remaining) [2023-08-26 18:23:51,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 60 remaining) [2023-08-26 18:23:51,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 60 remaining) [2023-08-26 18:23:51,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 60 remaining) [2023-08-26 18:23:51,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 60 remaining) [2023-08-26 18:23:51,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 60 remaining) [2023-08-26 18:23:51,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 60 remaining) [2023-08-26 18:23:51,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 60 remaining) [2023-08-26 18:23:51,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 60 remaining) [2023-08-26 18:23:51,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 60 remaining) [2023-08-26 18:23:51,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 60 remaining) [2023-08-26 18:23:51,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 60 remaining) [2023-08-26 18:23:51,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 60 remaining) [2023-08-26 18:23:51,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 60 remaining) [2023-08-26 18:23:51,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 60 remaining) [2023-08-26 18:23:51,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 60 remaining) [2023-08-26 18:23:51,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 60 remaining) [2023-08-26 18:23:51,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 60 remaining) [2023-08-26 18:23:51,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 60 remaining) [2023-08-26 18:23:51,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 60 remaining) [2023-08-26 18:23:51,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 60 remaining) [2023-08-26 18:23:51,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 60 remaining) [2023-08-26 18:23:51,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 60 remaining) [2023-08-26 18:23:51,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 60 remaining) [2023-08-26 18:23:51,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 60 remaining) [2023-08-26 18:23:51,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 60 remaining) [2023-08-26 18:23:51,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 60 remaining) [2023-08-26 18:23:51,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 60 remaining) [2023-08-26 18:23:51,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 60 remaining) [2023-08-26 18:23:51,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 60 remaining) [2023-08-26 18:23:51,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 60 remaining) [2023-08-26 18:23:51,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 60 remaining) [2023-08-26 18:23:51,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 60 remaining) [2023-08-26 18:23:51,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 60 remaining) [2023-08-26 18:23:51,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 60 remaining) [2023-08-26 18:23:51,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 60 remaining) [2023-08-26 18:23:51,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 60 remaining) [2023-08-26 18:23:51,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 60 remaining) [2023-08-26 18:23:51,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 60 remaining) [2023-08-26 18:23:51,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 18:23:51,477 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:51,482 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:23:51,482 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:23:51,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:23:51 BasicIcfg [2023-08-26 18:23:51,585 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:23:51,586 INFO L158 Benchmark]: Toolchain (without parser) took 22339.73ms. Allocated memory was 308.3MB in the beginning and 1.1GB in the end (delta: 841.0MB). Free memory was 282.5MB in the beginning and 498.9MB in the end (delta: -216.4MB). Peak memory consumption was 626.6MB. Max. memory is 16.0GB. [2023-08-26 18:23:51,586 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 308.3MB. Free memory was 285.5MB in the beginning and 285.3MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:23:51,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.70ms. Allocated memory is still 308.3MB. Free memory was 282.5MB in the beginning and 258.8MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 18:23:51,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.91ms. Allocated memory is still 308.3MB. Free memory was 258.8MB in the beginning and 256.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:23:51,586 INFO L158 Benchmark]: Boogie Preprocessor took 39.21ms. Allocated memory is still 308.3MB. Free memory was 256.2MB in the beginning and 254.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:23:51,588 INFO L158 Benchmark]: RCFGBuilder took 797.28ms. Allocated memory was 308.3MB in the beginning and 373.3MB in the end (delta: 65.0MB). Free memory was 254.1MB in the beginning and 290.1MB in the end (delta: -36.0MB). Peak memory consumption was 68.9MB. Max. memory is 16.0GB. [2023-08-26 18:23:51,588 INFO L158 Benchmark]: TraceAbstraction took 21045.32ms. Allocated memory was 373.3MB in the beginning and 1.1GB in the end (delta: 775.9MB). Free memory was 289.1MB in the beginning and 498.9MB in the end (delta: -209.8MB). Peak memory consumption was 566.1MB. Max. memory is 16.0GB. [2023-08-26 18:23:51,589 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.10ms. Allocated memory is still 308.3MB. Free memory was 285.5MB in the beginning and 285.3MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 397.70ms. Allocated memory is still 308.3MB. Free memory was 282.5MB in the beginning and 258.8MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 54.91ms. Allocated memory is still 308.3MB. Free memory was 258.8MB in the beginning and 256.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 39.21ms. Allocated memory is still 308.3MB. Free memory was 256.2MB in the beginning and 254.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 797.28ms. Allocated memory was 308.3MB in the beginning and 373.3MB in the end (delta: 65.0MB). Free memory was 254.1MB in the beginning and 290.1MB in the end (delta: -36.0MB). Peak memory consumption was 68.9MB. Max. memory is 16.0GB. * TraceAbstraction took 21045.32ms. Allocated memory was 373.3MB in the beginning and 1.1GB in the end (delta: 775.9MB). Free memory was 289.1MB in the beginning and 498.9MB in the end (delta: -209.8MB). Peak memory consumption was 566.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.4s, 166 PlacesBefore, 70 PlacesAfterwards, 159 TransitionsBefore, 61 TransitionsAfterwards, 5090 CoEnabledTransitionPairs, 8 FixpointIterations, 67 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 148 TotalNumberOfCompositions, 20554 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7435, independent: 6990, independent conditional: 0, independent unconditional: 6990, dependent: 445, dependent conditional: 0, dependent unconditional: 445, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2345, independent: 2281, independent conditional: 0, independent unconditional: 2281, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7435, independent: 4709, independent conditional: 0, independent unconditional: 4709, dependent: 381, dependent conditional: 0, dependent unconditional: 381, unknown: 2345, unknown conditional: 0, unknown unconditional: 2345] , Statistics on independence cache: Total cache size (in pairs): 358, Positive cache size: 325, Positive conditional cache size: 0, Positive unconditional cache size: 325, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L835] 0 pthread_t t2097; [L836] FCALL, FORK 0 pthread_create(&t2097, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2097, ((void *)0), P0, ((void *)0))=-2, t2097={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}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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}] [L837] 0 pthread_t t2098; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2097={7:0}, t2098={8: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}] [L838] FCALL, FORK 0 pthread_create(&t2098, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2098, ((void *)0), P1, ((void *)0))=-1, t2097={7:0}, t2098={8: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}] [L780] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}] [L792] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}] [L839] 0 pthread_t t2099; [L840] FCALL, FORK 0 pthread_create(&t2099, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2099, ((void *)0), P2, ((void *)0))=0, t2097={7:0}, t2098={8:0}, t2099={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=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L795] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L807] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L810] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 \read(y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 \read(y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2097={7:0}, t2098={8:0}, t2099={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L853] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L854] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L854] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L854] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L854] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) [L857] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe014_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - 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: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 207 locations, 60 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: 20.8s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 621 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 621 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1915 IncrementalHoareTripleChecker+Invalid, 2032 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 24 mSDtfsCounter, 1915 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=842occurred in iteration=16, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 2074 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 18:23:51,618 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...