/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/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 15:10:11,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 15:10:11,248 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:10:11,251 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 15:10:11,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 15:10:11,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 15:10:11,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 15:10:11,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 15:10:11,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 15:10:11,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 15:10:11,267 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 15:10:11,268 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 15:10:11,268 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 15:10:11,268 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 15:10:11,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 15:10:11,269 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 15:10:11,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 15:10:11,269 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 15:10:11,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 15:10:11,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 15:10:11,270 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 15:10:11,275 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 15:10:11,275 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 15:10:11,275 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 15:10:11,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 15:10:11,278 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 15:10:11,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 15:10:11,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:10:11,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 15:10:11,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 15:10:11,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 15:10:11,281 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 15:10:11,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 15:10:11,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 15:10:11,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 15:10:11,281 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:10:11,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 15:10:11,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 15:10:11,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 15:10:11,520 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 15:10:11,521 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 15:10:11,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-08-26 15:10:12,528 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 15:10:12,719 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 15:10:12,720 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-08-26 15:10:12,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b23bcb75b/a7ebc3a501d5453fbf6ebeff3314ed68/FLAGe9693535f [2023-08-26 15:10:12,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b23bcb75b/a7ebc3a501d5453fbf6ebeff3314ed68 [2023-08-26 15:10:12,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 15:10:12,747 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 15:10:12,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 15:10:12,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 15:10:12,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 15:10:12,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:10:12" (1/1) ... [2023-08-26 15:10:12,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27668c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:12, skipping insertion in model container [2023-08-26 15:10:12,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:10:12" (1/1) ... [2023-08-26 15:10:12,784 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 15:10:13,048 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:10:13,065 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 15:10:13,089 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:10:13,090 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:10:13,130 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:10:13,158 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:10:13,158 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:10:13,162 INFO L206 MainTranslator]: Completed translation [2023-08-26 15:10:13,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:13 WrapperNode [2023-08-26 15:10:13,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 15:10:13,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 15:10:13,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 15:10:13,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 15:10:13,169 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:10:13" (1/1) ... [2023-08-26 15:10:13,192 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:10:13" (1/1) ... [2023-08-26 15:10:13,222 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-08-26 15:10:13,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 15:10:13,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 15:10:13,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 15:10:13,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 15:10:13,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:13" (1/1) ... [2023-08-26 15:10:13,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:13" (1/1) ... [2023-08-26 15:10:13,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:13" (1/1) ... [2023-08-26 15:10:13,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:13" (1/1) ... [2023-08-26 15:10:13,246 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:13" (1/1) ... [2023-08-26 15:10:13,247 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:13" (1/1) ... [2023-08-26 15:10:13,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:13" (1/1) ... [2023-08-26 15:10:13,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:13" (1/1) ... [2023-08-26 15:10:13,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 15:10:13,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 15:10:13,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 15:10:13,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 15:10:13,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:13" (1/1) ... [2023-08-26 15:10:13,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:10:13,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 15:10:13,286 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:10:13,288 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:10:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 15:10:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 15:10:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 15:10:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 15:10:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 15:10:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 15:10:13,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 15:10:13,327 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 15:10:13,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 15:10:13,327 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 15:10:13,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 15:10:13,327 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 15:10:13,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 15:10:13,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 15:10:13,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 15:10:13,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 15:10:13,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 15:10:13,329 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:10:13,472 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 15:10:13,473 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 15:10:13,712 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 15:10:13,819 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 15:10:13,819 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 15:10:13,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:10:13 BoogieIcfgContainer [2023-08-26 15:10:13,820 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 15:10:13,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 15:10:13,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 15:10:13,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 15:10:13,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:10:12" (1/3) ... [2023-08-26 15:10:13,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed8f1bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:10:13, skipping insertion in model container [2023-08-26 15:10:13,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:13" (2/3) ... [2023-08-26 15:10:13,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed8f1bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:10:13, skipping insertion in model container [2023-08-26 15:10:13,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:10:13" (3/3) ... [2023-08-26 15:10:13,828 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-08-26 15:10:13,838 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 15:10:13,838 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 15:10:13,839 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 15:10:13,892 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 15:10:13,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 142 transitions, 304 flow [2023-08-26 15:10:13,974 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2023-08-26 15:10:13,974 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:10:13,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 3/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 115 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-26 15:10:13,979 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 142 transitions, 304 flow [2023-08-26 15:10:13,984 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 138 transitions, 288 flow [2023-08-26 15:10:13,986 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 15:10:13,998 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 138 transitions, 288 flow [2023-08-26 15:10:14,001 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 138 transitions, 288 flow [2023-08-26 15:10:14,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 138 transitions, 288 flow [2023-08-26 15:10:14,040 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2023-08-26 15:10:14,040 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:10:14,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 3/138 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/125 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-26 15:10:14,044 INFO L119 LiptonReduction]: Number of co-enabled transitions 3584 [2023-08-26 15:10:17,575 INFO L134 LiptonReduction]: Checked pairs total: 11299 [2023-08-26 15:10:17,576 INFO L136 LiptonReduction]: Total number of compositions: 142 [2023-08-26 15:10:17,584 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 15:10:17,588 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;@4d024942, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 15:10:17,588 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 15:10:17,589 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 15:10:17,589 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 15:10:17,589 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:10:17,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:17,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 15:10:17,590 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:10:17,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:17,592 INFO L85 PathProgramCache]: Analyzing trace with hash 626, now seen corresponding path program 1 times [2023-08-26 15:10:17,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:17,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800697730] [2023-08-26 15:10:17,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:17,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:17,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:10:17,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:17,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800697730] [2023-08-26 15:10:17,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800697730] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:17,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:17,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 15:10:17,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7213083] [2023-08-26 15:10:17,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:17,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 15:10:17,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:17,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 15:10:17,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 15:10:17,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 284 [2023-08-26 15:10:17,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have 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:10:17,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:17,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 284 [2023-08-26 15:10:17,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:18,537 INFO L124 PetriNetUnfolderBase]: 6239/8530 cut-off events. [2023-08-26 15:10:18,537 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-08-26 15:10:18,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17198 conditions, 8530 events. 6239/8530 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 43138 event pairs, 6239 based on Foata normal form. 0/7582 useless extension candidates. Maximal degree in co-relation 17186. Up to 8451 conditions per place. [2023-08-26 15:10:18,584 INFO L140 encePairwiseOnDemand]: 275/284 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-08-26 15:10:18,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2023-08-26 15:10:18,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 15:10:18,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 15:10:18,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 287 transitions. [2023-08-26 15:10:18,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052816901408451 [2023-08-26 15:10:18,654 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 287 transitions. [2023-08-26 15:10:18,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 287 transitions. [2023-08-26 15:10:18,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:18,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 287 transitions. [2023-08-26 15:10:18,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have 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:10:18,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:18,661 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:18,663 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 287 transitions. [2023-08-26 15:10:18,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2023-08-26 15:10:18,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 15:10:18,668 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-08-26 15:10:18,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-26 15:10:18,671 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-08-26 15:10:18,671 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-08-26 15:10:18,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have 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:10:18,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:18,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 15:10:18,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 15:10:18,672 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:10:18,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:18,679 INFO L85 PathProgramCache]: Analyzing trace with hash 617117, now seen corresponding path program 1 times [2023-08-26 15:10:18,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:18,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551087793] [2023-08-26 15:10:18,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:18,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:18,904 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:10:18,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:18,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551087793] [2023-08-26 15:10:18,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551087793] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:18,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:18,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:10:18,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589631469] [2023-08-26 15:10:18,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:18,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:10:18,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:18,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:10:18,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:10:18,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 284 [2023-08-26 15:10:18,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have 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:10:18,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:18,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 284 [2023-08-26 15:10:18,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:19,494 INFO L124 PetriNetUnfolderBase]: 4903/7130 cut-off events. [2023-08-26 15:10:19,494 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:10:19,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13975 conditions, 7130 events. 4903/7130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 42077 event pairs, 895 based on Foata normal form. 0/6789 useless extension candidates. Maximal degree in co-relation 13972. Up to 5335 conditions per place. [2023-08-26 15:10:19,528 INFO L140 encePairwiseOnDemand]: 281/284 looper letters, 41 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-08-26 15:10:19,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 202 flow [2023-08-26 15:10:19,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:10:19,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:10:19,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-26 15:10:19,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49413145539906106 [2023-08-26 15:10:19,531 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-26 15:10:19,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-26 15:10:19,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:19,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-26 15:10:19,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have 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:10:19,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have 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:10:19,534 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have 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:10:19,535 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 421 transitions. [2023-08-26 15:10:19,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 202 flow [2023-08-26 15:10:19,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 202 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:10:19,536 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-08-26 15:10:19,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-26 15:10:19,536 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-08-26 15:10:19,536 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-08-26 15:10:19,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have 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:10:19,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:19,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:10:19,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 15:10:19,537 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:10:19,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:19,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1652525622, now seen corresponding path program 1 times [2023-08-26 15:10:19,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:19,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921893016] [2023-08-26 15:10:19,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:19,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:19,707 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:10:19,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:19,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921893016] [2023-08-26 15:10:19,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921893016] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:19,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:19,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:10:19,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768291195] [2023-08-26 15:10:19,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:19,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:10:19,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:19,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:10:19,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:10:19,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 284 [2023-08-26 15:10:19,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have 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:10:19,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:19,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 284 [2023-08-26 15:10:19,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:21,354 INFO L124 PetriNetUnfolderBase]: 16167/22000 cut-off events. [2023-08-26 15:10:21,354 INFO L125 PetriNetUnfolderBase]: For 1094/1094 co-relation queries the response was YES. [2023-08-26 15:10:21,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45568 conditions, 22000 events. 16167/22000 cut-off events. For 1094/1094 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 115768 event pairs, 5981 based on Foata normal form. 634/22634 useless extension candidates. Maximal degree in co-relation 45564. Up to 12890 conditions per place. [2023-08-26 15:10:21,459 INFO L140 encePairwiseOnDemand]: 275/284 looper letters, 45 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2023-08-26 15:10:21,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 232 flow [2023-08-26 15:10:21,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:10:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:10:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2023-08-26 15:10:21,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4647887323943662 [2023-08-26 15:10:21,461 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2023-08-26 15:10:21,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2023-08-26 15:10:21,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:21,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2023-08-26 15:10:21,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have 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:10:21,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have 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:10:21,465 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have 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:10:21,465 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 3 states and 396 transitions. [2023-08-26 15:10:21,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 232 flow [2023-08-26 15:10:21,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:10:21,467 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 126 flow [2023-08-26 15:10:21,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, 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=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-08-26 15:10:21,469 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -9 predicate places. [2023-08-26 15:10:21,469 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 126 flow [2023-08-26 15:10:21,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have 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:10:21,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:21,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:10:21,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 15:10:21,472 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:10:21,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:21,472 INFO L85 PathProgramCache]: Analyzing trace with hash -311315088, now seen corresponding path program 1 times [2023-08-26 15:10:21,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:21,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401677327] [2023-08-26 15:10:21,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:21,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:21,590 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:10:21,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:21,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401677327] [2023-08-26 15:10:21,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401677327] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:21,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:21,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:10:21,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896186427] [2023-08-26 15:10:21,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:21,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:10:21,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:21,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:10:21,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:10:21,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 284 [2023-08-26 15:10:21,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have 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:10:21,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:21,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 284 [2023-08-26 15:10:21,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:23,347 INFO L124 PetriNetUnfolderBase]: 14987/20406 cut-off events. [2023-08-26 15:10:23,347 INFO L125 PetriNetUnfolderBase]: For 8442/8442 co-relation queries the response was YES. [2023-08-26 15:10:23,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50969 conditions, 20406 events. 14987/20406 cut-off events. For 8442/8442 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 104156 event pairs, 3878 based on Foata normal form. 210/20616 useless extension candidates. Maximal degree in co-relation 50964. Up to 8687 conditions per place. [2023-08-26 15:10:23,487 INFO L140 encePairwiseOnDemand]: 276/284 looper letters, 57 selfloop transitions, 8 changer transitions 0/65 dead transitions. [2023-08-26 15:10:23,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 65 transitions, 340 flow [2023-08-26 15:10:23,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:10:23,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:10:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 516 transitions. [2023-08-26 15:10:23,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45422535211267606 [2023-08-26 15:10:23,489 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 516 transitions. [2023-08-26 15:10:23,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 516 transitions. [2023-08-26 15:10:23,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:23,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 516 transitions. [2023-08-26 15:10:23,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have 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:10:23,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have 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:10:23,492 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have 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:10:23,492 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 126 flow. Second operand 4 states and 516 transitions. [2023-08-26 15:10:23,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 65 transitions, 340 flow [2023-08-26 15:10:23,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 65 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:10:23,552 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 168 flow [2023-08-26 15:10:23,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2023-08-26 15:10:23,554 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2023-08-26 15:10:23,554 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 168 flow [2023-08-26 15:10:23,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have 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:10:23,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:23,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:10:23,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 15:10:23,555 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:10:23,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:23,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1130596424, now seen corresponding path program 1 times [2023-08-26 15:10:23,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:23,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640211998] [2023-08-26 15:10:23,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:23,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:23,700 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:10:23,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:23,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640211998] [2023-08-26 15:10:23,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640211998] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:23,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:23,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:10:23,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113160603] [2023-08-26 15:10:23,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:23,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:10:23,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:23,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:10:23,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:10:23,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 284 [2023-08-26 15:10:23,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have 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:10:23,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:23,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 284 [2023-08-26 15:10:23,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:25,107 INFO L124 PetriNetUnfolderBase]: 14712/20031 cut-off events. [2023-08-26 15:10:25,108 INFO L125 PetriNetUnfolderBase]: For 11755/11755 co-relation queries the response was YES. [2023-08-26 15:10:25,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52797 conditions, 20031 events. 14712/20031 cut-off events. For 11755/11755 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 104073 event pairs, 1420 based on Foata normal form. 40/20071 useless extension candidates. Maximal degree in co-relation 52790. Up to 10992 conditions per place. [2023-08-26 15:10:25,218 INFO L140 encePairwiseOnDemand]: 275/284 looper letters, 61 selfloop transitions, 17 changer transitions 0/78 dead transitions. [2023-08-26 15:10:25,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 78 transitions, 446 flow [2023-08-26 15:10:25,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:10:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:10:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 526 transitions. [2023-08-26 15:10:25,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4630281690140845 [2023-08-26 15:10:25,220 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 526 transitions. [2023-08-26 15:10:25,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 526 transitions. [2023-08-26 15:10:25,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:25,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 526 transitions. [2023-08-26 15:10:25,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:25,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have 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:10:25,223 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have 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:10:25,224 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 168 flow. Second operand 4 states and 526 transitions. [2023-08-26 15:10:25,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 78 transitions, 446 flow [2023-08-26 15:10:25,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 442 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:10:25,305 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 267 flow [2023-08-26 15:10:25,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=267, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2023-08-26 15:10:25,307 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2023-08-26 15:10:25,307 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 267 flow [2023-08-26 15:10:25,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have 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:10:25,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:25,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:10:25,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 15:10:25,308 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:10:25,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:25,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1473831276, now seen corresponding path program 1 times [2023-08-26 15:10:25,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:25,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15023814] [2023-08-26 15:10:25,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:25,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:25,436 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:10:25,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:25,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15023814] [2023-08-26 15:10:25,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15023814] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:25,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:25,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:10:25,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225237207] [2023-08-26 15:10:25,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:25,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:10:25,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:25,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:10:25,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:10:25,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 284 [2023-08-26 15:10:25,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 267 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:25,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:25,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 284 [2023-08-26 15:10:25,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:26,540 INFO L124 PetriNetUnfolderBase]: 9255/13661 cut-off events. [2023-08-26 15:10:26,540 INFO L125 PetriNetUnfolderBase]: For 11805/12677 co-relation queries the response was YES. [2023-08-26 15:10:26,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36538 conditions, 13661 events. 9255/13661 cut-off events. For 11805/12677 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 84761 event pairs, 1414 based on Foata normal form. 1303/14755 useless extension candidates. Maximal degree in co-relation 36528. Up to 8379 conditions per place. [2023-08-26 15:10:26,627 INFO L140 encePairwiseOnDemand]: 277/284 looper letters, 84 selfloop transitions, 10 changer transitions 0/109 dead transitions. [2023-08-26 15:10:26,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 109 transitions, 727 flow [2023-08-26 15:10:26,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:10:26,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:10:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 652 transitions. [2023-08-26 15:10:26,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4591549295774648 [2023-08-26 15:10:26,629 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 652 transitions. [2023-08-26 15:10:26,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 652 transitions. [2023-08-26 15:10:26,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:26,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 652 transitions. [2023-08-26 15:10:26,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have 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:10:26,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 284.0) internal successors, (1704), 6 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have 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:10:26,633 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 284.0) internal successors, (1704), 6 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have 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:10:26,633 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 267 flow. Second operand 5 states and 652 transitions. [2023-08-26 15:10:26,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 109 transitions, 727 flow [2023-08-26 15:10:26,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 109 transitions, 727 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:10:26,646 INFO L231 Difference]: Finished difference. Result has 57 places, 55 transitions, 342 flow [2023-08-26 15:10:26,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=342, PETRI_PLACES=57, PETRI_TRANSITIONS=55} [2023-08-26 15:10:26,647 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2023-08-26 15:10:26,647 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 342 flow [2023-08-26 15:10:26,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:26,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:26,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:10:26,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 15:10:26,648 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:10:26,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:26,648 INFO L85 PathProgramCache]: Analyzing trace with hash -779907646, now seen corresponding path program 1 times [2023-08-26 15:10:26,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:26,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340975623] [2023-08-26 15:10:26,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:26,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:26,776 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:10:26,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:26,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340975623] [2023-08-26 15:10:26,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340975623] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:26,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:26,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:10:26,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37550232] [2023-08-26 15:10:26,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:26,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:10:26,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:26,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:10:26,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:10:26,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 284 [2023-08-26 15:10:26,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 342 flow. Second operand has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have 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:10:26,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:26,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 284 [2023-08-26 15:10:26,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:27,891 INFO L124 PetriNetUnfolderBase]: 7419/11270 cut-off events. [2023-08-26 15:10:27,891 INFO L125 PetriNetUnfolderBase]: For 13283/13901 co-relation queries the response was YES. [2023-08-26 15:10:27,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37485 conditions, 11270 events. 7419/11270 cut-off events. For 13283/13901 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 71634 event pairs, 750 based on Foata normal form. 882/11996 useless extension candidates. Maximal degree in co-relation 37471. Up to 3404 conditions per place. [2023-08-26 15:10:27,947 INFO L140 encePairwiseOnDemand]: 277/284 looper letters, 116 selfloop transitions, 19 changer transitions 0/150 dead transitions. [2023-08-26 15:10:27,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 150 transitions, 1088 flow [2023-08-26 15:10:27,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:10:27,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:10:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 915 transitions. [2023-08-26 15:10:27,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.460261569416499 [2023-08-26 15:10:27,951 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 915 transitions. [2023-08-26 15:10:27,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 915 transitions. [2023-08-26 15:10:27,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:27,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 915 transitions. [2023-08-26 15:10:27,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.71428571428572) internal successors, (915), 7 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have 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:10:27,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 284.0) internal successors, (2272), 8 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have 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:10:27,959 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 284.0) internal successors, (2272), 8 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have 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:10:27,960 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 342 flow. Second operand 7 states and 915 transitions. [2023-08-26 15:10:27,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 150 transitions, 1088 flow [2023-08-26 15:10:28,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 150 transitions, 1083 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:10:28,024 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 471 flow [2023-08-26 15:10:28,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=471, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2023-08-26 15:10:28,026 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2023-08-26 15:10:28,026 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 471 flow [2023-08-26 15:10:28,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have 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:10:28,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:28,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:10:28,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 15:10:28,027 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:10:28,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:28,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1676715013, now seen corresponding path program 1 times [2023-08-26 15:10:28,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:28,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599422293] [2023-08-26 15:10:28,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:28,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:28,217 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:10:28,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:28,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599422293] [2023-08-26 15:10:28,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599422293] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:28,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:28,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:10:28,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326516674] [2023-08-26 15:10:28,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:28,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:10:28,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:28,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:10:28,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:10:28,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 284 [2023-08-26 15:10:28,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 471 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:28,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:28,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 284 [2023-08-26 15:10:28,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:30,127 INFO L124 PetriNetUnfolderBase]: 14875/21606 cut-off events. [2023-08-26 15:10:30,127 INFO L125 PetriNetUnfolderBase]: For 63672/63672 co-relation queries the response was YES. [2023-08-26 15:10:30,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87841 conditions, 21606 events. 14875/21606 cut-off events. For 63672/63672 co-relation queries the response was YES. Maximal size of possible extension queue 806. Compared 132025 event pairs, 2675 based on Foata normal form. 76/21682 useless extension candidates. Maximal degree in co-relation 87824. Up to 9764 conditions per place. [2023-08-26 15:10:30,369 INFO L140 encePairwiseOnDemand]: 275/284 looper letters, 90 selfloop transitions, 19 changer transitions 35/144 dead transitions. [2023-08-26 15:10:30,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 144 transitions, 1322 flow [2023-08-26 15:10:30,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:10:30,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:10:30,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2023-08-26 15:10:30,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4665492957746479 [2023-08-26 15:10:30,371 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2023-08-26 15:10:30,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2023-08-26 15:10:30,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:30,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2023-08-26 15:10:30,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have 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:10:30,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have 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:10:30,374 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have 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:10:30,374 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 471 flow. Second operand 4 states and 530 transitions. [2023-08-26 15:10:30,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 144 transitions, 1322 flow [2023-08-26 15:10:31,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 144 transitions, 1176 flow, removed 51 selfloop flow, removed 3 redundant places. [2023-08-26 15:10:31,236 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 463 flow [2023-08-26 15:10:31,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=463, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2023-08-26 15:10:31,237 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2023-08-26 15:10:31,237 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 463 flow [2023-08-26 15:10:31,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:31,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:31,237 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:10:31,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 15:10:31,237 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:10:31,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:31,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1604541557, now seen corresponding path program 1 times [2023-08-26 15:10:31,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:31,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939856882] [2023-08-26 15:10:31,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:31,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:31,342 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:10:31,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:31,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939856882] [2023-08-26 15:10:31,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939856882] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:31,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:31,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:10:31,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770077782] [2023-08-26 15:10:31,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:31,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:10:31,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:31,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:10:31,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:10:31,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 284 [2023-08-26 15:10:31,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 463 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:31,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:31,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 284 [2023-08-26 15:10:31,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:32,328 INFO L124 PetriNetUnfolderBase]: 7827/12141 cut-off events. [2023-08-26 15:10:32,328 INFO L125 PetriNetUnfolderBase]: For 28425/28637 co-relation queries the response was YES. [2023-08-26 15:10:32,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45388 conditions, 12141 events. 7827/12141 cut-off events. For 28425/28637 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 76631 event pairs, 2741 based on Foata normal form. 136/12144 useless extension candidates. Maximal degree in co-relation 45369. Up to 6292 conditions per place. [2023-08-26 15:10:32,366 INFO L140 encePairwiseOnDemand]: 281/284 looper letters, 62 selfloop transitions, 5 changer transitions 8/86 dead transitions. [2023-08-26 15:10:32,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 86 transitions, 776 flow [2023-08-26 15:10:32,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:10:32,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:10:32,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-08-26 15:10:32,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47769953051643194 [2023-08-26 15:10:32,367 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-08-26 15:10:32,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-08-26 15:10:32,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:32,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-08-26 15:10:32,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have 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:10:32,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have 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:10:32,370 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have 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:10:32,370 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 463 flow. Second operand 3 states and 407 transitions. [2023-08-26 15:10:32,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 86 transitions, 776 flow [2023-08-26 15:10:32,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 86 transitions, 742 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-08-26 15:10:32,426 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 455 flow [2023-08-26 15:10:32,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=455, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2023-08-26 15:10:32,427 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 12 predicate places. [2023-08-26 15:10:32,427 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 455 flow [2023-08-26 15:10:32,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:32,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:32,427 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:10:32,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 15:10:32,427 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:10:32,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:32,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1478460133, now seen corresponding path program 2 times [2023-08-26 15:10:32,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:32,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910717046] [2023-08-26 15:10:32,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:32,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:32,568 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:10:32,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:32,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910717046] [2023-08-26 15:10:32,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910717046] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:32,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:32,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:10:32,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252264305] [2023-08-26 15:10:32,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:32,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:10:32,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:32,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:10:32,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:10:32,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 284 [2023-08-26 15:10:32,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 455 flow. Second operand has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have 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:10:32,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:32,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 284 [2023-08-26 15:10:32,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:33,320 INFO L124 PetriNetUnfolderBase]: 5446/8775 cut-off events. [2023-08-26 15:10:33,321 INFO L125 PetriNetUnfolderBase]: For 13163/13459 co-relation queries the response was YES. [2023-08-26 15:10:33,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29789 conditions, 8775 events. 5446/8775 cut-off events. For 13163/13459 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 58438 event pairs, 1015 based on Foata normal form. 602/9210 useless extension candidates. Maximal degree in co-relation 29771. Up to 2890 conditions per place. [2023-08-26 15:10:33,354 INFO L140 encePairwiseOnDemand]: 277/284 looper letters, 96 selfloop transitions, 17 changer transitions 32/160 dead transitions. [2023-08-26 15:10:33,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 160 transitions, 1409 flow [2023-08-26 15:10:33,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:10:33,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:10:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 916 transitions. [2023-08-26 15:10:33,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4607645875251509 [2023-08-26 15:10:33,356 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 916 transitions. [2023-08-26 15:10:33,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 916 transitions. [2023-08-26 15:10:33,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:33,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 916 transitions. [2023-08-26 15:10:33,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.85714285714286) internal successors, (916), 7 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have 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:10:33,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 284.0) internal successors, (2272), 8 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have 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:10:33,360 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 284.0) internal successors, (2272), 8 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have 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:10:33,360 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 455 flow. Second operand 7 states and 916 transitions. [2023-08-26 15:10:33,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 160 transitions, 1409 flow [2023-08-26 15:10:33,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 160 transitions, 1394 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:10:33,383 INFO L231 Difference]: Finished difference. Result has 71 places, 64 transitions, 558 flow [2023-08-26 15:10:33,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=558, PETRI_PLACES=71, PETRI_TRANSITIONS=64} [2023-08-26 15:10:33,383 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2023-08-26 15:10:33,383 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 64 transitions, 558 flow [2023-08-26 15:10:33,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have 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:10:33,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:33,384 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:10:33,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 15:10:33,384 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:10:33,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:33,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1159634208, now seen corresponding path program 1 times [2023-08-26 15:10:33,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:33,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167874563] [2023-08-26 15:10:33,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:33,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:33,945 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:10:33,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:33,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167874563] [2023-08-26 15:10:33,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167874563] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:33,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:33,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:10:33,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757288999] [2023-08-26 15:10:33,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:33,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:10:33,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:33,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:10:33,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:10:33,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 284 [2023-08-26 15:10:33,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 64 transitions, 558 flow. Second operand has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have 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:10:33,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:33,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 284 [2023-08-26 15:10:33,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:35,131 INFO L124 PetriNetUnfolderBase]: 7468/12175 cut-off events. [2023-08-26 15:10:35,132 INFO L125 PetriNetUnfolderBase]: For 27593/27992 co-relation queries the response was YES. [2023-08-26 15:10:35,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46298 conditions, 12175 events. 7468/12175 cut-off events. For 27593/27992 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 86884 event pairs, 896 based on Foata normal form. 148/12097 useless extension candidates. Maximal degree in co-relation 46277. Up to 7486 conditions per place. [2023-08-26 15:10:35,168 INFO L140 encePairwiseOnDemand]: 276/284 looper letters, 110 selfloop transitions, 10 changer transitions 57/192 dead transitions. [2023-08-26 15:10:35,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 192 transitions, 1846 flow [2023-08-26 15:10:35,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:10:35,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:10:35,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 904 transitions. [2023-08-26 15:10:35,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45472837022132795 [2023-08-26 15:10:35,170 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 904 transitions. [2023-08-26 15:10:35,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 904 transitions. [2023-08-26 15:10:35,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:35,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 904 transitions. [2023-08-26 15:10:35,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.14285714285714) internal successors, (904), 7 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have 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:10:35,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 284.0) internal successors, (2272), 8 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have 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:10:35,174 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 284.0) internal successors, (2272), 8 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have 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:10:35,174 INFO L175 Difference]: Start difference. First operand has 71 places, 64 transitions, 558 flow. Second operand 7 states and 904 transitions. [2023-08-26 15:10:35,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 192 transitions, 1846 flow [2023-08-26 15:10:35,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 192 transitions, 1595 flow, removed 82 selfloop flow, removed 3 redundant places. [2023-08-26 15:10:35,706 INFO L231 Difference]: Finished difference. Result has 79 places, 73 transitions, 570 flow [2023-08-26 15:10:35,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=570, PETRI_PLACES=79, PETRI_TRANSITIONS=73} [2023-08-26 15:10:35,706 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2023-08-26 15:10:35,706 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 73 transitions, 570 flow [2023-08-26 15:10:35,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have 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:10:35,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:35,707 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:10:35,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 15:10:35,707 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:10:35,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:35,707 INFO L85 PathProgramCache]: Analyzing trace with hash -725303498, now seen corresponding path program 2 times [2023-08-26 15:10:35,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:35,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174839022] [2023-08-26 15:10:35,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:35,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:35,847 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:10:35,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:35,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174839022] [2023-08-26 15:10:35,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174839022] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:35,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:35,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 15:10:35,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744357771] [2023-08-26 15:10:35,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:35,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:10:35,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:35,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:10:35,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:10:35,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 284 [2023-08-26 15:10:35,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 73 transitions, 570 flow. Second operand has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have 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:10:35,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:35,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 284 [2023-08-26 15:10:35,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:36,776 INFO L124 PetriNetUnfolderBase]: 6109/9875 cut-off events. [2023-08-26 15:10:36,776 INFO L125 PetriNetUnfolderBase]: For 19105/19550 co-relation queries the response was YES. [2023-08-26 15:10:36,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37650 conditions, 9875 events. 6109/9875 cut-off events. For 19105/19550 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 67989 event pairs, 812 based on Foata normal form. 258/9937 useless extension candidates. Maximal degree in co-relation 37623. Up to 3433 conditions per place. [2023-08-26 15:10:36,816 INFO L140 encePairwiseOnDemand]: 277/284 looper letters, 84 selfloop transitions, 22 changer transitions 58/172 dead transitions. [2023-08-26 15:10:36,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 172 transitions, 1524 flow [2023-08-26 15:10:36,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 15:10:36,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 15:10:36,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1148 transitions. [2023-08-26 15:10:36,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4491392801251956 [2023-08-26 15:10:36,819 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1148 transitions. [2023-08-26 15:10:36,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1148 transitions. [2023-08-26 15:10:36,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:36,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1148 transitions. [2023-08-26 15:10:36,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 127.55555555555556) internal successors, (1148), 9 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have 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:10:36,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 284.0) internal successors, (2840), 10 states have internal predecessors, (2840), 0 states have call successors, (0), 0 states have 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:10:36,824 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 284.0) internal successors, (2840), 10 states have internal predecessors, (2840), 0 states have call successors, (0), 0 states have 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:10:36,824 INFO L175 Difference]: Start difference. First operand has 79 places, 73 transitions, 570 flow. Second operand 9 states and 1148 transitions. [2023-08-26 15:10:36,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 172 transitions, 1524 flow [2023-08-26 15:10:37,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 172 transitions, 1497 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-26 15:10:37,142 INFO L231 Difference]: Finished difference. Result has 85 places, 58 transitions, 440 flow [2023-08-26 15:10:37,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=440, PETRI_PLACES=85, PETRI_TRANSITIONS=58} [2023-08-26 15:10:37,143 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 34 predicate places. [2023-08-26 15:10:37,143 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 58 transitions, 440 flow [2023-08-26 15:10:37,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have 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:10:37,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:37,144 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:10:37,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 15:10:37,144 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:10:37,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:37,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1424565064, now seen corresponding path program 1 times [2023-08-26 15:10:37,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:37,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560772842] [2023-08-26 15:10:37,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:37,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:37,306 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:10:37,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:37,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560772842] [2023-08-26 15:10:37,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560772842] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:37,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:37,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:10:37,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371480862] [2023-08-26 15:10:37,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:37,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:10:37,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:37,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:10:37,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:10:37,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 284 [2023-08-26 15:10:37,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 58 transitions, 440 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have 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:10:37,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:37,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 284 [2023-08-26 15:10:37,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:37,660 INFO L124 PetriNetUnfolderBase]: 2229/3455 cut-off events. [2023-08-26 15:10:37,660 INFO L125 PetriNetUnfolderBase]: For 8256/8256 co-relation queries the response was YES. [2023-08-26 15:10:37,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14826 conditions, 3455 events. 2229/3455 cut-off events. For 8256/8256 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 16515 event pairs, 372 based on Foata normal form. 1/3456 useless extension candidates. Maximal degree in co-relation 14798. Up to 1728 conditions per place. [2023-08-26 15:10:37,672 INFO L140 encePairwiseOnDemand]: 276/284 looper letters, 65 selfloop transitions, 7 changer transitions 68/140 dead transitions. [2023-08-26 15:10:37,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 140 transitions, 1268 flow [2023-08-26 15:10:37,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:10:37,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:10:37,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 750 transitions. [2023-08-26 15:10:37,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44014084507042256 [2023-08-26 15:10:37,674 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 750 transitions. [2023-08-26 15:10:37,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 750 transitions. [2023-08-26 15:10:37,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:37,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 750 transitions. [2023-08-26 15:10:37,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have 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:10:37,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 284.0) internal successors, (1988), 7 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have 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:10:37,678 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 284.0) internal successors, (1988), 7 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have 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:10:37,678 INFO L175 Difference]: Start difference. First operand has 85 places, 58 transitions, 440 flow. Second operand 6 states and 750 transitions. [2023-08-26 15:10:37,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 140 transitions, 1268 flow [2023-08-26 15:10:37,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 140 transitions, 1025 flow, removed 54 selfloop flow, removed 17 redundant places. [2023-08-26 15:10:37,701 INFO L231 Difference]: Finished difference. Result has 72 places, 42 transitions, 243 flow [2023-08-26 15:10:37,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=72, PETRI_TRANSITIONS=42} [2023-08-26 15:10:37,702 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 21 predicate places. [2023-08-26 15:10:37,702 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 42 transitions, 243 flow [2023-08-26 15:10:37,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have 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:10:37,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:37,702 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:10:37,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 15:10:37,702 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:10:37,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:37,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1963939452, now seen corresponding path program 2 times [2023-08-26 15:10:37,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:37,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457582332] [2023-08-26 15:10:37,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:37,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:38,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:10:38,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:38,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457582332] [2023-08-26 15:10:38,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457582332] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:38,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:38,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 15:10:38,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267111749] [2023-08-26 15:10:38,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:38,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 15:10:38,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:38,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 15:10:38,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 15:10:38,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 284 [2023-08-26 15:10:38,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 42 transitions, 243 flow. Second operand has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have 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:10:38,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:38,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 284 [2023-08-26 15:10:38,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:38,609 INFO L124 PetriNetUnfolderBase]: 504/864 cut-off events. [2023-08-26 15:10:38,609 INFO L125 PetriNetUnfolderBase]: For 1328/1340 co-relation queries the response was YES. [2023-08-26 15:10:38,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3285 conditions, 864 events. 504/864 cut-off events. For 1328/1340 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3429 event pairs, 137 based on Foata normal form. 11/869 useless extension candidates. Maximal degree in co-relation 3266. Up to 513 conditions per place. [2023-08-26 15:10:38,611 INFO L140 encePairwiseOnDemand]: 278/284 looper letters, 50 selfloop transitions, 5 changer transitions 30/89 dead transitions. [2023-08-26 15:10:38,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 89 transitions, 653 flow [2023-08-26 15:10:38,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:10:38,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:10:38,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 853 transitions. [2023-08-26 15:10:38,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4290744466800805 [2023-08-26 15:10:38,613 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 853 transitions. [2023-08-26 15:10:38,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 853 transitions. [2023-08-26 15:10:38,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:38,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 853 transitions. [2023-08-26 15:10:38,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:38,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 284.0) internal successors, (2272), 8 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have 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:10:38,617 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 284.0) internal successors, (2272), 8 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have 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:10:38,618 INFO L175 Difference]: Start difference. First operand has 72 places, 42 transitions, 243 flow. Second operand 7 states and 853 transitions. [2023-08-26 15:10:38,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 89 transitions, 653 flow [2023-08-26 15:10:38,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 89 transitions, 572 flow, removed 11 selfloop flow, removed 14 redundant places. [2023-08-26 15:10:38,622 INFO L231 Difference]: Finished difference. Result has 62 places, 42 transitions, 202 flow [2023-08-26 15:10:38,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=202, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2023-08-26 15:10:38,622 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-08-26 15:10:38,622 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 202 flow [2023-08-26 15:10:38,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have 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:10:38,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:38,623 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:10:38,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 15:10:38,623 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:10:38,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:38,623 INFO L85 PathProgramCache]: Analyzing trace with hash 510334194, now seen corresponding path program 3 times [2023-08-26 15:10:38,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:38,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436591329] [2023-08-26 15:10:38,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:38,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:10:38,683 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 15:10:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:10:38,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 15:10:38,761 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 15:10:38,762 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 15:10:38,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 15:10:38,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 15:10:38,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 15:10:38,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 15:10:38,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 15:10:38,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 15:10:38,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 15:10:38,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 15:10:38,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 15:10:38,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 15:10:38,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 15:10:38,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 15:10:38,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 15:10:38,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 15:10:38,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 15:10:38,781 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:10:38,785 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 15:10:38,785 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 15:10:38,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:10:38 BasicIcfg [2023-08-26 15:10:38,858 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 15:10:38,858 INFO L158 Benchmark]: Toolchain (without parser) took 26111.15ms. Allocated memory was 352.3MB in the beginning and 4.8GB in the end (delta: 4.5GB). Free memory was 327.2MB in the beginning and 4.6GB in the end (delta: -4.2GB). Peak memory consumption was 2.4GB. Max. memory is 16.0GB. [2023-08-26 15:10:38,858 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 352.3MB. Free memory is still 328.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 15:10:38,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.24ms. Allocated memory is still 352.3MB. Free memory was 327.2MB in the beginning and 302.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 15:10:38,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.13ms. Allocated memory is still 352.3MB. Free memory was 302.0MB in the beginning and 299.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 15:10:38,859 INFO L158 Benchmark]: Boogie Preprocessor took 28.04ms. Allocated memory is still 352.3MB. Free memory was 299.4MB in the beginning and 297.4MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 15:10:38,859 INFO L158 Benchmark]: RCFGBuilder took 568.73ms. Allocated memory is still 352.3MB. Free memory was 297.4MB in the beginning and 301.0MB in the end (delta: -3.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-26 15:10:38,859 INFO L158 Benchmark]: TraceAbstraction took 25035.47ms. Allocated memory was 352.3MB in the beginning and 4.8GB in the end (delta: 4.5GB). Free memory was 300.2MB in the beginning and 4.6GB in the end (delta: -4.3GB). Peak memory consumption was 2.4GB. Max. memory is 16.0GB. [2023-08-26 15:10:38,860 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.14ms. Allocated memory is still 352.3MB. Free memory is still 328.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 416.24ms. Allocated memory is still 352.3MB. Free memory was 327.2MB in the beginning and 302.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 58.13ms. Allocated memory is still 352.3MB. Free memory was 302.0MB in the beginning and 299.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 28.04ms. Allocated memory is still 352.3MB. Free memory was 299.4MB in the beginning and 297.4MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 568.73ms. Allocated memory is still 352.3MB. Free memory was 297.4MB in the beginning and 301.0MB in the end (delta: -3.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 25035.47ms. Allocated memory was 352.3MB in the beginning and 4.8GB in the end (delta: 4.5GB). Free memory was 300.2MB in the beginning and 4.6GB in the end (delta: -4.3GB). Peak memory consumption was 2.4GB. 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.6s, 148 PlacesBefore, 51 PlacesAfterwards, 138 TransitionsBefore, 39 TransitionsAfterwards, 3584 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 19 ConcurrentYvCompositions, 2 ChoiceCompositions, 142 TotalNumberOfCompositions, 11299 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5117, independent: 4860, independent conditional: 0, independent unconditional: 4860, dependent: 257, dependent conditional: 0, dependent unconditional: 257, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2098, independent: 2049, independent conditional: 0, independent unconditional: 2049, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5117, independent: 2811, independent conditional: 0, independent unconditional: 2811, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 2098, unknown conditional: 0, unknown unconditional: 2098] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 179, Positive conditional cache size: 0, Positive unconditional cache size: 179, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t769; [L865] FCALL, FORK 0 pthread_create(&t769, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t769, ((void *)0), P0, ((void *)0))=-1, t769={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t770; [L867] FCALL, FORK 0 pthread_create(&t770, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t770, ((void *)0), P1, ((void *)0))=0, t769={5:0}, t770={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t771; [L869] FCALL, FORK 0 pthread_create(&t771, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t771, ((void *)0), P2, ((void *)0))=1, t769={5:0}, t770={6:0}, t771={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t772; [L871] FCALL, FORK 0 pthread_create(&t772, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t772, ((void *)0), P3, ((void *)0))=2, t769={5:0}, t770={6:0}, t771={7:0}, t772={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, y=0, z=0] [L763] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, y=0, z=0] [L780] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=1, z=0] [L800] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=2, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=2, z=1] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=2, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=2, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=2, z=2] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=1, x=1, y=2, z=2] [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=1, x=1, y=2, z=2] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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$$choice2=1, x=1, y=2, z=2] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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$$choice2=1, x=1, y=2, z=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, t769={5:0}, t770={6:0}, t771={7:0}, t772={3:0}, weak$$choice2=1, x=1, y=2, z=2] [L884] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L886] 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", "mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={56:57}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, x=1, y=2, z=2] - 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: 867]: 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: 865]: 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: 871]: 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: 869]: 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, 178 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: 24.9s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 18.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 512 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 512 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1556 IncrementalHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 30 mSDtfsCounter, 1556 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=570occurred in iteration=11, InterpolantAutomatonStates: 71, 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, 2.6s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 1917 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:10:38,882 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...