/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:28:43,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:28:43,879 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 18:28:43,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:28:43,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:28:43,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:28:43,914 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:28:43,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:28:43,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:28:43,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:28:43,919 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:28:43,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:28:43,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:28:43,921 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:28:43,921 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:28:43,921 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:28:43,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:28:43,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:28:43,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:28:43,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:28:43,922 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:28:43,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:28:43,923 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:28:43,924 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:28:43,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:28:43,924 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:28:43,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:28:43,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:28:43,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:28:43,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:28:43,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:28:43,926 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:28:43,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:28:43,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:28:43,927 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:28:43,927 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 18:28:44,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:28:44,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:28:44,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:28:44,272 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:28:44,272 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:28:44,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 18:28:45,486 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:28:45,778 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:28:45,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 18:28:45,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db42d9407/23453abe379b456b8181e10b837e191a/FLAG08519d2ae [2023-08-26 18:28:45,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db42d9407/23453abe379b456b8181e10b837e191a [2023-08-26 18:28:45,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:28:45,822 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:28:45,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:28:45,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:28:45,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:28:45,829 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:28:45" (1/1) ... [2023-08-26 18:28:45,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67d48468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:28:45, skipping insertion in model container [2023-08-26 18:28:45,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:28:45" (1/1) ... [2023-08-26 18:28:45,882 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:28:46,269 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:28:46,284 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:28:46,317 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:28:46,318 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:28:46,357 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:28:46,393 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:28:46,393 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:28:46,399 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:28:46,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:28:46 WrapperNode [2023-08-26 18:28:46,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:28:46,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:28:46,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:28:46,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:28:46,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:28:46" (1/1) ... [2023-08-26 18:28:46,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:28:46" (1/1) ... [2023-08-26 18:28:46,473 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 134 [2023-08-26 18:28:46,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:28:46,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:28:46,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:28:46,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:28:46,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:28:46" (1/1) ... [2023-08-26 18:28:46,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:28:46" (1/1) ... [2023-08-26 18:28:46,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:28:46" (1/1) ... [2023-08-26 18:28:46,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:28:46" (1/1) ... [2023-08-26 18:28:46,499 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:28:46" (1/1) ... [2023-08-26 18:28:46,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:28:46" (1/1) ... [2023-08-26 18:28:46,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:28:46" (1/1) ... [2023-08-26 18:28:46,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:28:46" (1/1) ... [2023-08-26 18:28:46,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:28:46,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:28:46,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:28:46,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:28:46,509 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:28:46" (1/1) ... [2023-08-26 18:28:46,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:28:46,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:28:46,538 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 18:28:46,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 18:28:46,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:28:46,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:28:46,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:28:46,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:28:46,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:28:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:28:46,568 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:28:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:28:46,568 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:28:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:28:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:28:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:28:46,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:28:46,570 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 18:28:46,704 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:28:46,708 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:28:47,064 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:28:47,205 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:28:47,205 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:28:47,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:28:47 BoogieIcfgContainer [2023-08-26 18:28:47,207 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:28:47,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:28:47,210 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:28:47,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:28:47,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:28:45" (1/3) ... [2023-08-26 18:28:47,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c4061b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:28:47, skipping insertion in model container [2023-08-26 18:28:47,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:28:46" (2/3) ... [2023-08-26 18:28:47,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c4061b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:28:47, skipping insertion in model container [2023-08-26 18:28:47,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:28:47" (3/3) ... [2023-08-26 18:28:47,216 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 18:28:47,238 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:28:47,238 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-26 18:28:47,239 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:28:47,286 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:28:47,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 94 transitions, 198 flow [2023-08-26 18:28:47,370 INFO L124 PetriNetUnfolderBase]: 3/92 cut-off events. [2023-08-26 18:28:47,371 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:28:47,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 92 events. 3/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-26 18:28:47,377 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 94 transitions, 198 flow [2023-08-26 18:28:47,381 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 92 transitions, 190 flow [2023-08-26 18:28:47,384 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:28:47,396 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 92 transitions, 190 flow [2023-08-26 18:28:47,400 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 92 transitions, 190 flow [2023-08-26 18:28:47,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 92 transitions, 190 flow [2023-08-26 18:28:47,429 INFO L124 PetriNetUnfolderBase]: 3/92 cut-off events. [2023-08-26 18:28:47,430 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:28:47,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 92 events. 3/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-26 18:28:47,432 INFO L119 LiptonReduction]: Number of co-enabled transitions 1186 [2023-08-26 18:28:50,714 INFO L134 LiptonReduction]: Checked pairs total: 3214 [2023-08-26 18:28:50,714 INFO L136 LiptonReduction]: Total number of compositions: 102 [2023-08-26 18:28:50,726 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:28:50,731 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;@72e49c74, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:28:50,731 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-08-26 18:28:50,732 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:28:50,733 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:28:50,733 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:28:50,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:50,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:28:50,734 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 18:28:50,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:50,738 INFO L85 PathProgramCache]: Analyzing trace with hash 456, now seen corresponding path program 1 times [2023-08-26 18:28:50,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:50,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924437733] [2023-08-26 18:28:50,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:50,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:50,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:28:50,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:50,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924437733] [2023-08-26 18:28:50,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924437733] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:50,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:50,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:28:50,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647331800] [2023-08-26 18:28:50,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:50,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:28:50,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:50,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:28:50,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:28:50,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 196 [2023-08-26 18:28:50,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 54 flow. Second operand has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:50,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:50,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 196 [2023-08-26 18:28:50,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:51,021 INFO L124 PetriNetUnfolderBase]: 206/363 cut-off events. [2023-08-26 18:28:51,022 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 18:28:51,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 363 events. 206/363 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1477 event pairs, 206 based on Foata normal form. 20/304 useless extension candidates. Maximal degree in co-relation 726. Up to 358 conditions per place. [2023-08-26 18:28:51,026 INFO L140 encePairwiseOnDemand]: 191/196 looper letters, 17 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2023-08-26 18:28:51,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 19 transitions, 78 flow [2023-08-26 18:28:51,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:28:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:28:51,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 186 transitions. [2023-08-26 18:28:51,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4744897959183674 [2023-08-26 18:28:51,038 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 186 transitions. [2023-08-26 18:28:51,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 186 transitions. [2023-08-26 18:28:51,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:51,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 186 transitions. [2023-08-26 18:28:51,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 93.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:51,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 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 18:28:51,048 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 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 18:28:51,050 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 54 flow. Second operand 2 states and 186 transitions. [2023-08-26 18:28:51,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 19 transitions, 78 flow [2023-08-26 18:28:51,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 19 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:28:51,053 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 42 flow [2023-08-26 18:28:51,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2023-08-26 18:28:51,058 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -5 predicate places. [2023-08-26 18:28:51,058 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 42 flow [2023-08-26 18:28:51,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:51,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:51,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:28:51,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:28:51,059 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 18:28:51,060 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:51,060 INFO L85 PathProgramCache]: Analyzing trace with hash 449618, now seen corresponding path program 1 times [2023-08-26 18:28:51,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:51,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461467458] [2023-08-26 18:28:51,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:51,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:51,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:28:51,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:51,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461467458] [2023-08-26 18:28:51,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461467458] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:51,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:51,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:28:51,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747614116] [2023-08-26 18:28:51,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:51,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:28:51,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:51,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:28:51,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:28:51,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 196 [2023-08-26 18:28:51,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:51,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:51,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 196 [2023-08-26 18:28:51,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:51,417 INFO L124 PetriNetUnfolderBase]: 159/311 cut-off events. [2023-08-26 18:28:51,417 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:28:51,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 311 events. 159/311 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1406 event pairs, 18 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 601. Up to 232 conditions per place. [2023-08-26 18:28:51,419 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 21 selfloop transitions, 2 changer transitions 4/29 dead transitions. [2023-08-26 18:28:51,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 29 transitions, 118 flow [2023-08-26 18:28:51,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:28:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:28:51,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2023-08-26 18:28:51,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4608843537414966 [2023-08-26 18:28:51,422 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 271 transitions. [2023-08-26 18:28:51,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 271 transitions. [2023-08-26 18:28:51,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:51,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 271 transitions. [2023-08-26 18:28:51,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:51,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:51,427 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:51,427 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 42 flow. Second operand 3 states and 271 transitions. [2023-08-26 18:28:51,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 29 transitions, 118 flow [2023-08-26 18:28:51,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:28:51,428 INFO L231 Difference]: Finished difference. Result has 26 places, 16 transitions, 40 flow [2023-08-26 18:28:51,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=26, PETRI_TRANSITIONS=16} [2023-08-26 18:28:51,429 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -4 predicate places. [2023-08-26 18:28:51,429 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 16 transitions, 40 flow [2023-08-26 18:28:51,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:51,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:51,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:28:51,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:28:51,430 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 18:28:51,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:51,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1563295657, now seen corresponding path program 1 times [2023-08-26 18:28:51,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:51,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404335141] [2023-08-26 18:28:51,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:51,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:28:51,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:51,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404335141] [2023-08-26 18:28:51,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404335141] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:51,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:51,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:28:51,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147462093] [2023-08-26 18:28:51,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:51,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:28:51,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:51,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:28:51,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:28:51,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 196 [2023-08-26 18:28:51,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 16 transitions, 40 flow. Second operand has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:51,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:51,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 196 [2023-08-26 18:28:51,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:51,787 INFO L124 PetriNetUnfolderBase]: 149/293 cut-off events. [2023-08-26 18:28:51,788 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-08-26 18:28:51,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 293 events. 149/293 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1172 event pairs, 70 based on Foata normal form. 20/313 useless extension candidates. Maximal degree in co-relation 606. Up to 229 conditions per place. [2023-08-26 18:28:51,793 INFO L140 encePairwiseOnDemand]: 191/196 looper letters, 19 selfloop transitions, 3 changer transitions 11/34 dead transitions. [2023-08-26 18:28:51,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 34 transitions, 150 flow [2023-08-26 18:28:51,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:28:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:28:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 420 transitions. [2023-08-26 18:28:51,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2023-08-26 18:28:51,797 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 420 transitions. [2023-08-26 18:28:51,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 420 transitions. [2023-08-26 18:28:51,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:51,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 420 transitions. [2023-08-26 18:28:51,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:51,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:51,804 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:51,804 INFO L175 Difference]: Start difference. First operand has 26 places, 16 transitions, 40 flow. Second operand 5 states and 420 transitions. [2023-08-26 18:28:51,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 34 transitions, 150 flow [2023-08-26 18:28:51,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 34 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:28:51,805 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 63 flow [2023-08-26 18:28:51,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=63, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2023-08-26 18:28:51,806 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2023-08-26 18:28:51,807 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 63 flow [2023-08-26 18:28:51,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:51,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:51,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:28:51,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:28:51,811 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 18:28:51,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:51,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1217532144, now seen corresponding path program 1 times [2023-08-26 18:28:51,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:51,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577238765] [2023-08-26 18:28:51,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:51,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:52,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:28:52,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:52,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577238765] [2023-08-26 18:28:52,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577238765] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:52,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:52,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:28:52,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118537989] [2023-08-26 18:28:52,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:52,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:28:52,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:52,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:28:52,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:28:52,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 196 [2023-08-26 18:28:52,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 63 flow. Second operand has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:52,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:52,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 196 [2023-08-26 18:28:52,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:52,570 INFO L124 PetriNetUnfolderBase]: 160/304 cut-off events. [2023-08-26 18:28:52,570 INFO L125 PetriNetUnfolderBase]: For 150/151 co-relation queries the response was YES. [2023-08-26 18:28:52,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 304 events. 160/304 cut-off events. For 150/151 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1136 event pairs, 60 based on Foata normal form. 23/326 useless extension candidates. Maximal degree in co-relation 735. Up to 225 conditions per place. [2023-08-26 18:28:52,573 INFO L140 encePairwiseOnDemand]: 191/196 looper letters, 21 selfloop transitions, 3 changer transitions 12/38 dead transitions. [2023-08-26 18:28:52,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 38 transitions, 191 flow [2023-08-26 18:28:52,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:28:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:28:52,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 417 transitions. [2023-08-26 18:28:52,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42551020408163265 [2023-08-26 18:28:52,575 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 417 transitions. [2023-08-26 18:28:52,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 417 transitions. [2023-08-26 18:28:52,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:52,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 417 transitions. [2023-08-26 18:28:52,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:52,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:52,579 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:52,580 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 63 flow. Second operand 5 states and 417 transitions. [2023-08-26 18:28:52,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 38 transitions, 191 flow [2023-08-26 18:28:52,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 38 transitions, 186 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 18:28:52,583 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 85 flow [2023-08-26 18:28:52,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=85, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2023-08-26 18:28:52,584 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2023-08-26 18:28:52,584 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 20 transitions, 85 flow [2023-08-26 18:28:52,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:52,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:52,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:28:52,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:28:52,585 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 18:28:52,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:52,585 INFO L85 PathProgramCache]: Analyzing trace with hash -936251593, now seen corresponding path program 1 times [2023-08-26 18:28:52,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:52,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281823645] [2023-08-26 18:28:52,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:52,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:53,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:28:53,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:53,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281823645] [2023-08-26 18:28:53,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281823645] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:53,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:53,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:28:53,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979933570] [2023-08-26 18:28:53,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:53,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:28:53,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:53,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:28:53,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:28:53,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 196 [2023-08-26 18:28:53,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 20 transitions, 85 flow. Second operand has 6 states, 6 states have (on average 66.66666666666667) internal successors, (400), 6 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:53,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:53,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 196 [2023-08-26 18:28:53,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:53,759 INFO L124 PetriNetUnfolderBase]: 167/309 cut-off events. [2023-08-26 18:28:53,760 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2023-08-26 18:28:53,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 309 events. 167/309 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1122 event pairs, 76 based on Foata normal form. 17/326 useless extension candidates. Maximal degree in co-relation 938. Up to 238 conditions per place. [2023-08-26 18:28:53,762 INFO L140 encePairwiseOnDemand]: 184/196 looper letters, 27 selfloop transitions, 14 changer transitions 11/52 dead transitions. [2023-08-26 18:28:53,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 52 transitions, 302 flow [2023-08-26 18:28:53,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:28:53,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:28:53,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 637 transitions. [2023-08-26 18:28:53,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2023-08-26 18:28:53,765 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 637 transitions. [2023-08-26 18:28:53,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 637 transitions. [2023-08-26 18:28:53,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:53,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 637 transitions. [2023-08-26 18:28:53,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 70.77777777777777) internal successors, (637), 9 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:53,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 196.0) internal successors, (1960), 10 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:53,771 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 196.0) internal successors, (1960), 10 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:53,771 INFO L175 Difference]: Start difference. First operand has 32 places, 20 transitions, 85 flow. Second operand 9 states and 637 transitions. [2023-08-26 18:28:53,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 52 transitions, 302 flow [2023-08-26 18:28:53,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 52 transitions, 292 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-26 18:28:53,774 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 193 flow [2023-08-26 18:28:53,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=193, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-26 18:28:53,775 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2023-08-26 18:28:53,775 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 193 flow [2023-08-26 18:28:53,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.66666666666667) internal successors, (400), 6 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:53,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:53,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:28:53,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:28:53,776 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 18:28:53,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:53,777 INFO L85 PathProgramCache]: Analyzing trace with hash -209421405, now seen corresponding path program 1 times [2023-08-26 18:28:53,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:53,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532476581] [2023-08-26 18:28:53,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:53,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:54,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:28:54,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:54,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532476581] [2023-08-26 18:28:54,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532476581] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:54,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:54,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:28:54,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498408178] [2023-08-26 18:28:54,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:54,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:28:54,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:54,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:28:54,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:28:54,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 196 [2023-08-26 18:28:54,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 193 flow. Second operand has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:54,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:54,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 196 [2023-08-26 18:28:54,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:54,505 INFO L124 PetriNetUnfolderBase]: 216/410 cut-off events. [2023-08-26 18:28:54,505 INFO L125 PetriNetUnfolderBase]: For 1261/1261 co-relation queries the response was YES. [2023-08-26 18:28:54,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1727 conditions, 410 events. 216/410 cut-off events. For 1261/1261 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1736 event pairs, 61 based on Foata normal form. 21/431 useless extension candidates. Maximal degree in co-relation 1712. Up to 187 conditions per place. [2023-08-26 18:28:54,508 INFO L140 encePairwiseOnDemand]: 190/196 looper letters, 36 selfloop transitions, 7 changer transitions 13/56 dead transitions. [2023-08-26 18:28:54,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 448 flow [2023-08-26 18:28:54,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:28:54,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:28:54,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 458 transitions. [2023-08-26 18:28:54,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38945578231292516 [2023-08-26 18:28:54,511 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 458 transitions. [2023-08-26 18:28:54,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 458 transitions. [2023-08-26 18:28:54,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:54,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 458 transitions. [2023-08-26 18:28:54,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:54,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:54,515 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:54,515 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 193 flow. Second operand 6 states and 458 transitions. [2023-08-26 18:28:54,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 448 flow [2023-08-26 18:28:54,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 56 transitions, 420 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-26 18:28:54,521 INFO L231 Difference]: Finished difference. Result has 46 places, 31 transitions, 205 flow [2023-08-26 18:28:54,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=46, PETRI_TRANSITIONS=31} [2023-08-26 18:28:54,522 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 16 predicate places. [2023-08-26 18:28:54,522 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 205 flow [2023-08-26 18:28:54,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:54,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:54,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:28:54,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:28:54,523 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 18:28:54,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:54,523 INFO L85 PathProgramCache]: Analyzing trace with hash 820423674, now seen corresponding path program 1 times [2023-08-26 18:28:54,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:54,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094563878] [2023-08-26 18:28:54,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:54,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:28:55,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:55,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094563878] [2023-08-26 18:28:55,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094563878] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:55,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:55,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:28:55,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051428718] [2023-08-26 18:28:55,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:55,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:28:55,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:55,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:28:55,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:28:55,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 196 [2023-08-26 18:28:55,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 205 flow. Second operand has 7 states, 7 states have (on average 70.57142857142857) internal successors, (494), 7 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:55,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:55,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 196 [2023-08-26 18:28:55,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:55,368 INFO L124 PetriNetUnfolderBase]: 224/435 cut-off events. [2023-08-26 18:28:55,368 INFO L125 PetriNetUnfolderBase]: For 1490/1490 co-relation queries the response was YES. [2023-08-26 18:28:55,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1799 conditions, 435 events. 224/435 cut-off events. For 1490/1490 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1910 event pairs, 50 based on Foata normal form. 27/462 useless extension candidates. Maximal degree in co-relation 1782. Up to 277 conditions per place. [2023-08-26 18:28:55,371 INFO L140 encePairwiseOnDemand]: 187/196 looper letters, 30 selfloop transitions, 21 changer transitions 26/77 dead transitions. [2023-08-26 18:28:55,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 77 transitions, 665 flow [2023-08-26 18:28:55,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 18:28:55,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 18:28:55,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 751 transitions. [2023-08-26 18:28:55,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38316326530612244 [2023-08-26 18:28:55,374 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 751 transitions. [2023-08-26 18:28:55,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 751 transitions. [2023-08-26 18:28:55,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:55,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 751 transitions. [2023-08-26 18:28:55,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 75.1) internal successors, (751), 10 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:55,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 196.0) internal successors, (2156), 11 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:55,379 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 196.0) internal successors, (2156), 11 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:55,379 INFO L175 Difference]: Start difference. First operand has 46 places, 31 transitions, 205 flow. Second operand 10 states and 751 transitions. [2023-08-26 18:28:55,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 77 transitions, 665 flow [2023-08-26 18:28:55,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 77 transitions, 636 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-26 18:28:55,384 INFO L231 Difference]: Finished difference. Result has 55 places, 37 transitions, 312 flow [2023-08-26 18:28:55,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=312, PETRI_PLACES=55, PETRI_TRANSITIONS=37} [2023-08-26 18:28:55,385 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 25 predicate places. [2023-08-26 18:28:55,385 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 37 transitions, 312 flow [2023-08-26 18:28:55,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 70.57142857142857) internal successors, (494), 7 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:55,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:55,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:28:55,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:28:55,386 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 18:28:55,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:55,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1268778186, now seen corresponding path program 1 times [2023-08-26 18:28:55,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:55,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423454690] [2023-08-26 18:28:55,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:55,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:55,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:28:55,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:55,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423454690] [2023-08-26 18:28:55,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423454690] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:55,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:55,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:28:55,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460731676] [2023-08-26 18:28:55,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:55,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:28:55,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:55,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:28:55,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:28:55,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 196 [2023-08-26 18:28:55,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 37 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:55,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:55,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 196 [2023-08-26 18:28:55,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:55,581 INFO L124 PetriNetUnfolderBase]: 58/154 cut-off events. [2023-08-26 18:28:55,581 INFO L125 PetriNetUnfolderBase]: For 771/779 co-relation queries the response was YES. [2023-08-26 18:28:55,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 154 events. 58/154 cut-off events. For 771/779 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 575 event pairs, 14 based on Foata normal form. 20/173 useless extension candidates. Maximal degree in co-relation 749. Up to 108 conditions per place. [2023-08-26 18:28:55,582 INFO L140 encePairwiseOnDemand]: 192/196 looper letters, 33 selfloop transitions, 4 changer transitions 2/44 dead transitions. [2023-08-26 18:28:55,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 44 transitions, 436 flow [2023-08-26 18:28:55,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:28:55,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:28:55,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2023-08-26 18:28:55,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4370748299319728 [2023-08-26 18:28:55,584 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 257 transitions. [2023-08-26 18:28:55,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 257 transitions. [2023-08-26 18:28:55,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:55,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 257 transitions. [2023-08-26 18:28:55,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:55,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:55,586 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:55,586 INFO L175 Difference]: Start difference. First operand has 55 places, 37 transitions, 312 flow. Second operand 3 states and 257 transitions. [2023-08-26 18:28:55,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 44 transitions, 436 flow [2023-08-26 18:28:55,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 44 transitions, 417 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-08-26 18:28:55,589 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 297 flow [2023-08-26 18:28:55,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2023-08-26 18:28:55,590 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2023-08-26 18:28:55,590 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 297 flow [2023-08-26 18:28:55,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:55,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:55,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:28:55,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:28:55,591 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 18:28:55,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:55,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1774715269, now seen corresponding path program 1 times [2023-08-26 18:28:55,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:55,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631262325] [2023-08-26 18:28:55,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:55,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:55,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:28:55,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:55,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631262325] [2023-08-26 18:28:55,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631262325] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:55,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:55,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:28:55,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98544022] [2023-08-26 18:28:55,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:55,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:28:55,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:55,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:28:55,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:28:55,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 196 [2023-08-26 18:28:55,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 297 flow. Second operand has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:55,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:55,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 196 [2023-08-26 18:28:55,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:55,770 INFO L124 PetriNetUnfolderBase]: 22/74 cut-off events. [2023-08-26 18:28:55,770 INFO L125 PetriNetUnfolderBase]: For 250/252 co-relation queries the response was YES. [2023-08-26 18:28:55,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 74 events. 22/74 cut-off events. For 250/252 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 210 event pairs, 4 based on Foata normal form. 12/85 useless extension candidates. Maximal degree in co-relation 361. Up to 33 conditions per place. [2023-08-26 18:28:55,771 INFO L140 encePairwiseOnDemand]: 192/196 looper letters, 22 selfloop transitions, 5 changer transitions 13/43 dead transitions. [2023-08-26 18:28:55,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 43 transitions, 429 flow [2023-08-26 18:28:55,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:28:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:28:55,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 335 transitions. [2023-08-26 18:28:55,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4272959183673469 [2023-08-26 18:28:55,773 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 335 transitions. [2023-08-26 18:28:55,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 335 transitions. [2023-08-26 18:28:55,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:55,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 335 transitions. [2023-08-26 18:28:55,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:55,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:55,777 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:55,777 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 297 flow. Second operand 4 states and 335 transitions. [2023-08-26 18:28:55,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 43 transitions, 429 flow [2023-08-26 18:28:55,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 43 transitions, 369 flow, removed 27 selfloop flow, removed 4 redundant places. [2023-08-26 18:28:55,780 INFO L231 Difference]: Finished difference. Result has 51 places, 24 transitions, 166 flow [2023-08-26 18:28:55,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=51, PETRI_TRANSITIONS=24} [2023-08-26 18:28:55,781 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2023-08-26 18:28:55,781 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 24 transitions, 166 flow [2023-08-26 18:28:55,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:55,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:55,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:28:55,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:28:55,781 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 18:28:55,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:55,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1087380937, now seen corresponding path program 1 times [2023-08-26 18:28:55,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:55,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968571989] [2023-08-26 18:28:55,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:55,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:56,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:28:56,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:56,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968571989] [2023-08-26 18:28:56,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968571989] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:56,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:56,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:28:56,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914616907] [2023-08-26 18:28:56,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:56,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 18:28:56,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:56,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 18:28:56,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-26 18:28:56,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 196 [2023-08-26 18:28:56,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 24 transitions, 166 flow. Second operand has 9 states, 9 states have (on average 73.66666666666667) internal successors, (663), 9 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:56,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:56,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 196 [2023-08-26 18:28:56,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:56,665 INFO L124 PetriNetUnfolderBase]: 15/56 cut-off events. [2023-08-26 18:28:56,666 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2023-08-26 18:28:56,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 56 events. 15/56 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 106 event pairs, 5 based on Foata normal form. 1/57 useless extension candidates. Maximal degree in co-relation 243. Up to 32 conditions per place. [2023-08-26 18:28:56,666 INFO L140 encePairwiseOnDemand]: 190/196 looper letters, 17 selfloop transitions, 5 changer transitions 12/35 dead transitions. [2023-08-26 18:28:56,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 35 transitions, 296 flow [2023-08-26 18:28:56,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:28:56,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:28:56,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 533 transitions. [2023-08-26 18:28:56,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38848396501457727 [2023-08-26 18:28:56,669 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 533 transitions. [2023-08-26 18:28:56,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 533 transitions. [2023-08-26 18:28:56,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:56,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 533 transitions. [2023-08-26 18:28:56,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 76.14285714285714) internal successors, (533), 7 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:56,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:56,673 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:56,673 INFO L175 Difference]: Start difference. First operand has 51 places, 24 transitions, 166 flow. Second operand 7 states and 533 transitions. [2023-08-26 18:28:56,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 35 transitions, 296 flow [2023-08-26 18:28:56,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 239 flow, removed 13 selfloop flow, removed 13 redundant places. [2023-08-26 18:28:56,675 INFO L231 Difference]: Finished difference. Result has 43 places, 20 transitions, 108 flow [2023-08-26 18:28:56,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=108, PETRI_PLACES=43, PETRI_TRANSITIONS=20} [2023-08-26 18:28:56,676 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2023-08-26 18:28:56,676 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 20 transitions, 108 flow [2023-08-26 18:28:56,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 73.66666666666667) internal successors, (663), 9 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:56,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:56,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:28:56,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:28:56,677 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 18:28:56,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:56,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1616067949, now seen corresponding path program 2 times [2023-08-26 18:28:56,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:56,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20382733] [2023-08-26 18:28:56,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:56,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:28:56,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:28:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:28:56,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:28:56,798 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:28:56,798 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONASSERT (8 of 9 remaining) [2023-08-26 18:28:56,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (7 of 9 remaining) [2023-08-26 18:28:56,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2023-08-26 18:28:56,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2023-08-26 18:28:56,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2023-08-26 18:28:56,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2023-08-26 18:28:56,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-08-26 18:28:56,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 9 remaining) [2023-08-26 18:28:56,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (0 of 9 remaining) [2023-08-26 18:28:56,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:28:56,801 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:28:56,806 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:28:56,806 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:28:56,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:28:56 BasicIcfg [2023-08-26 18:28:56,843 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:28:56,844 INFO L158 Benchmark]: Toolchain (without parser) took 11021.77ms. Allocated memory was 348.1MB in the beginning and 612.4MB in the end (delta: 264.2MB). Free memory was 323.4MB in the beginning and 563.4MB in the end (delta: -240.1MB). Peak memory consumption was 25.6MB. Max. memory is 16.0GB. [2023-08-26 18:28:56,844 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 348.1MB. Free memory is still 324.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:28:56,844 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.52ms. Allocated memory is still 348.1MB. Free memory was 322.9MB in the beginning and 300.7MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-26 18:28:56,845 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.14ms. Allocated memory is still 348.1MB. Free memory was 300.3MB in the beginning and 297.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:28:56,845 INFO L158 Benchmark]: Boogie Preprocessor took 33.38ms. Allocated memory is still 348.1MB. Free memory was 297.8MB in the beginning and 296.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:28:56,845 INFO L158 Benchmark]: RCFGBuilder took 699.34ms. Allocated memory is still 348.1MB. Free memory was 296.1MB in the beginning and 312.7MB in the end (delta: -16.6MB). Peak memory consumption was 27.0MB. Max. memory is 16.0GB. [2023-08-26 18:28:56,845 INFO L158 Benchmark]: TraceAbstraction took 9633.88ms. Allocated memory was 348.1MB in the beginning and 612.4MB in the end (delta: 264.2MB). Free memory was 311.8MB in the beginning and 563.4MB in the end (delta: -251.6MB). Peak memory consumption was 13.4MB. Max. memory is 16.0GB. [2023-08-26 18:28:56,847 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 348.1MB. Free memory is still 324.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 575.52ms. Allocated memory is still 348.1MB. Free memory was 322.9MB in the beginning and 300.7MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 72.14ms. Allocated memory is still 348.1MB. Free memory was 300.3MB in the beginning and 297.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.38ms. Allocated memory is still 348.1MB. Free memory was 297.8MB in the beginning and 296.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 699.34ms. Allocated memory is still 348.1MB. Free memory was 296.1MB in the beginning and 312.7MB in the end (delta: -16.6MB). Peak memory consumption was 27.0MB. Max. memory is 16.0GB. * TraceAbstraction took 9633.88ms. Allocated memory was 348.1MB in the beginning and 612.4MB in the end (delta: 264.2MB). Free memory was 311.8MB in the beginning and 563.4MB in the end (delta: -251.6MB). Peak memory consumption was 13.4MB. 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.3s, 96 PlacesBefore, 30 PlacesAfterwards, 92 TransitionsBefore, 24 TransitionsAfterwards, 1186 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 102 TotalNumberOfCompositions, 3214 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1785, independent: 1660, independent conditional: 0, independent unconditional: 1660, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 676, independent: 652, independent conditional: 0, independent unconditional: 652, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1785, independent: 1008, independent conditional: 0, independent unconditional: 1008, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 676, unknown conditional: 0, unknown unconditional: 676] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2473; [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2473, ((void *)0), P0, ((void *)0))=-2, t2473={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L792] 0 pthread_t t2474; [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2474, ((void *)0), P1, ((void *)0))=-1, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L745] 1 x = 1 VAL [__unbuffered_cnt=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 [L821] 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", "safe029_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=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: 791]: 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: 793]: 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 5 procedures, 111 locations, 9 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: 9.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 631 IncrementalHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 21 mSDtfsCounter, 631 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=312occurred in iteration=7, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 890 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 18:28:56,874 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...