/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/mix016_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:11:25,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:11:26,044 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:11:26,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:11:26,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:11:26,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:11:26,073 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:11:26,074 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:11:26,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:11:26,074 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:11:26,075 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:11:26,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:11:26,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:11:26,076 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:11:26,076 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:11:26,076 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:11:26,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:11:26,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:11:26,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:11:26,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:11:26,078 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:11:26,083 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:11:26,084 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:11:26,084 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:11:26,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:11:26,086 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:11:26,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:11:26,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:11:26,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:11:26,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:11:26,087 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:11:26,087 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:11:26,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:11:26,087 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:11:26,088 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:11:26,088 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:11:26,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:11:26,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:11:26,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:11:26,455 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:11:26,456 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:11:26,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_power.opt_rmo.opt.i [2023-08-26 18:11:27,643 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:11:27,931 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:11:27,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_power.opt_rmo.opt.i [2023-08-26 18:11:27,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/997b4eb99/f55b48d6e8f54c138bfeb1d8dd236761/FLAG3fef1c01f [2023-08-26 18:11:27,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/997b4eb99/f55b48d6e8f54c138bfeb1d8dd236761 [2023-08-26 18:11:27,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:11:27,963 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:11:27,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:11:27,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:11:27,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:11:27,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:11:27" (1/1) ... [2023-08-26 18:11:27,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b02ce5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:11:27, skipping insertion in model container [2023-08-26 18:11:27,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:11:27" (1/1) ... [2023-08-26 18:11:28,031 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:11:28,396 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:11:28,410 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:11:28,438 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 18:11:28,440 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 18:11:28,475 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:11:28,512 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:11:28,513 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:11:28,518 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:11:28,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:11:28 WrapperNode [2023-08-26 18:11:28,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:11:28,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:11:28,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:11:28,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:11:28,526 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:11:28" (1/1) ... [2023-08-26 18:11:28,561 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:11:28" (1/1) ... [2023-08-26 18:11:28,596 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136 [2023-08-26 18:11:28,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:11:28,597 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:11:28,597 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:11:28,597 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:11:28,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:11:28" (1/1) ... [2023-08-26 18:11:28,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:11:28" (1/1) ... [2023-08-26 18:11:28,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:11:28" (1/1) ... [2023-08-26 18:11:28,618 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:11:28" (1/1) ... [2023-08-26 18:11:28,628 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:11:28" (1/1) ... [2023-08-26 18:11:28,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:11:28" (1/1) ... [2023-08-26 18:11:28,632 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:11:28" (1/1) ... [2023-08-26 18:11:28,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:11:28" (1/1) ... [2023-08-26 18:11:28,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:11:28,650 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:11:28,650 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:11:28,650 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:11:28,650 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:11:28" (1/1) ... [2023-08-26 18:11:28,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:11:28,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:11:28,689 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:11:28,697 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:11:28,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:11:28,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:11:28,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:11:28,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:11:28,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:11:28,718 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:11:28,719 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:11:28,719 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:11:28,719 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:11:28,719 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:11:28,720 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:11:28,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:11:28,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:11:28,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:11:28,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:11:28,723 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:11:28,838 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:11:28,839 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:11:29,108 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:11:29,216 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:11:29,217 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:11:29,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:11:29 BoogieIcfgContainer [2023-08-26 18:11:29,219 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:11:29,220 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:11:29,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:11:29,223 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:11:29,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:11:27" (1/3) ... [2023-08-26 18:11:29,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35103a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:11:29, skipping insertion in model container [2023-08-26 18:11:29,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:11:28" (2/3) ... [2023-08-26 18:11:29,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35103a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:11:29, skipping insertion in model container [2023-08-26 18:11:29,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:11:29" (3/3) ... [2023-08-26 18:11:29,225 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016_power.opt_rmo.opt.i [2023-08-26 18:11:29,240 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:11:29,240 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-26 18:11:29,240 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:11:29,284 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:11:29,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 120 transitions, 255 flow [2023-08-26 18:11:29,354 INFO L124 PetriNetUnfolderBase]: 3/117 cut-off events. [2023-08-26 18:11:29,354 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:11:29,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-26 18:11:29,359 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 120 transitions, 255 flow [2023-08-26 18:11:29,362 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 117 transitions, 243 flow [2023-08-26 18:11:29,365 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:11:29,372 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 117 transitions, 243 flow [2023-08-26 18:11:29,375 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 117 transitions, 243 flow [2023-08-26 18:11:29,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 117 transitions, 243 flow [2023-08-26 18:11:29,398 INFO L124 PetriNetUnfolderBase]: 3/117 cut-off events. [2023-08-26 18:11:29,399 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:11:29,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-26 18:11:29,401 INFO L119 LiptonReduction]: Number of co-enabled transitions 2132 [2023-08-26 18:11:33,287 INFO L134 LiptonReduction]: Checked pairs total: 6111 [2023-08-26 18:11:33,288 INFO L136 LiptonReduction]: Total number of compositions: 117 [2023-08-26 18:11:33,305 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:11:33,312 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;@59f5a1ab, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:11:33,312 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-08-26 18:11:33,313 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:11:33,314 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:11:33,314 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:11:33,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:11:33,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:11:33,315 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:11:33,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:11:33,321 INFO L85 PathProgramCache]: Analyzing trace with hash 534, now seen corresponding path program 1 times [2023-08-26 18:11:33,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:11:33,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485079284] [2023-08-26 18:11:33,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:11:33,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:11:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:11:33,411 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:11:33,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:11:33,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485079284] [2023-08-26 18:11:33,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485079284] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:11:33,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:11:33,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:11:33,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066645136] [2023-08-26 18:11:33,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:11:33,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:11:33,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:11:33,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:11:33,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:11:33,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 237 [2023-08-26 18:11:33,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 69 flow. Second operand has 2 states, 2 states have (on average 107.5) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have 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:11:33,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:11:33,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 237 [2023-08-26 18:11:33,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:11:33,698 INFO L124 PetriNetUnfolderBase]: 909/1398 cut-off events. [2023-08-26 18:11:33,698 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-26 18:11:33,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2811 conditions, 1398 events. 909/1398 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6385 event pairs, 909 based on Foata normal form. 0/1186 useless extension candidates. Maximal degree in co-relation 2800. Up to 1359 conditions per place. [2023-08-26 18:11:33,713 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 20 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2023-08-26 18:11:33,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 95 flow [2023-08-26 18:11:33,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:11:33,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:11:33,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 241 transitions. [2023-08-26 18:11:33,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5084388185654009 [2023-08-26 18:11:33,730 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 241 transitions. [2023-08-26 18:11:33,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 241 transitions. [2023-08-26 18:11:33,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:11:33,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 241 transitions. [2023-08-26 18:11:33,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 120.5) internal successors, (241), 2 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have 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:11:33,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have 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:11:33,743 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have 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:11:33,745 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 69 flow. Second operand 2 states and 241 transitions. [2023-08-26 18:11:33,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 95 flow [2023-08-26 18:11:33,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 92 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:11:33,749 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 52 flow [2023-08-26 18:11:33,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2023-08-26 18:11:33,754 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -8 predicate places. [2023-08-26 18:11:33,755 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 52 flow [2023-08-26 18:11:33,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 107.5) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have 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:11:33,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:11:33,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 18:11:33,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:11:33,756 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:11:33,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:11:33,757 INFO L85 PathProgramCache]: Analyzing trace with hash 506984994, now seen corresponding path program 1 times [2023-08-26 18:11:33,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:11:33,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862174643] [2023-08-26 18:11:33,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:11:33,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:11:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:11:34,094 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:11:34,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:11:34,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862174643] [2023-08-26 18:11:34,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862174643] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:11:34,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:11:34,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:11:34,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147522940] [2023-08-26 18:11:34,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:11:34,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:11:34,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:11:34,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:11:34,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:11:34,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 237 [2023-08-26 18:11:34,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have 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:11:34,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:11:34,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 237 [2023-08-26 18:11:34,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:11:34,284 INFO L124 PetriNetUnfolderBase]: 711/1168 cut-off events. [2023-08-26 18:11:34,284 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:11:34,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2285 conditions, 1168 events. 711/1168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5685 event pairs, 117 based on Foata normal form. 0/1092 useless extension candidates. Maximal degree in co-relation 2282. Up to 859 conditions per place. [2023-08-26 18:11:34,290 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 27 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2023-08-26 18:11:34,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 34 transitions, 138 flow [2023-08-26 18:11:34,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:11:34,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:11:34,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-08-26 18:11:34,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49226441631504925 [2023-08-26 18:11:34,295 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-08-26 18:11:34,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-08-26 18:11:34,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:11:34,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-08-26 18:11:34,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have 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:11:34,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have 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:11:34,300 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have 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:11:34,300 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 52 flow. Second operand 3 states and 350 transitions. [2023-08-26 18:11:34,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 34 transitions, 138 flow [2023-08-26 18:11:34,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:11:34,304 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-08-26 18:11:34,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-08-26 18:11:34,305 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -7 predicate places. [2023-08-26 18:11:34,305 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-08-26 18:11:34,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have 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:11:34,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:11:34,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:11:34,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:11:34,310 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:11:34,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:11:34,311 INFO L85 PathProgramCache]: Analyzing trace with hash -202272115, now seen corresponding path program 1 times [2023-08-26 18:11:34,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:11:34,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630452825] [2023-08-26 18:11:34,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:11:34,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:11:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:11:34,494 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:11:34,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:11:34,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630452825] [2023-08-26 18:11:34,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630452825] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:11:34,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:11:34,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:11:34,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125175996] [2023-08-26 18:11:34,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:11:34,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:11:34,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:11:34,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:11:34,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:11:34,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 237 [2023-08-26 18:11:34,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:34,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:11:34,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 237 [2023-08-26 18:11:34,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:11:34,700 INFO L124 PetriNetUnfolderBase]: 1069/1590 cut-off events. [2023-08-26 18:11:34,700 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2023-08-26 18:11:34,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3335 conditions, 1590 events. 1069/1590 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6332 event pairs, 409 based on Foata normal form. 8/1598 useless extension candidates. Maximal degree in co-relation 3331. Up to 1515 conditions per place. [2023-08-26 18:11:34,709 INFO L140 encePairwiseOnDemand]: 232/237 looper letters, 29 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2023-08-26 18:11:34,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 148 flow [2023-08-26 18:11:34,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:11:34,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:11:34,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2023-08-26 18:11:34,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46554149085794655 [2023-08-26 18:11:34,711 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 331 transitions. [2023-08-26 18:11:34,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 331 transitions. [2023-08-26 18:11:34,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:11:34,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 331 transitions. [2023-08-26 18:11:34,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have 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:11:34,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have 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:11:34,715 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have 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:11:34,715 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 3 states and 331 transitions. [2023-08-26 18:11:34,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 148 flow [2023-08-26 18:11:34,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 33 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:11:34,718 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 74 flow [2023-08-26 18:11:34,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-08-26 18:11:34,719 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -7 predicate places. [2023-08-26 18:11:34,720 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 74 flow [2023-08-26 18:11:34,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:34,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:11:34,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:11:34,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:11:34,723 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:11:34,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:11:34,724 INFO L85 PathProgramCache]: Analyzing trace with hash -685413070, now seen corresponding path program 1 times [2023-08-26 18:11:34,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:11:34,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558767460] [2023-08-26 18:11:34,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:11:34,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:11:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:11:34,959 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:11:34,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:11:34,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558767460] [2023-08-26 18:11:34,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558767460] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:11:34,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:11:34,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:11:34,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153162223] [2023-08-26 18:11:34,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:11:34,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:11:34,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:11:34,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:11:34,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:11:34,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 237 [2023-08-26 18:11:34,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have 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:11:34,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:11:34,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 237 [2023-08-26 18:11:34,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:11:35,121 INFO L124 PetriNetUnfolderBase]: 755/1206 cut-off events. [2023-08-26 18:11:35,121 INFO L125 PetriNetUnfolderBase]: For 177/177 co-relation queries the response was YES. [2023-08-26 18:11:35,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2672 conditions, 1206 events. 755/1206 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5298 event pairs, 267 based on Foata normal form. 32/1223 useless extension candidates. Maximal degree in co-relation 2667. Up to 733 conditions per place. [2023-08-26 18:11:35,128 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 26 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2023-08-26 18:11:35,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 150 flow [2023-08-26 18:11:35,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:11:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:11:35,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2023-08-26 18:11:35,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4781997187060478 [2023-08-26 18:11:35,130 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 340 transitions. [2023-08-26 18:11:35,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions. [2023-08-26 18:11:35,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:11:35,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions. [2023-08-26 18:11:35,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have 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:11:35,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have 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:11:35,134 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have 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:11:35,134 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 74 flow. Second operand 3 states and 340 transitions. [2023-08-26 18:11:35,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 150 flow [2023-08-26 18:11:35,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 32 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:11:35,137 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 81 flow [2023-08-26 18:11:35,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2023-08-26 18:11:35,139 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -5 predicate places. [2023-08-26 18:11:35,139 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 81 flow [2023-08-26 18:11:35,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have 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:11:35,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:11:35,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:11:35,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:11:35,140 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:11:35,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:11:35,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1136328988, now seen corresponding path program 1 times [2023-08-26 18:11:35,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:11:35,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37841367] [2023-08-26 18:11:35,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:11:35,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:11:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:11:35,365 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:11:35,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:11:35,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37841367] [2023-08-26 18:11:35,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37841367] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:11:35,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:11:35,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:11:35,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156915342] [2023-08-26 18:11:35,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:11:35,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:11:35,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:11:35,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:11:35,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:11:35,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 237 [2023-08-26 18:11:35,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have 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:11:35,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:11:35,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 237 [2023-08-26 18:11:35,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:11:35,547 INFO L124 PetriNetUnfolderBase]: 520/884 cut-off events. [2023-08-26 18:11:35,548 INFO L125 PetriNetUnfolderBase]: For 154/159 co-relation queries the response was YES. [2023-08-26 18:11:35,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1999 conditions, 884 events. 520/884 cut-off events. For 154/159 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4133 event pairs, 94 based on Foata normal form. 86/952 useless extension candidates. Maximal degree in co-relation 1993. Up to 495 conditions per place. [2023-08-26 18:11:35,553 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 42 selfloop transitions, 8 changer transitions 2/57 dead transitions. [2023-08-26 18:11:35,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 57 transitions, 263 flow [2023-08-26 18:11:35,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:11:35,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:11:35,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 552 transitions. [2023-08-26 18:11:35,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46582278481012657 [2023-08-26 18:11:35,555 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 552 transitions. [2023-08-26 18:11:35,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 552 transitions. [2023-08-26 18:11:35,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:11:35,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 552 transitions. [2023-08-26 18:11:35,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have 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:11:35,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have 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:11:35,560 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have 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:11:35,560 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 81 flow. Second operand 5 states and 552 transitions. [2023-08-26 18:11:35,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 57 transitions, 263 flow [2023-08-26 18:11:35,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 57 transitions, 257 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:11:35,563 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 133 flow [2023-08-26 18:11:35,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-08-26 18:11:35,565 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2023-08-26 18:11:35,565 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 133 flow [2023-08-26 18:11:35,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have 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:11:35,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:11:35,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:11:35,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:11:35,566 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:11:35,567 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:11:35,567 INFO L85 PathProgramCache]: Analyzing trace with hash 41784222, now seen corresponding path program 1 times [2023-08-26 18:11:35,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:11:35,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396013553] [2023-08-26 18:11:35,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:11:35,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:11:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:11:35,803 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:11:35,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:11:35,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396013553] [2023-08-26 18:11:35,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396013553] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:11:35,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:11:35,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:11:35,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470268878] [2023-08-26 18:11:35,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:11:35,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:11:35,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:11:35,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:11:35,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:11:35,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 237 [2023-08-26 18:11:35,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have 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:11:35,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:11:35,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 237 [2023-08-26 18:11:35,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:11:36,053 INFO L124 PetriNetUnfolderBase]: 392/707 cut-off events. [2023-08-26 18:11:36,053 INFO L125 PetriNetUnfolderBase]: For 398/398 co-relation queries the response was YES. [2023-08-26 18:11:36,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2018 conditions, 707 events. 392/707 cut-off events. For 398/398 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3334 event pairs, 57 based on Foata normal form. 47/741 useless extension candidates. Maximal degree in co-relation 2009. Up to 191 conditions per place. [2023-08-26 18:11:36,058 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 49 selfloop transitions, 14 changer transitions 10/78 dead transitions. [2023-08-26 18:11:36,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 78 transitions, 423 flow [2023-08-26 18:11:36,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:11:36,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:11:36,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 773 transitions. [2023-08-26 18:11:36,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46594333936106086 [2023-08-26 18:11:36,061 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 773 transitions. [2023-08-26 18:11:36,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 773 transitions. [2023-08-26 18:11:36,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:11:36,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 773 transitions. [2023-08-26 18:11:36,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.42857142857143) internal successors, (773), 7 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have 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:11:36,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have 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:11:36,068 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have 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:11:36,068 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 133 flow. Second operand 7 states and 773 transitions. [2023-08-26 18:11:36,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 78 transitions, 423 flow [2023-08-26 18:11:36,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 78 transitions, 423 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:11:36,074 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 222 flow [2023-08-26 18:11:36,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-08-26 18:11:36,076 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2023-08-26 18:11:36,077 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 222 flow [2023-08-26 18:11:36,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have 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:11:36,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:11:36,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:11:36,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:11:36,078 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:11:36,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:11:36,078 INFO L85 PathProgramCache]: Analyzing trace with hash 329126827, now seen corresponding path program 1 times [2023-08-26 18:11:36,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:11:36,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146477314] [2023-08-26 18:11:36,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:11:36,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:11:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:11:36,288 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:11:36,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:11:36,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146477314] [2023-08-26 18:11:36,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146477314] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:11:36,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:11:36,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:11:36,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987792821] [2023-08-26 18:11:36,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:11:36,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:11:36,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:11:36,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:11:36,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:11:36,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 237 [2023-08-26 18:11:36,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have 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:11:36,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:11:36,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 237 [2023-08-26 18:11:36,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:11:36,492 INFO L124 PetriNetUnfolderBase]: 578/1057 cut-off events. [2023-08-26 18:11:36,492 INFO L125 PetriNetUnfolderBase]: For 2021/2038 co-relation queries the response was YES. [2023-08-26 18:11:36,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3672 conditions, 1057 events. 578/1057 cut-off events. For 2021/2038 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5597 event pairs, 72 based on Foata normal form. 15/1048 useless extension candidates. Maximal degree in co-relation 3659. Up to 590 conditions per place. [2023-08-26 18:11:36,498 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 61 selfloop transitions, 2 changer transitions 13/80 dead transitions. [2023-08-26 18:11:36,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 80 transitions, 656 flow [2023-08-26 18:11:36,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:11:36,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:11:36,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 451 transitions. [2023-08-26 18:11:36,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4757383966244726 [2023-08-26 18:11:36,500 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 451 transitions. [2023-08-26 18:11:36,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 451 transitions. [2023-08-26 18:11:36,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:11:36,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 451 transitions. [2023-08-26 18:11:36,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have 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:11:36,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have 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:11:36,503 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have 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:11:36,503 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 222 flow. Second operand 4 states and 451 transitions. [2023-08-26 18:11:36,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 80 transitions, 656 flow [2023-08-26 18:11:36,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 581 flow, removed 26 selfloop flow, removed 2 redundant places. [2023-08-26 18:11:36,518 INFO L231 Difference]: Finished difference. Result has 51 places, 35 transitions, 184 flow [2023-08-26 18:11:36,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=51, PETRI_TRANSITIONS=35} [2023-08-26 18:11:36,519 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 12 predicate places. [2023-08-26 18:11:36,520 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 184 flow [2023-08-26 18:11:36,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have 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:11:36,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:11:36,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:11:36,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:11:36,521 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:11:36,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:11:36,521 INFO L85 PathProgramCache]: Analyzing trace with hash 689528949, now seen corresponding path program 1 times [2023-08-26 18:11:36,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:11:36,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862572825] [2023-08-26 18:11:36,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:11:36,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:11:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:11:36,922 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:11:36,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:11:36,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862572825] [2023-08-26 18:11:36,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862572825] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:11:36,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:11:36,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:11:36,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678964399] [2023-08-26 18:11:36,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:11:36,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:11:36,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:11:36,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:11:36,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:11:36,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 237 [2023-08-26 18:11:36,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 35 transitions, 184 flow. Second operand has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have 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:11:36,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:11:36,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 237 [2023-08-26 18:11:36,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:11:37,261 INFO L124 PetriNetUnfolderBase]: 719/1494 cut-off events. [2023-08-26 18:11:37,262 INFO L125 PetriNetUnfolderBase]: For 2015/2016 co-relation queries the response was YES. [2023-08-26 18:11:37,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5059 conditions, 1494 events. 719/1494 cut-off events. For 2015/2016 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9680 event pairs, 170 based on Foata normal form. 6/1461 useless extension candidates. Maximal degree in co-relation 5043. Up to 694 conditions per place. [2023-08-26 18:11:37,270 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 56 selfloop transitions, 8 changer transitions 42/112 dead transitions. [2023-08-26 18:11:37,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 112 transitions, 842 flow [2023-08-26 18:11:37,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:11:37,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:11:37,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 665 transitions. [2023-08-26 18:11:37,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4676511954992968 [2023-08-26 18:11:37,273 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 665 transitions. [2023-08-26 18:11:37,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 665 transitions. [2023-08-26 18:11:37,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:11:37,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 665 transitions. [2023-08-26 18:11:37,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have 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:11:37,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have 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:11:37,277 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have 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:11:37,277 INFO L175 Difference]: Start difference. First operand has 51 places, 35 transitions, 184 flow. Second operand 6 states and 665 transitions. [2023-08-26 18:11:37,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 112 transitions, 842 flow [2023-08-26 18:11:37,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 112 transitions, 839 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:11:37,293 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 256 flow [2023-08-26 18:11:37,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=256, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2023-08-26 18:11:37,295 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 19 predicate places. [2023-08-26 18:11:37,295 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 256 flow [2023-08-26 18:11:37,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have 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:11:37,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:11:37,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:11:37,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:11:37,296 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:11:37,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:11:37,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2101665417, now seen corresponding path program 2 times [2023-08-26 18:11:37,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:11:37,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226589234] [2023-08-26 18:11:37,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:11:37,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:11:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:11:37,504 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:11:37,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:11:37,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226589234] [2023-08-26 18:11:37,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226589234] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:11:37,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:11:37,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:11:37,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305413334] [2023-08-26 18:11:37,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:11:37,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:11:37,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:11:37,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:11:37,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:11:37,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 237 [2023-08-26 18:11:37,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 102.5) internal successors, (615), 6 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have 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:11:37,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:11:37,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 237 [2023-08-26 18:11:37,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:11:37,763 INFO L124 PetriNetUnfolderBase]: 554/1097 cut-off events. [2023-08-26 18:11:37,763 INFO L125 PetriNetUnfolderBase]: For 2210/2210 co-relation queries the response was YES. [2023-08-26 18:11:37,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4195 conditions, 1097 events. 554/1097 cut-off events. For 2210/2210 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 6620 event pairs, 58 based on Foata normal form. 37/1119 useless extension candidates. Maximal degree in co-relation 4176. Up to 259 conditions per place. [2023-08-26 18:11:37,770 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 51 selfloop transitions, 15 changer transitions 28/99 dead transitions. [2023-08-26 18:11:37,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 99 transitions, 716 flow [2023-08-26 18:11:37,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:11:37,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:11:37,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 970 transitions. [2023-08-26 18:11:37,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4547585560243788 [2023-08-26 18:11:37,773 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 970 transitions. [2023-08-26 18:11:37,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 970 transitions. [2023-08-26 18:11:37,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:11:37,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 970 transitions. [2023-08-26 18:11:37,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 107.77777777777777) internal successors, (970), 9 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have 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:11:37,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 237.0) internal successors, (2370), 10 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have 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:11:37,780 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 237.0) internal successors, (2370), 10 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have 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:11:37,780 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 256 flow. Second operand 9 states and 970 transitions. [2023-08-26 18:11:37,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 99 transitions, 716 flow [2023-08-26 18:11:37,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 99 transitions, 707 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-26 18:11:37,794 INFO L231 Difference]: Finished difference. Result has 65 places, 39 transitions, 270 flow [2023-08-26 18:11:37,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=270, PETRI_PLACES=65, PETRI_TRANSITIONS=39} [2023-08-26 18:11:37,795 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 26 predicate places. [2023-08-26 18:11:37,795 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 39 transitions, 270 flow [2023-08-26 18:11:37,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.5) internal successors, (615), 6 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have 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:11:37,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:11:37,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:11:37,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:11:37,796 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:11:37,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:11:37,797 INFO L85 PathProgramCache]: Analyzing trace with hash -858836452, now seen corresponding path program 1 times [2023-08-26 18:11:37,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:11:37,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493192028] [2023-08-26 18:11:37,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:11:37,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:11:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:11:38,410 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:11:38,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:11:38,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493192028] [2023-08-26 18:11:38,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493192028] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:11:38,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:11:38,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:11:38,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110736440] [2023-08-26 18:11:38,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:11:38,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:11:38,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:11:38,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:11:38,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:11:38,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 237 [2023-08-26 18:11:38,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 39 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 98.57142857142857) internal successors, (690), 7 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have 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:11:38,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:11:38,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 237 [2023-08-26 18:11:38,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:11:38,653 INFO L124 PetriNetUnfolderBase]: 356/771 cut-off events. [2023-08-26 18:11:38,653 INFO L125 PetriNetUnfolderBase]: For 2004/2026 co-relation queries the response was YES. [2023-08-26 18:11:38,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3223 conditions, 771 events. 356/771 cut-off events. For 2004/2026 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4560 event pairs, 63 based on Foata normal form. 15/771 useless extension candidates. Maximal degree in co-relation 3202. Up to 257 conditions per place. [2023-08-26 18:11:38,657 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 50 selfloop transitions, 8 changer transitions 41/104 dead transitions. [2023-08-26 18:11:38,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 104 transitions, 988 flow [2023-08-26 18:11:38,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:11:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:11:38,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 724 transitions. [2023-08-26 18:11:38,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43640747438215793 [2023-08-26 18:11:38,660 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 724 transitions. [2023-08-26 18:11:38,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 724 transitions. [2023-08-26 18:11:38,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:11:38,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 724 transitions. [2023-08-26 18:11:38,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.42857142857143) internal successors, (724), 7 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have 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:11:38,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have 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:11:38,664 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have 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:11:38,664 INFO L175 Difference]: Start difference. First operand has 65 places, 39 transitions, 270 flow. Second operand 7 states and 724 transitions. [2023-08-26 18:11:38,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 104 transitions, 988 flow [2023-08-26 18:11:38,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 104 transitions, 778 flow, removed 46 selfloop flow, removed 10 redundant places. [2023-08-26 18:11:38,675 INFO L231 Difference]: Finished difference. Result has 63 places, 39 transitions, 248 flow [2023-08-26 18:11:38,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=63, PETRI_TRANSITIONS=39} [2023-08-26 18:11:38,675 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 24 predicate places. [2023-08-26 18:11:38,676 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 39 transitions, 248 flow [2023-08-26 18:11:38,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.57142857142857) internal successors, (690), 7 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have 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:11:38,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:11:38,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:11:38,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:11:38,677 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:11:38,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:11:38,677 INFO L85 PathProgramCache]: Analyzing trace with hash 47923572, now seen corresponding path program 2 times [2023-08-26 18:11:38,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:11:38,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868522745] [2023-08-26 18:11:38,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:11:38,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:11:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:11:38,823 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:11:38,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:11:38,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868522745] [2023-08-26 18:11:38,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868522745] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:11:38,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:11:38,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:11:38,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023760347] [2023-08-26 18:11:38,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:11:38,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:11:38,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:11:38,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:11:38,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:11:38,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 237 [2023-08-26 18:11:38,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 39 transitions, 248 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have 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:11:38,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:11:38,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 237 [2023-08-26 18:11:38,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:11:39,018 INFO L124 PetriNetUnfolderBase]: 525/996 cut-off events. [2023-08-26 18:11:39,018 INFO L125 PetriNetUnfolderBase]: For 2267/2267 co-relation queries the response was YES. [2023-08-26 18:11:39,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3894 conditions, 996 events. 525/996 cut-off events. For 2267/2267 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5298 event pairs, 132 based on Foata normal form. 1/991 useless extension candidates. Maximal degree in co-relation 3874. Up to 428 conditions per place. [2023-08-26 18:11:39,023 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 27 selfloop transitions, 1 changer transitions 45/74 dead transitions. [2023-08-26 18:11:39,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 74 transitions, 623 flow [2023-08-26 18:11:39,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:11:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:11:39,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 443 transitions. [2023-08-26 18:11:39,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46729957805907174 [2023-08-26 18:11:39,025 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 443 transitions. [2023-08-26 18:11:39,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 443 transitions. [2023-08-26 18:11:39,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:11:39,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 443 transitions. [2023-08-26 18:11:39,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:39,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have 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:11:39,028 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have 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:11:39,028 INFO L175 Difference]: Start difference. First operand has 63 places, 39 transitions, 248 flow. Second operand 4 states and 443 transitions. [2023-08-26 18:11:39,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 74 transitions, 623 flow [2023-08-26 18:11:39,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 578 flow, removed 17 selfloop flow, removed 6 redundant places. [2023-08-26 18:11:39,036 INFO L231 Difference]: Finished difference. Result has 57 places, 29 transitions, 152 flow [2023-08-26 18:11:39,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=57, PETRI_TRANSITIONS=29} [2023-08-26 18:11:39,036 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 18 predicate places. [2023-08-26 18:11:39,037 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 29 transitions, 152 flow [2023-08-26 18:11:39,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have 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:11:39,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:11:39,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:11:39,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:11:39,037 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:11:39,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:11:39,038 INFO L85 PathProgramCache]: Analyzing trace with hash -404782294, now seen corresponding path program 3 times [2023-08-26 18:11:39,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:11:39,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796198691] [2023-08-26 18:11:39,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:11:39,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:11:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:11:39,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:11:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:11:39,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:11:39,118 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:11:39,119 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (11 of 12 remaining) [2023-08-26 18:11:39,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (10 of 12 remaining) [2023-08-26 18:11:39,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-08-26 18:11:39,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-08-26 18:11:39,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-08-26 18:11:39,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-08-26 18:11:39,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-08-26 18:11:39,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-08-26 18:11:39,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-08-26 18:11:39,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-08-26 18:11:39,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-08-26 18:11:39,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (0 of 12 remaining) [2023-08-26 18:11:39,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:11:39,122 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:11:39,126 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:11:39,127 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:11:39,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:11:39 BasicIcfg [2023-08-26 18:11:39,175 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:11:39,175 INFO L158 Benchmark]: Toolchain (without parser) took 11211.67ms. Allocated memory was 400.6MB in the beginning and 578.8MB in the end (delta: 178.3MB). Free memory was 375.1MB in the beginning and 476.4MB in the end (delta: -101.2MB). Peak memory consumption was 78.8MB. Max. memory is 16.0GB. [2023-08-26 18:11:39,175 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 400.6MB. Free memory was 377.3MB in the beginning and 377.2MB in the end (delta: 94.0kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:11:39,175 INFO L158 Benchmark]: CACSL2BoogieTranslator took 550.67ms. Allocated memory is still 400.6MB. Free memory was 375.1MB in the beginning and 352.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 18:11:39,176 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.50ms. Allocated memory is still 400.6MB. Free memory was 352.1MB in the beginning and 349.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:11:39,176 INFO L158 Benchmark]: Boogie Preprocessor took 51.66ms. Allocated memory is still 400.6MB. Free memory was 349.7MB in the beginning and 347.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:11:39,176 INFO L158 Benchmark]: RCFGBuilder took 569.27ms. Allocated memory is still 400.6MB. Free memory was 347.6MB in the beginning and 361.4MB in the end (delta: -13.9MB). Peak memory consumption was 27.4MB. Max. memory is 16.0GB. [2023-08-26 18:11:39,177 INFO L158 Benchmark]: TraceAbstraction took 9954.30ms. Allocated memory was 400.6MB in the beginning and 578.8MB in the end (delta: 178.3MB). Free memory was 361.4MB in the beginning and 476.4MB in the end (delta: -114.9MB). Peak memory consumption was 64.0MB. Max. memory is 16.0GB. [2023-08-26 18:11:39,178 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.11ms. Allocated memory is still 400.6MB. Free memory was 377.3MB in the beginning and 377.2MB in the end (delta: 94.0kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 550.67ms. Allocated memory is still 400.6MB. Free memory was 375.1MB in the beginning and 352.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 76.50ms. Allocated memory is still 400.6MB. Free memory was 352.1MB in the beginning and 349.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 51.66ms. Allocated memory is still 400.6MB. Free memory was 349.7MB in the beginning and 347.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 569.27ms. Allocated memory is still 400.6MB. Free memory was 347.6MB in the beginning and 361.4MB in the end (delta: -13.9MB). Peak memory consumption was 27.4MB. Max. memory is 16.0GB. * TraceAbstraction took 9954.30ms. Allocated memory was 400.6MB in the beginning and 578.8MB in the end (delta: 178.3MB). Free memory was 361.4MB in the beginning and 476.4MB in the end (delta: -114.9MB). Peak memory consumption was 64.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 124 PlacesBefore, 39 PlacesAfterwards, 117 TransitionsBefore, 30 TransitionsAfterwards, 2132 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 117 TotalNumberOfCompositions, 6111 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2920, independent: 2727, independent conditional: 0, independent unconditional: 2727, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1186, independent: 1145, independent conditional: 0, independent unconditional: 1145, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2920, independent: 1582, independent conditional: 0, independent unconditional: 1582, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 1186, unknown conditional: 0, unknown unconditional: 1186] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 89, Positive conditional cache size: 0, Positive unconditional cache size: 89, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff1_thd0; [L730] 0 _Bool x$r_buff1_thd1; [L731] 0 _Bool x$r_buff1_thd2; [L732] 0 _Bool x$r_buff1_thd3; [L733] 0 _Bool x$read_delayed; [L734] 0 int *x$read_delayed_var; [L735] 0 int x$w_buff0; [L736] 0 _Bool x$w_buff0_used; [L737] 0 int x$w_buff1; [L738] 0 _Bool x$w_buff1_used; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t412; [L837] FCALL, FORK 0 pthread_create(&t412, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t412, ((void *)0), P0, ((void *)0))=-3, t412={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L838] 0 pthread_t t413; [L839] FCALL, FORK 0 pthread_create(&t413, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t413, ((void *)0), P1, ((void *)0))=-2, t412={5:0}, t413={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L840] 0 pthread_t t414; [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L780] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L780] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t414, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t414, ((void *)0), P2, ((void *)0))=-1, t412={5:0}, t413={6:0}, t414={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L788] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L805] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L808] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L811] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L748] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L814] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L815] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L816] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L817] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L818] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L848] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L849] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L850] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L851] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t412={5:0}, t413={6:0}, t414={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L854] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "mix016_power.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 837]: 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: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 146 locations, 12 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.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 202 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 202 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 904 IncrementalHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 6 mSDtfsCounter, 904 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=270occurred in iteration=9, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 791 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:11:39,202 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...