/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe014_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:23:28,384 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:23:28,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 18:23:28,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:23:28,469 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:23:28,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:23:28,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:23:28,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:23:28,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:23:28,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:23:28,510 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:23:28,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:23:28,510 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:23:28,511 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:23:28,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:23:28,512 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:23:28,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:23:28,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:23:28,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:23:28,512 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:23:28,513 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:23:28,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:23:28,514 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:23:28,514 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:23:28,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:23:28,514 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:23:28,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:23:28,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:23:28,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:23:28,515 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:23:28,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:23:28,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:23:28,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:23:28,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:23:28,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:23:28,517 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 18:23:28,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:23:28,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:23:28,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:23:28,882 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:23:28,882 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:23:28,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe014_power.opt.i [2023-08-26 18:23:29,973 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:23:30,269 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:23:30,270 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_power.opt.i [2023-08-26 18:23:30,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e218cafeb/21c33949cfb74c909bdd8621b73ab02d/FLAGa30d347bc [2023-08-26 18:23:30,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e218cafeb/21c33949cfb74c909bdd8621b73ab02d [2023-08-26 18:23:30,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:23:30,309 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:23:30,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:23:30,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:23:30,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:23:30,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:23:30" (1/1) ... [2023-08-26 18:23:30,316 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b42f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:30, skipping insertion in model container [2023-08-26 18:23:30,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:23:30" (1/1) ... [2023-08-26 18:23:30,374 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:23:30,746 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:23:30,761 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:23:30,792 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 18:23:30,794 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 18:23:30,830 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:23:30,858 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:23:30,858 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:23:30,864 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:23:30,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:30 WrapperNode [2023-08-26 18:23:30,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:23:30,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:23:30,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:23:30,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:23:30,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:30" (1/1) ... [2023-08-26 18:23:30,886 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:30" (1/1) ... [2023-08-26 18:23:30,919 INFO L138 Inliner]: procedures = 176, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 187 [2023-08-26 18:23:30,919 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:23:30,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:23:30,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:23:30,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:23:30,928 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:30" (1/1) ... [2023-08-26 18:23:30,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:30" (1/1) ... [2023-08-26 18:23:30,932 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:30" (1/1) ... [2023-08-26 18:23:30,933 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:30" (1/1) ... [2023-08-26 18:23:30,951 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:30" (1/1) ... [2023-08-26 18:23:30,954 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:30" (1/1) ... [2023-08-26 18:23:30,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:30" (1/1) ... [2023-08-26 18:23:30,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:30" (1/1) ... [2023-08-26 18:23:30,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:23:30,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:23:30,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:23:30,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:23:30,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:30" (1/1) ... [2023-08-26 18:23:30,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:23:30,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:23:30,991 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 18:23:31,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 18:23:31,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 18:23:31,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:23:31,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:23:31,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:23:31,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:23:31,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:23:31,030 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:23:31,030 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:23:31,030 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:23:31,030 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:23:31,030 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:23:31,030 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:23:31,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:23:31,030 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:23:31,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:23:31,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:23:31,033 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 18:23:31,185 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:23:31,192 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:23:31,684 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:23:32,112 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:23:32,112 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:23:32,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:23:32 BoogieIcfgContainer [2023-08-26 18:23:32,115 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:23:32,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:23:32,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:23:32,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:23:32,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:23:30" (1/3) ... [2023-08-26 18:23:32,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ca464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:23:32, skipping insertion in model container [2023-08-26 18:23:32,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:30" (2/3) ... [2023-08-26 18:23:32,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ca464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:23:32, skipping insertion in model container [2023-08-26 18:23:32,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:23:32" (3/3) ... [2023-08-26 18:23:32,124 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_power.opt.i [2023-08-26 18:23:32,145 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:23:32,145 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2023-08-26 18:23:32,145 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:23:32,279 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:23:32,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 161 transitions, 337 flow [2023-08-26 18:23:32,412 INFO L124 PetriNetUnfolderBase]: 3/158 cut-off events. [2023-08-26 18:23:32,412 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:23:32,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 158 events. 3/158 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 219 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-26 18:23:32,419 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 161 transitions, 337 flow [2023-08-26 18:23:32,426 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 158 transitions, 325 flow [2023-08-26 18:23:32,430 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:23:32,438 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 158 transitions, 325 flow [2023-08-26 18:23:32,442 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 158 transitions, 325 flow [2023-08-26 18:23:32,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 158 transitions, 325 flow [2023-08-26 18:23:32,535 INFO L124 PetriNetUnfolderBase]: 3/158 cut-off events. [2023-08-26 18:23:32,536 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:23:32,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 158 events. 3/158 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 221 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-26 18:23:32,541 INFO L119 LiptonReduction]: Number of co-enabled transitions 4956 [2023-08-26 18:23:42,369 INFO L134 LiptonReduction]: Checked pairs total: 18505 [2023-08-26 18:23:42,370 INFO L136 LiptonReduction]: Total number of compositions: 140 [2023-08-26 18:23:42,381 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:23:42,386 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;@301847c2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:23:42,386 INFO L358 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2023-08-26 18:23:42,387 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:23:42,387 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:23:42,387 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:23:42,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:42,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:23:42,388 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-08-26 18:23:42,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:42,391 INFO L85 PathProgramCache]: Analyzing trace with hash 970, now seen corresponding path program 1 times [2023-08-26 18:23:42,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:42,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648822399] [2023-08-26 18:23:42,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:42,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:42,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:42,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:42,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648822399] [2023-08-26 18:23:42,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648822399] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:42,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:42,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:23:42,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481881660] [2023-08-26 18:23:42,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:42,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:23:42,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:42,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:23:42,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:23:42,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 301 [2023-08-26 18:23:42,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 129 flow. Second operand has 2 states, 2 states have (on average 122.5) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:42,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:42,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 301 [2023-08-26 18:23:42,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:43,803 INFO L124 PetriNetUnfolderBase]: 5254/7577 cut-off events. [2023-08-26 18:23:43,804 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:23:43,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15189 conditions, 7577 events. 5254/7577 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 43968 event pairs, 5254 based on Foata normal form. 150/4472 useless extension candidates. Maximal degree in co-relation 15178. Up to 7566 conditions per place. [2023-08-26 18:23:43,861 INFO L140 encePairwiseOnDemand]: 280/301 looper letters, 37 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2023-08-26 18:23:43,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 161 flow [2023-08-26 18:23:43,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:23:43,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:23:43,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 302 transitions. [2023-08-26 18:23:43,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5016611295681063 [2023-08-26 18:23:43,879 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 302 transitions. [2023-08-26 18:23:43,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 302 transitions. [2023-08-26 18:23:43,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:43,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 302 transitions. [2023-08-26 18:23:43,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 151.0) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:43,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:43,895 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:43,897 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 129 flow. Second operand 2 states and 302 transitions. [2023-08-26 18:23:43,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 161 flow [2023-08-26 18:23:43,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:23:43,903 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 84 flow [2023-08-26 18:23:43,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2023-08-26 18:23:43,907 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -22 predicate places. [2023-08-26 18:23:43,908 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 84 flow [2023-08-26 18:23:43,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 122.5) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:43,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:43,908 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:23:43,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:23:43,909 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-08-26 18:23:43,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:43,916 INFO L85 PathProgramCache]: Analyzing trace with hash 958737, now seen corresponding path program 1 times [2023-08-26 18:23:43,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:43,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092819939] [2023-08-26 18:23:43,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:43,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:44,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:44,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:44,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092819939] [2023-08-26 18:23:44,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092819939] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:44,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:44,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:23:44,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738827229] [2023-08-26 18:23:44,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:44,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:23:44,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:44,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:23:44,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:23:44,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 301 [2023-08-26 18:23:44,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:44,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:44,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 301 [2023-08-26 18:23:44,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:44,876 INFO L124 PetriNetUnfolderBase]: 2825/4132 cut-off events. [2023-08-26 18:23:44,877 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:23:44,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8291 conditions, 4132 events. 2825/4132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 22293 event pairs, 2825 based on Foata normal form. 0/2759 useless extension candidates. Maximal degree in co-relation 8288. Up to 4122 conditions per place. [2023-08-26 18:23:44,901 INFO L140 encePairwiseOnDemand]: 295/301 looper letters, 31 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-08-26 18:23:44,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 34 transitions, 138 flow [2023-08-26 18:23:44,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:23:44,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:23:44,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-08-26 18:23:44,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3997785160575858 [2023-08-26 18:23:44,903 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-08-26 18:23:44,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-08-26 18:23:44,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:44,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-08-26 18:23:44,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:44,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:44,907 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:44,907 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 84 flow. Second operand 3 states and 361 transitions. [2023-08-26 18:23:44,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 34 transitions, 138 flow [2023-08-26 18:23:44,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:23:44,909 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2023-08-26 18:23:44,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-26 18:23:44,910 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -25 predicate places. [2023-08-26 18:23:44,910 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2023-08-26 18:23:44,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:44,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:44,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:23:44,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:23:44,911 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-08-26 18:23:44,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:44,911 INFO L85 PathProgramCache]: Analyzing trace with hash 958736, now seen corresponding path program 1 times [2023-08-26 18:23:44,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:44,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485834883] [2023-08-26 18:23:44,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:44,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:44,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:44,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:44,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485834883] [2023-08-26 18:23:44,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485834883] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:44,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:44,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:23:44,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182404214] [2023-08-26 18:23:44,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:44,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:23:44,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:44,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:23:44,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:23:44,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 301 [2023-08-26 18:23:44,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:44,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:44,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 301 [2023-08-26 18:23:44,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:45,426 INFO L124 PetriNetUnfolderBase]: 1801/2800 cut-off events. [2023-08-26 18:23:45,426 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:23:45,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5569 conditions, 2800 events. 1801/2800 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 15623 event pairs, 1237 based on Foata normal form. 0/2310 useless extension candidates. Maximal degree in co-relation 5565. Up to 1820 conditions per place. [2023-08-26 18:23:45,443 INFO L140 encePairwiseOnDemand]: 290/301 looper letters, 35 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2023-08-26 18:23:45,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 176 flow [2023-08-26 18:23:45,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:23:45,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:23:45,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-08-26 18:23:45,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3964562569213732 [2023-08-26 18:23:45,446 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-08-26 18:23:45,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-08-26 18:23:45,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:45,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-08-26 18:23:45,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:45,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:45,450 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:45,450 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 3 states and 358 transitions. [2023-08-26 18:23:45,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 176 flow [2023-08-26 18:23:45,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 175 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:23:45,451 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 117 flow [2023-08-26 18:23:45,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2023-08-26 18:23:45,453 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -24 predicate places. [2023-08-26 18:23:45,453 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 117 flow [2023-08-26 18:23:45,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:45,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:45,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:45,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:23:45,458 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err0ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-08-26 18:23:45,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:45,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1670853636, now seen corresponding path program 1 times [2023-08-26 18:23:45,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:45,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419673117] [2023-08-26 18:23:45,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:45,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:45,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:45,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:45,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419673117] [2023-08-26 18:23:45,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419673117] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:45,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:45,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:23:45,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744291569] [2023-08-26 18:23:45,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:45,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:23:45,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:45,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:23:45,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:23:45,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 301 [2023-08-26 18:23:45,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:45,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:45,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 301 [2023-08-26 18:23:45,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:46,015 INFO L124 PetriNetUnfolderBase]: 1525/2380 cut-off events. [2023-08-26 18:23:46,016 INFO L125 PetriNetUnfolderBase]: For 515/515 co-relation queries the response was YES. [2023-08-26 18:23:46,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5797 conditions, 2380 events. 1525/2380 cut-off events. For 515/515 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 13170 event pairs, 493 based on Foata normal form. 0/2160 useless extension candidates. Maximal degree in co-relation 5792. Up to 1579 conditions per place. [2023-08-26 18:23:46,028 INFO L140 encePairwiseOnDemand]: 298/301 looper letters, 47 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2023-08-26 18:23:46,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 277 flow [2023-08-26 18:23:46,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:23:46,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:23:46,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-08-26 18:23:46,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45182724252491696 [2023-08-26 18:23:46,030 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-08-26 18:23:46,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-08-26 18:23:46,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:46,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-08-26 18:23:46,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:46,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:46,034 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:46,034 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 117 flow. Second operand 3 states and 408 transitions. [2023-08-26 18:23:46,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 277 flow [2023-08-26 18:23:46,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 257 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:23:46,043 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 105 flow [2023-08-26 18:23:46,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-26 18:23:46,044 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -25 predicate places. [2023-08-26 18:23:46,044 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 105 flow [2023-08-26 18:23:46,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:46,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:46,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:46,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:23:46,045 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-08-26 18:23:46,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:46,045 INFO L85 PathProgramCache]: Analyzing trace with hash -256789304, now seen corresponding path program 1 times [2023-08-26 18:23:46,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:46,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383408597] [2023-08-26 18:23:46,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:46,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:46,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:46,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383408597] [2023-08-26 18:23:46,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383408597] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:46,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:46,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:23:46,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257928487] [2023-08-26 18:23:46,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:46,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:23:46,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:46,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:23:46,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:23:46,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 301 [2023-08-26 18:23:46,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:46,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:46,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 301 [2023-08-26 18:23:46,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:46,511 INFO L124 PetriNetUnfolderBase]: 1355/2243 cut-off events. [2023-08-26 18:23:46,512 INFO L125 PetriNetUnfolderBase]: For 311/311 co-relation queries the response was YES. [2023-08-26 18:23:46,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5214 conditions, 2243 events. 1355/2243 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 13205 event pairs, 453 based on Foata normal form. 0/2002 useless extension candidates. Maximal degree in co-relation 5209. Up to 1482 conditions per place. [2023-08-26 18:23:46,520 INFO L140 encePairwiseOnDemand]: 297/301 looper letters, 52 selfloop transitions, 3 changer transitions 1/58 dead transitions. [2023-08-26 18:23:46,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 289 flow [2023-08-26 18:23:46,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:23:46,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:23:46,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2023-08-26 18:23:46,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4584717607973422 [2023-08-26 18:23:46,523 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 414 transitions. [2023-08-26 18:23:46,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 414 transitions. [2023-08-26 18:23:46,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:46,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 414 transitions. [2023-08-26 18:23:46,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:46,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:46,526 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:46,526 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 105 flow. Second operand 3 states and 414 transitions. [2023-08-26 18:23:46,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 289 flow [2023-08-26 18:23:46,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 58 transitions, 283 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:23:46,528 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 114 flow [2023-08-26 18:23:46,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-26 18:23:46,529 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -25 predicate places. [2023-08-26 18:23:46,529 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 114 flow [2023-08-26 18:23:46,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:46,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:46,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:46,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:23:46,530 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-08-26 18:23:46,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:46,530 INFO L85 PathProgramCache]: Analyzing trace with hash -256789106, now seen corresponding path program 1 times [2023-08-26 18:23:46,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:46,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709027536] [2023-08-26 18:23:46,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:46,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:46,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:46,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:46,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709027536] [2023-08-26 18:23:46,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709027536] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:46,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:46,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:23:46,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483190350] [2023-08-26 18:23:46,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:46,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:23:46,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:46,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:23:46,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:23:46,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 301 [2023-08-26 18:23:46,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:46,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:46,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 301 [2023-08-26 18:23:46,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:47,016 INFO L124 PetriNetUnfolderBase]: 1334/2096 cut-off events. [2023-08-26 18:23:47,016 INFO L125 PetriNetUnfolderBase]: For 553/553 co-relation queries the response was YES. [2023-08-26 18:23:47,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5314 conditions, 2096 events. 1334/2096 cut-off events. For 553/553 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 11588 event pairs, 222 based on Foata normal form. 0/1954 useless extension candidates. Maximal degree in co-relation 5308. Up to 1764 conditions per place. [2023-08-26 18:23:47,028 INFO L140 encePairwiseOnDemand]: 298/301 looper letters, 46 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-08-26 18:23:47,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 268 flow [2023-08-26 18:23:47,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:23:47,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:23:47,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-08-26 18:23:47,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44518272425249167 [2023-08-26 18:23:47,030 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-08-26 18:23:47,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-08-26 18:23:47,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:47,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-08-26 18:23:47,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:47,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:47,034 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:47,034 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 114 flow. Second operand 3 states and 402 transitions. [2023-08-26 18:23:47,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 268 flow [2023-08-26 18:23:47,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 50 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:23:47,036 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 116 flow [2023-08-26 18:23:47,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2023-08-26 18:23:47,037 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -24 predicate places. [2023-08-26 18:23:47,037 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 116 flow [2023-08-26 18:23:47,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:47,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:47,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:47,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:23:47,038 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-08-26 18:23:47,039 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:47,039 INFO L85 PathProgramCache]: Analyzing trace with hash 160004810, now seen corresponding path program 1 times [2023-08-26 18:23:47,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:47,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477885180] [2023-08-26 18:23:47,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:47,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:47,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:47,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:47,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477885180] [2023-08-26 18:23:47,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477885180] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:47,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:47,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:23:47,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523303908] [2023-08-26 18:23:47,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:47,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:23:47,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:47,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:23:47,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:23:47,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 301 [2023-08-26 18:23:47,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:47,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:47,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 301 [2023-08-26 18:23:47,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:47,618 INFO L124 PetriNetUnfolderBase]: 1323/2157 cut-off events. [2023-08-26 18:23:47,618 INFO L125 PetriNetUnfolderBase]: For 382/382 co-relation queries the response was YES. [2023-08-26 18:23:47,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5422 conditions, 2157 events. 1323/2157 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 11936 event pairs, 536 based on Foata normal form. 0/2021 useless extension candidates. Maximal degree in co-relation 5415. Up to 1140 conditions per place. [2023-08-26 18:23:47,629 INFO L140 encePairwiseOnDemand]: 296/301 looper letters, 46 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2023-08-26 18:23:47,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 271 flow [2023-08-26 18:23:47,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:23:47,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:23:47,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-26 18:23:47,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3953488372093023 [2023-08-26 18:23:47,631 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-26 18:23:47,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-26 18:23:47,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:47,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-26 18:23:47,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:47,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:47,634 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:47,634 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 116 flow. Second operand 3 states and 357 transitions. [2023-08-26 18:23:47,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 271 flow [2023-08-26 18:23:47,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:23:47,636 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 141 flow [2023-08-26 18:23:47,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2023-08-26 18:23:47,637 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -24 predicate places. [2023-08-26 18:23:47,637 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 141 flow [2023-08-26 18:23:47,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:47,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:47,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:47,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:23:47,638 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-08-26 18:23:47,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:47,638 INFO L85 PathProgramCache]: Analyzing trace with hash 629470711, now seen corresponding path program 1 times [2023-08-26 18:23:47,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:47,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295595980] [2023-08-26 18:23:47,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:47,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:47,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:47,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295595980] [2023-08-26 18:23:47,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295595980] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:47,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:47,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:23:47,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330108906] [2023-08-26 18:23:47,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:47,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:23:47,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:47,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:23:47,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:23:47,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 301 [2023-08-26 18:23:47,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:47,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:47,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 301 [2023-08-26 18:23:47,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:48,168 INFO L124 PetriNetUnfolderBase]: 1264/2068 cut-off events. [2023-08-26 18:23:48,168 INFO L125 PetriNetUnfolderBase]: For 1150/1150 co-relation queries the response was YES. [2023-08-26 18:23:48,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5562 conditions, 2068 events. 1264/2068 cut-off events. For 1150/1150 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 11409 event pairs, 538 based on Foata normal form. 30/2025 useless extension candidates. Maximal degree in co-relation 5554. Up to 1365 conditions per place. [2023-08-26 18:23:48,178 INFO L140 encePairwiseOnDemand]: 298/301 looper letters, 50 selfloop transitions, 3 changer transitions 3/58 dead transitions. [2023-08-26 18:23:48,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 322 flow [2023-08-26 18:23:48,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:23:48,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:23:48,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions. [2023-08-26 18:23:48,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3953488372093023 [2023-08-26 18:23:48,181 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 476 transitions. [2023-08-26 18:23:48,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 476 transitions. [2023-08-26 18:23:48,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:48,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 476 transitions. [2023-08-26 18:23:48,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:48,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:48,184 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:48,184 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 141 flow. Second operand 4 states and 476 transitions. [2023-08-26 18:23:48,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 322 flow [2023-08-26 18:23:48,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:23:48,193 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 135 flow [2023-08-26 18:23:48,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-08-26 18:23:48,195 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -24 predicate places. [2023-08-26 18:23:48,196 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 135 flow [2023-08-26 18:23:48,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:48,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:48,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:48,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:23:48,196 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-08-26 18:23:48,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:48,197 INFO L85 PathProgramCache]: Analyzing trace with hash 627588929, now seen corresponding path program 1 times [2023-08-26 18:23:48,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:48,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703043877] [2023-08-26 18:23:48,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:48,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:48,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:48,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:48,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703043877] [2023-08-26 18:23:48,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703043877] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:48,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:48,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:23:48,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029907712] [2023-08-26 18:23:48,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:48,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:23:48,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:48,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:23:48,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:23:48,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 301 [2023-08-26 18:23:48,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:48,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:48,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 301 [2023-08-26 18:23:48,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:48,826 INFO L124 PetriNetUnfolderBase]: 2392/3613 cut-off events. [2023-08-26 18:23:48,827 INFO L125 PetriNetUnfolderBase]: For 2567/2567 co-relation queries the response was YES. [2023-08-26 18:23:48,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9443 conditions, 3613 events. 2392/3613 cut-off events. For 2567/2567 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 18808 event pairs, 320 based on Foata normal form. 16/3509 useless extension candidates. Maximal degree in co-relation 9436. Up to 2949 conditions per place. [2023-08-26 18:23:48,842 INFO L140 encePairwiseOnDemand]: 298/301 looper letters, 59 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-26 18:23:48,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 61 transitions, 362 flow [2023-08-26 18:23:48,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:23:48,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:23:48,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions. [2023-08-26 18:23:48,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2023-08-26 18:23:48,844 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions. [2023-08-26 18:23:48,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions. [2023-08-26 18:23:48,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:48,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions. [2023-08-26 18:23:48,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:48,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:48,847 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:48,847 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 135 flow. Second operand 3 states and 399 transitions. [2023-08-26 18:23:48,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 61 transitions, 362 flow [2023-08-26 18:23:48,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:23:48,850 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 139 flow [2023-08-26 18:23:48,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2023-08-26 18:23:48,851 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -23 predicate places. [2023-08-26 18:23:48,851 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 139 flow [2023-08-26 18:23:48,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:48,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:48,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:48,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:23:48,852 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-08-26 18:23:48,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:48,852 INFO L85 PathProgramCache]: Analyzing trace with hash -2019580955, now seen corresponding path program 1 times [2023-08-26 18:23:48,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:48,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623770046] [2023-08-26 18:23:48,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:48,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:48,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:48,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623770046] [2023-08-26 18:23:48,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623770046] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:48,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:48,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:23:48,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542024129] [2023-08-26 18:23:48,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:48,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:23:48,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:48,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:23:48,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:23:48,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 301 [2023-08-26 18:23:48,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:48,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:48,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 301 [2023-08-26 18:23:48,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:49,441 INFO L124 PetriNetUnfolderBase]: 2352/3557 cut-off events. [2023-08-26 18:23:49,441 INFO L125 PetriNetUnfolderBase]: For 1722/1722 co-relation queries the response was YES. [2023-08-26 18:23:49,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9912 conditions, 3557 events. 2352/3557 cut-off events. For 1722/1722 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 17710 event pairs, 1482 based on Foata normal form. 16/3453 useless extension candidates. Maximal degree in co-relation 9904. Up to 2626 conditions per place. [2023-08-26 18:23:49,457 INFO L140 encePairwiseOnDemand]: 298/301 looper letters, 59 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-26 18:23:49,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 364 flow [2023-08-26 18:23:49,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:23:49,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:23:49,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions. [2023-08-26 18:23:49,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2023-08-26 18:23:49,459 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions. [2023-08-26 18:23:49,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions. [2023-08-26 18:23:49,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:49,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions. [2023-08-26 18:23:49,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:49,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:49,462 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:49,462 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 139 flow. Second operand 3 states and 399 transitions. [2023-08-26 18:23:49,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 364 flow [2023-08-26 18:23:49,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 61 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:23:49,466 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 143 flow [2023-08-26 18:23:49,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2023-08-26 18:23:49,467 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -22 predicate places. [2023-08-26 18:23:49,467 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 143 flow [2023-08-26 18:23:49,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:49,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:49,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:49,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:23:49,468 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-08-26 18:23:49,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:49,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1961191585, now seen corresponding path program 1 times [2023-08-26 18:23:49,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:49,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742738770] [2023-08-26 18:23:49,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:49,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:49,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:49,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:49,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742738770] [2023-08-26 18:23:49,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742738770] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:49,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:49,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:23:49,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098346040] [2023-08-26 18:23:49,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:49,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:23:49,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:49,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:23:49,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:23:49,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 301 [2023-08-26 18:23:49,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:49,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:49,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 301 [2023-08-26 18:23:49,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:49,935 INFO L124 PetriNetUnfolderBase]: 1119/1815 cut-off events. [2023-08-26 18:23:49,935 INFO L125 PetriNetUnfolderBase]: For 1288/1288 co-relation queries the response was YES. [2023-08-26 18:23:49,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5265 conditions, 1815 events. 1119/1815 cut-off events. For 1288/1288 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 9643 event pairs, 479 based on Foata normal form. 15/1778 useless extension candidates. Maximal degree in co-relation 5256. Up to 669 conditions per place. [2023-08-26 18:23:49,943 INFO L140 encePairwiseOnDemand]: 292/301 looper letters, 37 selfloop transitions, 10 changer transitions 2/51 dead transitions. [2023-08-26 18:23:49,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 297 flow [2023-08-26 18:23:49,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:23:49,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:23:49,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 450 transitions. [2023-08-26 18:23:49,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37375415282392027 [2023-08-26 18:23:49,945 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 450 transitions. [2023-08-26 18:23:49,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 450 transitions. [2023-08-26 18:23:49,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:49,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 450 transitions. [2023-08-26 18:23:49,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:49,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:49,949 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:49,950 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 143 flow. Second operand 4 states and 450 transitions. [2023-08-26 18:23:49,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 297 flow [2023-08-26 18:23:49,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 51 transitions, 289 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:23:49,953 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 197 flow [2023-08-26 18:23:49,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2023-08-26 18:23:49,954 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -19 predicate places. [2023-08-26 18:23:49,954 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 197 flow [2023-08-26 18:23:49,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:49,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:49,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:49,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:23:49,955 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-08-26 18:23:49,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:49,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1890060557, now seen corresponding path program 1 times [2023-08-26 18:23:49,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:49,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479620522] [2023-08-26 18:23:49,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:49,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:50,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:50,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479620522] [2023-08-26 18:23:50,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479620522] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:50,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:50,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:23:50,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317629347] [2023-08-26 18:23:50,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:50,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:23:50,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:50,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:23:50,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:23:50,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 301 [2023-08-26 18:23:50,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 197 flow. Second operand has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:50,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:50,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 301 [2023-08-26 18:23:50,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:50,563 INFO L124 PetriNetUnfolderBase]: 1101/1852 cut-off events. [2023-08-26 18:23:50,564 INFO L125 PetriNetUnfolderBase]: For 1788/1788 co-relation queries the response was YES. [2023-08-26 18:23:50,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5634 conditions, 1852 events. 1101/1852 cut-off events. For 1788/1788 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10604 event pairs, 249 based on Foata normal form. 8/1835 useless extension candidates. Maximal degree in co-relation 5624. Up to 1258 conditions per place. [2023-08-26 18:23:50,573 INFO L140 encePairwiseOnDemand]: 296/301 looper letters, 52 selfloop transitions, 8 changer transitions 4/66 dead transitions. [2023-08-26 18:23:50,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 66 transitions, 442 flow [2023-08-26 18:23:50,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:23:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:23:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 454 transitions. [2023-08-26 18:23:50,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3770764119601329 [2023-08-26 18:23:50,576 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 454 transitions. [2023-08-26 18:23:50,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 454 transitions. [2023-08-26 18:23:50,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:50,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 454 transitions. [2023-08-26 18:23:50,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:50,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:50,579 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:50,579 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 197 flow. Second operand 4 states and 454 transitions. [2023-08-26 18:23:50,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 66 transitions, 442 flow [2023-08-26 18:23:50,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 66 transitions, 439 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:23:50,586 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 244 flow [2023-08-26 18:23:50,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2023-08-26 18:23:50,587 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -15 predicate places. [2023-08-26 18:23:50,587 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 244 flow [2023-08-26 18:23:50,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:50,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:50,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:50,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:23:50,588 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-08-26 18:23:50,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:50,588 INFO L85 PathProgramCache]: Analyzing trace with hash -667396682, now seen corresponding path program 1 times [2023-08-26 18:23:50,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:50,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365486295] [2023-08-26 18:23:50,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:50,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:50,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:50,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:50,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365486295] [2023-08-26 18:23:50,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365486295] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:50,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:50,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:23:50,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578773496] [2023-08-26 18:23:50,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:50,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:23:50,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:50,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:23:50,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:23:50,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 301 [2023-08-26 18:23:50,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 244 flow. Second operand has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:50,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:50,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 301 [2023-08-26 18:23:50,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:51,099 INFO L124 PetriNetUnfolderBase]: 973/1601 cut-off events. [2023-08-26 18:23:51,100 INFO L125 PetriNetUnfolderBase]: For 1872/1872 co-relation queries the response was YES. [2023-08-26 18:23:51,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5269 conditions, 1601 events. 973/1601 cut-off events. For 1872/1872 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 8420 event pairs, 414 based on Foata normal form. 24/1609 useless extension candidates. Maximal degree in co-relation 5256. Up to 639 conditions per place. [2023-08-26 18:23:51,109 INFO L140 encePairwiseOnDemand]: 291/301 looper letters, 45 selfloop transitions, 14 changer transitions 4/65 dead transitions. [2023-08-26 18:23:51,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 65 transitions, 467 flow [2023-08-26 18:23:51,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:23:51,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:23:51,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 649 transitions. [2023-08-26 18:23:51,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3593576965669989 [2023-08-26 18:23:51,112 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 649 transitions. [2023-08-26 18:23:51,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 649 transitions. [2023-08-26 18:23:51,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:51,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 649 transitions. [2023-08-26 18:23:51,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:51,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 301.0) internal successors, (2107), 7 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:51,117 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 301.0) internal successors, (2107), 7 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:51,117 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 244 flow. Second operand 6 states and 649 transitions. [2023-08-26 18:23:51,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 65 transitions, 467 flow [2023-08-26 18:23:51,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 65 transitions, 459 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:23:51,123 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 313 flow [2023-08-26 18:23:51,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=313, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2023-08-26 18:23:51,123 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -9 predicate places. [2023-08-26 18:23:51,123 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 313 flow [2023-08-26 18:23:51,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:51,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:51,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:51,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 18:23:51,124 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-08-26 18:23:51,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:51,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1662675495, now seen corresponding path program 1 times [2023-08-26 18:23:51,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:51,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839196949] [2023-08-26 18:23:51,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:51,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:51,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:51,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:51,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839196949] [2023-08-26 18:23:51,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839196949] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:51,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:51,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:23:51,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182006827] [2023-08-26 18:23:51,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:51,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:23:51,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:51,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:23:51,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:23:51,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 301 [2023-08-26 18:23:51,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 42 transitions, 313 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:51,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:51,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 301 [2023-08-26 18:23:51,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:51,874 INFO L124 PetriNetUnfolderBase]: 2949/4544 cut-off events. [2023-08-26 18:23:51,874 INFO L125 PetriNetUnfolderBase]: For 11974/11974 co-relation queries the response was YES. [2023-08-26 18:23:51,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15511 conditions, 4544 events. 2949/4544 cut-off events. For 11974/11974 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 24841 event pairs, 1239 based on Foata normal form. 24/4533 useless extension candidates. Maximal degree in co-relation 15497. Up to 2160 conditions per place. [2023-08-26 18:23:51,898 INFO L140 encePairwiseOnDemand]: 297/301 looper letters, 125 selfloop transitions, 4 changer transitions 3/132 dead transitions. [2023-08-26 18:23:51,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 132 transitions, 1328 flow [2023-08-26 18:23:51,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:23:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:23:51,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2023-08-26 18:23:51,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43853820598006643 [2023-08-26 18:23:51,901 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 660 transitions. [2023-08-26 18:23:51,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 660 transitions. [2023-08-26 18:23:51,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:51,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 660 transitions. [2023-08-26 18:23:51,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:51,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:51,906 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:51,906 INFO L175 Difference]: Start difference. First operand has 60 places, 42 transitions, 313 flow. Second operand 5 states and 660 transitions. [2023-08-26 18:23:51,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 132 transitions, 1328 flow [2023-08-26 18:23:51,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 132 transitions, 1255 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 18:23:51,929 INFO L231 Difference]: Finished difference. Result has 62 places, 44 transitions, 313 flow [2023-08-26 18:23:51,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=313, PETRI_PLACES=62, PETRI_TRANSITIONS=44} [2023-08-26 18:23:51,930 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -7 predicate places. [2023-08-26 18:23:51,930 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 44 transitions, 313 flow [2023-08-26 18:23:51,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:51,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:51,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:51,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 18:23:51,930 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-08-26 18:23:51,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:51,931 INFO L85 PathProgramCache]: Analyzing trace with hash 157127603, now seen corresponding path program 2 times [2023-08-26 18:23:51,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:51,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936147860] [2023-08-26 18:23:51,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:51,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:53,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:53,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936147860] [2023-08-26 18:23:53,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936147860] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:53,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:53,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:23:53,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111112909] [2023-08-26 18:23:53,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:53,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 18:23:53,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:53,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 18:23:53,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-26 18:23:53,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 301 [2023-08-26 18:23:53,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 44 transitions, 313 flow. Second operand has 9 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:53,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:53,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 301 [2023-08-26 18:23:53,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:54,114 INFO L124 PetriNetUnfolderBase]: 2037/3390 cut-off events. [2023-08-26 18:23:54,114 INFO L125 PetriNetUnfolderBase]: For 5921/5929 co-relation queries the response was YES. [2023-08-26 18:23:54,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11697 conditions, 3390 events. 2037/3390 cut-off events. For 5921/5929 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 21233 event pairs, 827 based on Foata normal form. 16/3359 useless extension candidates. Maximal degree in co-relation 11680. Up to 2619 conditions per place. [2023-08-26 18:23:54,134 INFO L140 encePairwiseOnDemand]: 290/301 looper letters, 81 selfloop transitions, 18 changer transitions 0/102 dead transitions. [2023-08-26 18:23:54,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 102 transitions, 778 flow [2023-08-26 18:23:54,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 18:23:54,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 18:23:54,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1072 transitions. [2023-08-26 18:23:54,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32376925400181217 [2023-08-26 18:23:54,138 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1072 transitions. [2023-08-26 18:23:54,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1072 transitions. [2023-08-26 18:23:54,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:54,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1072 transitions. [2023-08-26 18:23:54,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 97.45454545454545) internal successors, (1072), 11 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:54,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 301.0) internal successors, (3612), 12 states have internal predecessors, (3612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:54,146 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 301.0) internal successors, (3612), 12 states have internal predecessors, (3612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:54,146 INFO L175 Difference]: Start difference. First operand has 62 places, 44 transitions, 313 flow. Second operand 11 states and 1072 transitions. [2023-08-26 18:23:54,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 102 transitions, 778 flow [2023-08-26 18:23:54,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 102 transitions, 759 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:23:54,168 INFO L231 Difference]: Finished difference. Result has 78 places, 59 transitions, 494 flow [2023-08-26 18:23:54,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=494, PETRI_PLACES=78, PETRI_TRANSITIONS=59} [2023-08-26 18:23:54,169 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 9 predicate places. [2023-08-26 18:23:54,169 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 59 transitions, 494 flow [2023-08-26 18:23:54,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:54,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:54,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:54,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 18:23:54,170 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-08-26 18:23:54,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:54,170 INFO L85 PathProgramCache]: Analyzing trace with hash -306728111, now seen corresponding path program 3 times [2023-08-26 18:23:54,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:54,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492721739] [2023-08-26 18:23:54,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:54,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:55,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:55,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:55,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492721739] [2023-08-26 18:23:55,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492721739] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:55,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:55,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:23:55,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143607728] [2023-08-26 18:23:55,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:55,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:23:55,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:55,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:23:55,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:23:55,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 301 [2023-08-26 18:23:55,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 59 transitions, 494 flow. Second operand has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:55,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:55,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 301 [2023-08-26 18:23:55,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:56,169 INFO L124 PetriNetUnfolderBase]: 2257/3760 cut-off events. [2023-08-26 18:23:56,169 INFO L125 PetriNetUnfolderBase]: For 8610/8618 co-relation queries the response was YES. [2023-08-26 18:23:56,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14271 conditions, 3760 events. 2257/3760 cut-off events. For 8610/8618 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 24163 event pairs, 306 based on Foata normal form. 16/3723 useless extension candidates. Maximal degree in co-relation 14246. Up to 2037 conditions per place. [2023-08-26 18:23:56,187 INFO L140 encePairwiseOnDemand]: 292/301 looper letters, 94 selfloop transitions, 35 changer transitions 0/132 dead transitions. [2023-08-26 18:23:56,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 132 transitions, 1191 flow [2023-08-26 18:23:56,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 18:23:56,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 18:23:56,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1184 transitions. [2023-08-26 18:23:56,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.327796234772979 [2023-08-26 18:23:56,191 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1184 transitions. [2023-08-26 18:23:56,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1184 transitions. [2023-08-26 18:23:56,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:56,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1184 transitions. [2023-08-26 18:23:56,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 98.66666666666667) internal successors, (1184), 12 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:56,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 301.0) internal successors, (3913), 13 states have internal predecessors, (3913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:56,199 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 301.0) internal successors, (3913), 13 states have internal predecessors, (3913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:56,199 INFO L175 Difference]: Start difference. First operand has 78 places, 59 transitions, 494 flow. Second operand 12 states and 1184 transitions. [2023-08-26 18:23:56,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 132 transitions, 1191 flow [2023-08-26 18:23:56,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 132 transitions, 1165 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-26 18:23:56,240 INFO L231 Difference]: Finished difference. Result has 93 places, 80 transitions, 808 flow [2023-08-26 18:23:56,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=808, PETRI_PLACES=93, PETRI_TRANSITIONS=80} [2023-08-26 18:23:56,241 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 24 predicate places. [2023-08-26 18:23:56,241 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 80 transitions, 808 flow [2023-08-26 18:23:56,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:56,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:56,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:56,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 18:23:56,242 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-08-26 18:23:56,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:56,242 INFO L85 PathProgramCache]: Analyzing trace with hash 785542437, now seen corresponding path program 1 times [2023-08-26 18:23:56,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:56,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441139667] [2023-08-26 18:23:56,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:56,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:56,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:56,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441139667] [2023-08-26 18:23:56,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441139667] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:56,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:56,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:23:56,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768146640] [2023-08-26 18:23:56,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:56,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 18:23:56,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:56,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 18:23:56,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-08-26 18:23:56,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 301 [2023-08-26 18:23:56,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 80 transitions, 808 flow. Second operand has 9 states, 9 states have (on average 98.66666666666667) internal successors, (888), 9 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:56,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:56,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 301 [2023-08-26 18:23:56,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:57,203 INFO L124 PetriNetUnfolderBase]: 2113/3445 cut-off events. [2023-08-26 18:23:57,203 INFO L125 PetriNetUnfolderBase]: For 12081/12087 co-relation queries the response was YES. [2023-08-26 18:23:57,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14505 conditions, 3445 events. 2113/3445 cut-off events. For 12081/12087 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 21000 event pairs, 513 based on Foata normal form. 75/3509 useless extension candidates. Maximal degree in co-relation 14475. Up to 1474 conditions per place. [2023-08-26 18:23:57,218 INFO L140 encePairwiseOnDemand]: 292/301 looper letters, 72 selfloop transitions, 26 changer transitions 8/108 dead transitions. [2023-08-26 18:23:57,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 108 transitions, 1154 flow [2023-08-26 18:23:57,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:23:57,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:23:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 832 transitions. [2023-08-26 18:23:57,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34551495016611294 [2023-08-26 18:23:57,221 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 832 transitions. [2023-08-26 18:23:57,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 832 transitions. [2023-08-26 18:23:57,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:57,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 832 transitions. [2023-08-26 18:23:57,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 104.0) internal successors, (832), 8 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:57,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 301.0) internal successors, (2709), 9 states have internal predecessors, (2709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:57,227 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 301.0) internal successors, (2709), 9 states have internal predecessors, (2709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:57,227 INFO L175 Difference]: Start difference. First operand has 93 places, 80 transitions, 808 flow. Second operand 8 states and 832 transitions. [2023-08-26 18:23:57,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 108 transitions, 1154 flow [2023-08-26 18:23:57,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 108 transitions, 1055 flow, removed 23 selfloop flow, removed 5 redundant places. [2023-08-26 18:23:57,295 INFO L231 Difference]: Finished difference. Result has 92 places, 75 transitions, 738 flow [2023-08-26 18:23:57,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=738, PETRI_PLACES=92, PETRI_TRANSITIONS=75} [2023-08-26 18:23:57,296 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 23 predicate places. [2023-08-26 18:23:57,296 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 75 transitions, 738 flow [2023-08-26 18:23:57,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 98.66666666666667) internal successors, (888), 9 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:57,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:57,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:57,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 18:23:57,297 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-08-26 18:23:57,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:57,297 INFO L85 PathProgramCache]: Analyzing trace with hash 874644172, now seen corresponding path program 1 times [2023-08-26 18:23:57,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:57,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280626671] [2023-08-26 18:23:57,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:57,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:57,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:57,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:57,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280626671] [2023-08-26 18:23:57,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280626671] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:57,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:57,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:23:57,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038581114] [2023-08-26 18:23:57,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:57,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:23:57,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:57,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:23:57,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:23:57,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 301 [2023-08-26 18:23:57,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 75 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:57,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:57,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 301 [2023-08-26 18:23:57,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:57,628 INFO L124 PetriNetUnfolderBase]: 735/1328 cut-off events. [2023-08-26 18:23:57,628 INFO L125 PetriNetUnfolderBase]: For 4374/4374 co-relation queries the response was YES. [2023-08-26 18:23:57,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5579 conditions, 1328 events. 735/1328 cut-off events. For 4374/4374 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6993 event pairs, 132 based on Foata normal form. 33/1358 useless extension candidates. Maximal degree in co-relation 5551. Up to 1200 conditions per place. [2023-08-26 18:23:57,633 INFO L140 encePairwiseOnDemand]: 296/301 looper letters, 83 selfloop transitions, 4 changer transitions 10/99 dead transitions. [2023-08-26 18:23:57,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 99 transitions, 1093 flow [2023-08-26 18:23:57,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:23:57,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:23:57,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2023-08-26 18:23:57,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43078626799557035 [2023-08-26 18:23:57,636 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2023-08-26 18:23:57,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2023-08-26 18:23:57,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:57,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2023-08-26 18:23:57,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:57,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:57,639 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:57,639 INFO L175 Difference]: Start difference. First operand has 92 places, 75 transitions, 738 flow. Second operand 3 states and 389 transitions. [2023-08-26 18:23:57,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 99 transitions, 1093 flow [2023-08-26 18:23:57,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 99 transitions, 1043 flow, removed 1 selfloop flow, removed 7 redundant places. [2023-08-26 18:23:57,655 INFO L231 Difference]: Finished difference. Result has 86 places, 68 transitions, 607 flow [2023-08-26 18:23:57,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=607, PETRI_PLACES=86, PETRI_TRANSITIONS=68} [2023-08-26 18:23:57,655 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 17 predicate places. [2023-08-26 18:23:57,655 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 68 transitions, 607 flow [2023-08-26 18:23:57,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:57,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:57,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:57,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 18:23:57,656 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-08-26 18:23:57,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:57,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1749836440, now seen corresponding path program 1 times [2023-08-26 18:23:57,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:57,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503300659] [2023-08-26 18:23:57,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:57,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:57,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:57,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:57,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503300659] [2023-08-26 18:23:57,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503300659] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:57,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:57,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:23:57,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314123642] [2023-08-26 18:23:57,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:57,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:23:57,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:57,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:23:57,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:23:57,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 301 [2023-08-26 18:23:57,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 68 transitions, 607 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:57,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:57,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 301 [2023-08-26 18:23:57,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:57,999 INFO L124 PetriNetUnfolderBase]: 223/472 cut-off events. [2023-08-26 18:23:57,999 INFO L125 PetriNetUnfolderBase]: For 1413/1413 co-relation queries the response was YES. [2023-08-26 18:23:58,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2114 conditions, 472 events. 223/472 cut-off events. For 1413/1413 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2025 event pairs, 25 based on Foata normal form. 40/508 useless extension candidates. Maximal degree in co-relation 2086. Up to 231 conditions per place. [2023-08-26 18:23:58,002 INFO L140 encePairwiseOnDemand]: 296/301 looper letters, 67 selfloop transitions, 7 changer transitions 28/104 dead transitions. [2023-08-26 18:23:58,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 104 transitions, 1056 flow [2023-08-26 18:23:58,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:23:58,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:23:58,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 517 transitions. [2023-08-26 18:23:58,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42940199335548174 [2023-08-26 18:23:58,005 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 517 transitions. [2023-08-26 18:23:58,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 517 transitions. [2023-08-26 18:23:58,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:58,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 517 transitions. [2023-08-26 18:23:58,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:58,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:58,008 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:58,008 INFO L175 Difference]: Start difference. First operand has 86 places, 68 transitions, 607 flow. Second operand 4 states and 517 transitions. [2023-08-26 18:23:58,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 104 transitions, 1056 flow [2023-08-26 18:23:58,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 104 transitions, 1041 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-26 18:23:58,016 INFO L231 Difference]: Finished difference. Result has 86 places, 43 transitions, 312 flow [2023-08-26 18:23:58,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=312, PETRI_PLACES=86, PETRI_TRANSITIONS=43} [2023-08-26 18:23:58,016 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 17 predicate places. [2023-08-26 18:23:58,016 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 43 transitions, 312 flow [2023-08-26 18:23:58,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:58,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:58,029 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 18:23:58,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 18:23:58,029 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-08-26 18:23:58,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:58,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1718631309, now seen corresponding path program 1 times [2023-08-26 18:23:58,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:58,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695372517] [2023-08-26 18:23:58,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:58,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:58,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:58,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695372517] [2023-08-26 18:23:58,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695372517] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:58,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:58,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:23:58,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248526183] [2023-08-26 18:23:58,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:58,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:23:58,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:58,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:23:58,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:23:58,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 301 [2023-08-26 18:23:58,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 43 transitions, 312 flow. Second operand has 5 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:58,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:58,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 301 [2023-08-26 18:23:58,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:58,369 INFO L124 PetriNetUnfolderBase]: 147/299 cut-off events. [2023-08-26 18:23:58,369 INFO L125 PetriNetUnfolderBase]: For 1124/1124 co-relation queries the response was YES. [2023-08-26 18:23:58,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1373 conditions, 299 events. 147/299 cut-off events. For 1124/1124 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1224 event pairs, 18 based on Foata normal form. 13/308 useless extension candidates. Maximal degree in co-relation 1346. Up to 136 conditions per place. [2023-08-26 18:23:58,370 INFO L140 encePairwiseOnDemand]: 296/301 looper letters, 60 selfloop transitions, 10 changer transitions 4/76 dead transitions. [2023-08-26 18:23:58,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 76 transitions, 693 flow [2023-08-26 18:23:58,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:23:58,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:23:58,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2023-08-26 18:23:58,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212624584717608 [2023-08-26 18:23:58,373 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 634 transitions. [2023-08-26 18:23:58,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 634 transitions. [2023-08-26 18:23:58,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:58,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 634 transitions. [2023-08-26 18:23:58,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:58,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:58,376 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:58,376 INFO L175 Difference]: Start difference. First operand has 86 places, 43 transitions, 312 flow. Second operand 5 states and 634 transitions. [2023-08-26 18:23:58,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 76 transitions, 693 flow [2023-08-26 18:23:58,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 76 transitions, 555 flow, removed 20 selfloop flow, removed 20 redundant places. [2023-08-26 18:23:58,380 INFO L231 Difference]: Finished difference. Result has 66 places, 39 transitions, 235 flow [2023-08-26 18:23:58,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=66, PETRI_TRANSITIONS=39} [2023-08-26 18:23:58,380 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -3 predicate places. [2023-08-26 18:23:58,380 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 39 transitions, 235 flow [2023-08-26 18:23:58,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:58,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:58,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:58,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 18:23:58,381 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-08-26 18:23:58,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:58,381 INFO L85 PathProgramCache]: Analyzing trace with hash -813628046, now seen corresponding path program 1 times [2023-08-26 18:23:58,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:58,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031448945] [2023-08-26 18:23:58,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:58,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:58,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:58,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031448945] [2023-08-26 18:23:58,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031448945] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:58,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:58,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:23:58,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133221051] [2023-08-26 18:23:58,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:58,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:23:58,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:58,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:23:58,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:23:58,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 301 [2023-08-26 18:23:58,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 39 transitions, 235 flow. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:58,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:58,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 301 [2023-08-26 18:23:58,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:58,701 INFO L124 PetriNetUnfolderBase]: 333/607 cut-off events. [2023-08-26 18:23:58,702 INFO L125 PetriNetUnfolderBase]: For 1403/1403 co-relation queries the response was YES. [2023-08-26 18:23:58,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2289 conditions, 607 events. 333/607 cut-off events. For 1403/1403 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2687 event pairs, 90 based on Foata normal form. 1/608 useless extension candidates. Maximal degree in co-relation 2274. Up to 239 conditions per place. [2023-08-26 18:23:58,704 INFO L140 encePairwiseOnDemand]: 298/301 looper letters, 52 selfloop transitions, 1 changer transitions 29/82 dead transitions. [2023-08-26 18:23:58,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 82 transitions, 676 flow [2023-08-26 18:23:58,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:23:58,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:23:58,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 507 transitions. [2023-08-26 18:23:58,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4210963455149502 [2023-08-26 18:23:58,706 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 507 transitions. [2023-08-26 18:23:58,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 507 transitions. [2023-08-26 18:23:58,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:58,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 507 transitions. [2023-08-26 18:23:58,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:58,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:58,709 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:58,709 INFO L175 Difference]: Start difference. First operand has 66 places, 39 transitions, 235 flow. Second operand 4 states and 507 transitions. [2023-08-26 18:23:58,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 82 transitions, 676 flow [2023-08-26 18:23:58,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 82 transitions, 620 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-26 18:23:58,713 INFO L231 Difference]: Finished difference. Result has 63 places, 39 transitions, 216 flow [2023-08-26 18:23:58,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=63, PETRI_TRANSITIONS=39} [2023-08-26 18:23:58,714 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -6 predicate places. [2023-08-26 18:23:58,714 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 39 transitions, 216 flow [2023-08-26 18:23:58,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:58,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:58,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:58,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 18:23:58,714 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-08-26 18:23:58,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:58,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1680336766, now seen corresponding path program 2 times [2023-08-26 18:23:58,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:58,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771622988] [2023-08-26 18:23:58,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:58,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:58,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:58,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771622988] [2023-08-26 18:23:58,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771622988] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:58,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:58,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:23:58,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814857813] [2023-08-26 18:23:58,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:58,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:23:58,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:58,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:23:58,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:23:58,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 301 [2023-08-26 18:23:58,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 39 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:58,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:58,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 301 [2023-08-26 18:23:58,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:59,054 INFO L124 PetriNetUnfolderBase]: 288/552 cut-off events. [2023-08-26 18:23:59,054 INFO L125 PetriNetUnfolderBase]: For 1163/1163 co-relation queries the response was YES. [2023-08-26 18:23:59,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2115 conditions, 552 events. 288/552 cut-off events. For 1163/1163 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2528 event pairs, 27 based on Foata normal form. 1/553 useless extension candidates. Maximal degree in co-relation 2098. Up to 349 conditions per place. [2023-08-26 18:23:59,056 INFO L140 encePairwiseOnDemand]: 297/301 looper letters, 48 selfloop transitions, 3 changer transitions 29/80 dead transitions. [2023-08-26 18:23:59,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 80 transitions, 626 flow [2023-08-26 18:23:59,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:23:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:23:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 504 transitions. [2023-08-26 18:23:59,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4186046511627907 [2023-08-26 18:23:59,058 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 504 transitions. [2023-08-26 18:23:59,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 504 transitions. [2023-08-26 18:23:59,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:59,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 504 transitions. [2023-08-26 18:23:59,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:59,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:59,061 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:59,061 INFO L175 Difference]: Start difference. First operand has 63 places, 39 transitions, 216 flow. Second operand 4 states and 504 transitions. [2023-08-26 18:23:59,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 80 transitions, 626 flow [2023-08-26 18:23:59,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 80 transitions, 623 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 18:23:59,064 INFO L231 Difference]: Finished difference. Result has 64 places, 36 transitions, 203 flow [2023-08-26 18:23:59,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=203, PETRI_PLACES=64, PETRI_TRANSITIONS=36} [2023-08-26 18:23:59,066 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -5 predicate places. [2023-08-26 18:23:59,066 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 36 transitions, 203 flow [2023-08-26 18:23:59,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:59,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:59,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:59,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 18:23:59,067 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-08-26 18:23:59,067 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:59,067 INFO L85 PathProgramCache]: Analyzing trace with hash 686607140, now seen corresponding path program 3 times [2023-08-26 18:23:59,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:59,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119068742] [2023-08-26 18:23:59,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:59,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:23:59,119 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:23:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:23:59,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:23:59,213 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:23:59,214 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONASSERT (57 of 58 remaining) [2023-08-26 18:23:59,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 58 remaining) [2023-08-26 18:23:59,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 58 remaining) [2023-08-26 18:23:59,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 58 remaining) [2023-08-26 18:23:59,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 58 remaining) [2023-08-26 18:23:59,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 58 remaining) [2023-08-26 18:23:59,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 58 remaining) [2023-08-26 18:23:59,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 58 remaining) [2023-08-26 18:23:59,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 58 remaining) [2023-08-26 18:23:59,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 58 remaining) [2023-08-26 18:23:59,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 58 remaining) [2023-08-26 18:23:59,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 58 remaining) [2023-08-26 18:23:59,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 58 remaining) [2023-08-26 18:23:59,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 58 remaining) [2023-08-26 18:23:59,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 58 remaining) [2023-08-26 18:23:59,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 58 remaining) [2023-08-26 18:23:59,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 58 remaining) [2023-08-26 18:23:59,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (40 of 58 remaining) [2023-08-26 18:23:59,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 58 remaining) [2023-08-26 18:23:59,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 58 remaining) [2023-08-26 18:23:59,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 58 remaining) [2023-08-26 18:23:59,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 58 remaining) [2023-08-26 18:23:59,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 58 remaining) [2023-08-26 18:23:59,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 58 remaining) [2023-08-26 18:23:59,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 58 remaining) [2023-08-26 18:23:59,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 58 remaining) [2023-08-26 18:23:59,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 58 remaining) [2023-08-26 18:23:59,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 58 remaining) [2023-08-26 18:23:59,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 58 remaining) [2023-08-26 18:23:59,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 58 remaining) [2023-08-26 18:23:59,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 58 remaining) [2023-08-26 18:23:59,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 58 remaining) [2023-08-26 18:23:59,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 58 remaining) [2023-08-26 18:23:59,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 58 remaining) [2023-08-26 18:23:59,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 58 remaining) [2023-08-26 18:23:59,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 58 remaining) [2023-08-26 18:23:59,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 58 remaining) [2023-08-26 18:23:59,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 58 remaining) [2023-08-26 18:23:59,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 58 remaining) [2023-08-26 18:23:59,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 58 remaining) [2023-08-26 18:23:59,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 58 remaining) [2023-08-26 18:23:59,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 58 remaining) [2023-08-26 18:23:59,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 58 remaining) [2023-08-26 18:23:59,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 58 remaining) [2023-08-26 18:23:59,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 58 remaining) [2023-08-26 18:23:59,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 58 remaining) [2023-08-26 18:23:59,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 58 remaining) [2023-08-26 18:23:59,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 58 remaining) [2023-08-26 18:23:59,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 58 remaining) [2023-08-26 18:23:59,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 58 remaining) [2023-08-26 18:23:59,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 58 remaining) [2023-08-26 18:23:59,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 58 remaining) [2023-08-26 18:23:59,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 58 remaining) [2023-08-26 18:23:59,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (4 of 58 remaining) [2023-08-26 18:23:59,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 58 remaining) [2023-08-26 18:23:59,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 58 remaining) [2023-08-26 18:23:59,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 58 remaining) [2023-08-26 18:23:59,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 58 remaining) [2023-08-26 18:23:59,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 18:23:59,221 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:59,228 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:23:59,228 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:23:59,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:23:59 BasicIcfg [2023-08-26 18:23:59,326 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:23:59,326 INFO L158 Benchmark]: Toolchain (without parser) took 29017.71ms. Allocated memory was 373.3MB in the beginning and 981.5MB in the end (delta: 608.2MB). Free memory was 346.6MB in the beginning and 851.7MB in the end (delta: -505.1MB). Peak memory consumption was 106.2MB. Max. memory is 16.0GB. [2023-08-26 18:23:59,327 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 373.3MB. Free memory was 350.2MB in the beginning and 350.2MB in the end (delta: 16.7kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:23:59,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 553.44ms. Allocated memory is still 373.3MB. Free memory was 345.8MB in the beginning and 322.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 18:23:59,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.95ms. Allocated memory is still 373.3MB. Free memory was 322.7MB in the beginning and 319.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:23:59,327 INFO L158 Benchmark]: Boogie Preprocessor took 41.34ms. Allocated memory is still 373.3MB. Free memory was 319.8MB in the beginning and 317.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:23:59,327 INFO L158 Benchmark]: RCFGBuilder took 1152.65ms. Allocated memory was 373.3MB in the beginning and 509.6MB in the end (delta: 136.3MB). Free memory was 317.7MB in the beginning and 420.3MB in the end (delta: -102.6MB). Peak memory consumption was 68.9MB. Max. memory is 16.0GB. [2023-08-26 18:23:59,328 INFO L158 Benchmark]: TraceAbstraction took 27209.05ms. Allocated memory was 509.6MB in the beginning and 981.5MB in the end (delta: 471.9MB). Free memory was 419.3MB in the beginning and 851.7MB in the end (delta: -432.4MB). Peak memory consumption was 39.5MB. Max. memory is 16.0GB. [2023-08-26 18:23:59,329 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 373.3MB. Free memory was 350.2MB in the beginning and 350.2MB in the end (delta: 16.7kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 553.44ms. Allocated memory is still 373.3MB. Free memory was 345.8MB in the beginning and 322.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 53.95ms. Allocated memory is still 373.3MB. Free memory was 322.7MB in the beginning and 319.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 41.34ms. Allocated memory is still 373.3MB. Free memory was 319.8MB in the beginning and 317.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1152.65ms. Allocated memory was 373.3MB in the beginning and 509.6MB in the end (delta: 136.3MB). Free memory was 317.7MB in the beginning and 420.3MB in the end (delta: -102.6MB). Peak memory consumption was 68.9MB. Max. memory is 16.0GB. * TraceAbstraction took 27209.05ms. Allocated memory was 509.6MB in the beginning and 981.5MB in the end (delta: 471.9MB). Free memory was 419.3MB in the beginning and 851.7MB in the end (delta: -432.4MB). Peak memory consumption was 39.5MB. 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: 9.9s, 165 PlacesBefore, 69 PlacesAfterwards, 158 TransitionsBefore, 60 TransitionsAfterwards, 4956 CoEnabledTransitionPairs, 7 FixpointIterations, 63 TrivialSequentialCompositions, 69 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 140 TotalNumberOfCompositions, 18505 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6810, independent: 6415, independent conditional: 0, independent unconditional: 6415, dependent: 395, dependent conditional: 0, dependent unconditional: 395, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2252, independent: 2189, independent conditional: 0, independent unconditional: 2189, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6810, independent: 4226, independent conditional: 0, independent unconditional: 4226, dependent: 332, dependent conditional: 0, dependent unconditional: 332, unknown: 2252, unknown conditional: 0, unknown unconditional: 2252] , Statistics on independence cache: Total cache size (in pairs): 309, Positive cache size: 279, Positive conditional cache size: 0, Positive unconditional cache size: 279, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 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; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L844] 0 pthread_t t2100; [L845] FCALL, FORK 0 pthread_create(&t2100, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2100, ((void *)0), P0, ((void *)0))=-2, t2100={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L846] 0 pthread_t t2101; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2100={7:0}, t2101={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L780] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L847] FCALL, FORK 0 pthread_create(&t2101, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2101, ((void *)0), P1, ((void *)0))=-1, t2100={7:0}, t2101={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L848] 0 pthread_t t2102; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2100={7:0}, t2101={5:0}, t2102={6:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L849] FCALL, FORK 0 pthread_create(&t2102, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2102, ((void *)0), P2, ((void *)0))=0, t2100={7:0}, t2101={5:0}, t2102={6:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L792] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L795] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L807] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L810] 3 y$w_buff1 = y$w_buff0 [L811] 3 y$w_buff0 = 1 [L812] 3 y$w_buff1_used = y$w_buff0_used [L813] 3 y$w_buff0_used = (_Bool)1 [L814] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L814] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L815] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L816] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L817] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L818] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L819] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 \read(y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100={7:0}, t2101={5:0}, t2102={6:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L862] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L863] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L863] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L863] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L863] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L863] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L863] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) [L866] 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", "safe014_power.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={51:49}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - 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: 18]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 849]: 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: 845]: 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: 847]: 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, 205 locations, 58 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: 26.9s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 668 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 668 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1765 IncrementalHoareTripleChecker+Invalid, 1895 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 9 mSDtfsCounter, 1765 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=808occurred in iteration=16, 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, 5.2s InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 2012 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 18:23:59,350 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...