/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 -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/safe025_rmo.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:17:08,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:17:08,217 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 12:17:08,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:17:08,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:17:08,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:17:08,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:17:08,249 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:17:08,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:17:08,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:17:08,252 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:17:08,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:17:08,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:17:08,253 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:17:08,253 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:17:08,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:17:08,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:17:08,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:17:08,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:17:08,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:17:08,254 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:17:08,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:17:08,255 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:17:08,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:17:08,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:17:08,256 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:17:08,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:17:08,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:17:08,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:17:08,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:17:08,257 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:17:08,258 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:17:08,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:17:08,258 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:17:08,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:17:08,258 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.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 12:17:08,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:17:08,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:17:08,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:17:08,526 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:17:08,529 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:17:08,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe025_rmo.i [2023-08-26 12:17:09,593 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:17:09,784 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:17:09,785 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe025_rmo.i [2023-08-26 12:17:09,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/090dbb20d/144a0931db4a42bd9845bc62b48975a1/FLAGdab39c37a [2023-08-26 12:17:09,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/090dbb20d/144a0931db4a42bd9845bc62b48975a1 [2023-08-26 12:17:09,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:17:09,814 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:17:09,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:17:09,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:17:09,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:17:09,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:17:09" (1/1) ... [2023-08-26 12:17:09,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3461626c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:09, skipping insertion in model container [2023-08-26 12:17:09,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:17:09" (1/1) ... [2023-08-26 12:17:09,848 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:17:10,154 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:17:10,164 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:17:10,188 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 12:17:10,189 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 12:17:10,227 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:17:10,255 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:17:10,255 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:17:10,259 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:17:10,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:10 WrapperNode [2023-08-26 12:17:10,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:17:10,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:17:10,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:17:10,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:17:10,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:10" (1/1) ... [2023-08-26 12:17:10,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:10" (1/1) ... [2023-08-26 12:17:10,322 INFO L138 Inliner]: procedures = 176, calls = 85, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 173 [2023-08-26 12:17:10,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:17:10,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:17:10,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:17:10,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:17:10,329 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:10" (1/1) ... [2023-08-26 12:17:10,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:10" (1/1) ... [2023-08-26 12:17:10,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:10" (1/1) ... [2023-08-26 12:17:10,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:10" (1/1) ... [2023-08-26 12:17:10,352 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:10" (1/1) ... [2023-08-26 12:17:10,363 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:10" (1/1) ... [2023-08-26 12:17:10,365 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:10" (1/1) ... [2023-08-26 12:17:10,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:10" (1/1) ... [2023-08-26 12:17:10,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:17:10,369 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:17:10,369 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:17:10,369 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:17:10,370 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:10" (1/1) ... [2023-08-26 12:17:10,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:17:10,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:17:10,405 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 12:17:10,410 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 12:17:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 12:17:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:17:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 12:17:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:17:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:17:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:17:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 12:17:10,430 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 12:17:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 12:17:10,431 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 12:17:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 12:17:10,431 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 12:17:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:17:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 12:17:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:17:10,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:17:10,433 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 12:17:10,574 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:17:10,575 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:17:11,050 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:17:11,498 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:17:11,498 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:17:11,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:17:11 BoogieIcfgContainer [2023-08-26 12:17:11,500 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:17:11,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:17:11,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:17:11,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:17:11,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:17:09" (1/3) ... [2023-08-26 12:17:11,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c51164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:17:11, skipping insertion in model container [2023-08-26 12:17:11,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:10" (2/3) ... [2023-08-26 12:17:11,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c51164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:17:11, skipping insertion in model container [2023-08-26 12:17:11,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:17:11" (3/3) ... [2023-08-26 12:17:11,506 INFO L112 eAbstractionObserver]: Analyzing ICFG safe025_rmo.i [2023-08-26 12:17:11,518 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:17:11,518 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2023-08-26 12:17:11,518 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:17:11,614 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 12:17:11,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 196 places, 189 transitions, 393 flow [2023-08-26 12:17:11,733 INFO L124 PetriNetUnfolderBase]: 3/186 cut-off events. [2023-08-26 12:17:11,733 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:17:11,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 3/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 129. Up to 2 conditions per place. [2023-08-26 12:17:11,739 INFO L82 GeneralOperation]: Start removeDead. Operand has 196 places, 189 transitions, 393 flow [2023-08-26 12:17:11,748 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 193 places, 186 transitions, 381 flow [2023-08-26 12:17:11,751 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:17:11,757 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 186 transitions, 381 flow [2023-08-26 12:17:11,759 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 186 transitions, 381 flow [2023-08-26 12:17:11,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 186 transitions, 381 flow [2023-08-26 12:17:11,796 INFO L124 PetriNetUnfolderBase]: 3/186 cut-off events. [2023-08-26 12:17:11,797 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:17:11,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 3/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 129. Up to 2 conditions per place. [2023-08-26 12:17:11,801 INFO L119 LiptonReduction]: Number of co-enabled transitions 8688 [2023-08-26 12:17:22,965 INFO L134 LiptonReduction]: Checked pairs total: 54970 [2023-08-26 12:17:22,965 INFO L136 LiptonReduction]: Total number of compositions: 143 [2023-08-26 12:17:22,976 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:17:22,980 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;@1c2177a8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:17:22,981 INFO L358 AbstractCegarLoop]: Starting to check reachability of 100 error locations. [2023-08-26 12:17:22,985 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:17:22,985 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 12:17:22,985 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:17:22,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:22,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:17:22,986 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:17:22,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:22,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1182, now seen corresponding path program 1 times [2023-08-26 12:17:22,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:22,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692303464] [2023-08-26 12:17:22,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:22,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:23,084 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 12:17:23,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:23,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692303464] [2023-08-26 12:17:23,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692303464] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:23,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:23,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:17:23,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854169705] [2023-08-26 12:17:23,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:23,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:17:23,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:23,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:17:23,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:17:23,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 332 [2023-08-26 12:17:23,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 88 transitions, 185 flow. Second operand has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:23,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:23,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 332 [2023-08-26 12:17:23,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:27,216 INFO L124 PetriNetUnfolderBase]: 26588/37065 cut-off events. [2023-08-26 12:17:27,216 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-08-26 12:17:27,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74191 conditions, 37065 events. 26588/37065 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 3040. Compared 261713 event pairs, 26588 based on Foata normal form. 600/15773 useless extension candidates. Maximal degree in co-relation 74180. Up to 36988 conditions per place. [2023-08-26 12:17:27,408 INFO L140 encePairwiseOnDemand]: 295/332 looper letters, 47 selfloop transitions, 0 changer transitions 0/51 dead transitions. [2023-08-26 12:17:27,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 51 transitions, 205 flow [2023-08-26 12:17:27,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:17:27,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:17:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 336 transitions. [2023-08-26 12:17:27,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5060240963855421 [2023-08-26 12:17:27,421 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 336 transitions. [2023-08-26 12:17:27,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 336 transitions. [2023-08-26 12:17:27,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:27,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 336 transitions. [2023-08-26 12:17:27,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 168.0) internal successors, (336), 2 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:27,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:27,431 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:27,432 INFO L175 Difference]: Start difference. First operand has 97 places, 88 transitions, 185 flow. Second operand 2 states and 336 transitions. [2023-08-26 12:17:27,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 51 transitions, 205 flow [2023-08-26 12:17:27,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 202 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 12:17:27,439 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 108 flow [2023-08-26 12:17:27,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=108, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2023-08-26 12:17:27,449 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -38 predicate places. [2023-08-26 12:17:27,449 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 108 flow [2023-08-26 12:17:27,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:27,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:27,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 12:17:27,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:17:27,450 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:17:27,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:27,451 INFO L85 PathProgramCache]: Analyzing trace with hash 36153428, now seen corresponding path program 1 times [2023-08-26 12:17:27,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:27,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312045387] [2023-08-26 12:17:27,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:27,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:27,628 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 12:17:27,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:27,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312045387] [2023-08-26 12:17:27,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312045387] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:27,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:27,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:17:27,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474575479] [2023-08-26 12:17:27,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:27,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:17:27,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:27,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:17:27,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:17:27,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 332 [2023-08-26 12:17:27,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:27,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:27,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 332 [2023-08-26 12:17:27,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:30,257 INFO L124 PetriNetUnfolderBase]: 17709/25924 cut-off events. [2023-08-26 12:17:30,258 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:17:30,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51674 conditions, 25924 events. 17709/25924 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1683. Compared 177001 event pairs, 12207 based on Foata normal form. 0/14652 useless extension candidates. Maximal degree in co-relation 51671. Up to 17632 conditions per place. [2023-08-26 12:17:30,400 INFO L140 encePairwiseOnDemand]: 311/332 looper letters, 57 selfloop transitions, 10 changer transitions 0/68 dead transitions. [2023-08-26 12:17:30,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 276 flow [2023-08-26 12:17:30,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:17:30,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:17:30,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-08-26 12:17:30,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3855421686746988 [2023-08-26 12:17:30,404 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-08-26 12:17:30,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-08-26 12:17:30,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:30,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-08-26 12:17:30,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:30,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:30,408 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:30,409 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 108 flow. Second operand 3 states and 384 transitions. [2023-08-26 12:17:30,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 276 flow [2023-08-26 12:17:30,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 68 transitions, 276 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:17:30,413 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 190 flow [2023-08-26 12:17:30,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2023-08-26 12:17:30,414 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -37 predicate places. [2023-08-26 12:17:30,414 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 190 flow [2023-08-26 12:17:30,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:30,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:30,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 12:17:30,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:17:30,420 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:17:30,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:30,425 INFO L85 PathProgramCache]: Analyzing trace with hash 36153429, now seen corresponding path program 1 times [2023-08-26 12:17:30,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:30,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726398850] [2023-08-26 12:17:30,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:30,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:30,555 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 12:17:30,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:30,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726398850] [2023-08-26 12:17:30,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726398850] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:30,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:30,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:17:30,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578704923] [2023-08-26 12:17:30,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:30,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:17:30,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:30,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:17:30,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:17:30,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 332 [2023-08-26 12:17:30,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:30,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:30,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 332 [2023-08-26 12:17:30,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:31,553 INFO L124 PetriNetUnfolderBase]: 4602/7180 cut-off events. [2023-08-26 12:17:31,554 INFO L125 PetriNetUnfolderBase]: For 2402/2402 co-relation queries the response was YES. [2023-08-26 12:17:31,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20185 conditions, 7180 events. 4602/7180 cut-off events. For 2402/2402 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 44183 event pairs, 3459 based on Foata normal form. 2305/8905 useless extension candidates. Maximal degree in co-relation 20180. Up to 7025 conditions per place. [2023-08-26 12:17:31,606 INFO L140 encePairwiseOnDemand]: 320/332 looper letters, 42 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2023-08-26 12:17:31,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 45 transitions, 256 flow [2023-08-26 12:17:31,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:17:31,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:17:31,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-08-26 12:17:31,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36646586345381527 [2023-08-26 12:17:31,609 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-08-26 12:17:31,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-08-26 12:17:31,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:31,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-08-26 12:17:31,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:31,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:31,614 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:31,614 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 190 flow. Second operand 3 states and 365 transitions. [2023-08-26 12:17:31,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 45 transitions, 256 flow [2023-08-26 12:17:31,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 45 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:17:31,649 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 148 flow [2023-08-26 12:17:31,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-08-26 12:17:31,650 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -48 predicate places. [2023-08-26 12:17:31,650 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 148 flow [2023-08-26 12:17:31,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:31,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:31,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:17:31,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:17:31,654 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:17:31,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:31,654 INFO L85 PathProgramCache]: Analyzing trace with hash -971694432, now seen corresponding path program 1 times [2023-08-26 12:17:31,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:31,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641045944] [2023-08-26 12:17:31,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:31,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:32,070 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 12:17:32,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:32,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641045944] [2023-08-26 12:17:32,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641045944] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:32,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:32,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:17:32,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828647606] [2023-08-26 12:17:32,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:32,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:17:32,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:32,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:17:32,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:17:32,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 332 [2023-08-26 12:17:32,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:32,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:32,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 332 [2023-08-26 12:17:32,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:32,838 INFO L124 PetriNetUnfolderBase]: 4367/6945 cut-off events. [2023-08-26 12:17:32,839 INFO L125 PetriNetUnfolderBase]: For 981/981 co-relation queries the response was YES. [2023-08-26 12:17:32,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18106 conditions, 6945 events. 4367/6945 cut-off events. For 981/981 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 43776 event pairs, 1433 based on Foata normal form. 0/5711 useless extension candidates. Maximal degree in co-relation 18101. Up to 5114 conditions per place. [2023-08-26 12:17:32,855 INFO L140 encePairwiseOnDemand]: 329/332 looper letters, 66 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2023-08-26 12:17:32,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 70 transitions, 374 flow [2023-08-26 12:17:32,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:17:32,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:17:32,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-08-26 12:17:32,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36947791164658633 [2023-08-26 12:17:32,857 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-08-26 12:17:32,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-08-26 12:17:32,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:32,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-08-26 12:17:32,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:32,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:32,859 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:32,860 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 148 flow. Second operand 3 states and 368 transitions. [2023-08-26 12:17:32,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 70 transitions, 374 flow [2023-08-26 12:17:32,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 373 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:17:32,862 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 158 flow [2023-08-26 12:17:32,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2023-08-26 12:17:32,863 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -47 predicate places. [2023-08-26 12:17:32,863 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 158 flow [2023-08-26 12:17:32,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:32,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:32,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:17:32,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:17:32,864 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:17:32,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:32,864 INFO L85 PathProgramCache]: Analyzing trace with hash -971694695, now seen corresponding path program 1 times [2023-08-26 12:17:32,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:32,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993948668] [2023-08-26 12:17:32,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:32,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:32,966 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 12:17:32,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:32,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993948668] [2023-08-26 12:17:32,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993948668] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:32,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:32,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:17:32,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74584435] [2023-08-26 12:17:32,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:32,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:17:32,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:32,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:17:32,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:17:32,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 332 [2023-08-26 12:17:32,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:32,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:32,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 332 [2023-08-26 12:17:32,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:33,550 INFO L124 PetriNetUnfolderBase]: 4105/6546 cut-off events. [2023-08-26 12:17:33,550 INFO L125 PetriNetUnfolderBase]: For 1571/1643 co-relation queries the response was YES. [2023-08-26 12:17:33,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17626 conditions, 6546 events. 4105/6546 cut-off events. For 1571/1643 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 41799 event pairs, 1453 based on Foata normal form. 0/5477 useless extension candidates. Maximal degree in co-relation 17620. Up to 4698 conditions per place. [2023-08-26 12:17:33,572 INFO L140 encePairwiseOnDemand]: 328/332 looper letters, 58 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2023-08-26 12:17:33,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 352 flow [2023-08-26 12:17:33,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:17:33,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:17:33,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-08-26 12:17:33,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42771084337349397 [2023-08-26 12:17:33,574 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-08-26 12:17:33,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-08-26 12:17:33,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:33,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-08-26 12:17:33,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:33,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:33,576 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:33,577 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 158 flow. Second operand 3 states and 426 transitions. [2023-08-26 12:17:33,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 352 flow [2023-08-26 12:17:33,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:17:33,579 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 165 flow [2023-08-26 12:17:33,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2023-08-26 12:17:33,579 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -46 predicate places. [2023-08-26 12:17:33,579 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 165 flow [2023-08-26 12:17:33,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:33,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:33,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:17:33,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:17:33,580 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:17:33,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:33,580 INFO L85 PathProgramCache]: Analyzing trace with hash -57757506, now seen corresponding path program 1 times [2023-08-26 12:17:33,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:33,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638030201] [2023-08-26 12:17:33,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:33,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:34,965 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 12:17:34,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:34,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638030201] [2023-08-26 12:17:34,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638030201] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:34,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:34,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:17:34,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867051347] [2023-08-26 12:17:34,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:34,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:17:34,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:34,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:17:34,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:17:34,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 332 [2023-08-26 12:17:34,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 165 flow. Second operand has 7 states, 7 states have (on average 90.71428571428571) internal successors, (635), 7 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:34,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:34,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 332 [2023-08-26 12:17:34,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:35,913 INFO L124 PetriNetUnfolderBase]: 4084/6447 cut-off events. [2023-08-26 12:17:35,914 INFO L125 PetriNetUnfolderBase]: For 1435/1435 co-relation queries the response was YES. [2023-08-26 12:17:35,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18005 conditions, 6447 events. 4084/6447 cut-off events. For 1435/1435 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 39698 event pairs, 1585 based on Foata normal form. 24/5579 useless extension candidates. Maximal degree in co-relation 17998. Up to 5345 conditions per place. [2023-08-26 12:17:35,957 INFO L140 encePairwiseOnDemand]: 321/332 looper letters, 96 selfloop transitions, 25 changer transitions 0/122 dead transitions. [2023-08-26 12:17:35,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 122 transitions, 685 flow [2023-08-26 12:17:35,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 12:17:35,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 12:17:35,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 995 transitions. [2023-08-26 12:17:35,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2996987951807229 [2023-08-26 12:17:35,978 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 995 transitions. [2023-08-26 12:17:35,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 995 transitions. [2023-08-26 12:17:35,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:35,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 995 transitions. [2023-08-26 12:17:35,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.5) internal successors, (995), 10 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:35,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 332.0) internal successors, (3652), 11 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:35,985 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 332.0) internal successors, (3652), 11 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:35,985 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 165 flow. Second operand 10 states and 995 transitions. [2023-08-26 12:17:35,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 122 transitions, 685 flow [2023-08-26 12:17:35,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 122 transitions, 669 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:17:35,988 INFO L231 Difference]: Finished difference. Result has 62 places, 65 transitions, 342 flow [2023-08-26 12:17:35,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=342, PETRI_PLACES=62, PETRI_TRANSITIONS=65} [2023-08-26 12:17:35,991 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -35 predicate places. [2023-08-26 12:17:35,991 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 65 transitions, 342 flow [2023-08-26 12:17:35,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.71428571428571) internal successors, (635), 7 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:35,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:35,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:17:35,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:17:35,991 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:17:35,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:35,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2137671027, now seen corresponding path program 1 times [2023-08-26 12:17:35,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:35,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499305920] [2023-08-26 12:17:35,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:35,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:36,928 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 12:17:36,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:36,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499305920] [2023-08-26 12:17:36,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499305920] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:36,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:36,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:17:36,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053861166] [2023-08-26 12:17:36,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:36,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 12:17:36,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:36,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 12:17:36,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-08-26 12:17:36,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 332 [2023-08-26 12:17:36,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 65 transitions, 342 flow. Second operand has 8 states, 8 states have (on average 93.625) internal successors, (749), 8 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:36,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:36,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 332 [2023-08-26 12:17:36,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:37,916 INFO L124 PetriNetUnfolderBase]: 5507/8539 cut-off events. [2023-08-26 12:17:37,916 INFO L125 PetriNetUnfolderBase]: For 3642/3680 co-relation queries the response was YES. [2023-08-26 12:17:37,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26009 conditions, 8539 events. 5507/8539 cut-off events. For 3642/3680 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 53599 event pairs, 2819 based on Foata normal form. 16/7552 useless extension candidates. Maximal degree in co-relation 25998. Up to 6563 conditions per place. [2023-08-26 12:17:37,953 INFO L140 encePairwiseOnDemand]: 320/332 looper letters, 99 selfloop transitions, 35 changer transitions 0/135 dead transitions. [2023-08-26 12:17:37,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 135 transitions, 906 flow [2023-08-26 12:17:37,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:17:37,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:17:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 747 transitions. [2023-08-26 12:17:37,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2023-08-26 12:17:37,962 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 747 transitions. [2023-08-26 12:17:37,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 747 transitions. [2023-08-26 12:17:37,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:37,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 747 transitions. [2023-08-26 12:17:37,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.71428571428571) internal successors, (747), 7 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:37,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:37,984 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:37,984 INFO L175 Difference]: Start difference. First operand has 62 places, 65 transitions, 342 flow. Second operand 7 states and 747 transitions. [2023-08-26 12:17:37,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 135 transitions, 906 flow [2023-08-26 12:17:37,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 135 transitions, 904 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:17:37,991 INFO L231 Difference]: Finished difference. Result has 71 places, 88 transitions, 596 flow [2023-08-26 12:17:37,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=596, PETRI_PLACES=71, PETRI_TRANSITIONS=88} [2023-08-26 12:17:37,992 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -26 predicate places. [2023-08-26 12:17:37,992 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 88 transitions, 596 flow [2023-08-26 12:17:37,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.625) internal successors, (749), 8 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:37,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:37,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:17:38,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:17:38,009 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:17:38,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:38,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1790496628, now seen corresponding path program 1 times [2023-08-26 12:17:38,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:38,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128830346] [2023-08-26 12:17:38,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:38,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:38,133 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 12:17:38,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:38,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128830346] [2023-08-26 12:17:38,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128830346] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:38,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:38,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:17:38,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898479604] [2023-08-26 12:17:38,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:38,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:17:38,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:38,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:17:38,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:17:38,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 332 [2023-08-26 12:17:38,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 88 transitions, 596 flow. Second operand has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:38,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:38,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 332 [2023-08-26 12:17:38,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:39,433 INFO L124 PetriNetUnfolderBase]: 5941/9440 cut-off events. [2023-08-26 12:17:39,433 INFO L125 PetriNetUnfolderBase]: For 10530/10530 co-relation queries the response was YES. [2023-08-26 12:17:39,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33208 conditions, 9440 events. 5941/9440 cut-off events. For 10530/10530 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 62192 event pairs, 1764 based on Foata normal form. 0/9230 useless extension candidates. Maximal degree in co-relation 33192. Up to 4014 conditions per place. [2023-08-26 12:17:39,490 INFO L140 encePairwiseOnDemand]: 321/332 looper letters, 68 selfloop transitions, 49 changer transitions 0/118 dead transitions. [2023-08-26 12:17:39,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 118 transitions, 1000 flow [2023-08-26 12:17:39,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:17:39,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:17:39,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions. [2023-08-26 12:17:39,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3509036144578313 [2023-08-26 12:17:39,492 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 466 transitions. [2023-08-26 12:17:39,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 466 transitions. [2023-08-26 12:17:39,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:39,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 466 transitions. [2023-08-26 12:17:39,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:39,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:39,495 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:39,495 INFO L175 Difference]: Start difference. First operand has 71 places, 88 transitions, 596 flow. Second operand 4 states and 466 transitions. [2023-08-26 12:17:39,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 118 transitions, 1000 flow [2023-08-26 12:17:39,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 118 transitions, 993 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-26 12:17:39,569 INFO L231 Difference]: Finished difference. Result has 72 places, 97 transitions, 767 flow [2023-08-26 12:17:39,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=767, PETRI_PLACES=72, PETRI_TRANSITIONS=97} [2023-08-26 12:17:39,570 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -25 predicate places. [2023-08-26 12:17:39,570 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 97 transitions, 767 flow [2023-08-26 12:17:39,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:39,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:39,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:17:39,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:17:39,571 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:17:39,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:39,571 INFO L85 PathProgramCache]: Analyzing trace with hash -655171227, now seen corresponding path program 1 times [2023-08-26 12:17:39,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:39,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960959400] [2023-08-26 12:17:39,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:39,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:39,838 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 12:17:39,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:39,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960959400] [2023-08-26 12:17:39,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960959400] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:39,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:39,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:17:39,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211196999] [2023-08-26 12:17:39,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:39,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:17:39,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:39,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:17:39,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:17:39,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 332 [2023-08-26 12:17:39,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 97 transitions, 767 flow. Second operand has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:39,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:39,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 332 [2023-08-26 12:17:39,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:41,038 INFO L124 PetriNetUnfolderBase]: 5797/9232 cut-off events. [2023-08-26 12:17:41,038 INFO L125 PetriNetUnfolderBase]: For 14582/14582 co-relation queries the response was YES. [2023-08-26 12:17:41,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34774 conditions, 9232 events. 5797/9232 cut-off events. For 14582/14582 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 60962 event pairs, 1156 based on Foata normal form. 64/9191 useless extension candidates. Maximal degree in co-relation 34758. Up to 5757 conditions per place. [2023-08-26 12:17:41,088 INFO L140 encePairwiseOnDemand]: 327/332 looper letters, 132 selfloop transitions, 20 changer transitions 0/153 dead transitions. [2023-08-26 12:17:41,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 153 transitions, 1386 flow [2023-08-26 12:17:41,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:17:41,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:17:41,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 744 transitions. [2023-08-26 12:17:41,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32013769363166955 [2023-08-26 12:17:41,091 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 744 transitions. [2023-08-26 12:17:41,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 744 transitions. [2023-08-26 12:17:41,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:41,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 744 transitions. [2023-08-26 12:17:41,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.28571428571429) internal successors, (744), 7 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:41,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:41,096 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:41,096 INFO L175 Difference]: Start difference. First operand has 72 places, 97 transitions, 767 flow. Second operand 7 states and 744 transitions. [2023-08-26 12:17:41,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 153 transitions, 1386 flow [2023-08-26 12:17:41,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 153 transitions, 1316 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:17:41,223 INFO L231 Difference]: Finished difference. Result has 75 places, 97 transitions, 755 flow [2023-08-26 12:17:41,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=755, PETRI_PLACES=75, PETRI_TRANSITIONS=97} [2023-08-26 12:17:41,223 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -22 predicate places. [2023-08-26 12:17:41,223 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 97 transitions, 755 flow [2023-08-26 12:17:41,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:41,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:41,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:17:41,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:17:41,224 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:17:41,224 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:41,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1063767387, now seen corresponding path program 2 times [2023-08-26 12:17:41,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:41,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250726663] [2023-08-26 12:17:41,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:41,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:42,077 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 12:17:42,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:42,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250726663] [2023-08-26 12:17:42,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250726663] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:42,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:42,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 12:17:42,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82738285] [2023-08-26 12:17:42,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:42,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 12:17:42,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:42,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 12:17:42,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-08-26 12:17:42,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 332 [2023-08-26 12:17:42,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 97 transitions, 755 flow. Second operand has 10 states, 10 states have (on average 93.3) internal successors, (933), 10 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:42,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:42,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 332 [2023-08-26 12:17:42,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:43,299 INFO L124 PetriNetUnfolderBase]: 5156/8183 cut-off events. [2023-08-26 12:17:43,300 INFO L125 PetriNetUnfolderBase]: For 12747/12771 co-relation queries the response was YES. [2023-08-26 12:17:43,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30068 conditions, 8183 events. 5156/8183 cut-off events. For 12747/12771 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 52219 event pairs, 770 based on Foata normal form. 150/8191 useless extension candidates. Maximal degree in co-relation 30053. Up to 2844 conditions per place. [2023-08-26 12:17:43,339 INFO L140 encePairwiseOnDemand]: 322/332 looper letters, 139 selfloop transitions, 53 changer transitions 0/193 dead transitions. [2023-08-26 12:17:43,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 193 transitions, 1655 flow [2023-08-26 12:17:43,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 12:17:43,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 12:17:43,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1031 transitions. [2023-08-26 12:17:43,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3105421686746988 [2023-08-26 12:17:43,342 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1031 transitions. [2023-08-26 12:17:43,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1031 transitions. [2023-08-26 12:17:43,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:43,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1031 transitions. [2023-08-26 12:17:43,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 103.1) internal successors, (1031), 10 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:43,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 332.0) internal successors, (3652), 11 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:43,347 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 332.0) internal successors, (3652), 11 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:43,347 INFO L175 Difference]: Start difference. First operand has 75 places, 97 transitions, 755 flow. Second operand 10 states and 1031 transitions. [2023-08-26 12:17:43,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 193 transitions, 1655 flow [2023-08-26 12:17:43,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 193 transitions, 1652 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:17:43,434 INFO L231 Difference]: Finished difference. Result has 86 places, 112 transitions, 1059 flow [2023-08-26 12:17:43,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1059, PETRI_PLACES=86, PETRI_TRANSITIONS=112} [2023-08-26 12:17:43,435 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -11 predicate places. [2023-08-26 12:17:43,435 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 112 transitions, 1059 flow [2023-08-26 12:17:43,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 93.3) internal successors, (933), 10 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:43,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:43,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:17:43,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 12:17:43,436 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:17:43,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:43,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1790495739, now seen corresponding path program 1 times [2023-08-26 12:17:43,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:43,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912249641] [2023-08-26 12:17:43,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:43,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:43,510 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 12:17:43,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:43,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912249641] [2023-08-26 12:17:43,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912249641] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:43,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:43,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:17:43,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520350333] [2023-08-26 12:17:43,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:43,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:17:43,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:43,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:17:43,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:17:43,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 332 [2023-08-26 12:17:43,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 112 transitions, 1059 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:43,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:43,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 332 [2023-08-26 12:17:43,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:44,329 INFO L124 PetriNetUnfolderBase]: 4249/6817 cut-off events. [2023-08-26 12:17:44,329 INFO L125 PetriNetUnfolderBase]: For 19455/19455 co-relation queries the response was YES. [2023-08-26 12:17:44,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28499 conditions, 6817 events. 4249/6817 cut-off events. For 19455/19455 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 42325 event pairs, 1318 based on Foata normal form. 138/6886 useless extension candidates. Maximal degree in co-relation 28480. Up to 2815 conditions per place. [2023-08-26 12:17:44,361 INFO L140 encePairwiseOnDemand]: 316/332 looper letters, 88 selfloop transitions, 52 changer transitions 0/141 dead transitions. [2023-08-26 12:17:44,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 141 transitions, 1553 flow [2023-08-26 12:17:44,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:17:44,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:17:44,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 456 transitions. [2023-08-26 12:17:44,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3433734939759036 [2023-08-26 12:17:44,368 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 456 transitions. [2023-08-26 12:17:44,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 456 transitions. [2023-08-26 12:17:44,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:44,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 456 transitions. [2023-08-26 12:17:44,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:44,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:44,370 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:44,370 INFO L175 Difference]: Start difference. First operand has 86 places, 112 transitions, 1059 flow. Second operand 4 states and 456 transitions. [2023-08-26 12:17:44,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 141 transitions, 1553 flow [2023-08-26 12:17:44,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 141 transitions, 1537 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-26 12:17:44,446 INFO L231 Difference]: Finished difference. Result has 89 places, 128 transitions, 1454 flow [2023-08-26 12:17:44,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1454, PETRI_PLACES=89, PETRI_TRANSITIONS=128} [2023-08-26 12:17:44,446 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -8 predicate places. [2023-08-26 12:17:44,446 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 128 transitions, 1454 flow [2023-08-26 12:17:44,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:44,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:44,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:17:44,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 12:17:44,464 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:17:44,464 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:44,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1032712374, now seen corresponding path program 1 times [2023-08-26 12:17:44,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:44,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828677279] [2023-08-26 12:17:44,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:44,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:44,600 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 12:17:44,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:44,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828677279] [2023-08-26 12:17:44,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828677279] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:44,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:44,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:17:44,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049687342] [2023-08-26 12:17:44,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:44,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:17:44,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:44,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:17:44,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:17:44,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 332 [2023-08-26 12:17:44,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 128 transitions, 1454 flow. Second operand has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:44,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:44,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 332 [2023-08-26 12:17:44,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:44,994 INFO L124 PetriNetUnfolderBase]: 1442/2591 cut-off events. [2023-08-26 12:17:44,994 INFO L125 PetriNetUnfolderBase]: For 9966/10015 co-relation queries the response was YES. [2023-08-26 12:17:45,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11304 conditions, 2591 events. 1442/2591 cut-off events. For 9966/10015 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 15468 event pairs, 326 based on Foata normal form. 105/2682 useless extension candidates. Maximal degree in co-relation 11284. Up to 1882 conditions per place. [2023-08-26 12:17:45,018 INFO L140 encePairwiseOnDemand]: 326/332 looper letters, 130 selfloop transitions, 7 changer transitions 11/169 dead transitions. [2023-08-26 12:17:45,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 169 transitions, 1946 flow [2023-08-26 12:17:45,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:17:45,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:17:45,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 652 transitions. [2023-08-26 12:17:45,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3927710843373494 [2023-08-26 12:17:45,028 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 652 transitions. [2023-08-26 12:17:45,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 652 transitions. [2023-08-26 12:17:45,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:45,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 652 transitions. [2023-08-26 12:17:45,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:45,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:45,032 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:45,032 INFO L175 Difference]: Start difference. First operand has 89 places, 128 transitions, 1454 flow. Second operand 5 states and 652 transitions. [2023-08-26 12:17:45,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 169 transitions, 1946 flow [2023-08-26 12:17:45,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 169 transitions, 1935 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:17:45,069 INFO L231 Difference]: Finished difference. Result has 95 places, 124 transitions, 1374 flow [2023-08-26 12:17:45,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1374, PETRI_PLACES=95, PETRI_TRANSITIONS=124} [2023-08-26 12:17:45,070 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -2 predicate places. [2023-08-26 12:17:45,070 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 124 transitions, 1374 flow [2023-08-26 12:17:45,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:45,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:45,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:17:45,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 12:17:45,070 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:17:45,071 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:45,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1495595908, now seen corresponding path program 1 times [2023-08-26 12:17:45,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:45,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026351558] [2023-08-26 12:17:45,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:45,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:45,225 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 12:17:45,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:45,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026351558] [2023-08-26 12:17:45,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026351558] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:45,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:45,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:17:45,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799833146] [2023-08-26 12:17:45,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:45,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:17:45,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:45,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:17:45,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:17:45,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 332 [2023-08-26 12:17:45,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 124 transitions, 1374 flow. Second operand has 5 states, 5 states have (on average 120.2) internal successors, (601), 5 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:45,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:45,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 332 [2023-08-26 12:17:45,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:45,492 INFO L124 PetriNetUnfolderBase]: 531/1005 cut-off events. [2023-08-26 12:17:45,493 INFO L125 PetriNetUnfolderBase]: For 3338/3371 co-relation queries the response was YES. [2023-08-26 12:17:45,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4302 conditions, 1005 events. 531/1005 cut-off events. For 3338/3371 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5006 event pairs, 103 based on Foata normal form. 54/1047 useless extension candidates. Maximal degree in co-relation 4278. Up to 411 conditions per place. [2023-08-26 12:17:45,497 INFO L140 encePairwiseOnDemand]: 326/332 looper letters, 102 selfloop transitions, 13 changer transitions 21/147 dead transitions. [2023-08-26 12:17:45,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 147 transitions, 1496 flow [2023-08-26 12:17:45,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:17:45,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:17:45,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 907 transitions. [2023-08-26 12:17:45,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39027538726333905 [2023-08-26 12:17:45,499 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 907 transitions. [2023-08-26 12:17:45,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 907 transitions. [2023-08-26 12:17:45,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:45,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 907 transitions. [2023-08-26 12:17:45,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.57142857142858) internal successors, (907), 7 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:45,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:45,504 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:45,504 INFO L175 Difference]: Start difference. First operand has 95 places, 124 transitions, 1374 flow. Second operand 7 states and 907 transitions. [2023-08-26 12:17:45,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 147 transitions, 1496 flow [2023-08-26 12:17:45,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 147 transitions, 1430 flow, removed 16 selfloop flow, removed 7 redundant places. [2023-08-26 12:17:45,511 INFO L231 Difference]: Finished difference. Result has 94 places, 78 transitions, 710 flow [2023-08-26 12:17:45,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=710, PETRI_PLACES=94, PETRI_TRANSITIONS=78} [2023-08-26 12:17:45,512 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -3 predicate places. [2023-08-26 12:17:45,512 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 78 transitions, 710 flow [2023-08-26 12:17:45,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.2) internal successors, (601), 5 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:45,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:45,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:17:45,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 12:17:45,512 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:17:45,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:45,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1674206673, now seen corresponding path program 1 times [2023-08-26 12:17:45,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:45,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078297264] [2023-08-26 12:17:45,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:45,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:45,679 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 12:17:45,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:45,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078297264] [2023-08-26 12:17:45,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078297264] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:45,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:45,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:17:45,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665854568] [2023-08-26 12:17:45,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:45,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:17:45,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:45,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:17:45,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:17:45,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 332 [2023-08-26 12:17:45,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 78 transitions, 710 flow. Second operand has 6 states, 6 states have (on average 120.0) internal successors, (720), 6 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:45,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:45,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 332 [2023-08-26 12:17:45,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:45,899 INFO L124 PetriNetUnfolderBase]: 442/803 cut-off events. [2023-08-26 12:17:45,899 INFO L125 PetriNetUnfolderBase]: For 2984/3017 co-relation queries the response was YES. [2023-08-26 12:17:45,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3527 conditions, 803 events. 442/803 cut-off events. For 2984/3017 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3868 event pairs, 89 based on Foata normal form. 13/804 useless extension candidates. Maximal degree in co-relation 3506. Up to 368 conditions per place. [2023-08-26 12:17:45,902 INFO L140 encePairwiseOnDemand]: 326/332 looper letters, 69 selfloop transitions, 17 changer transitions 17/108 dead transitions. [2023-08-26 12:17:45,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 108 transitions, 1004 flow [2023-08-26 12:17:45,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 12:17:45,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 12:17:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1134 transitions. [2023-08-26 12:17:45,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3795180722891566 [2023-08-26 12:17:45,904 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1134 transitions. [2023-08-26 12:17:45,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1134 transitions. [2023-08-26 12:17:45,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:45,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1134 transitions. [2023-08-26 12:17:45,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 126.0) internal successors, (1134), 9 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:45,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 332.0) internal successors, (3320), 10 states have internal predecessors, (3320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:45,910 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 332.0) internal successors, (3320), 10 states have internal predecessors, (3320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:45,910 INFO L175 Difference]: Start difference. First operand has 94 places, 78 transitions, 710 flow. Second operand 9 states and 1134 transitions. [2023-08-26 12:17:45,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 108 transitions, 1004 flow [2023-08-26 12:17:45,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 108 transitions, 824 flow, removed 20 selfloop flow, removed 19 redundant places. [2023-08-26 12:17:45,916 INFO L231 Difference]: Finished difference. Result has 72 places, 46 transitions, 327 flow [2023-08-26 12:17:45,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=327, PETRI_PLACES=72, PETRI_TRANSITIONS=46} [2023-08-26 12:17:45,917 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -25 predicate places. [2023-08-26 12:17:45,917 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 46 transitions, 327 flow [2023-08-26 12:17:45,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.0) internal successors, (720), 6 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:45,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:45,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:17:45,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 12:17:45,917 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:17:45,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:45,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1603577278, now seen corresponding path program 1 times [2023-08-26 12:17:45,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:45,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707220711] [2023-08-26 12:17:45,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:45,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:46,086 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 12:17:46,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:46,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707220711] [2023-08-26 12:17:46,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707220711] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:46,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:46,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:17:46,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615641992] [2023-08-26 12:17:46,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:46,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:17:46,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:46,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:17:46,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:17:46,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 332 [2023-08-26 12:17:46,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 46 transitions, 327 flow. Second operand has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:46,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:46,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 332 [2023-08-26 12:17:46,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:46,292 INFO L124 PetriNetUnfolderBase]: 690/1244 cut-off events. [2023-08-26 12:17:46,292 INFO L125 PetriNetUnfolderBase]: For 3423/3425 co-relation queries the response was YES. [2023-08-26 12:17:46,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5051 conditions, 1244 events. 690/1244 cut-off events. For 3423/3425 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6703 event pairs, 117 based on Foata normal form. 3/1243 useless extension candidates. Maximal degree in co-relation 5034. Up to 698 conditions per place. [2023-08-26 12:17:46,296 INFO L140 encePairwiseOnDemand]: 329/332 looper letters, 64 selfloop transitions, 2 changer transitions 28/98 dead transitions. [2023-08-26 12:17:46,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 98 transitions, 905 flow [2023-08-26 12:17:46,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:17:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:17:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 533 transitions. [2023-08-26 12:17:46,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.401355421686747 [2023-08-26 12:17:46,298 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 533 transitions. [2023-08-26 12:17:46,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 533 transitions. [2023-08-26 12:17:46,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:46,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 533 transitions. [2023-08-26 12:17:46,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:46,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:46,301 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:46,301 INFO L175 Difference]: Start difference. First operand has 72 places, 46 transitions, 327 flow. Second operand 4 states and 533 transitions. [2023-08-26 12:17:46,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 98 transitions, 905 flow [2023-08-26 12:17:46,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 98 transitions, 772 flow, removed 30 selfloop flow, removed 8 redundant places. [2023-08-26 12:17:46,309 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 266 flow [2023-08-26 12:17:46,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=266, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2023-08-26 12:17:46,309 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -34 predicate places. [2023-08-26 12:17:46,309 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 266 flow [2023-08-26 12:17:46,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:46,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:46,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:17:46,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 12:17:46,310 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:17:46,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:46,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1804383748, now seen corresponding path program 2 times [2023-08-26 12:17:46,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:46,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510516319] [2023-08-26 12:17:46,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:46,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:47,512 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 12:17:47,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:47,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510516319] [2023-08-26 12:17:47,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510516319] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:47,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:47,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:17:47,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552557942] [2023-08-26 12:17:47,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:47,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:17:47,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:47,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:17:47,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:17:47,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 332 [2023-08-26 12:17:47,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:47,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:47,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 332 [2023-08-26 12:17:47,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:47,811 INFO L124 PetriNetUnfolderBase]: 941/1723 cut-off events. [2023-08-26 12:17:47,812 INFO L125 PetriNetUnfolderBase]: For 3525/3550 co-relation queries the response was YES. [2023-08-26 12:17:47,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6800 conditions, 1723 events. 941/1723 cut-off events. For 3525/3550 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9859 event pairs, 224 based on Foata normal form. 2/1720 useless extension candidates. Maximal degree in co-relation 6784. Up to 1054 conditions per place. [2023-08-26 12:17:47,817 INFO L140 encePairwiseOnDemand]: 324/332 looper letters, 40 selfloop transitions, 12 changer transitions 49/102 dead transitions. [2023-08-26 12:17:47,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 102 transitions, 816 flow [2023-08-26 12:17:47,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:17:47,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:17:47,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2023-08-26 12:17:47,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34759036144578315 [2023-08-26 12:17:47,819 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 577 transitions. [2023-08-26 12:17:47,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 577 transitions. [2023-08-26 12:17:47,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:47,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 577 transitions. [2023-08-26 12:17:47,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:47,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:47,822 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:47,822 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 266 flow. Second operand 5 states and 577 transitions. [2023-08-26 12:17:47,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 102 transitions, 816 flow [2023-08-26 12:17:47,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 102 transitions, 808 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-26 12:17:47,831 INFO L231 Difference]: Finished difference. Result has 66 places, 45 transitions, 331 flow [2023-08-26 12:17:47,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=331, PETRI_PLACES=66, PETRI_TRANSITIONS=45} [2023-08-26 12:17:47,832 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -31 predicate places. [2023-08-26 12:17:47,832 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 45 transitions, 331 flow [2023-08-26 12:17:47,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:47,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:47,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:17:47,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 12:17:47,832 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:17:47,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:47,833 INFO L85 PathProgramCache]: Analyzing trace with hash -507471948, now seen corresponding path program 3 times [2023-08-26 12:17:47,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:47,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115557612] [2023-08-26 12:17:47,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:47,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:48,598 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 12:17:48,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:48,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115557612] [2023-08-26 12:17:48,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115557612] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:48,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:48,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:17:48,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166066883] [2023-08-26 12:17:48,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:48,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:17:48,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:48,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:17:48,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:17:48,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 332 [2023-08-26 12:17:48,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 45 transitions, 331 flow. Second operand has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:48,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:48,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 332 [2023-08-26 12:17:48,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:48,822 INFO L124 PetriNetUnfolderBase]: 329/652 cut-off events. [2023-08-26 12:17:48,822 INFO L125 PetriNetUnfolderBase]: For 1474/1474 co-relation queries the response was YES. [2023-08-26 12:17:48,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2800 conditions, 652 events. 329/652 cut-off events. For 1474/1474 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3040 event pairs, 161 based on Foata normal form. 1/651 useless extension candidates. Maximal degree in co-relation 2783. Up to 463 conditions per place. [2023-08-26 12:17:48,825 INFO L140 encePairwiseOnDemand]: 325/332 looper letters, 40 selfloop transitions, 10 changer transitions 28/79 dead transitions. [2023-08-26 12:17:48,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 79 transitions, 689 flow [2023-08-26 12:17:48,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:17:48,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:17:48,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 692 transitions. [2023-08-26 12:17:48,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3473895582329317 [2023-08-26 12:17:48,827 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 692 transitions. [2023-08-26 12:17:48,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 692 transitions. [2023-08-26 12:17:48,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:48,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 692 transitions. [2023-08-26 12:17:48,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:48,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 332.0) internal successors, (2324), 7 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:48,853 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 332.0) internal successors, (2324), 7 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:48,853 INFO L175 Difference]: Start difference. First operand has 66 places, 45 transitions, 331 flow. Second operand 6 states and 692 transitions. [2023-08-26 12:17:48,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 79 transitions, 689 flow [2023-08-26 12:17:48,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 79 transitions, 664 flow, removed 9 selfloop flow, removed 7 redundant places. [2023-08-26 12:17:48,856 INFO L231 Difference]: Finished difference. Result has 62 places, 44 transitions, 336 flow [2023-08-26 12:17:48,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=336, PETRI_PLACES=62, PETRI_TRANSITIONS=44} [2023-08-26 12:17:48,856 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -35 predicate places. [2023-08-26 12:17:48,856 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 44 transitions, 336 flow [2023-08-26 12:17:48,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:48,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:48,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:17:48,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 12:17:48,857 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:17:48,862 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:48,862 INFO L85 PathProgramCache]: Analyzing trace with hash -569576892, now seen corresponding path program 4 times [2023-08-26 12:17:48,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:48,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704425483] [2023-08-26 12:17:48,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:48,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:49,752 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 12:17:49,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:49,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704425483] [2023-08-26 12:17:49,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704425483] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:49,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:49,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:17:49,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201562494] [2023-08-26 12:17:49,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:49,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 12:17:49,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:49,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 12:17:49,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-26 12:17:49,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 332 [2023-08-26 12:17:49,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 44 transitions, 336 flow. Second operand has 8 states, 8 states have (on average 94.625) internal successors, (757), 8 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:49,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:49,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 332 [2023-08-26 12:17:49,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:50,074 INFO L124 PetriNetUnfolderBase]: 388/782 cut-off events. [2023-08-26 12:17:50,075 INFO L125 PetriNetUnfolderBase]: For 2025/2027 co-relation queries the response was YES. [2023-08-26 12:17:50,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3371 conditions, 782 events. 388/782 cut-off events. For 2025/2027 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3973 event pairs, 111 based on Foata normal form. 1/782 useless extension candidates. Maximal degree in co-relation 3356. Up to 365 conditions per place. [2023-08-26 12:17:50,077 INFO L140 encePairwiseOnDemand]: 324/332 looper letters, 33 selfloop transitions, 8 changer transitions 55/97 dead transitions. [2023-08-26 12:17:50,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 97 transitions, 849 flow [2023-08-26 12:17:50,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:17:50,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:17:50,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 800 transitions. [2023-08-26 12:17:50,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30120481927710846 [2023-08-26 12:17:50,079 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 800 transitions. [2023-08-26 12:17:50,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 800 transitions. [2023-08-26 12:17:50,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:50,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 800 transitions. [2023-08-26 12:17:50,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 100.0) internal successors, (800), 8 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:50,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 332.0) internal successors, (2988), 9 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:50,083 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 332.0) internal successors, (2988), 9 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:50,083 INFO L175 Difference]: Start difference. First operand has 62 places, 44 transitions, 336 flow. Second operand 8 states and 800 transitions. [2023-08-26 12:17:50,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 97 transitions, 849 flow [2023-08-26 12:17:50,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 97 transitions, 822 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-26 12:17:50,087 INFO L231 Difference]: Finished difference. Result has 67 places, 37 transitions, 286 flow [2023-08-26 12:17:50,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=286, PETRI_PLACES=67, PETRI_TRANSITIONS=37} [2023-08-26 12:17:50,088 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -30 predicate places. [2023-08-26 12:17:50,088 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 37 transitions, 286 flow [2023-08-26 12:17:50,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.625) internal successors, (757), 8 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:50,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:50,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:17:50,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 12:17:50,088 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:17:50,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:50,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2065659164, now seen corresponding path program 5 times [2023-08-26 12:17:50,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:50,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871244854] [2023-08-26 12:17:50,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:50,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:17:50,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:17:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:17:50,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:17:50,231 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:17:50,232 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONASSERT (99 of 100 remaining) [2023-08-26 12:17:50,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 100 remaining) [2023-08-26 12:17:50,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 100 remaining) [2023-08-26 12:17:50,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 100 remaining) [2023-08-26 12:17:50,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 100 remaining) [2023-08-26 12:17:50,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 100 remaining) [2023-08-26 12:17:50,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 100 remaining) [2023-08-26 12:17:50,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 100 remaining) [2023-08-26 12:17:50,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 100 remaining) [2023-08-26 12:17:50,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 100 remaining) [2023-08-26 12:17:50,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 100 remaining) [2023-08-26 12:17:50,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 100 remaining) [2023-08-26 12:17:50,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 100 remaining) [2023-08-26 12:17:50,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 100 remaining) [2023-08-26 12:17:50,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 100 remaining) [2023-08-26 12:17:50,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 100 remaining) [2023-08-26 12:17:50,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 100 remaining) [2023-08-26 12:17:50,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 100 remaining) [2023-08-26 12:17:50,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 100 remaining) [2023-08-26 12:17:50,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 100 remaining) [2023-08-26 12:17:50,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 100 remaining) [2023-08-26 12:17:50,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 100 remaining) [2023-08-26 12:17:50,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 100 remaining) [2023-08-26 12:17:50,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 100 remaining) [2023-08-26 12:17:50,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 100 remaining) [2023-08-26 12:17:50,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 100 remaining) [2023-08-26 12:17:50,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 100 remaining) [2023-08-26 12:17:50,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 100 remaining) [2023-08-26 12:17:50,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 100 remaining) [2023-08-26 12:17:50,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 100 remaining) [2023-08-26 12:17:50,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 100 remaining) [2023-08-26 12:17:50,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 100 remaining) [2023-08-26 12:17:50,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 100 remaining) [2023-08-26 12:17:50,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 100 remaining) [2023-08-26 12:17:50,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 100 remaining) [2023-08-26 12:17:50,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 100 remaining) [2023-08-26 12:17:50,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 100 remaining) [2023-08-26 12:17:50,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 100 remaining) [2023-08-26 12:17:50,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 100 remaining) [2023-08-26 12:17:50,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 100 remaining) [2023-08-26 12:17:50,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 100 remaining) [2023-08-26 12:17:50,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 100 remaining) [2023-08-26 12:17:50,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 100 remaining) [2023-08-26 12:17:50,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 100 remaining) [2023-08-26 12:17:50,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 100 remaining) [2023-08-26 12:17:50,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 100 remaining) [2023-08-26 12:17:50,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 100 remaining) [2023-08-26 12:17:50,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 100 remaining) [2023-08-26 12:17:50,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 100 remaining) [2023-08-26 12:17:50,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 100 remaining) [2023-08-26 12:17:50,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 100 remaining) [2023-08-26 12:17:50,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 100 remaining) [2023-08-26 12:17:50,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 100 remaining) [2023-08-26 12:17:50,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 100 remaining) [2023-08-26 12:17:50,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 100 remaining) [2023-08-26 12:17:50,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 100 remaining) [2023-08-26 12:17:50,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 100 remaining) [2023-08-26 12:17:50,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 100 remaining) [2023-08-26 12:17:50,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 100 remaining) [2023-08-26 12:17:50,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 100 remaining) [2023-08-26 12:17:50,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 100 remaining) [2023-08-26 12:17:50,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 100 remaining) [2023-08-26 12:17:50,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 100 remaining) [2023-08-26 12:17:50,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 100 remaining) [2023-08-26 12:17:50,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 100 remaining) [2023-08-26 12:17:50,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 100 remaining) [2023-08-26 12:17:50,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 100 remaining) [2023-08-26 12:17:50,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 100 remaining) [2023-08-26 12:17:50,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 100 remaining) [2023-08-26 12:17:50,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 100 remaining) [2023-08-26 12:17:50,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 100 remaining) [2023-08-26 12:17:50,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 100 remaining) [2023-08-26 12:17:50,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 100 remaining) [2023-08-26 12:17:50,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 100 remaining) [2023-08-26 12:17:50,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 100 remaining) [2023-08-26 12:17:50,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 100 remaining) [2023-08-26 12:17:50,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 100 remaining) [2023-08-26 12:17:50,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 100 remaining) [2023-08-26 12:17:50,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 100 remaining) [2023-08-26 12:17:50,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 100 remaining) [2023-08-26 12:17:50,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 100 remaining) [2023-08-26 12:17:50,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 100 remaining) [2023-08-26 12:17:50,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 100 remaining) [2023-08-26 12:17:50,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 100 remaining) [2023-08-26 12:17:50,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 100 remaining) [2023-08-26 12:17:50,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 100 remaining) [2023-08-26 12:17:50,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 100 remaining) [2023-08-26 12:17:50,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 100 remaining) [2023-08-26 12:17:50,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 100 remaining) [2023-08-26 12:17:50,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 100 remaining) [2023-08-26 12:17:50,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 100 remaining) [2023-08-26 12:17:50,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 100 remaining) [2023-08-26 12:17:50,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 100 remaining) [2023-08-26 12:17:50,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 100 remaining) [2023-08-26 12:17:50,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 100 remaining) [2023-08-26 12:17:50,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 100 remaining) [2023-08-26 12:17:50,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 100 remaining) [2023-08-26 12:17:50,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 100 remaining) [2023-08-26 12:17:50,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 100 remaining) [2023-08-26 12:17:50,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 100 remaining) [2023-08-26 12:17:50,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 12:17:50,244 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:17:50,250 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:17:50,250 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:17:50,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:17:50 BasicIcfg [2023-08-26 12:17:50,338 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:17:50,338 INFO L158 Benchmark]: Toolchain (without parser) took 40524.09ms. Allocated memory was 406.8MB in the beginning and 5.7GB in the end (delta: 5.3GB). Free memory was 380.4MB in the beginning and 4.7GB in the end (delta: -4.3GB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2023-08-26 12:17:50,339 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 406.8MB. Free memory was 383.7MB in the beginning and 383.4MB in the end (delta: 225.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:17:50,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.32ms. Allocated memory is still 406.8MB. Free memory was 380.4MB in the beginning and 354.1MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-26 12:17:50,340 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.71ms. Allocated memory is still 406.8MB. Free memory was 354.1MB in the beginning and 351.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:17:50,341 INFO L158 Benchmark]: Boogie Preprocessor took 45.32ms. Allocated memory is still 406.8MB. Free memory was 351.2MB in the beginning and 349.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:17:50,341 INFO L158 Benchmark]: RCFGBuilder took 1131.18ms. Allocated memory was 406.8MB in the beginning and 622.9MB in the end (delta: 216.0MB). Free memory was 349.1MB in the beginning and 574.3MB in the end (delta: -225.2MB). Peak memory consumption was 82.7MB. Max. memory is 16.0GB. [2023-08-26 12:17:50,341 INFO L158 Benchmark]: TraceAbstraction took 38836.26ms. Allocated memory was 622.9MB in the beginning and 5.7GB in the end (delta: 5.1GB). Free memory was 574.3MB in the beginning and 4.7GB in the end (delta: -4.1GB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2023-08-26 12:17:50,342 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 406.8MB. Free memory was 383.7MB in the beginning and 383.4MB in the end (delta: 225.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 445.32ms. Allocated memory is still 406.8MB. Free memory was 380.4MB in the beginning and 354.1MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 61.71ms. Allocated memory is still 406.8MB. Free memory was 354.1MB in the beginning and 351.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 45.32ms. Allocated memory is still 406.8MB. Free memory was 351.2MB in the beginning and 349.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1131.18ms. Allocated memory was 406.8MB in the beginning and 622.9MB in the end (delta: 216.0MB). Free memory was 349.1MB in the beginning and 574.3MB in the end (delta: -225.2MB). Peak memory consumption was 82.7MB. Max. memory is 16.0GB. * TraceAbstraction took 38836.26ms. Allocated memory was 622.9MB in the beginning and 5.7GB in the end (delta: 5.1GB). Free memory was 574.3MB in the beginning and 4.7GB in the end (delta: -4.1GB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.2s, 193 PlacesBefore, 97 PlacesAfterwards, 186 TransitionsBefore, 88 TransitionsAfterwards, 8688 CoEnabledTransitionPairs, 7 FixpointIterations, 65 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 143 TotalNumberOfCompositions, 54970 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13148, independent: 12287, independent conditional: 0, independent unconditional: 12287, dependent: 861, dependent conditional: 0, dependent unconditional: 861, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2906, independent: 2793, independent conditional: 0, independent unconditional: 2793, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 13148, independent: 9494, independent conditional: 0, independent unconditional: 9494, dependent: 748, dependent conditional: 0, dependent unconditional: 748, unknown: 2906, unknown conditional: 0, unknown unconditional: 2906] , Statistics on independence cache: Total cache size (in pairs): 391, Positive cache size: 317, Positive conditional cache size: 0, Positive unconditional cache size: 317, Negative cache size: 74, Negative conditional cache size: 0, Negative unconditional cache size: 74, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2381; [L855] FCALL, FORK 0 pthread_create(&t2381, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2381, ((void *)0), P0, ((void *)0))=-2, t2381={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L856] 0 pthread_t t2382; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2381={7:0}, t2382={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L857] FCALL, FORK 0 pthread_create(&t2382, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2382, ((void *)0), P1, ((void *)0))=-1, t2381={7:0}, t2382={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L858] 0 pthread_t t2383; [L859] FCALL, FORK 0 pthread_create(&t2383, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2383, ((void *)0), P2, ((void *)0))=0, t2381={7:0}, t2382={5:0}, t2383={6: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 x$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(x) [L814] 3 x$mem_tmp = x [L815] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L815] EXPR 3 \read(x) [L815] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L815] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L816] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L817] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L818] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L819] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L821] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L823] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L824] EXPR 3 \read(x) [L824] 3 __unbuffered_p2_EAX = x [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] 3 x = x$flush_delayed ? x$mem_tmp : x [L826] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L829] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L761] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 x$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(x) [L769] 1 x$mem_tmp = x [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] EXPR 1 \read(x) [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L771] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L772] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L773] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L774] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L776] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 1 \read(x) [L777] 1 __unbuffered_p0_EAX = x [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] EXPR 1 \read(x) [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] 1 x = x$flush_delayed ? x$mem_tmp : x [L779] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L791] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L794] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L797] 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) [L797] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L797] EXPR 2 \read(x) [L797] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L797] 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) [L797] 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) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 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 [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L832] EXPR 3 \read(x) [L832] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L833] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L834] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L835] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L836] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 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) [L865] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L865] EXPR 0 \read(x) [L865] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L865] 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) [L865] 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) [L866] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L867] 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 [L868] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L869] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2381={7:0}, t2382={5:0}, t2383={6: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 x$flush_delayed = weak$$choice2 [L875] EXPR 0 \read(x) [L875] 0 x$mem_tmp = x [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] EXPR 0 \read(x) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L877] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L878] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L879] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L880] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L882] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L884] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L884] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L884] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L884] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L885] EXPR 0 \read(x) [L885] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L886] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L886] EXPR 0 \read(x) [L886] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L886] 0 x = x$flush_delayed ? x$mem_tmp : x [L887] 0 x$flush_delayed = (_Bool)0 [L889] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe025_rmo.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - 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: -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: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 859]: 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: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 249 locations, 100 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: 38.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 672 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 672 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 271 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2148 IncrementalHoareTripleChecker+Invalid, 2419 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 271 mSolverCounterUnsat, 7 mSDtfsCounter, 2148 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1454occurred in iteration=11, InterpolantAutomatonStates: 100, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 2878 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 12:17:50,377 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...