/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 INSUFFICIENT_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/mix051_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 15:13:09,321 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 15:13:09,391 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 15:13:09,395 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 15:13:09,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 15:13:09,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 15:13:09,419 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 15:13:09,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 15:13:09,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 15:13:09,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 15:13:09,423 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 15:13:09,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 15:13:09,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 15:13:09,425 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 15:13:09,425 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 15:13:09,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 15:13:09,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 15:13:09,425 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 15:13:09,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 15:13:09,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 15:13:09,426 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 15:13:09,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 15:13:09,426 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 15:13:09,427 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 15:13:09,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 15:13:09,427 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 15:13:09,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 15:13:09,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:13:09,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 15:13:09,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 15:13:09,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 15:13:09,429 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 15:13:09,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 15:13:09,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 15:13:09,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 15:13:09,429 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 -> INSUFFICIENT_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 15:13:09,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 15:13:09,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 15:13:09,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 15:13:09,764 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 15:13:09,764 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 15:13:09,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i [2023-08-26 15:13:10,850 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 15:13:11,097 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 15:13:11,097 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i [2023-08-26 15:13:11,114 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2d0f7c58/31a4ec69347f4b07a66cbd84d73814aa/FLAG5fad033f6 [2023-08-26 15:13:11,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2d0f7c58/31a4ec69347f4b07a66cbd84d73814aa [2023-08-26 15:13:11,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 15:13:11,126 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 15:13:11,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 15:13:11,127 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 15:13:11,129 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 15:13:11,129 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:13:11" (1/1) ... [2023-08-26 15:13:11,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c111374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:13:11, skipping insertion in model container [2023-08-26 15:13:11,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:13:11" (1/1) ... [2023-08-26 15:13:11,171 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 15:13:11,534 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:13:11,553 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 15:13:11,577 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:13:11,579 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:13:11,609 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:13:11,639 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:13:11,639 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:13:11,644 INFO L206 MainTranslator]: Completed translation [2023-08-26 15:13:11,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:13:11 WrapperNode [2023-08-26 15:13:11,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 15:13:11,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 15:13:11,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 15:13:11,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 15:13:11,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:13:11" (1/1) ... [2023-08-26 15:13:11,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 03:13:11" (1/1) ... [2023-08-26 15:13:11,704 INFO L138 Inliner]: procedures = 177, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 167 [2023-08-26 15:13:11,705 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 15:13:11,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 15:13:11,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 15:13:11,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 15:13:11,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:13:11" (1/1) ... [2023-08-26 15:13:11,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:13:11" (1/1) ... [2023-08-26 15:13:11,724 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:13:11" (1/1) ... [2023-08-26 15:13:11,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:13:11" (1/1) ... [2023-08-26 15:13:11,733 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:13:11" (1/1) ... [2023-08-26 15:13:11,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:13:11" (1/1) ... [2023-08-26 15:13:11,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:13:11" (1/1) ... [2023-08-26 15:13:11,736 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:13:11" (1/1) ... [2023-08-26 15:13:11,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 15:13:11,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 15:13:11,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 15:13:11,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 15:13:11,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:13:11" (1/1) ... [2023-08-26 15:13:11,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:13:11,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 15:13:11,794 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 15:13:11,812 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 15:13:11,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 15:13:11,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 15:13:11,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 15:13:11,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 15:13:11,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 15:13:11,842 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 15:13:11,842 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 15:13:11,842 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 15:13:11,842 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 15:13:11,842 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 15:13:11,842 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 15:13:11,842 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 15:13:11,842 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 15:13:11,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 15:13:11,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 15:13:11,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 15:13:11,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 15:13:11,843 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 15:13:11,962 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 15:13:11,964 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 15:13:12,319 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 15:13:12,402 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 15:13:12,403 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 15:13:12,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:13:12 BoogieIcfgContainer [2023-08-26 15:13:12,405 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 15:13:12,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 15:13:12,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 15:13:12,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 15:13:12,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:13:11" (1/3) ... [2023-08-26 15:13:12,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7510c559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:13:12, skipping insertion in model container [2023-08-26 15:13:12,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:13:11" (2/3) ... [2023-08-26 15:13:12,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7510c559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:13:12, skipping insertion in model container [2023-08-26 15:13:12,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:13:12" (3/3) ... [2023-08-26 15:13:12,413 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2023-08-26 15:13:12,426 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 15:13:12,426 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 15:13:12,427 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 15:13:12,479 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 15:13:12,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 141 transitions, 302 flow [2023-08-26 15:13:12,585 INFO L124 PetriNetUnfolderBase]: 3/137 cut-off events. [2023-08-26 15:13:12,585 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:13:12,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 3/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 114 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-26 15:13:12,592 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 141 transitions, 302 flow [2023-08-26 15:13:12,599 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 137 transitions, 286 flow [2023-08-26 15:13:12,602 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 15:13:12,613 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 137 transitions, 286 flow [2023-08-26 15:13:12,617 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 137 transitions, 286 flow [2023-08-26 15:13:12,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 137 transitions, 286 flow [2023-08-26 15:13:12,654 INFO L124 PetriNetUnfolderBase]: 3/137 cut-off events. [2023-08-26 15:13:12,654 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:13:12,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 3/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 113 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-26 15:13:12,670 INFO L119 LiptonReduction]: Number of co-enabled transitions 3452 [2023-08-26 15:13:16,519 INFO L134 LiptonReduction]: Checked pairs total: 9357 [2023-08-26 15:13:16,520 INFO L136 LiptonReduction]: Total number of compositions: 140 [2023-08-26 15:13:16,528 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 15:13:16,532 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@504692a6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 15:13:16,532 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 15:13:16,533 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 15:13:16,533 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 15:13:16,533 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:13:16,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:16,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 15:13:16,534 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:16,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:16,537 INFO L85 PathProgramCache]: Analyzing trace with hash 621, now seen corresponding path program 1 times [2023-08-26 15:13:16,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:16,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852214917] [2023-08-26 15:13:16,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:16,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:16,622 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 15:13:16,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:16,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852214917] [2023-08-26 15:13:16,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852214917] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:16,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:16,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 15:13:16,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512776654] [2023-08-26 15:13:16,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:16,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 15:13:16,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:16,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 15:13:16,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 15:13:16,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 281 [2023-08-26 15:13:16,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 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 15:13:16,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:16,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 281 [2023-08-26 15:13:16,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:17,558 INFO L124 PetriNetUnfolderBase]: 6949/9497 cut-off events. [2023-08-26 15:13:17,558 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2023-08-26 15:13:17,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19111 conditions, 9497 events. 6949/9497 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 49263 event pairs, 6949 based on Foata normal form. 320/8547 useless extension candidates. Maximal degree in co-relation 19099. Up to 9399 conditions per place. [2023-08-26 15:13:17,606 INFO L140 encePairwiseOnDemand]: 272/281 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-26 15:13:17,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow [2023-08-26 15:13:17,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 15:13:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 15:13:17,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 286 transitions. [2023-08-26 15:13:17,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5088967971530249 [2023-08-26 15:13:17,619 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 286 transitions. [2023-08-26 15:13:17,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 286 transitions. [2023-08-26 15:13:17,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:17,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 286 transitions. [2023-08-26 15:13:17,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.0) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:17,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:17,628 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:17,629 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 286 transitions. [2023-08-26 15:13:17,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow [2023-08-26 15:13:17,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 15:13:17,633 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-26 15:13:17,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-26 15:13:17,636 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-26 15:13:17,636 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-26 15:13:17,637 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 15:13:17,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:17,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 15:13:17,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 15:13:17,637 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:17,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:17,638 INFO L85 PathProgramCache]: Analyzing trace with hash 588456792, now seen corresponding path program 1 times [2023-08-26 15:13:17,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:17,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606028010] [2023-08-26 15:13:17,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:17,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:17,843 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 15:13:17,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:17,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606028010] [2023-08-26 15:13:17,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606028010] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:17,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:17,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:13:17,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454131675] [2023-08-26 15:13:17,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:17,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:13:17,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:17,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:13:17,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:13:17,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 281 [2023-08-26 15:13:17,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:17,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:17,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 281 [2023-08-26 15:13:17,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:18,520 INFO L124 PetriNetUnfolderBase]: 5463/7581 cut-off events. [2023-08-26 15:13:18,520 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:13:18,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15178 conditions, 7581 events. 5463/7581 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 38456 event pairs, 2045 based on Foata normal form. 0/7040 useless extension candidates. Maximal degree in co-relation 15175. Up to 5923 conditions per place. [2023-08-26 15:13:18,543 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 39 selfloop transitions, 2 changer transitions 4/49 dead transitions. [2023-08-26 15:13:18,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 200 flow [2023-08-26 15:13:18,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:13:18,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:13:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-08-26 15:13:18,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4958481613285884 [2023-08-26 15:13:18,545 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-08-26 15:13:18,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-08-26 15:13:18,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:18,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-08-26 15:13:18,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:18,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:18,548 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:18,548 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 418 transitions. [2023-08-26 15:13:18,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 200 flow [2023-08-26 15:13:18,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:13:18,549 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 68 flow [2023-08-26 15:13:18,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-26 15:13:18,550 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-26 15:13:18,550 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 68 flow [2023-08-26 15:13:18,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:18,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:18,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:18,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 15:13:18,551 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:18,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:18,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1186075633, now seen corresponding path program 1 times [2023-08-26 15:13:18,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:18,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909708471] [2023-08-26 15:13:18,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:18,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:19,027 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 15:13:19,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:19,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909708471] [2023-08-26 15:13:19,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909708471] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:19,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:19,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:13:19,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848883136] [2023-08-26 15:13:19,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:19,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:13:19,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:19,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:13:19,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:13:19,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 281 [2023-08-26 15:13:19,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:19,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:19,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 281 [2023-08-26 15:13:19,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:19,983 INFO L124 PetriNetUnfolderBase]: 5463/7662 cut-off events. [2023-08-26 15:13:19,983 INFO L125 PetriNetUnfolderBase]: For 464/464 co-relation queries the response was YES. [2023-08-26 15:13:20,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15875 conditions, 7662 events. 5463/7662 cut-off events. For 464/464 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 39392 event pairs, 2693 based on Foata normal form. 320/7970 useless extension candidates. Maximal degree in co-relation 15871. Up to 6217 conditions per place. [2023-08-26 15:13:20,030 INFO L140 encePairwiseOnDemand]: 276/281 looper letters, 39 selfloop transitions, 3 changer transitions 23/68 dead transitions. [2023-08-26 15:13:20,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 290 flow [2023-08-26 15:13:20,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:13:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:13:20,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 637 transitions. [2023-08-26 15:13:20,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4533807829181495 [2023-08-26 15:13:20,033 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 637 transitions. [2023-08-26 15:13:20,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 637 transitions. [2023-08-26 15:13:20,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:20,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 637 transitions. [2023-08-26 15:13:20,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:20,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:20,039 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:20,039 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 68 flow. Second operand 5 states and 637 transitions. [2023-08-26 15:13:20,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 290 flow [2023-08-26 15:13:20,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:13:20,041 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 91 flow [2023-08-26 15:13:20,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2023-08-26 15:13:20,042 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2023-08-26 15:13:20,042 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 91 flow [2023-08-26 15:13:20,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:20,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:20,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:20,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 15:13:20,043 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:20,044 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:20,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1886328783, now seen corresponding path program 1 times [2023-08-26 15:13:20,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:20,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789050173] [2023-08-26 15:13:20,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:20,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:20,511 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 15:13:20,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:20,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789050173] [2023-08-26 15:13:20,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789050173] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:20,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:20,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:13:20,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992075801] [2023-08-26 15:13:20,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:20,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:13:20,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:20,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:13:20,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:13:20,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 281 [2023-08-26 15:13:20,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 91 flow. Second operand has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:20,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:20,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 281 [2023-08-26 15:13:20,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:21,312 INFO L124 PetriNetUnfolderBase]: 5507/7882 cut-off events. [2023-08-26 15:13:21,312 INFO L125 PetriNetUnfolderBase]: For 2589/2589 co-relation queries the response was YES. [2023-08-26 15:13:21,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18180 conditions, 7882 events. 5507/7882 cut-off events. For 2589/2589 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 44048 event pairs, 1213 based on Foata normal form. 264/8138 useless extension candidates. Maximal degree in co-relation 18173. Up to 6091 conditions per place. [2023-08-26 15:13:21,350 INFO L140 encePairwiseOnDemand]: 273/281 looper letters, 50 selfloop transitions, 7 changer transitions 22/82 dead transitions. [2023-08-26 15:13:21,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 82 transitions, 377 flow [2023-08-26 15:13:21,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:13:21,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:13:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 765 transitions. [2023-08-26 15:13:21,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45373665480427045 [2023-08-26 15:13:21,353 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 765 transitions. [2023-08-26 15:13:21,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 765 transitions. [2023-08-26 15:13:21,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:21,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 765 transitions. [2023-08-26 15:13:21,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:21,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:21,359 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:21,359 INFO L175 Difference]: Start difference. First operand has 45 places, 30 transitions, 91 flow. Second operand 6 states and 765 transitions. [2023-08-26 15:13:21,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 82 transitions, 377 flow [2023-08-26 15:13:21,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 82 transitions, 372 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 15:13:21,396 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 139 flow [2023-08-26 15:13:21,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=139, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2023-08-26 15:13:21,397 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2023-08-26 15:13:21,397 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 139 flow [2023-08-26 15:13:21,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:21,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:21,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:21,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 15:13:21,398 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:21,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:21,399 INFO L85 PathProgramCache]: Analyzing trace with hash 555891098, now seen corresponding path program 1 times [2023-08-26 15:13:21,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:21,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018610067] [2023-08-26 15:13:21,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:21,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:21,596 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 15:13:21,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:21,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018610067] [2023-08-26 15:13:21,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018610067] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:21,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:21,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:13:21,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242169059] [2023-08-26 15:13:21,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:21,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:13:21,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:21,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:13:21,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:13:21,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 281 [2023-08-26 15:13:21,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:21,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:21,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 281 [2023-08-26 15:13:21,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:22,284 INFO L124 PetriNetUnfolderBase]: 5461/7931 cut-off events. [2023-08-26 15:13:22,285 INFO L125 PetriNetUnfolderBase]: For 8365/8398 co-relation queries the response was YES. [2023-08-26 15:13:22,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22370 conditions, 7931 events. 5461/7931 cut-off events. For 8365/8398 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 45058 event pairs, 805 based on Foata normal form. 217/8131 useless extension candidates. Maximal degree in co-relation 22361. Up to 5647 conditions per place. [2023-08-26 15:13:22,314 INFO L140 encePairwiseOnDemand]: 272/281 looper letters, 55 selfloop transitions, 9 changer transitions 20/87 dead transitions. [2023-08-26 15:13:22,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 87 transitions, 481 flow [2023-08-26 15:13:22,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:13:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:13:22,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 783 transitions. [2023-08-26 15:13:22,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46441281138790036 [2023-08-26 15:13:22,316 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 783 transitions. [2023-08-26 15:13:22,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 783 transitions. [2023-08-26 15:13:22,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:22,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 783 transitions. [2023-08-26 15:13:22,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:22,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:22,320 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:22,320 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 139 flow. Second operand 6 states and 783 transitions. [2023-08-26 15:13:22,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 87 transitions, 481 flow [2023-08-26 15:13:22,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 87 transitions, 464 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-26 15:13:22,339 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 184 flow [2023-08-26 15:13:22,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-08-26 15:13:22,340 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2023-08-26 15:13:22,340 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 184 flow [2023-08-26 15:13:22,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:22,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:22,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:22,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 15:13:22,341 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:22,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:22,341 INFO L85 PathProgramCache]: Analyzing trace with hash 556669508, now seen corresponding path program 2 times [2023-08-26 15:13:22,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:22,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088422121] [2023-08-26 15:13:22,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:22,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:22,702 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 15:13:22,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:22,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088422121] [2023-08-26 15:13:22,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088422121] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:22,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:22,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:13:22,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363988160] [2023-08-26 15:13:22,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:22,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:13:22,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:22,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:13:22,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:13:22,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 281 [2023-08-26 15:13:22,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 109.33333333333333) internal successors, (656), 6 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:22,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:22,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 281 [2023-08-26 15:13:22,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:23,807 INFO L124 PetriNetUnfolderBase]: 10583/14341 cut-off events. [2023-08-26 15:13:23,807 INFO L125 PetriNetUnfolderBase]: For 19435/19435 co-relation queries the response was YES. [2023-08-26 15:13:23,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43424 conditions, 14341 events. 10583/14341 cut-off events. For 19435/19435 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 68606 event pairs, 3405 based on Foata normal form. 375/14716 useless extension candidates. Maximal degree in co-relation 43413. Up to 11616 conditions per place. [2023-08-26 15:13:23,855 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 74 selfloop transitions, 9 changer transitions 25/108 dead transitions. [2023-08-26 15:13:23,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 108 transitions, 637 flow [2023-08-26 15:13:23,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:13:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:13:23,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 850 transitions. [2023-08-26 15:13:23,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43213014743263856 [2023-08-26 15:13:23,857 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 850 transitions. [2023-08-26 15:13:23,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 850 transitions. [2023-08-26 15:13:23,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:23,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 850 transitions. [2023-08-26 15:13:23,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.42857142857143) internal successors, (850), 7 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:23,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:23,861 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:23,861 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 184 flow. Second operand 7 states and 850 transitions. [2023-08-26 15:13:23,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 108 transitions, 637 flow [2023-08-26 15:13:23,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 108 transitions, 611 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-08-26 15:13:23,915 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 217 flow [2023-08-26 15:13:23,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=217, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2023-08-26 15:13:23,917 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2023-08-26 15:13:23,919 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 217 flow [2023-08-26 15:13:23,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.33333333333333) internal successors, (656), 6 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:23,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:23,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:23,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 15:13:23,920 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:23,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:23,921 INFO L85 PathProgramCache]: Analyzing trace with hash 52722596, now seen corresponding path program 1 times [2023-08-26 15:13:23,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:23,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457542147] [2023-08-26 15:13:23,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:23,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:24,196 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 15:13:24,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:24,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457542147] [2023-08-26 15:13:24,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457542147] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:24,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:24,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:13:24,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93849416] [2023-08-26 15:13:24,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:24,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:13:24,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:24,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:13:24,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:13:24,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 281 [2023-08-26 15:13:24,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 217 flow. Second operand has 7 states, 7 states have (on average 118.14285714285714) internal successors, (827), 7 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:24,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:24,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 281 [2023-08-26 15:13:24,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:25,098 INFO L124 PetriNetUnfolderBase]: 5960/8615 cut-off events. [2023-08-26 15:13:25,098 INFO L125 PetriNetUnfolderBase]: For 15872/16005 co-relation queries the response was YES. [2023-08-26 15:13:25,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27480 conditions, 8615 events. 5960/8615 cut-off events. For 15872/16005 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 48241 event pairs, 1539 based on Foata normal form. 207/8712 useless extension candidates. Maximal degree in co-relation 27467. Up to 6470 conditions per place. [2023-08-26 15:13:25,142 INFO L140 encePairwiseOnDemand]: 271/281 looper letters, 70 selfloop transitions, 17 changer transitions 2/94 dead transitions. [2023-08-26 15:13:25,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 94 transitions, 573 flow [2023-08-26 15:13:25,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:13:25,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:13:25,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 779 transitions. [2023-08-26 15:13:25,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4620403321470937 [2023-08-26 15:13:25,144 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 779 transitions. [2023-08-26 15:13:25,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 779 transitions. [2023-08-26 15:13:25,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:25,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 779 transitions. [2023-08-26 15:13:25,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:25,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:25,148 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:25,148 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 217 flow. Second operand 6 states and 779 transitions. [2023-08-26 15:13:25,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 94 transitions, 573 flow [2023-08-26 15:13:25,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 94 transitions, 553 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-26 15:13:25,203 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 293 flow [2023-08-26 15:13:25,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=293, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-08-26 15:13:25,203 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2023-08-26 15:13:25,203 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 293 flow [2023-08-26 15:13:25,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.14285714285714) internal successors, (827), 7 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:25,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:25,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:25,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 15:13:25,204 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:25,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:25,204 INFO L85 PathProgramCache]: Analyzing trace with hash 79995776, now seen corresponding path program 2 times [2023-08-26 15:13:25,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:25,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614365359] [2023-08-26 15:13:25,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:25,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:25,683 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 15:13:25,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:25,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614365359] [2023-08-26 15:13:25,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614365359] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:25,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:25,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:13:25,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978938619] [2023-08-26 15:13:25,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:25,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:13:25,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:25,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:13:25,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:13:25,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 281 [2023-08-26 15:13:25,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 293 flow. Second operand has 7 states, 7 states have (on average 110.14285714285714) internal successors, (771), 7 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:25,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:25,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 281 [2023-08-26 15:13:25,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:26,961 INFO L124 PetriNetUnfolderBase]: 11879/16150 cut-off events. [2023-08-26 15:13:26,961 INFO L125 PetriNetUnfolderBase]: For 24917/24917 co-relation queries the response was YES. [2023-08-26 15:13:26,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54200 conditions, 16150 events. 11879/16150 cut-off events. For 24917/24917 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 79923 event pairs, 2334 based on Foata normal form. 332/16482 useless extension candidates. Maximal degree in co-relation 54188. Up to 11833 conditions per place. [2023-08-26 15:13:27,032 INFO L140 encePairwiseOnDemand]: 268/281 looper letters, 94 selfloop transitions, 29 changer transitions 26/149 dead transitions. [2023-08-26 15:13:27,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 149 transitions, 989 flow [2023-08-26 15:13:27,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 15:13:27,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 15:13:27,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1109 transitions. [2023-08-26 15:13:27,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43851324634242783 [2023-08-26 15:13:27,035 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1109 transitions. [2023-08-26 15:13:27,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1109 transitions. [2023-08-26 15:13:27,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:27,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1109 transitions. [2023-08-26 15:13:27,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.22222222222223) internal successors, (1109), 9 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:27,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 281.0) internal successors, (2810), 10 states have internal predecessors, (2810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:27,040 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 281.0) internal successors, (2810), 10 states have internal predecessors, (2810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:27,040 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 293 flow. Second operand 9 states and 1109 transitions. [2023-08-26 15:13:27,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 149 transitions, 989 flow [2023-08-26 15:13:27,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 149 transitions, 931 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-08-26 15:13:27,111 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 440 flow [2023-08-26 15:13:27,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=440, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2023-08-26 15:13:27,112 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2023-08-26 15:13:27,112 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 440 flow [2023-08-26 15:13:27,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.14285714285714) internal successors, (771), 7 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:27,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:27,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:27,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 15:13:27,113 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:27,113 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:27,113 INFO L85 PathProgramCache]: Analyzing trace with hash 76853306, now seen corresponding path program 3 times [2023-08-26 15:13:27,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:27,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334586537] [2023-08-26 15:13:27,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:27,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:27,571 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 15:13:27,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:27,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334586537] [2023-08-26 15:13:27,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334586537] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:27,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:27,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:13:27,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279959765] [2023-08-26 15:13:27,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:27,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:13:27,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:27,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:13:27,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:13:27,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 281 [2023-08-26 15:13:27,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 440 flow. Second operand has 7 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:27,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:27,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 281 [2023-08-26 15:13:27,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:29,120 INFO L124 PetriNetUnfolderBase]: 12501/16929 cut-off events. [2023-08-26 15:13:29,120 INFO L125 PetriNetUnfolderBase]: For 59693/59693 co-relation queries the response was YES. [2023-08-26 15:13:29,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68810 conditions, 16929 events. 12501/16929 cut-off events. For 59693/59693 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 83529 event pairs, 2477 based on Foata normal form. 371/17300 useless extension candidates. Maximal degree in co-relation 68793. Up to 12809 conditions per place. [2023-08-26 15:13:29,191 INFO L140 encePairwiseOnDemand]: 269/281 looper letters, 96 selfloop transitions, 39 changer transitions 25/160 dead transitions. [2023-08-26 15:13:29,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 160 transitions, 1305 flow [2023-08-26 15:13:29,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 15:13:29,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 15:13:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 983 transitions. [2023-08-26 15:13:29,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4372775800711744 [2023-08-26 15:13:29,194 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 983 transitions. [2023-08-26 15:13:29,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 983 transitions. [2023-08-26 15:13:29,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:29,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 983 transitions. [2023-08-26 15:13:29,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.875) internal successors, (983), 8 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:29,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 281.0) internal successors, (2529), 9 states have internal predecessors, (2529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:29,198 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 281.0) internal successors, (2529), 9 states have internal predecessors, (2529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:29,198 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 440 flow. Second operand 8 states and 983 transitions. [2023-08-26 15:13:29,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 160 transitions, 1305 flow [2023-08-26 15:13:29,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 160 transitions, 1223 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-26 15:13:29,301 INFO L231 Difference]: Finished difference. Result has 71 places, 80 transitions, 693 flow [2023-08-26 15:13:29,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=693, PETRI_PLACES=71, PETRI_TRANSITIONS=80} [2023-08-26 15:13:29,302 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places. [2023-08-26 15:13:29,302 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 80 transitions, 693 flow [2023-08-26 15:13:29,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:29,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:29,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:29,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 15:13:29,303 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:29,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:29,303 INFO L85 PathProgramCache]: Analyzing trace with hash 153281636, now seen corresponding path program 4 times [2023-08-26 15:13:29,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:29,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820503736] [2023-08-26 15:13:29,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:29,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:29,622 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 15:13:29,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:29,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820503736] [2023-08-26 15:13:29,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820503736] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:29,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:29,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:13:29,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807261134] [2023-08-26 15:13:29,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:29,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:13:29,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:29,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:13:29,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:13:29,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 281 [2023-08-26 15:13:29,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 80 transitions, 693 flow. Second operand has 7 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:29,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:29,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 281 [2023-08-26 15:13:29,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:31,229 INFO L124 PetriNetUnfolderBase]: 11582/16236 cut-off events. [2023-08-26 15:13:31,229 INFO L125 PetriNetUnfolderBase]: For 126533/128338 co-relation queries the response was YES. [2023-08-26 15:13:31,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83187 conditions, 16236 events. 11582/16236 cut-off events. For 126533/128338 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 90434 event pairs, 2735 based on Foata normal form. 680/16572 useless extension candidates. Maximal degree in co-relation 83167. Up to 8973 conditions per place. [2023-08-26 15:13:31,323 INFO L140 encePairwiseOnDemand]: 273/281 looper letters, 66 selfloop transitions, 30 changer transitions 20/131 dead transitions. [2023-08-26 15:13:31,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 131 transitions, 1307 flow [2023-08-26 15:13:31,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:13:31,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:13:31,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 764 transitions. [2023-08-26 15:13:31,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4531435349940688 [2023-08-26 15:13:31,325 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 764 transitions. [2023-08-26 15:13:31,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 764 transitions. [2023-08-26 15:13:31,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:31,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 764 transitions. [2023-08-26 15:13:31,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:31,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:31,329 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:31,329 INFO L175 Difference]: Start difference. First operand has 71 places, 80 transitions, 693 flow. Second operand 6 states and 764 transitions. [2023-08-26 15:13:31,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 131 transitions, 1307 flow [2023-08-26 15:13:31,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 131 transitions, 1236 flow, removed 26 selfloop flow, removed 2 redundant places. [2023-08-26 15:13:31,519 INFO L231 Difference]: Finished difference. Result has 75 places, 84 transitions, 803 flow [2023-08-26 15:13:31,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=803, PETRI_PLACES=75, PETRI_TRANSITIONS=84} [2023-08-26 15:13:31,519 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2023-08-26 15:13:31,519 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 84 transitions, 803 flow [2023-08-26 15:13:31,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:31,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:31,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:31,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 15:13:31,520 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:31,520 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:31,520 INFO L85 PathProgramCache]: Analyzing trace with hash -961318468, now seen corresponding path program 1 times [2023-08-26 15:13:31,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:31,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541411503] [2023-08-26 15:13:31,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:31,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:31,762 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 15:13:31,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:31,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541411503] [2023-08-26 15:13:31,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541411503] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:31,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:31,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:13:31,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885282831] [2023-08-26 15:13:31,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:31,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:13:31,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:31,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:13:31,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:13:31,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 281 [2023-08-26 15:13:31,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 84 transitions, 803 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:31,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:31,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 281 [2023-08-26 15:13:31,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:32,954 INFO L124 PetriNetUnfolderBase]: 6560/9485 cut-off events. [2023-08-26 15:13:32,955 INFO L125 PetriNetUnfolderBase]: For 122610/124024 co-relation queries the response was YES. [2023-08-26 15:13:32,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54603 conditions, 9485 events. 6560/9485 cut-off events. For 122610/124024 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 52542 event pairs, 1381 based on Foata normal form. 437/9636 useless extension candidates. Maximal degree in co-relation 54581. Up to 7262 conditions per place. [2023-08-26 15:13:33,021 INFO L140 encePairwiseOnDemand]: 275/281 looper letters, 97 selfloop transitions, 5 changer transitions 0/119 dead transitions. [2023-08-26 15:13:33,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 119 transitions, 1358 flow [2023-08-26 15:13:33,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:13:33,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:13:33,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-08-26 15:13:33,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4744958481613286 [2023-08-26 15:13:33,023 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-08-26 15:13:33,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-08-26 15:13:33,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:33,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-08-26 15:13:33,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:33,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:33,025 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:33,025 INFO L175 Difference]: Start difference. First operand has 75 places, 84 transitions, 803 flow. Second operand 3 states and 400 transitions. [2023-08-26 15:13:33,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 119 transitions, 1358 flow [2023-08-26 15:13:33,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 119 transitions, 1213 flow, removed 42 selfloop flow, removed 6 redundant places. [2023-08-26 15:13:33,131 INFO L231 Difference]: Finished difference. Result has 70 places, 82 transitions, 688 flow [2023-08-26 15:13:33,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=70, PETRI_TRANSITIONS=82} [2023-08-26 15:13:33,132 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 18 predicate places. [2023-08-26 15:13:33,132 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 82 transitions, 688 flow [2023-08-26 15:13:33,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:33,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:33,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:33,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 15:13:33,133 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:33,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:33,133 INFO L85 PathProgramCache]: Analyzing trace with hash 111739438, now seen corresponding path program 1 times [2023-08-26 15:13:33,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:33,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121928055] [2023-08-26 15:13:33,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:33,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:33,232 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 15:13:33,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:33,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121928055] [2023-08-26 15:13:33,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121928055] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:33,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:33,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:13:33,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052261884] [2023-08-26 15:13:33,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:33,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:13:33,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:33,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:13:33,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:13:33,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 281 [2023-08-26 15:13:33,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 82 transitions, 688 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 15:13:33,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:33,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 281 [2023-08-26 15:13:33,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:33,816 INFO L124 PetriNetUnfolderBase]: 3248/4993 cut-off events. [2023-08-26 15:13:33,816 INFO L125 PetriNetUnfolderBase]: For 43054/43772 co-relation queries the response was YES. [2023-08-26 15:13:33,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26190 conditions, 4993 events. 3248/4993 cut-off events. For 43054/43772 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 27524 event pairs, 569 based on Foata normal form. 458/5321 useless extension candidates. Maximal degree in co-relation 26170. Up to 1879 conditions per place. [2023-08-26 15:13:33,844 INFO L140 encePairwiseOnDemand]: 275/281 looper letters, 120 selfloop transitions, 9 changer transitions 0/146 dead transitions. [2023-08-26 15:13:33,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 146 transitions, 1546 flow [2023-08-26 15:13:33,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:13:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:13:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 535 transitions. [2023-08-26 15:13:33,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47597864768683273 [2023-08-26 15:13:33,846 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 535 transitions. [2023-08-26 15:13:33,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 535 transitions. [2023-08-26 15:13:33,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:33,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 535 transitions. [2023-08-26 15:13:33,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:33,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:33,848 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:33,849 INFO L175 Difference]: Start difference. First operand has 70 places, 82 transitions, 688 flow. Second operand 4 states and 535 transitions. [2023-08-26 15:13:33,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 146 transitions, 1546 flow [2023-08-26 15:13:33,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 146 transitions, 1541 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:13:33,863 INFO L231 Difference]: Finished difference. Result has 73 places, 82 transitions, 703 flow [2023-08-26 15:13:33,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=703, PETRI_PLACES=73, PETRI_TRANSITIONS=82} [2023-08-26 15:13:33,864 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2023-08-26 15:13:33,864 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 82 transitions, 703 flow [2023-08-26 15:13:33,864 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 15:13:33,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:33,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:33,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 15:13:33,864 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:33,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:33,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1298010640, now seen corresponding path program 1 times [2023-08-26 15:13:33,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:33,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139244536] [2023-08-26 15:13:33,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:33,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:34,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 15:13:34,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:34,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139244536] [2023-08-26 15:13:34,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139244536] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:34,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:34,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:13:34,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785660902] [2023-08-26 15:13:34,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:34,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:13:34,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:34,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:13:34,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:13:34,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 281 [2023-08-26 15:13:34,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 82 transitions, 703 flow. Second operand has 5 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:34,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:34,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 281 [2023-08-26 15:13:34,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:34,685 INFO L124 PetriNetUnfolderBase]: 2368/3651 cut-off events. [2023-08-26 15:13:34,685 INFO L125 PetriNetUnfolderBase]: For 35459/36031 co-relation queries the response was YES. [2023-08-26 15:13:34,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19850 conditions, 3651 events. 2368/3651 cut-off events. For 35459/36031 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 20065 event pairs, 425 based on Foata normal form. 248/3801 useless extension candidates. Maximal degree in co-relation 19829. Up to 1417 conditions per place. [2023-08-26 15:13:34,711 INFO L140 encePairwiseOnDemand]: 275/281 looper letters, 125 selfloop transitions, 13 changer transitions 0/155 dead transitions. [2023-08-26 15:13:34,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 155 transitions, 1676 flow [2023-08-26 15:13:34,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:13:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:13:34,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 668 transitions. [2023-08-26 15:13:34,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47544483985765124 [2023-08-26 15:13:34,713 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 668 transitions. [2023-08-26 15:13:34,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 668 transitions. [2023-08-26 15:13:34,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:34,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 668 transitions. [2023-08-26 15:13:34,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:34,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:34,716 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:34,716 INFO L175 Difference]: Start difference. First operand has 73 places, 82 transitions, 703 flow. Second operand 5 states and 668 transitions. [2023-08-26 15:13:34,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 155 transitions, 1676 flow [2023-08-26 15:13:34,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 155 transitions, 1526 flow, removed 38 selfloop flow, removed 6 redundant places. [2023-08-26 15:13:34,743 INFO L231 Difference]: Finished difference. Result has 72 places, 79 transitions, 651 flow [2023-08-26 15:13:34,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=651, PETRI_PLACES=72, PETRI_TRANSITIONS=79} [2023-08-26 15:13:34,743 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2023-08-26 15:13:34,743 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 79 transitions, 651 flow [2023-08-26 15:13:34,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:34,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:34,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:34,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 15:13:34,744 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:34,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:34,744 INFO L85 PathProgramCache]: Analyzing trace with hash -2128497649, now seen corresponding path program 1 times [2023-08-26 15:13:34,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:34,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876190881] [2023-08-26 15:13:34,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:34,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:34,921 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 15:13:34,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:34,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876190881] [2023-08-26 15:13:34,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876190881] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:34,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:34,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:13:34,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524005172] [2023-08-26 15:13:34,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:34,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:13:34,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:34,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:13:34,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:13:34,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 281 [2023-08-26 15:13:34,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 79 transitions, 651 flow. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:34,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:34,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 281 [2023-08-26 15:13:34,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:35,577 INFO L124 PetriNetUnfolderBase]: 3463/5366 cut-off events. [2023-08-26 15:13:35,578 INFO L125 PetriNetUnfolderBase]: For 35803/36207 co-relation queries the response was YES. [2023-08-26 15:13:35,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27861 conditions, 5366 events. 3463/5366 cut-off events. For 35803/36207 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 30422 event pairs, 484 based on Foata normal form. 65/5380 useless extension candidates. Maximal degree in co-relation 27841. Up to 2406 conditions per place. [2023-08-26 15:13:35,608 INFO L140 encePairwiseOnDemand]: 277/281 looper letters, 113 selfloop transitions, 2 changer transitions 42/171 dead transitions. [2023-08-26 15:13:35,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 171 transitions, 1781 flow [2023-08-26 15:13:35,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:13:35,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:13:35,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 653 transitions. [2023-08-26 15:13:35,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4647686832740214 [2023-08-26 15:13:35,611 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 653 transitions. [2023-08-26 15:13:35,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 653 transitions. [2023-08-26 15:13:35,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:35,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 653 transitions. [2023-08-26 15:13:35,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:35,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:35,615 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:35,615 INFO L175 Difference]: Start difference. First operand has 72 places, 79 transitions, 651 flow. Second operand 5 states and 653 transitions. [2023-08-26 15:13:35,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 171 transitions, 1781 flow [2023-08-26 15:13:35,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 171 transitions, 1691 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-08-26 15:13:35,683 INFO L231 Difference]: Finished difference. Result has 76 places, 79 transitions, 634 flow [2023-08-26 15:13:35,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=634, PETRI_PLACES=76, PETRI_TRANSITIONS=79} [2023-08-26 15:13:35,683 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 24 predicate places. [2023-08-26 15:13:35,683 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 79 transitions, 634 flow [2023-08-26 15:13:35,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:35,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:35,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:35,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 15:13:35,684 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:35,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:35,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1991047651, now seen corresponding path program 2 times [2023-08-26 15:13:35,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:35,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663873779] [2023-08-26 15:13:35,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:35,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:35,892 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 15:13:35,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:35,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663873779] [2023-08-26 15:13:35,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663873779] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:35,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:35,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:13:35,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17255173] [2023-08-26 15:13:35,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:35,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:13:35,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:35,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:13:35,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:13:35,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 281 [2023-08-26 15:13:35,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 79 transitions, 634 flow. Second operand has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:35,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:35,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 281 [2023-08-26 15:13:35,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:36,453 INFO L124 PetriNetUnfolderBase]: 2951/4505 cut-off events. [2023-08-26 15:13:36,453 INFO L125 PetriNetUnfolderBase]: For 38114/38802 co-relation queries the response was YES. [2023-08-26 15:13:36,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23461 conditions, 4505 events. 2951/4505 cut-off events. For 38114/38802 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 25917 event pairs, 483 based on Foata normal form. 110/4429 useless extension candidates. Maximal degree in co-relation 23438. Up to 1824 conditions per place. [2023-08-26 15:13:36,476 INFO L140 encePairwiseOnDemand]: 275/281 looper letters, 95 selfloop transitions, 17 changer transitions 28/153 dead transitions. [2023-08-26 15:13:36,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 153 transitions, 1542 flow [2023-08-26 15:13:36,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:13:36,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:13:36,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 787 transitions. [2023-08-26 15:13:36,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.466785290628707 [2023-08-26 15:13:36,478 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 787 transitions. [2023-08-26 15:13:36,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 787 transitions. [2023-08-26 15:13:36,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:36,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 787 transitions. [2023-08-26 15:13:36,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.16666666666666) internal successors, (787), 6 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:36,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:36,483 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:36,483 INFO L175 Difference]: Start difference. First operand has 76 places, 79 transitions, 634 flow. Second operand 6 states and 787 transitions. [2023-08-26 15:13:36,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 153 transitions, 1542 flow [2023-08-26 15:13:36,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 153 transitions, 1477 flow, removed 24 selfloop flow, removed 3 redundant places. [2023-08-26 15:13:36,577 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 569 flow [2023-08-26 15:13:36,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=569, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2023-08-26 15:13:36,577 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 26 predicate places. [2023-08-26 15:13:36,577 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 569 flow [2023-08-26 15:13:36,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:36,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:36,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:36,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 15:13:36,578 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:36,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:36,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1936499029, now seen corresponding path program 1 times [2023-08-26 15:13:36,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:36,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371155053] [2023-08-26 15:13:36,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:36,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:36,817 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 15:13:36,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:36,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371155053] [2023-08-26 15:13:36,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371155053] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:36,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:36,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:13:36,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274570916] [2023-08-26 15:13:36,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:36,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:13:36,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:36,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:13:36,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:13:36,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 281 [2023-08-26 15:13:36,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 569 flow. Second operand has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:36,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:36,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 281 [2023-08-26 15:13:36,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:37,330 INFO L124 PetriNetUnfolderBase]: 2777/4280 cut-off events. [2023-08-26 15:13:37,330 INFO L125 PetriNetUnfolderBase]: For 25952/25952 co-relation queries the response was YES. [2023-08-26 15:13:37,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22572 conditions, 4280 events. 2777/4280 cut-off events. For 25952/25952 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 22244 event pairs, 307 based on Foata normal form. 1/4281 useless extension candidates. Maximal degree in co-relation 22550. Up to 1791 conditions per place. [2023-08-26 15:13:37,345 INFO L140 encePairwiseOnDemand]: 273/281 looper letters, 85 selfloop transitions, 5 changer transitions 85/175 dead transitions. [2023-08-26 15:13:37,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 175 transitions, 1765 flow [2023-08-26 15:13:37,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:13:37,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:13:37,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 811 transitions. [2023-08-26 15:13:37,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4123029994916116 [2023-08-26 15:13:37,347 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 811 transitions. [2023-08-26 15:13:37,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 811 transitions. [2023-08-26 15:13:37,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:37,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 811 transitions. [2023-08-26 15:13:37,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.85714285714286) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:37,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:37,351 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:37,351 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 569 flow. Second operand 7 states and 811 transitions. [2023-08-26 15:13:37,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 175 transitions, 1765 flow [2023-08-26 15:13:37,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 175 transitions, 1532 flow, removed 84 selfloop flow, removed 8 redundant places. [2023-08-26 15:13:37,411 INFO L231 Difference]: Finished difference. Result has 80 places, 60 transitions, 411 flow [2023-08-26 15:13:37,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=411, PETRI_PLACES=80, PETRI_TRANSITIONS=60} [2023-08-26 15:13:37,411 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 28 predicate places. [2023-08-26 15:13:37,411 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 60 transitions, 411 flow [2023-08-26 15:13:37,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:37,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:37,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:37,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 15:13:37,412 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:37,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:37,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2023056387, now seen corresponding path program 2 times [2023-08-26 15:13:37,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:37,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283716762] [2023-08-26 15:13:37,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:37,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:37,554 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 15:13:37,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:37,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283716762] [2023-08-26 15:13:37,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283716762] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:37,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:37,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:13:37,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312159891] [2023-08-26 15:13:37,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:37,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:13:37,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:37,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:13:37,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:13:37,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 281 [2023-08-26 15:13:37,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 60 transitions, 411 flow. Second operand has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:37,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:37,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 281 [2023-08-26 15:13:37,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:37,917 INFO L124 PetriNetUnfolderBase]: 1562/2493 cut-off events. [2023-08-26 15:13:37,918 INFO L125 PetriNetUnfolderBase]: For 7478/7584 co-relation queries the response was YES. [2023-08-26 15:13:37,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10593 conditions, 2493 events. 1562/2493 cut-off events. For 7478/7584 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12298 event pairs, 337 based on Foata normal form. 9/2463 useless extension candidates. Maximal degree in co-relation 10570. Up to 1510 conditions per place. [2023-08-26 15:13:37,929 INFO L140 encePairwiseOnDemand]: 277/281 looper letters, 58 selfloop transitions, 1 changer transitions 56/119 dead transitions. [2023-08-26 15:13:37,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 119 transitions, 1010 flow [2023-08-26 15:13:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:13:37,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:13:37,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 639 transitions. [2023-08-26 15:13:37,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45480427046263344 [2023-08-26 15:13:37,932 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 639 transitions. [2023-08-26 15:13:37,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 639 transitions. [2023-08-26 15:13:37,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:37,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 639 transitions. [2023-08-26 15:13:37,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:37,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:37,936 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:37,936 INFO L175 Difference]: Start difference. First operand has 80 places, 60 transitions, 411 flow. Second operand 5 states and 639 transitions. [2023-08-26 15:13:37,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 119 transitions, 1010 flow [2023-08-26 15:13:37,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 119 transitions, 964 flow, removed 14 selfloop flow, removed 7 redundant places. [2023-08-26 15:13:37,959 INFO L231 Difference]: Finished difference. Result has 75 places, 48 transitions, 292 flow [2023-08-26 15:13:37,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=75, PETRI_TRANSITIONS=48} [2023-08-26 15:13:37,960 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2023-08-26 15:13:37,960 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 48 transitions, 292 flow [2023-08-26 15:13:37,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:37,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:37,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:37,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 15:13:37,960 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:37,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:37,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1460787611, now seen corresponding path program 3 times [2023-08-26 15:13:37,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:37,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777578462] [2023-08-26 15:13:37,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:37,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:13:38,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 15:13:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:13:38,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 15:13:38,113 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 15:13:38,114 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 15:13:38,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 15:13:38,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 15:13:38,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 15:13:38,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 15:13:38,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 15:13:38,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 15:13:38,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 15:13:38,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 15:13:38,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 15:13:38,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 15:13:38,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 15:13:38,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 15:13:38,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 15:13:38,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 15:13:38,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 15:13:38,120 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:38,124 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 15:13:38,124 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 15:13:38,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:13:38 BasicIcfg [2023-08-26 15:13:38,198 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 15:13:38,198 INFO L158 Benchmark]: Toolchain (without parser) took 27072.24ms. Allocated memory was 381.7MB in the beginning and 2.5GB in the end (delta: 2.1GB). Free memory was 355.7MB in the beginning and 1.3GB in the end (delta: -945.0MB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-08-26 15:13:38,198 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 381.7MB. Free memory is still 357.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 15:13:38,199 INFO L158 Benchmark]: CACSL2BoogieTranslator took 517.63ms. Allocated memory is still 381.7MB. Free memory was 355.7MB in the beginning and 331.9MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 15:13:38,199 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.81ms. Allocated memory is still 381.7MB. Free memory was 331.4MB in the beginning and 328.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:13:38,199 INFO L158 Benchmark]: Boogie Preprocessor took 33.12ms. Allocated memory is still 381.7MB. Free memory was 328.8MB in the beginning and 326.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:13:38,199 INFO L158 Benchmark]: RCFGBuilder took 665.75ms. Allocated memory is still 381.7MB. Free memory was 326.7MB in the beginning and 338.2MB in the end (delta: -11.5MB). Peak memory consumption was 29.5MB. Max. memory is 16.0GB. [2023-08-26 15:13:38,199 INFO L158 Benchmark]: TraceAbstraction took 25790.77ms. Allocated memory was 381.7MB in the beginning and 2.5GB in the end (delta: 2.1GB). Free memory was 338.2MB in the beginning and 1.3GB in the end (delta: -962.5MB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-08-26 15:13:38,200 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 381.7MB. Free memory is still 357.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 517.63ms. Allocated memory is still 381.7MB. Free memory was 355.7MB in the beginning and 331.9MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.81ms. Allocated memory is still 381.7MB. Free memory was 331.4MB in the beginning and 328.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.12ms. Allocated memory is still 381.7MB. Free memory was 328.8MB in the beginning and 326.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 665.75ms. Allocated memory is still 381.7MB. Free memory was 326.7MB in the beginning and 338.2MB in the end (delta: -11.5MB). Peak memory consumption was 29.5MB. Max. memory is 16.0GB. * TraceAbstraction took 25790.77ms. Allocated memory was 381.7MB in the beginning and 2.5GB in the end (delta: 2.1GB). Free memory was 338.2MB in the beginning and 1.3GB in the end (delta: -962.5MB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 147 PlacesBefore, 52 PlacesAfterwards, 137 TransitionsBefore, 40 TransitionsAfterwards, 3452 CoEnabledTransitionPairs, 6 FixpointIterations, 54 TrivialSequentialCompositions, 70 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 2 ChoiceCompositions, 140 TotalNumberOfCompositions, 9357 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3872, independent: 3670, independent conditional: 0, independent unconditional: 3670, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1859, independent: 1820, independent conditional: 0, independent unconditional: 1820, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3872, independent: 1850, independent conditional: 0, independent unconditional: 1850, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 1859, unknown conditional: 0, unknown unconditional: 1859] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 178, Positive conditional cache size: 0, Positive unconditional cache size: 178, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1377; [L849] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1377, ((void *)0), P0, ((void *)0))=-2, t1377={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L850] 0 pthread_t t1378; [L851] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1378, ((void *)0), P1, ((void *)0))=-1, t1377={5:0}, t1378={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L852] 0 pthread_t t1379; [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1379, ((void *)0), P2, ((void *)0))=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L854] 0 pthread_t t1380; [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L855] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1380, ((void *)0), P3, ((void *)0))=1, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L826] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L827] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L828] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L829] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L830] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 4 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 x$flush_delayed = weak$$choice2 [L871] 0 x$mem_tmp = x [L872] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L873] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L874] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L875] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L876] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L878] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L880] 0 x = x$flush_delayed ? x$mem_tmp : x [L881] 0 x$flush_delayed = (_Bool)0 [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix051_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 176 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 25.6s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 16.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 678 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 678 mSDsluCounter, 140 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2458 IncrementalHoareTripleChecker+Invalid, 2564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 48 mSDtfsCounter, 2458 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=803occurred in iteration=10, InterpolantAutomatonStates: 93, 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, 4.3s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 2242 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 15:13:38,236 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...