/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 15:17:01,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 15:17:01,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 15:17:01,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 15:17:01,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 15:17:01,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 15:17:01,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 15:17:01,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 15:17:01,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 15:17:01,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 15:17:01,109 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 15:17:01,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 15:17:01,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 15:17:01,109 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 15:17:01,109 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 15:17:01,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 15:17:01,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 15:17:01,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 15:17:01,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 15:17:01,111 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 15:17:01,111 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 15:17:01,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 15:17:01,116 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 15:17:01,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 15:17:01,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 15:17:01,116 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 15:17:01,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 15:17:01,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:17:01,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 15:17:01,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 15:17:01,117 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 15:17:01,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 15:17:01,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 15:17:01,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 15:17:01,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 15:17:01,118 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 15:17:01,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 15:17:01,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 15:17:01,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 15:17:01,373 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 15:17:01,373 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 15:17:01,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2023-08-26 15:17:02,302 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 15:17:02,523 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 15:17:02,523 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2023-08-26 15:17:02,541 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91b8425e9/4e28a348940c4429bddeef0019860a32/FLAGb867bc464 [2023-08-26 15:17:02,554 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91b8425e9/4e28a348940c4429bddeef0019860a32 [2023-08-26 15:17:02,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 15:17:02,558 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 15:17:02,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 15:17:02,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 15:17:02,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 15:17:02,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:17:02" (1/1) ... [2023-08-26 15:17:02,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4efeed28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:17:02, skipping insertion in model container [2023-08-26 15:17:02,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:17:02" (1/1) ... [2023-08-26 15:17:02,603 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 15:17:02,885 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:17:02,899 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 15:17:02,921 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:17:02,923 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:17:02,956 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:17:02,996 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:17:02,997 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:17:03,001 INFO L206 MainTranslator]: Completed translation [2023-08-26 15:17:03,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:17:03 WrapperNode [2023-08-26 15:17:03,001 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 15:17:03,002 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 15:17:03,002 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 15:17:03,002 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 15:17:03,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:17:03" (1/1) ... [2023-08-26 15:17:03,032 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:17:03" (1/1) ... [2023-08-26 15:17:03,060 INFO L138 Inliner]: procedures = 175, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 170 [2023-08-26 15:17:03,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 15:17:03,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 15:17:03,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 15:17:03,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 15:17:03,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:17:03" (1/1) ... [2023-08-26 15:17:03,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:17:03" (1/1) ... [2023-08-26 15:17:03,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:17:03" (1/1) ... [2023-08-26 15:17:03,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:17:03" (1/1) ... [2023-08-26 15:17:03,079 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:17:03" (1/1) ... [2023-08-26 15:17:03,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:17:03" (1/1) ... [2023-08-26 15:17:03,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:17:03" (1/1) ... [2023-08-26 15:17:03,083 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:17:03" (1/1) ... [2023-08-26 15:17:03,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 15:17:03,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 15:17:03,086 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 15:17:03,086 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 15:17:03,086 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:17:03" (1/1) ... [2023-08-26 15:17:03,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:17:03,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 15:17:03,107 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 15:17:03,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 15:17:03,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 15:17:03,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 15:17:03,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 15:17:03,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 15:17:03,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 15:17:03,130 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 15:17:03,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 15:17:03,130 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 15:17:03,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 15:17:03,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 15:17:03,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 15:17:03,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 15:17:03,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 15:17:03,132 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 15:17:03,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 15:17:03,259 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 15:17:03,261 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 15:17:03,704 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 15:17:04,221 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 15:17:04,222 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 15:17:04,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:17:04 BoogieIcfgContainer [2023-08-26 15:17:04,224 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 15:17:04,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 15:17:04,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 15:17:04,228 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 15:17:04,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:17:02" (1/3) ... [2023-08-26 15:17:04,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14bc67d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:17:04, skipping insertion in model container [2023-08-26 15:17:04,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:17:03" (2/3) ... [2023-08-26 15:17:04,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14bc67d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:17:04, skipping insertion in model container [2023-08-26 15:17:04,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:17:04" (3/3) ... [2023-08-26 15:17:04,232 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.opt-thin000_power.opt.i [2023-08-26 15:17:04,246 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 15:17:04,246 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2023-08-26 15:17:04,247 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 15:17:04,341 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 15:17:04,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 143 transitions, 296 flow [2023-08-26 15:17:04,482 INFO L124 PetriNetUnfolderBase]: 3/141 cut-off events. [2023-08-26 15:17:04,482 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:17:04,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 141 events. 3/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 216 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-26 15:17:04,487 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 143 transitions, 296 flow [2023-08-26 15:17:04,492 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 141 transitions, 288 flow [2023-08-26 15:17:04,495 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 15:17:04,505 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 141 transitions, 288 flow [2023-08-26 15:17:04,508 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 141 transitions, 288 flow [2023-08-26 15:17:04,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 141 transitions, 288 flow [2023-08-26 15:17:04,551 INFO L124 PetriNetUnfolderBase]: 3/141 cut-off events. [2023-08-26 15:17:04,551 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:17:04,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 141 events. 3/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 215 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-26 15:17:04,555 INFO L119 LiptonReduction]: Number of co-enabled transitions 3750 [2023-08-26 15:17:11,810 INFO L134 LiptonReduction]: Checked pairs total: 17152 [2023-08-26 15:17:11,810 INFO L136 LiptonReduction]: Total number of compositions: 125 [2023-08-26 15:17:11,819 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 15:17:11,823 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;@3082ce12, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 15:17:11,823 INFO L358 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2023-08-26 15:17:11,824 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 15:17:11,824 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 15:17:11,824 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:17:11,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:17:11,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 15:17:11,825 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-08-26 15:17:11,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:17:11,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2023-08-26 15:17:11,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:17:11,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055125637] [2023-08-26 15:17:11,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:17:11,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:17:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:17:11,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:17:11,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:17:11,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055125637] [2023-08-26 15:17:11,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055125637] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:17:11,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:17:11,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 15:17:11,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953522622] [2023-08-26 15:17:11,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:17:11,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 15:17:11,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:17:11,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 15:17:11,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 15:17:11,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 268 [2023-08-26 15:17:11,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 118 flow. Second operand has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:11,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:17:11,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 268 [2023-08-26 15:17:11,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:17:12,328 INFO L124 PetriNetUnfolderBase]: 2259/3689 cut-off events. [2023-08-26 15:17:12,328 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-08-26 15:17:12,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7295 conditions, 3689 events. 2259/3689 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 24788 event pairs, 2259 based on Foata normal form. 100/1501 useless extension candidates. Maximal degree in co-relation 7285. Up to 3581 conditions per place. [2023-08-26 15:17:12,344 INFO L140 encePairwiseOnDemand]: 249/268 looper letters, 34 selfloop transitions, 0 changer transitions 0/37 dead transitions. [2023-08-26 15:17:12,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 148 flow [2023-08-26 15:17:12,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 15:17:12,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 15:17:12,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 253 transitions. [2023-08-26 15:17:12,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47201492537313433 [2023-08-26 15:17:12,353 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 253 transitions. [2023-08-26 15:17:12,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 253 transitions. [2023-08-26 15:17:12,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:17:12,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 253 transitions. [2023-08-26 15:17:12,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:12,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 268.0) internal successors, (804), 3 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:12,359 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 268.0) internal successors, (804), 3 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:12,360 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 118 flow. Second operand 2 states and 253 transitions. [2023-08-26 15:17:12,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 148 flow [2023-08-26 15:17:12,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:17:12,363 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 78 flow [2023-08-26 15:17:12,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2023-08-26 15:17:12,366 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -19 predicate places. [2023-08-26 15:17:12,366 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 78 flow [2023-08-26 15:17:12,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:12,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:17:12,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 15:17:12,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 15:17:12,367 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-08-26 15:17:12,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:17:12,367 INFO L85 PathProgramCache]: Analyzing trace with hash 30661852, now seen corresponding path program 1 times [2023-08-26 15:17:12,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:17:12,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058559732] [2023-08-26 15:17:12,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:17:12,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:17:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:17:12,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:17:12,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:17:12,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058559732] [2023-08-26 15:17:12,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058559732] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:17:12,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:17:12,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:17:12,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85359210] [2023-08-26 15:17:12,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:17:12,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:17:12,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:17:12,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:17:12,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:17:12,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 268 [2023-08-26 15:17:12,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:12,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:17:12,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 268 [2023-08-26 15:17:12,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:17:12,964 INFO L124 PetriNetUnfolderBase]: 2020/3232 cut-off events. [2023-08-26 15:17:12,965 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:17:12,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6464 conditions, 3232 events. 2020/3232 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 23113 event pairs, 347 based on Foata normal form. 0/1271 useless extension candidates. Maximal degree in co-relation 6461. Up to 2598 conditions per place. [2023-08-26 15:17:12,986 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 54 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-26 15:17:12,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 59 transitions, 236 flow [2023-08-26 15:17:12,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:17:12,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:17:12,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-08-26 15:17:12,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44029850746268656 [2023-08-26 15:17:12,991 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-08-26 15:17:12,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-08-26 15:17:12,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:17:12,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-08-26 15:17:12,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:13,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:13,000 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:13,000 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 78 flow. Second operand 3 states and 354 transitions. [2023-08-26 15:17:13,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 59 transitions, 236 flow [2023-08-26 15:17:13,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 236 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:17:13,002 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 80 flow [2023-08-26 15:17:13,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2023-08-26 15:17:13,006 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -18 predicate places. [2023-08-26 15:17:13,006 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 80 flow [2023-08-26 15:17:13,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:13,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:17:13,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 15:17:13,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 15:17:13,009 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-08-26 15:17:13,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:17:13,010 INFO L85 PathProgramCache]: Analyzing trace with hash 950518251, now seen corresponding path program 1 times [2023-08-26 15:17:13,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:17:13,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601954827] [2023-08-26 15:17:13,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:17:13,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:17:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:17:13,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:17:13,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:17:13,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601954827] [2023-08-26 15:17:13,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601954827] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:17:13,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:17:13,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:17:13,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926859758] [2023-08-26 15:17:13,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:17:13,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:17:13,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:17:13,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:17:13,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:17:13,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 268 [2023-08-26 15:17:13,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:13,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:17:13,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 268 [2023-08-26 15:17:13,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:17:13,369 INFO L124 PetriNetUnfolderBase]: 1186/2018 cut-off events. [2023-08-26 15:17:13,369 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2023-08-26 15:17:13,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4130 conditions, 2018 events. 1186/2018 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 12101 event pairs, 927 based on Foata normal form. 0/1100 useless extension candidates. Maximal degree in co-relation 4126. Up to 1528 conditions per place. [2023-08-26 15:17:13,376 INFO L140 encePairwiseOnDemand]: 255/268 looper letters, 40 selfloop transitions, 6 changer transitions 0/47 dead transitions. [2023-08-26 15:17:13,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 196 flow [2023-08-26 15:17:13,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:17:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:17:13,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-08-26 15:17:13,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38681592039800994 [2023-08-26 15:17:13,377 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-08-26 15:17:13,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-08-26 15:17:13,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:17:13,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-08-26 15:17:13,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:13,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:13,380 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:13,380 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 80 flow. Second operand 3 states and 311 transitions. [2023-08-26 15:17:13,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 196 flow [2023-08-26 15:17:13,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:17:13,383 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 122 flow [2023-08-26 15:17:13,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2023-08-26 15:17:13,384 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -18 predicate places. [2023-08-26 15:17:13,384 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 122 flow [2023-08-26 15:17:13,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:13,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:17:13,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 15:17:13,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 15:17:13,388 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-08-26 15:17:13,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:17:13,388 INFO L85 PathProgramCache]: Analyzing trace with hash 950518252, now seen corresponding path program 1 times [2023-08-26 15:17:13,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:17:13,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287598780] [2023-08-26 15:17:13,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:17:13,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:17:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:17:13,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:17:13,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:17:13,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287598780] [2023-08-26 15:17:13,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287598780] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:17:13,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:17:13,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:17:13,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290545078] [2023-08-26 15:17:13,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:17:13,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:17:13,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:17:13,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:17:13,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:17:13,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 268 [2023-08-26 15:17:13,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:13,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:17:13,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 268 [2023-08-26 15:17:13,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:17:13,638 INFO L124 PetriNetUnfolderBase]: 398/747 cut-off events. [2023-08-26 15:17:13,639 INFO L125 PetriNetUnfolderBase]: For 238/243 co-relation queries the response was YES. [2023-08-26 15:17:13,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1906 conditions, 747 events. 398/747 cut-off events. For 238/243 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3854 event pairs, 345 based on Foata normal form. 166/799 useless extension candidates. Maximal degree in co-relation 1901. Up to 710 conditions per place. [2023-08-26 15:17:13,641 INFO L140 encePairwiseOnDemand]: 260/268 looper letters, 27 selfloop transitions, 1 changer transitions 1/31 dead transitions. [2023-08-26 15:17:13,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 166 flow [2023-08-26 15:17:13,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:17:13,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:17:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2023-08-26 15:17:13,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3718905472636816 [2023-08-26 15:17:13,642 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 299 transitions. [2023-08-26 15:17:13,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 299 transitions. [2023-08-26 15:17:13,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:17:13,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 299 transitions. [2023-08-26 15:17:13,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:13,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:13,645 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:13,645 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 122 flow. Second operand 3 states and 299 transitions. [2023-08-26 15:17:13,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 166 flow [2023-08-26 15:17:13,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 31 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:17:13,648 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 96 flow [2023-08-26 15:17:13,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-08-26 15:17:13,649 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -25 predicate places. [2023-08-26 15:17:13,649 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 96 flow [2023-08-26 15:17:13,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:13,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:17:13,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:17:13,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 15:17:13,650 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-08-26 15:17:13,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:17:13,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1700279859, now seen corresponding path program 1 times [2023-08-26 15:17:13,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:17:13,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356394447] [2023-08-26 15:17:13,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:17:13,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:17:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:17:13,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:17:13,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:17:13,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356394447] [2023-08-26 15:17:13,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356394447] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:17:13,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:17:13,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:17:13,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514656204] [2023-08-26 15:17:13,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:17:13,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:17:13,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:17:13,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:17:13,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:17:13,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 268 [2023-08-26 15:17:13,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:13,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:17:13,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 268 [2023-08-26 15:17:13,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:17:13,884 INFO L124 PetriNetUnfolderBase]: 345/677 cut-off events. [2023-08-26 15:17:13,884 INFO L125 PetriNetUnfolderBase]: For 124/129 co-relation queries the response was YES. [2023-08-26 15:17:13,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1635 conditions, 677 events. 345/677 cut-off events. For 124/129 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3584 event pairs, 103 based on Foata normal form. 5/561 useless extension candidates. Maximal degree in co-relation 1630. Up to 506 conditions per place. [2023-08-26 15:17:13,887 INFO L140 encePairwiseOnDemand]: 264/268 looper letters, 37 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2023-08-26 15:17:13,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 214 flow [2023-08-26 15:17:13,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:17:13,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:17:13,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-08-26 15:17:13,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4141791044776119 [2023-08-26 15:17:13,889 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-08-26 15:17:13,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-08-26 15:17:13,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:17:13,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-08-26 15:17:13,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:13,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:13,892 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:13,892 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 96 flow. Second operand 3 states and 333 transitions. [2023-08-26 15:17:13,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 214 flow [2023-08-26 15:17:13,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:17:13,894 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 108 flow [2023-08-26 15:17:13,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2023-08-26 15:17:13,896 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -24 predicate places. [2023-08-26 15:17:13,896 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 108 flow [2023-08-26 15:17:13,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:13,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:17:13,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:17:13,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 15:17:13,897 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-08-26 15:17:13,897 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:17:13,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1700280135, now seen corresponding path program 1 times [2023-08-26 15:17:13,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:17:13,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718661853] [2023-08-26 15:17:13,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:17:13,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:17:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:17:13,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:17:13,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:17:13,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718661853] [2023-08-26 15:17:13,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718661853] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:17:13,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:17:13,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:17:13,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342383590] [2023-08-26 15:17:13,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:17:13,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:17:13,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:17:14,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:17:14,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:17:14,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 268 [2023-08-26 15:17:14,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:14,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:17:14,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 268 [2023-08-26 15:17:14,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:17:14,216 INFO L124 PetriNetUnfolderBase]: 338/651 cut-off events. [2023-08-26 15:17:14,216 INFO L125 PetriNetUnfolderBase]: For 206/211 co-relation queries the response was YES. [2023-08-26 15:17:14,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1712 conditions, 651 events. 338/651 cut-off events. For 206/211 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3310 event pairs, 243 based on Foata normal form. 5/568 useless extension candidates. Maximal degree in co-relation 1706. Up to 549 conditions per place. [2023-08-26 15:17:14,234 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 42 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-26 15:17:14,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 47 transitions, 260 flow [2023-08-26 15:17:14,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:17:14,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:17:14,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2023-08-26 15:17:14,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4129353233830846 [2023-08-26 15:17:14,236 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2023-08-26 15:17:14,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2023-08-26 15:17:14,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:17:14,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2023-08-26 15:17:14,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:14,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:14,239 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:14,239 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 108 flow. Second operand 3 states and 332 transitions. [2023-08-26 15:17:14,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 47 transitions, 260 flow [2023-08-26 15:17:14,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:17:14,241 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 110 flow [2023-08-26 15:17:14,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2023-08-26 15:17:14,244 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -23 predicate places. [2023-08-26 15:17:14,244 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 110 flow [2023-08-26 15:17:14,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:14,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:17:14,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:17:14,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 15:17:14,244 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-08-26 15:17:14,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:17:14,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2000990366, now seen corresponding path program 1 times [2023-08-26 15:17:14,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:17:14,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058086676] [2023-08-26 15:17:14,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:17:14,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:17:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:17:14,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:17:14,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:17:14,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058086676] [2023-08-26 15:17:14,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058086676] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:17:14,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:17:14,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:17:14,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265598253] [2023-08-26 15:17:14,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:17:14,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:17:14,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:17:14,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:17:14,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:17:14,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 268 [2023-08-26 15:17:14,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:14,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:17:14,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 268 [2023-08-26 15:17:14,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:17:14,513 INFO L124 PetriNetUnfolderBase]: 593/1094 cut-off events. [2023-08-26 15:17:14,513 INFO L125 PetriNetUnfolderBase]: For 248/266 co-relation queries the response was YES. [2023-08-26 15:17:14,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2916 conditions, 1094 events. 593/1094 cut-off events. For 248/266 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6043 event pairs, 127 based on Foata normal form. 38/981 useless extension candidates. Maximal degree in co-relation 2909. Up to 447 conditions per place. [2023-08-26 15:17:14,520 INFO L140 encePairwiseOnDemand]: 264/268 looper letters, 57 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2023-08-26 15:17:14,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 62 transitions, 337 flow [2023-08-26 15:17:14,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:17:14,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:17:14,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 437 transitions. [2023-08-26 15:17:14,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076492537313433 [2023-08-26 15:17:14,522 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 437 transitions. [2023-08-26 15:17:14,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 437 transitions. [2023-08-26 15:17:14,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:17:14,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 437 transitions. [2023-08-26 15:17:14,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:14,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:14,525 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:14,525 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 110 flow. Second operand 4 states and 437 transitions. [2023-08-26 15:17:14,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 62 transitions, 337 flow [2023-08-26 15:17:14,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 62 transitions, 331 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:17:14,527 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 125 flow [2023-08-26 15:17:14,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-08-26 15:17:14,528 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -20 predicate places. [2023-08-26 15:17:14,528 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 125 flow [2023-08-26 15:17:14,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:14,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:17:14,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:17:14,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 15:17:14,529 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-08-26 15:17:14,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:17:14,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1169250143, now seen corresponding path program 1 times [2023-08-26 15:17:14,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:17:14,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446938411] [2023-08-26 15:17:14,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:17:14,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:17:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:17:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:17:14,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:17:14,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446938411] [2023-08-26 15:17:14,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446938411] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:17:14,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:17:14,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:17:14,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737146447] [2023-08-26 15:17:14,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:17:14,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:17:14,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:17:14,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:17:14,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:17:14,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 268 [2023-08-26 15:17:14,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:14,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:17:14,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 268 [2023-08-26 15:17:14,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:17:14,828 INFO L124 PetriNetUnfolderBase]: 550/1075 cut-off events. [2023-08-26 15:17:14,828 INFO L125 PetriNetUnfolderBase]: For 351/351 co-relation queries the response was YES. [2023-08-26 15:17:14,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2981 conditions, 1075 events. 550/1075 cut-off events. For 351/351 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 6129 event pairs, 256 based on Foata normal form. 0/961 useless extension candidates. Maximal degree in co-relation 2972. Up to 579 conditions per place. [2023-08-26 15:17:14,831 INFO L140 encePairwiseOnDemand]: 264/268 looper letters, 36 selfloop transitions, 4 changer transitions 1/42 dead transitions. [2023-08-26 15:17:14,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 242 flow [2023-08-26 15:17:14,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:17:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:17:14,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2023-08-26 15:17:14,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3619402985074627 [2023-08-26 15:17:14,832 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 291 transitions. [2023-08-26 15:17:14,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 291 transitions. [2023-08-26 15:17:14,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:17:14,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 291 transitions. [2023-08-26 15:17:14,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:14,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:14,834 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:14,834 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 125 flow. Second operand 3 states and 291 transitions. [2023-08-26 15:17:14,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 242 flow [2023-08-26 15:17:14,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 237 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:17:14,836 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 141 flow [2023-08-26 15:17:14,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-26 15:17:14,838 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -20 predicate places. [2023-08-26 15:17:14,838 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 141 flow [2023-08-26 15:17:14,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:14,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:17:14,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:17:14,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 15:17:14,838 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-08-26 15:17:14,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:17:14,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1169075304, now seen corresponding path program 1 times [2023-08-26 15:17:14,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:17:14,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889218149] [2023-08-26 15:17:14,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:17:14,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:17:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:17:15,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:17:15,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:17:15,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889218149] [2023-08-26 15:17:15,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889218149] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:17:15,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:17:15,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:17:15,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127084042] [2023-08-26 15:17:15,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:17:15,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:17:15,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:17:15,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:17:15,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:17:15,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 268 [2023-08-26 15:17:15,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:15,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:17:15,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 268 [2023-08-26 15:17:15,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:17:15,186 INFO L124 PetriNetUnfolderBase]: 482/965 cut-off events. [2023-08-26 15:17:15,186 INFO L125 PetriNetUnfolderBase]: For 575/587 co-relation queries the response was YES. [2023-08-26 15:17:15,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2809 conditions, 965 events. 482/965 cut-off events. For 575/587 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5604 event pairs, 219 based on Foata normal form. 39/893 useless extension candidates. Maximal degree in co-relation 2799. Up to 797 conditions per place. [2023-08-26 15:17:15,190 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 37 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2023-08-26 15:17:15,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 258 flow [2023-08-26 15:17:15,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:17:15,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:17:15,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 381 transitions. [2023-08-26 15:17:15,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.355410447761194 [2023-08-26 15:17:15,191 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 381 transitions. [2023-08-26 15:17:15,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 381 transitions. [2023-08-26 15:17:15,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:17:15,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 381 transitions. [2023-08-26 15:17:15,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:15,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:15,194 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:15,194 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 141 flow. Second operand 4 states and 381 transitions. [2023-08-26 15:17:15,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 258 flow [2023-08-26 15:17:15,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:17:15,196 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 136 flow [2023-08-26 15:17:15,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-08-26 15:17:15,197 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -20 predicate places. [2023-08-26 15:17:15,197 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 136 flow [2023-08-26 15:17:15,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:15,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:17:15,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:17:15,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 15:17:15,197 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-08-26 15:17:15,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:17:15,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1881651310, now seen corresponding path program 1 times [2023-08-26 15:17:15,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:17:15,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351647889] [2023-08-26 15:17:15,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:17:15,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:17:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:17:15,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:17:15,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:17:15,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351647889] [2023-08-26 15:17:15,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351647889] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:17:15,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:17:15,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:17:15,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515372303] [2023-08-26 15:17:15,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:17:15,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:17:15,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:17:15,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:17:15,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:17:15,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 268 [2023-08-26 15:17:15,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:15,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:17:15,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 268 [2023-08-26 15:17:15,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:17:15,505 INFO L124 PetriNetUnfolderBase]: 412/816 cut-off events. [2023-08-26 15:17:15,505 INFO L125 PetriNetUnfolderBase]: For 505/509 co-relation queries the response was YES. [2023-08-26 15:17:15,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2325 conditions, 816 events. 412/816 cut-off events. For 505/509 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4635 event pairs, 85 based on Foata normal form. 9/772 useless extension candidates. Maximal degree in co-relation 2316. Up to 363 conditions per place. [2023-08-26 15:17:15,507 INFO L140 encePairwiseOnDemand]: 257/268 looper letters, 47 selfloop transitions, 11 changer transitions 5/64 dead transitions. [2023-08-26 15:17:15,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 64 transitions, 402 flow [2023-08-26 15:17:15,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:17:15,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:17:15,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 467 transitions. [2023-08-26 15:17:15,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3485074626865672 [2023-08-26 15:17:15,509 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 467 transitions. [2023-08-26 15:17:15,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 467 transitions. [2023-08-26 15:17:15,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:17:15,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 467 transitions. [2023-08-26 15:17:15,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:15,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:15,512 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:15,512 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 136 flow. Second operand 5 states and 467 transitions. [2023-08-26 15:17:15,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 64 transitions, 402 flow [2023-08-26 15:17:15,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 64 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:17:15,514 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 230 flow [2023-08-26 15:17:15,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-08-26 15:17:15,515 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -15 predicate places. [2023-08-26 15:17:15,515 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 230 flow [2023-08-26 15:17:15,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:15,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:17:15,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:17:15,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 15:17:15,516 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-08-26 15:17:15,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:17:15,517 INFO L85 PathProgramCache]: Analyzing trace with hash 721524266, now seen corresponding path program 1 times [2023-08-26 15:17:15,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:17:15,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058935099] [2023-08-26 15:17:15,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:17:15,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:17:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:17:16,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:17:16,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:17:16,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058935099] [2023-08-26 15:17:16,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058935099] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:17:16,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:17:16,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:17:16,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019072289] [2023-08-26 15:17:16,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:17:16,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:17:16,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:17:16,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:17:16,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:17:16,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 268 [2023-08-26 15:17:16,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 230 flow. Second operand has 7 states, 7 states have (on average 75.42857142857143) internal successors, (528), 7 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:16,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:17:16,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 268 [2023-08-26 15:17:16,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:17:16,670 INFO L124 PetriNetUnfolderBase]: 496/994 cut-off events. [2023-08-26 15:17:16,670 INFO L125 PetriNetUnfolderBase]: For 1023/1024 co-relation queries the response was YES. [2023-08-26 15:17:16,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3408 conditions, 994 events. 496/994 cut-off events. For 1023/1024 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5671 event pairs, 136 based on Foata normal form. 7/960 useless extension candidates. Maximal degree in co-relation 3397. Up to 613 conditions per place. [2023-08-26 15:17:16,673 INFO L140 encePairwiseOnDemand]: 258/268 looper letters, 67 selfloop transitions, 24 changer transitions 3/95 dead transitions. [2023-08-26 15:17:16,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 95 transitions, 711 flow [2023-08-26 15:17:16,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 15:17:16,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 15:17:16,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 814 transitions. [2023-08-26 15:17:16,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3037313432835821 [2023-08-26 15:17:16,676 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 814 transitions. [2023-08-26 15:17:16,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 814 transitions. [2023-08-26 15:17:16,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:17:16,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 814 transitions. [2023-08-26 15:17:16,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 81.4) internal successors, (814), 10 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:16,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 268.0) internal successors, (2948), 11 states have internal predecessors, (2948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:16,680 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 268.0) internal successors, (2948), 11 states have internal predecessors, (2948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:16,680 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 230 flow. Second operand 10 states and 814 transitions. [2023-08-26 15:17:16,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 95 transitions, 711 flow [2023-08-26 15:17:16,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 95 transitions, 711 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:17:16,683 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 436 flow [2023-08-26 15:17:16,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=436, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2023-08-26 15:17:16,684 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2023-08-26 15:17:16,684 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 436 flow [2023-08-26 15:17:16,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.42857142857143) internal successors, (528), 7 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:16,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:17:16,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:17:16,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 15:17:16,684 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-08-26 15:17:16,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:17:16,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1798348608, now seen corresponding path program 1 times [2023-08-26 15:17:16,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:17:16,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198964862] [2023-08-26 15:17:16,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:17:16,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:17:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:17:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:17:16,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:17:16,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198964862] [2023-08-26 15:17:16,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198964862] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:17:16,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:17:16,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:17:16,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078461156] [2023-08-26 15:17:16,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:17:16,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:17:16,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:17:16,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:17:16,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:17:16,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 268 [2023-08-26 15:17:16,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 436 flow. Second operand has 6 states, 6 states have (on average 82.83333333333333) internal successors, (497), 6 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:16,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:17:16,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 268 [2023-08-26 15:17:16,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:17:16,949 INFO L124 PetriNetUnfolderBase]: 434/803 cut-off events. [2023-08-26 15:17:16,949 INFO L125 PetriNetUnfolderBase]: For 1759/1763 co-relation queries the response was YES. [2023-08-26 15:17:16,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3230 conditions, 803 events. 434/803 cut-off events. For 1759/1763 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3893 event pairs, 208 based on Foata normal form. 29/829 useless extension candidates. Maximal degree in co-relation 3212. Up to 571 conditions per place. [2023-08-26 15:17:16,951 INFO L140 encePairwiseOnDemand]: 260/268 looper letters, 16 selfloop transitions, 2 changer transitions 43/62 dead transitions. [2023-08-26 15:17:16,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 62 transitions, 577 flow [2023-08-26 15:17:16,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:17:16,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:17:16,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2023-08-26 15:17:16,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3276119402985075 [2023-08-26 15:17:16,953 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 439 transitions. [2023-08-26 15:17:16,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 439 transitions. [2023-08-26 15:17:16,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:17:16,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 439 transitions. [2023-08-26 15:17:16,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:16,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:16,955 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:16,955 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 436 flow. Second operand 5 states and 439 transitions. [2023-08-26 15:17:16,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 62 transitions, 577 flow [2023-08-26 15:17:16,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 62 transitions, 524 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-26 15:17:16,960 INFO L231 Difference]: Finished difference. Result has 57 places, 19 transitions, 107 flow [2023-08-26 15:17:16,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=57, PETRI_TRANSITIONS=19} [2023-08-26 15:17:16,960 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -5 predicate places. [2023-08-26 15:17:16,960 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 19 transitions, 107 flow [2023-08-26 15:17:16,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.83333333333333) internal successors, (497), 6 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:16,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:17:16,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:17:16,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 15:17:16,961 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-08-26 15:17:16,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:17:16,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1069181089, now seen corresponding path program 1 times [2023-08-26 15:17:16,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:17:16,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521464215] [2023-08-26 15:17:16,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:17:16,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:17:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:17:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:17:17,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:17:17,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521464215] [2023-08-26 15:17:17,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521464215] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:17:17,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:17:17,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 15:17:17,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204892631] [2023-08-26 15:17:17,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:17:17,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 15:17:17,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:17:17,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 15:17:17,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-26 15:17:17,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 268 [2023-08-26 15:17:17,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 19 transitions, 107 flow. Second operand has 8 states, 8 states have (on average 76.375) internal successors, (611), 8 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:17,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:17:17,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 268 [2023-08-26 15:17:17,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:17:17,769 INFO L124 PetriNetUnfolderBase]: 72/141 cut-off events. [2023-08-26 15:17:17,769 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2023-08-26 15:17:17,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 141 events. 72/141 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 403 event pairs, 19 based on Foata normal form. 1/142 useless extension candidates. Maximal degree in co-relation 483. Up to 124 conditions per place. [2023-08-26 15:17:17,770 INFO L140 encePairwiseOnDemand]: 260/268 looper letters, 21 selfloop transitions, 11 changer transitions 0/33 dead transitions. [2023-08-26 15:17:17,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 33 transitions, 240 flow [2023-08-26 15:17:17,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:17:17,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:17:17,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 478 transitions. [2023-08-26 15:17:17,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2972636815920398 [2023-08-26 15:17:17,772 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 478 transitions. [2023-08-26 15:17:17,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 478 transitions. [2023-08-26 15:17:17,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:17:17,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 478 transitions. [2023-08-26 15:17:17,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 79.66666666666667) internal successors, (478), 6 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:17,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:17,776 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:17,776 INFO L175 Difference]: Start difference. First operand has 57 places, 19 transitions, 107 flow. Second operand 6 states and 478 transitions. [2023-08-26 15:17:17,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 33 transitions, 240 flow [2023-08-26 15:17:17,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 33 transitions, 199 flow, removed 6 selfloop flow, removed 13 redundant places. [2023-08-26 15:17:17,777 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 172 flow [2023-08-26 15:17:17,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2023-08-26 15:17:17,778 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -19 predicate places. [2023-08-26 15:17:17,778 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 172 flow [2023-08-26 15:17:17,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 76.375) internal successors, (611), 8 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:17,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:17:17,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:17:17,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 15:17:17,778 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-08-26 15:17:17,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:17:17,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1217982437, now seen corresponding path program 1 times [2023-08-26 15:17:17,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:17:17,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426990243] [2023-08-26 15:17:17,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:17:17,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:17:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:17:17,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:17:17,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:17:17,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426990243] [2023-08-26 15:17:17,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426990243] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:17:17,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:17:17,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:17:17,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979685375] [2023-08-26 15:17:17,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:17:17,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:17:17,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:17:17,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:17:17,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:17:17,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 268 [2023-08-26 15:17:17,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:17,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:17:17,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 268 [2023-08-26 15:17:17,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:17:17,931 INFO L124 PetriNetUnfolderBase]: 27/71 cut-off events. [2023-08-26 15:17:17,931 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2023-08-26 15:17:17,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 71 events. 27/71 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 169 event pairs, 4 based on Foata normal form. 10/81 useless extension candidates. Maximal degree in co-relation 267. Up to 54 conditions per place. [2023-08-26 15:17:17,931 INFO L140 encePairwiseOnDemand]: 264/268 looper letters, 24 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2023-08-26 15:17:17,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 29 transitions, 218 flow [2023-08-26 15:17:17,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:17:17,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:17:17,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2023-08-26 15:17:17,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3843283582089552 [2023-08-26 15:17:17,933 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2023-08-26 15:17:17,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2023-08-26 15:17:17,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:17:17,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2023-08-26 15:17:17,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:17,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:17,934 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:17,934 INFO L175 Difference]: Start difference. First operand has 43 places, 28 transitions, 172 flow. Second operand 3 states and 309 transitions. [2023-08-26 15:17:17,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 29 transitions, 218 flow [2023-08-26 15:17:17,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 29 transitions, 193 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-08-26 15:17:17,935 INFO L231 Difference]: Finished difference. Result has 42 places, 24 transitions, 127 flow [2023-08-26 15:17:17,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2023-08-26 15:17:17,936 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -20 predicate places. [2023-08-26 15:17:17,936 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 24 transitions, 127 flow [2023-08-26 15:17:17,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:17,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:17:17,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:17:17,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 15:17:17,936 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-08-26 15:17:17,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:17:17,936 INFO L85 PathProgramCache]: Analyzing trace with hash -517290976, now seen corresponding path program 1 times [2023-08-26 15:17:17,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:17:17,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702965821] [2023-08-26 15:17:17,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:17:17,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:17:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:17:18,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:17:18,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:17:18,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702965821] [2023-08-26 15:17:18,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702965821] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:17:18,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:17:18,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 15:17:18,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745170163] [2023-08-26 15:17:18,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:17:18,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 15:17:18,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:17:18,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 15:17:18,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-08-26 15:17:18,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 268 [2023-08-26 15:17:18,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 24 transitions, 127 flow. Second operand has 9 states, 9 states have (on average 75.44444444444444) internal successors, (679), 9 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:18,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:17:18,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 268 [2023-08-26 15:17:18,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:17:18,864 INFO L124 PetriNetUnfolderBase]: 27/72 cut-off events. [2023-08-26 15:17:18,864 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-08-26 15:17:18,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 72 events. 27/72 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 166 event pairs, 5 based on Foata normal form. 1/73 useless extension candidates. Maximal degree in co-relation 274. Up to 49 conditions per place. [2023-08-26 15:17:18,864 INFO L140 encePairwiseOnDemand]: 260/268 looper letters, 22 selfloop transitions, 10 changer transitions 0/33 dead transitions. [2023-08-26 15:17:18,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 236 flow [2023-08-26 15:17:18,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:17:18,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:17:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 471 transitions. [2023-08-26 15:17:18,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.292910447761194 [2023-08-26 15:17:18,866 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 471 transitions. [2023-08-26 15:17:18,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 471 transitions. [2023-08-26 15:17:18,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:17:18,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 471 transitions. [2023-08-26 15:17:18,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 78.5) internal successors, (471), 6 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:18,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:18,868 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:18,868 INFO L175 Difference]: Start difference. First operand has 42 places, 24 transitions, 127 flow. Second operand 6 states and 471 transitions. [2023-08-26 15:17:18,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 236 flow [2023-08-26 15:17:18,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 33 transitions, 231 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:17:18,869 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 188 flow [2023-08-26 15:17:18,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=48, PETRI_TRANSITIONS=28} [2023-08-26 15:17:18,870 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -14 predicate places. [2023-08-26 15:17:18,870 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 188 flow [2023-08-26 15:17:18,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 75.44444444444444) internal successors, (679), 9 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:18,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:17:18,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:17:18,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 15:17:18,870 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-08-26 15:17:18,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:17:18,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1428508293, now seen corresponding path program 1 times [2023-08-26 15:17:18,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:17:18,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850123986] [2023-08-26 15:17:18,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:17:18,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:17:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:17:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:17:18,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:17:18,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850123986] [2023-08-26 15:17:18,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850123986] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:17:18,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:17:18,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:17:18,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527253775] [2023-08-26 15:17:18,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:17:18,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:17:18,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:17:18,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:17:18,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:17:18,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 268 [2023-08-26 15:17:18,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 28 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:18,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:17:18,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 268 [2023-08-26 15:17:18,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:17:19,025 INFO L124 PetriNetUnfolderBase]: 9/35 cut-off events. [2023-08-26 15:17:19,025 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2023-08-26 15:17:19,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 35 events. 9/35 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 1 based on Foata normal form. 7/42 useless extension candidates. Maximal degree in co-relation 151. Up to 16 conditions per place. [2023-08-26 15:17:19,026 INFO L140 encePairwiseOnDemand]: 264/268 looper letters, 21 selfloop transitions, 5 changer transitions 0/28 dead transitions. [2023-08-26 15:17:19,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 28 transitions, 238 flow [2023-08-26 15:17:19,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:17:19,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:17:19,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 405 transitions. [2023-08-26 15:17:19,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37779850746268656 [2023-08-26 15:17:19,027 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 405 transitions. [2023-08-26 15:17:19,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 405 transitions. [2023-08-26 15:17:19,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:17:19,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 405 transitions. [2023-08-26 15:17:19,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:19,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:19,030 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:19,030 INFO L175 Difference]: Start difference. First operand has 48 places, 28 transitions, 188 flow. Second operand 4 states and 405 transitions. [2023-08-26 15:17:19,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 28 transitions, 238 flow [2023-08-26 15:17:19,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 28 transitions, 182 flow, removed 9 selfloop flow, removed 9 redundant places. [2023-08-26 15:17:19,034 INFO L231 Difference]: Finished difference. Result has 43 places, 23 transitions, 121 flow [2023-08-26 15:17:19,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=43, PETRI_TRANSITIONS=23} [2023-08-26 15:17:19,035 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -19 predicate places. [2023-08-26 15:17:19,035 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 23 transitions, 121 flow [2023-08-26 15:17:19,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:17:19,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:17:19,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:17:19,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 15:17:19,035 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-08-26 15:17:19,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:17:19,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1637145810, now seen corresponding path program 1 times [2023-08-26 15:17:19,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:17:19,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514745656] [2023-08-26 15:17:19,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:17:19,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:17:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:17:19,081 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 15:17:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:17:19,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 15:17:19,170 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 15:17:19,171 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONASSERT (62 of 63 remaining) [2023-08-26 15:17:19,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (61 of 63 remaining) [2023-08-26 15:17:19,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 63 remaining) [2023-08-26 15:17:19,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 63 remaining) [2023-08-26 15:17:19,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 63 remaining) [2023-08-26 15:17:19,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 63 remaining) [2023-08-26 15:17:19,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 63 remaining) [2023-08-26 15:17:19,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 63 remaining) [2023-08-26 15:17:19,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 63 remaining) [2023-08-26 15:17:19,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 63 remaining) [2023-08-26 15:17:19,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 63 remaining) [2023-08-26 15:17:19,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 63 remaining) [2023-08-26 15:17:19,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 63 remaining) [2023-08-26 15:17:19,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 63 remaining) [2023-08-26 15:17:19,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 63 remaining) [2023-08-26 15:17:19,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 63 remaining) [2023-08-26 15:17:19,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 63 remaining) [2023-08-26 15:17:19,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 63 remaining) [2023-08-26 15:17:19,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 63 remaining) [2023-08-26 15:17:19,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 63 remaining) [2023-08-26 15:17:19,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 63 remaining) [2023-08-26 15:17:19,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 63 remaining) [2023-08-26 15:17:19,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 63 remaining) [2023-08-26 15:17:19,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 63 remaining) [2023-08-26 15:17:19,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 63 remaining) [2023-08-26 15:17:19,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 63 remaining) [2023-08-26 15:17:19,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 63 remaining) [2023-08-26 15:17:19,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 63 remaining) [2023-08-26 15:17:19,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 63 remaining) [2023-08-26 15:17:19,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 63 remaining) [2023-08-26 15:17:19,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 63 remaining) [2023-08-26 15:17:19,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 63 remaining) [2023-08-26 15:17:19,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 63 remaining) [2023-08-26 15:17:19,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 63 remaining) [2023-08-26 15:17:19,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 63 remaining) [2023-08-26 15:17:19,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 63 remaining) [2023-08-26 15:17:19,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 63 remaining) [2023-08-26 15:17:19,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 63 remaining) [2023-08-26 15:17:19,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (24 of 63 remaining) [2023-08-26 15:17:19,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 63 remaining) [2023-08-26 15:17:19,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 63 remaining) [2023-08-26 15:17:19,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 63 remaining) [2023-08-26 15:17:19,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 63 remaining) [2023-08-26 15:17:19,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 63 remaining) [2023-08-26 15:17:19,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 63 remaining) [2023-08-26 15:17:19,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 63 remaining) [2023-08-26 15:17:19,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 63 remaining) [2023-08-26 15:17:19,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 63 remaining) [2023-08-26 15:17:19,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 63 remaining) [2023-08-26 15:17:19,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 63 remaining) [2023-08-26 15:17:19,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 63 remaining) [2023-08-26 15:17:19,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 63 remaining) [2023-08-26 15:17:19,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 63 remaining) [2023-08-26 15:17:19,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 63 remaining) [2023-08-26 15:17:19,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 63 remaining) [2023-08-26 15:17:19,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 63 remaining) [2023-08-26 15:17:19,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 63 remaining) [2023-08-26 15:17:19,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 63 remaining) [2023-08-26 15:17:19,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 63 remaining) [2023-08-26 15:17:19,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 63 remaining) [2023-08-26 15:17:19,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 63 remaining) [2023-08-26 15:17:19,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 63 remaining) [2023-08-26 15:17:19,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 63 remaining) [2023-08-26 15:17:19,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 15:17:19,177 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:17:19,181 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 15:17:19,181 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 15:17:19,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:17:19 BasicIcfg [2023-08-26 15:17:19,240 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 15:17:19,258 INFO L158 Benchmark]: Toolchain (without parser) took 16700.78ms. Allocated memory was 362.8MB in the beginning and 1.0GB in the end (delta: 639.6MB). Free memory was 335.9MB in the beginning and 687.8MB in the end (delta: -351.9MB). Peak memory consumption was 290.9MB. Max. memory is 16.0GB. [2023-08-26 15:17:19,259 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 362.8MB. Free memory was 340.0MB in the beginning and 339.8MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 15:17:19,259 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.11ms. Allocated memory is still 362.8MB. Free memory was 335.9MB in the beginning and 312.0MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 15:17:19,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.90ms. Allocated memory is still 362.8MB. Free memory was 312.0MB in the beginning and 309.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:17:19,259 INFO L158 Benchmark]: Boogie Preprocessor took 24.88ms. Allocated memory is still 362.8MB. Free memory was 309.9MB in the beginning and 307.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:17:19,259 INFO L158 Benchmark]: RCFGBuilder took 1138.41ms. Allocated memory was 362.8MB in the beginning and 436.2MB in the end (delta: 73.4MB). Free memory was 306.9MB in the beginning and 322.6MB in the end (delta: -15.6MB). Peak memory consumption was 69.2MB. Max. memory is 16.0GB. [2023-08-26 15:17:19,259 INFO L158 Benchmark]: TraceAbstraction took 15014.65ms. Allocated memory was 436.2MB in the beginning and 1.0GB in the end (delta: 566.2MB). Free memory was 322.6MB in the beginning and 687.8MB in the end (delta: -365.2MB). Peak memory consumption was 203.1MB. Max. memory is 16.0GB. [2023-08-26 15:17:19,260 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.52ms. Allocated memory is still 362.8MB. Free memory was 340.0MB in the beginning and 339.8MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 443.11ms. Allocated memory is still 362.8MB. Free memory was 335.9MB in the beginning and 312.0MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.90ms. Allocated memory is still 362.8MB. Free memory was 312.0MB in the beginning and 309.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 24.88ms. Allocated memory is still 362.8MB. Free memory was 309.9MB in the beginning and 307.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1138.41ms. Allocated memory was 362.8MB in the beginning and 436.2MB in the end (delta: 73.4MB). Free memory was 306.9MB in the beginning and 322.6MB in the end (delta: -15.6MB). Peak memory consumption was 69.2MB. Max. memory is 16.0GB. * TraceAbstraction took 15014.65ms. Allocated memory was 436.2MB in the beginning and 1.0GB in the end (delta: 566.2MB). Free memory was 322.6MB in the beginning and 687.8MB in the end (delta: -365.2MB). Peak memory consumption was 203.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.3s, 145 PlacesBefore, 62 PlacesAfterwards, 141 TransitionsBefore, 56 TransitionsAfterwards, 3750 CoEnabledTransitionPairs, 7 FixpointIterations, 60 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 125 TotalNumberOfCompositions, 17152 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4809, independent: 4406, independent conditional: 0, independent unconditional: 4406, dependent: 403, dependent conditional: 0, dependent unconditional: 403, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1593, independent: 1539, independent conditional: 0, independent unconditional: 1539, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4809, independent: 2867, independent conditional: 0, independent unconditional: 2867, dependent: 349, dependent conditional: 0, dependent unconditional: 349, unknown: 1593, unknown conditional: 0, unknown unconditional: 1593] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L713] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L714] 0 int __unbuffered_p1_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L722] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L723] 0 int __unbuffered_p1_EAX$w_buff0; [L724] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L725] 0 int __unbuffered_p1_EAX$w_buff1; [L726] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L727] 0 _Bool main$tmp_guard0; [L728] 0 _Bool main$tmp_guard1; [L730] 0 int x = 0; [L731] 0 _Bool x$flush_delayed; [L732] 0 int x$mem_tmp; [L733] 0 _Bool x$r_buff0_thd0; [L734] 0 _Bool x$r_buff0_thd1; [L735] 0 _Bool x$r_buff0_thd2; [L736] 0 _Bool x$r_buff1_thd0; [L737] 0 _Bool x$r_buff1_thd1; [L738] 0 _Bool x$r_buff1_thd2; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice1; [L749] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1923; [L826] FCALL, FORK 0 pthread_create(&t1923, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1923, ((void *)0), P0, ((void *)0))=-2, t1923={7:0}, weak$$choice0=0, weak$$choice1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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={3:0}, y=0] [L827] 0 pthread_t t1924; [L828] FCALL, FORK 0 pthread_create(&t1924, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1924, ((void *)0), P1, ((void *)0))=-1, t1923={7:0}, t1924={5:0}, weak$$choice0=0, weak$$choice1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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={3:0}, y=0] [L781] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 2 x$flush_delayed = weak$$choice2 [L784] EXPR 2 \read(x) [L784] 2 x$mem_tmp = x [L785] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] EXPR 2 \read(x) [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L793] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L794] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L795] EXPR 2 \read(x) [L795] 2 __unbuffered_p1_EAX = x [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] EXPR 2 \read(x) [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] 2 x = x$flush_delayed ? x$mem_tmp : x [L797] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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={3:0}, y=0] [L800] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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={3:0}, y=1] [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 \read(x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] 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) [L804] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L805] 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 [L806] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L807] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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={3:0}, y=1] [L753] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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={3:0}, y=1] [L756] 1 x$w_buff1 = x$w_buff0 [L757] 1 x$w_buff0 = 1 [L758] 1 x$w_buff1_used = x$w_buff0_used [L759] 1 x$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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={3:0}, y=1] [L767] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L767] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L768] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L769] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L770] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L771] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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={3:0}, y=1] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 2 return 0; [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 \read(x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 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) [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 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 [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923={7:0}, t1924={5:0}, weak$$choice0=6, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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={3:0}, y=1] [L841] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L845] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe006_power.opt-thin000_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={51:49}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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={3:0}, y=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 184 locations, 63 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: 14.8s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 328 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 328 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 938 IncrementalHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 3 mSDtfsCounter, 938 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=436occurred in iteration=11, InterpolantAutomatonStates: 67, 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.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 1357 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 15:17:19,283 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...