/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/mix055.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:18:23,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:18:23,878 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:18:23,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:18:23,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:18:23,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:18:23,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:18:23,920 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:18:23,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:18:23,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:18:23,921 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:18:23,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:18:23,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:18:23,922 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:18:23,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:18:23,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:18:23,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:18:23,923 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:18:23,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:18:23,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:18:23,924 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:18:23,928 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:18:23,928 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:18:23,929 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:18:23,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:18:23,931 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:18:23,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:18:23,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:18:23,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:18:23,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:18:23,933 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:18:23,933 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:18:23,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:18:23,934 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:18:23,934 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:18:23,934 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:18:24,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:18:24,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:18:24,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:18:24,295 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:18:24,296 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:18:24,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2023-08-26 18:18:25,536 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:18:25,873 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:18:25,874 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2023-08-26 18:18:25,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921cc5f90/8bec0eeca01e4e6fb6a4b43c0fe39a57/FLAGfe42a973b [2023-08-26 18:18:25,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921cc5f90/8bec0eeca01e4e6fb6a4b43c0fe39a57 [2023-08-26 18:18:25,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:18:25,910 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:18:25,912 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:18:25,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:18:25,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:18:25,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:18:25" (1/1) ... [2023-08-26 18:18:25,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@171a92cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:25, skipping insertion in model container [2023-08-26 18:18:25,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:18:25" (1/1) ... [2023-08-26 18:18:25,970 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:18:26,324 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:18:26,337 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:18:26,354 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:18:26,355 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:18:26,393 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:18:26,430 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:18:26,430 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:18:26,436 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:18:26,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:26 WrapperNode [2023-08-26 18:18:26,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:18:26,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:18:26,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:18:26,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:18:26,444 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:18:26" (1/1) ... [2023-08-26 18:18:26,457 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:18:26" (1/1) ... [2023-08-26 18:18:26,482 INFO L138 Inliner]: procedures = 177, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 166 [2023-08-26 18:18:26,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:18:26,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:18:26,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:18:26,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:18:26,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:26" (1/1) ... [2023-08-26 18:18:26,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:26" (1/1) ... [2023-08-26 18:18:26,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:26" (1/1) ... [2023-08-26 18:18:26,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:26" (1/1) ... [2023-08-26 18:18:26,504 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:26" (1/1) ... [2023-08-26 18:18:26,506 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:26" (1/1) ... [2023-08-26 18:18:26,508 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:26" (1/1) ... [2023-08-26 18:18:26,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:26" (1/1) ... [2023-08-26 18:18:26,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:18:26,513 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:18:26,513 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:18:26,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:18:26,514 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:26" (1/1) ... [2023-08-26 18:18:26,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:18:26,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:18:26,553 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:18:26,555 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:18:26,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:18:26,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:18:26,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:18:26,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:18:26,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:18:26,578 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:18:26,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:18:26,579 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:18:26,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:18:26,579 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:18:26,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:18:26,579 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 18:18:26,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 18:18:26,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:18:26,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:18:26,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:18:26,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:18:26,581 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:18:26,746 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:18:26,748 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:18:27,089 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:18:27,196 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:18:27,196 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:18:27,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:18:27 BoogieIcfgContainer [2023-08-26 18:18:27,199 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:18:27,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:18:27,202 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:18:27,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:18:27,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:18:25" (1/3) ... [2023-08-26 18:18:27,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f8b543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:18:27, skipping insertion in model container [2023-08-26 18:18:27,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:26" (2/3) ... [2023-08-26 18:18:27,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f8b543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:18:27, skipping insertion in model container [2023-08-26 18:18:27,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:18:27" (3/3) ... [2023-08-26 18:18:27,207 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055.opt.i [2023-08-26 18:18:27,221 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:18:27,222 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 18:18:27,222 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:18:27,268 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:18:27,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 138 transitions, 296 flow [2023-08-26 18:18:27,345 INFO L124 PetriNetUnfolderBase]: 3/134 cut-off events. [2023-08-26 18:18:27,345 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:18:27,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 3/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-26 18:18:27,351 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 138 transitions, 296 flow [2023-08-26 18:18:27,355 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 134 transitions, 280 flow [2023-08-26 18:18:27,358 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:18:27,365 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 134 transitions, 280 flow [2023-08-26 18:18:27,368 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 134 transitions, 280 flow [2023-08-26 18:18:27,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 134 transitions, 280 flow [2023-08-26 18:18:27,393 INFO L124 PetriNetUnfolderBase]: 3/134 cut-off events. [2023-08-26 18:18:27,393 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:18:27,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 3/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-26 18:18:27,396 INFO L119 LiptonReduction]: Number of co-enabled transitions 3100 [2023-08-26 18:18:31,570 INFO L134 LiptonReduction]: Checked pairs total: 7421 [2023-08-26 18:18:31,570 INFO L136 LiptonReduction]: Total number of compositions: 134 [2023-08-26 18:18:31,590 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:18:31,597 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;@4b66199d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:18:31,598 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 18:18:31,600 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:18:31,600 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:18:31,600 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:18:31,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:31,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:18:31,601 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:31,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:31,607 INFO L85 PathProgramCache]: Analyzing trace with hash 594, now seen corresponding path program 1 times [2023-08-26 18:18:31,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:31,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549218276] [2023-08-26 18:18:31,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:31,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:31,727 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:18:31,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:31,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549218276] [2023-08-26 18:18:31,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549218276] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:31,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:31,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:18:31,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855051239] [2023-08-26 18:18:31,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:31,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:18:31,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:31,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:18:31,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:18:31,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 272 [2023-08-26 18:18:31,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have 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:18:31,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:31,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 272 [2023-08-26 18:18:31,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:32,342 INFO L124 PetriNetUnfolderBase]: 3632/5096 cut-off events. [2023-08-26 18:18:32,343 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-08-26 18:18:32,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10189 conditions, 5096 events. 3632/5096 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 26180 event pairs, 3632 based on Foata normal form. 180/4624 useless extension candidates. Maximal degree in co-relation 10177. Up to 4990 conditions per place. [2023-08-26 18:18:32,383 INFO L140 encePairwiseOnDemand]: 263/272 looper letters, 25 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-08-26 18:18:32,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 120 flow [2023-08-26 18:18:32,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:18:32,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:18:32,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 282 transitions. [2023-08-26 18:18:32,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5183823529411765 [2023-08-26 18:18:32,397 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 282 transitions. [2023-08-26 18:18:32,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 282 transitions. [2023-08-26 18:18:32,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:32,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 282 transitions. [2023-08-26 18:18:32,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 141.0) internal successors, (282), 2 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have 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:18:32,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have 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:18:32,408 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have 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:18:32,409 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 2 states and 282 transitions. [2023-08-26 18:18:32,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 120 flow [2023-08-26 18:18:32,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 18:18:32,414 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-08-26 18:18:32,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-26 18:18:32,418 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-08-26 18:18:32,419 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-08-26 18:18:32,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have 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:18:32,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:32,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:32,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:18:32,420 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:32,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:32,420 INFO L85 PathProgramCache]: Analyzing trace with hash -433271246, now seen corresponding path program 1 times [2023-08-26 18:18:32,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:32,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015725507] [2023-08-26 18:18:32,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:32,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:32,795 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:18:32,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:32,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015725507] [2023-08-26 18:18:32,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015725507] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:32,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:32,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:18:32,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308777457] [2023-08-26 18:18:32,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:32,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:18:32,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:32,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:18:32,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:18:32,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 272 [2023-08-26 18:18:32,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have 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:18:32,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:32,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 272 [2023-08-26 18:18:32,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:33,267 INFO L124 PetriNetUnfolderBase]: 2891/4274 cut-off events. [2023-08-26 18:18:33,267 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:18:33,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8371 conditions, 4274 events. 2891/4274 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 23590 event pairs, 668 based on Foata normal form. 0/3973 useless extension candidates. Maximal degree in co-relation 8368. Up to 2980 conditions per place. [2023-08-26 18:18:33,295 INFO L140 encePairwiseOnDemand]: 269/272 looper letters, 31 selfloop transitions, 2 changer transitions 4/41 dead transitions. [2023-08-26 18:18:33,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 164 flow [2023-08-26 18:18:33,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:18:33,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:18:33,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-08-26 18:18:33,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4987745098039216 [2023-08-26 18:18:33,301 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-08-26 18:18:33,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-08-26 18:18:33,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:33,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-08-26 18:18:33,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have 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:18:33,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have 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:18:33,310 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have 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:18:33,311 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 3 states and 407 transitions. [2023-08-26 18:18:33,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 164 flow [2023-08-26 18:18:33,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 164 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:18:33,314 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 64 flow [2023-08-26 18:18:33,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2023-08-26 18:18:33,315 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-08-26 18:18:33,316 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 64 flow [2023-08-26 18:18:33,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have 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:18:33,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:33,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:33,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:18:33,322 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:33,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:33,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1203769257, now seen corresponding path program 1 times [2023-08-26 18:18:33,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:33,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587275995] [2023-08-26 18:18:33,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:33,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:34,215 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:18:34,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:34,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587275995] [2023-08-26 18:18:34,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587275995] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:34,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:34,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:18:34,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632450141] [2023-08-26 18:18:34,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:34,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:18:34,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:34,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:18:34,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:18:34,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 272 [2023-08-26 18:18:34,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have 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:18:34,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:34,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 272 [2023-08-26 18:18:34,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:35,562 INFO L124 PetriNetUnfolderBase]: 9604/13267 cut-off events. [2023-08-26 18:18:35,563 INFO L125 PetriNetUnfolderBase]: For 658/658 co-relation queries the response was YES. [2023-08-26 18:18:35,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27483 conditions, 13267 events. 9604/13267 cut-off events. For 658/658 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 69455 event pairs, 716 based on Foata normal form. 594/13861 useless extension candidates. Maximal degree in co-relation 27479. Up to 8262 conditions per place. [2023-08-26 18:18:35,645 INFO L140 encePairwiseOnDemand]: 261/272 looper letters, 53 selfloop transitions, 11 changer transitions 39/103 dead transitions. [2023-08-26 18:18:35,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 103 transitions, 444 flow [2023-08-26 18:18:35,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:18:35,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:18:35,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 855 transitions. [2023-08-26 18:18:35,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4490546218487395 [2023-08-26 18:18:35,648 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 855 transitions. [2023-08-26 18:18:35,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 855 transitions. [2023-08-26 18:18:35,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:35,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 855 transitions. [2023-08-26 18:18:35,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have 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:18:35,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have 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:18:35,656 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have 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:18:35,656 INFO L175 Difference]: Start difference. First operand has 40 places, 26 transitions, 64 flow. Second operand 7 states and 855 transitions. [2023-08-26 18:18:35,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 103 transitions, 444 flow [2023-08-26 18:18:35,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 103 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:18:35,660 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 146 flow [2023-08-26 18:18:35,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=146, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2023-08-26 18:18:35,661 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2023-08-26 18:18:35,661 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 146 flow [2023-08-26 18:18:35,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have 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:18:35,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:35,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:35,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:18:35,666 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:35,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:35,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1337804537, now seen corresponding path program 1 times [2023-08-26 18:18:35,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:35,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930356572] [2023-08-26 18:18:35,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:35,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:36,212 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:18:36,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:36,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930356572] [2023-08-26 18:18:36,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930356572] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:36,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:36,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:18:36,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776406605] [2023-08-26 18:18:36,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:36,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:18:36,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:36,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:18:36,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:18:36,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 272 [2023-08-26 18:18:36,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have 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:18:36,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:36,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 272 [2023-08-26 18:18:36,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:37,358 INFO L124 PetriNetUnfolderBase]: 9213/12812 cut-off events. [2023-08-26 18:18:37,358 INFO L125 PetriNetUnfolderBase]: For 9618/9618 co-relation queries the response was YES. [2023-08-26 18:18:37,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38047 conditions, 12812 events. 9213/12812 cut-off events. For 9618/9618 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 64166 event pairs, 1865 based on Foata normal form. 514/13326 useless extension candidates. Maximal degree in co-relation 38038. Up to 10241 conditions per place. [2023-08-26 18:18:37,457 INFO L140 encePairwiseOnDemand]: 263/272 looper letters, 58 selfloop transitions, 15 changer transitions 43/116 dead transitions. [2023-08-26 18:18:37,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 116 transitions, 712 flow [2023-08-26 18:18:37,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:18:37,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:18:37,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 857 transitions. [2023-08-26 18:18:37,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45010504201680673 [2023-08-26 18:18:37,460 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 857 transitions. [2023-08-26 18:18:37,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 857 transitions. [2023-08-26 18:18:37,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:37,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 857 transitions. [2023-08-26 18:18:37,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.42857142857143) internal successors, (857), 7 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have 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:18:37,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have 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:18:37,467 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have 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:18:37,467 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 146 flow. Second operand 7 states and 857 transitions. [2023-08-26 18:18:37,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 116 transitions, 712 flow [2023-08-26 18:18:37,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 116 transitions, 708 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-26 18:18:37,559 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 303 flow [2023-08-26 18:18:37,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=142, 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=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=303, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2023-08-26 18:18:37,561 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2023-08-26 18:18:37,561 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 303 flow [2023-08-26 18:18:37,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have 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:18:37,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:37,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:37,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:18:37,562 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:37,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:37,563 INFO L85 PathProgramCache]: Analyzing trace with hash 238492829, now seen corresponding path program 1 times [2023-08-26 18:18:37,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:37,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397608743] [2023-08-26 18:18:37,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:37,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:38,101 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:18:38,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:38,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397608743] [2023-08-26 18:18:38,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397608743] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:38,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:38,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:18:38,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518067304] [2023-08-26 18:18:38,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:38,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:18:38,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:38,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:18:38,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:18:38,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 272 [2023-08-26 18:18:38,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 303 flow. Second operand has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have 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:18:38,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:38,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 272 [2023-08-26 18:18:38,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:39,035 INFO L124 PetriNetUnfolderBase]: 7316/10591 cut-off events. [2023-08-26 18:18:39,036 INFO L125 PetriNetUnfolderBase]: For 20153/20272 co-relation queries the response was YES. [2023-08-26 18:18:39,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37702 conditions, 10591 events. 7316/10591 cut-off events. For 20153/20272 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 59111 event pairs, 1850 based on Foata normal form. 348/10826 useless extension candidates. Maximal degree in co-relation 37689. Up to 7352 conditions per place. [2023-08-26 18:18:39,124 INFO L140 encePairwiseOnDemand]: 265/272 looper letters, 57 selfloop transitions, 9 changer transitions 13/87 dead transitions. [2023-08-26 18:18:39,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 87 transitions, 640 flow [2023-08-26 18:18:39,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:18:39,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:18:39,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 630 transitions. [2023-08-26 18:18:39,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4632352941176471 [2023-08-26 18:18:39,127 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 630 transitions. [2023-08-26 18:18:39,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 630 transitions. [2023-08-26 18:18:39,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:39,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 630 transitions. [2023-08-26 18:18:39,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have 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:18:39,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have 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:18:39,131 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have 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:18:39,131 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 303 flow. Second operand 5 states and 630 transitions. [2023-08-26 18:18:39,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 87 transitions, 640 flow [2023-08-26 18:18:39,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 87 transitions, 632 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-26 18:18:39,166 INFO L231 Difference]: Finished difference. Result has 55 places, 54 transitions, 364 flow [2023-08-26 18:18:39,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=364, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2023-08-26 18:18:39,167 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2023-08-26 18:18:39,167 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 364 flow [2023-08-26 18:18:39,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have 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:18:39,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:39,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:39,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:18:39,168 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:39,168 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:39,168 INFO L85 PathProgramCache]: Analyzing trace with hash 237224309, now seen corresponding path program 2 times [2023-08-26 18:18:39,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:39,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331992886] [2023-08-26 18:18:39,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:39,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:39,562 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:18:39,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:39,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331992886] [2023-08-26 18:18:39,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331992886] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:39,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:39,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:18:39,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699447613] [2023-08-26 18:18:39,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:39,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:18:39,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:39,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:18:39,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:18:39,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 272 [2023-08-26 18:18:39,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 364 flow. Second operand has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have 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:18:39,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:39,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 272 [2023-08-26 18:18:39,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:40,585 INFO L124 PetriNetUnfolderBase]: 6883/10019 cut-off events. [2023-08-26 18:18:40,586 INFO L125 PetriNetUnfolderBase]: For 23574/23699 co-relation queries the response was YES. [2023-08-26 18:18:40,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37900 conditions, 10019 events. 6883/10019 cut-off events. For 23574/23699 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 55867 event pairs, 1725 based on Foata normal form. 354/10276 useless extension candidates. Maximal degree in co-relation 37885. Up to 6651 conditions per place. [2023-08-26 18:18:40,667 INFO L140 encePairwiseOnDemand]: 266/272 looper letters, 59 selfloop transitions, 10 changer transitions 21/98 dead transitions. [2023-08-26 18:18:40,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 98 transitions, 767 flow [2023-08-26 18:18:40,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:18:40,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:18:40,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 765 transitions. [2023-08-26 18:18:40,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2023-08-26 18:18:40,670 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 765 transitions. [2023-08-26 18:18:40,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 765 transitions. [2023-08-26 18:18:40,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:40,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 765 transitions. [2023-08-26 18:18:40,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have 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:18:40,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have 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:18:40,675 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have 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:18:40,675 INFO L175 Difference]: Start difference. First operand has 55 places, 54 transitions, 364 flow. Second operand 6 states and 765 transitions. [2023-08-26 18:18:40,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 98 transitions, 767 flow [2023-08-26 18:18:40,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 98 transitions, 750 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-26 18:18:40,724 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 416 flow [2023-08-26 18:18:40,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=416, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2023-08-26 18:18:40,726 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2023-08-26 18:18:40,726 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 416 flow [2023-08-26 18:18:40,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have 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:18:40,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:40,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:40,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:18:40,727 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:40,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:40,728 INFO L85 PathProgramCache]: Analyzing trace with hash -386965944, now seen corresponding path program 1 times [2023-08-26 18:18:40,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:40,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406616099] [2023-08-26 18:18:40,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:40,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:41,127 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:18:41,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:41,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406616099] [2023-08-26 18:18:41,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406616099] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:41,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:41,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:18:41,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860746176] [2023-08-26 18:18:41,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:41,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:18:41,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:41,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:18:41,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:18:41,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 272 [2023-08-26 18:18:41,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 416 flow. Second operand has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have 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:18:41,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:41,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 272 [2023-08-26 18:18:41,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:42,032 INFO L124 PetriNetUnfolderBase]: 6357/9307 cut-off events. [2023-08-26 18:18:42,033 INFO L125 PetriNetUnfolderBase]: For 28782/28872 co-relation queries the response was YES. [2023-08-26 18:18:42,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37176 conditions, 9307 events. 6357/9307 cut-off events. For 28782/28872 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 51394 event pairs, 1168 based on Foata normal form. 267/9496 useless extension candidates. Maximal degree in co-relation 37159. Up to 5821 conditions per place. [2023-08-26 18:18:42,097 INFO L140 encePairwiseOnDemand]: 267/272 looper letters, 65 selfloop transitions, 8 changer transitions 20/101 dead transitions. [2023-08-26 18:18:42,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 101 transitions, 849 flow [2023-08-26 18:18:42,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:18:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:18:42,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 762 transitions. [2023-08-26 18:18:42,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46691176470588236 [2023-08-26 18:18:42,100 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 762 transitions. [2023-08-26 18:18:42,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 762 transitions. [2023-08-26 18:18:42,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:42,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 762 transitions. [2023-08-26 18:18:42,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have 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:18:42,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have 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:18:42,105 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have 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:18:42,105 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 416 flow. Second operand 6 states and 762 transitions. [2023-08-26 18:18:42,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 101 transitions, 849 flow [2023-08-26 18:18:42,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 101 transitions, 831 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-26 18:18:42,159 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 425 flow [2023-08-26 18:18:42,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=425, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2023-08-26 18:18:42,160 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2023-08-26 18:18:42,160 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 425 flow [2023-08-26 18:18:42,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have 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:18:42,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:42,160 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:18:42,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:18:42,161 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:42,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:42,161 INFO L85 PathProgramCache]: Analyzing trace with hash 958618248, now seen corresponding path program 1 times [2023-08-26 18:18:42,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:42,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503666437] [2023-08-26 18:18:42,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:42,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:42,536 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:18:42,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:42,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503666437] [2023-08-26 18:18:42,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503666437] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:42,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:42,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:18:42,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31878809] [2023-08-26 18:18:42,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:42,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:18:42,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:42,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:18:42,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:18:42,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 272 [2023-08-26 18:18:42,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 425 flow. Second operand has 6 states, 6 states have (on average 118.66666666666667) internal successors, (712), 6 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have 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:18:42,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:42,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 272 [2023-08-26 18:18:42,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:43,344 INFO L124 PetriNetUnfolderBase]: 6692/9688 cut-off events. [2023-08-26 18:18:43,344 INFO L125 PetriNetUnfolderBase]: For 34315/34801 co-relation queries the response was YES. [2023-08-26 18:18:43,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39982 conditions, 9688 events. 6692/9688 cut-off events. For 34315/34801 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 53338 event pairs, 1585 based on Foata normal form. 241/9776 useless extension candidates. Maximal degree in co-relation 39963. Up to 6053 conditions per place. [2023-08-26 18:18:43,417 INFO L140 encePairwiseOnDemand]: 264/272 looper letters, 63 selfloop transitions, 24 changer transitions 11/106 dead transitions. [2023-08-26 18:18:43,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 106 transitions, 927 flow [2023-08-26 18:18:43,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:18:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:18:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 757 transitions. [2023-08-26 18:18:43,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4638480392156863 [2023-08-26 18:18:43,420 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 757 transitions. [2023-08-26 18:18:43,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 757 transitions. [2023-08-26 18:18:43,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:43,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 757 transitions. [2023-08-26 18:18:43,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.16666666666667) internal successors, (757), 6 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:43,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have 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:18:43,425 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have 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:18:43,425 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 425 flow. Second operand 6 states and 757 transitions. [2023-08-26 18:18:43,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 106 transitions, 927 flow [2023-08-26 18:18:43,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 106 transitions, 906 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-26 18:18:43,499 INFO L231 Difference]: Finished difference. Result has 63 places, 69 transitions, 615 flow [2023-08-26 18:18:43,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=615, PETRI_PLACES=63, PETRI_TRANSITIONS=69} [2023-08-26 18:18:43,500 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2023-08-26 18:18:43,500 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 69 transitions, 615 flow [2023-08-26 18:18:43,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.66666666666667) internal successors, (712), 6 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have 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:18:43,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:43,501 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:18:43,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:18:43,501 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:43,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:43,501 INFO L85 PathProgramCache]: Analyzing trace with hash 887638788, now seen corresponding path program 2 times [2023-08-26 18:18:43,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:43,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778088969] [2023-08-26 18:18:43,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:43,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:43,905 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:18:43,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:43,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778088969] [2023-08-26 18:18:43,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778088969] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:43,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:43,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:18:43,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388998267] [2023-08-26 18:18:43,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:43,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:18:43,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:43,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:18:43,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:18:43,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 272 [2023-08-26 18:18:43,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 69 transitions, 615 flow. Second operand has 7 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have 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:18:43,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:43,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 272 [2023-08-26 18:18:43,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:44,778 INFO L124 PetriNetUnfolderBase]: 6789/9836 cut-off events. [2023-08-26 18:18:44,778 INFO L125 PetriNetUnfolderBase]: For 43962/44449 co-relation queries the response was YES. [2023-08-26 18:18:44,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44075 conditions, 9836 events. 6789/9836 cut-off events. For 43962/44449 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 54415 event pairs, 1569 based on Foata normal form. 235/9904 useless extension candidates. Maximal degree in co-relation 44056. Up to 6063 conditions per place. [2023-08-26 18:18:44,849 INFO L140 encePairwiseOnDemand]: 264/272 looper letters, 65 selfloop transitions, 26 changer transitions 19/118 dead transitions. [2023-08-26 18:18:44,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 118 transitions, 1177 flow [2023-08-26 18:18:44,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:18:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:18:44,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 880 transitions. [2023-08-26 18:18:44,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46218487394957986 [2023-08-26 18:18:44,853 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 880 transitions. [2023-08-26 18:18:44,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 880 transitions. [2023-08-26 18:18:44,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:44,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 880 transitions. [2023-08-26 18:18:44,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.71428571428571) internal successors, (880), 7 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have 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:18:44,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have 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:18:44,858 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have 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:18:44,858 INFO L175 Difference]: Start difference. First operand has 63 places, 69 transitions, 615 flow. Second operand 7 states and 880 transitions. [2023-08-26 18:18:44,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 118 transitions, 1177 flow [2023-08-26 18:18:45,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 118 transitions, 1144 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-26 18:18:45,038 INFO L231 Difference]: Finished difference. Result has 69 places, 73 transitions, 722 flow [2023-08-26 18:18:45,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=722, PETRI_PLACES=69, PETRI_TRANSITIONS=73} [2023-08-26 18:18:45,039 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 19 predicate places. [2023-08-26 18:18:45,039 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 73 transitions, 722 flow [2023-08-26 18:18:45,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have 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:18:45,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:45,040 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:18:45,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:18:45,040 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:45,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:45,041 INFO L85 PathProgramCache]: Analyzing trace with hash 888907308, now seen corresponding path program 3 times [2023-08-26 18:18:45,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:45,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720887359] [2023-08-26 18:18:45,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:45,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:45,481 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:18:45,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:45,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720887359] [2023-08-26 18:18:45,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720887359] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:45,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:45,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:18:45,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236710750] [2023-08-26 18:18:45,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:45,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:18:45,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:45,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:18:45,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:18:45,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 272 [2023-08-26 18:18:45,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 73 transitions, 722 flow. Second operand has 7 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have 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:18:45,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:45,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 272 [2023-08-26 18:18:45,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:46,679 INFO L124 PetriNetUnfolderBase]: 6920/10009 cut-off events. [2023-08-26 18:18:46,679 INFO L125 PetriNetUnfolderBase]: For 65029/65628 co-relation queries the response was YES. [2023-08-26 18:18:46,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48476 conditions, 10009 events. 6920/10009 cut-off events. For 65029/65628 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 55622 event pairs, 1588 based on Foata normal form. 246/10054 useless extension candidates. Maximal degree in co-relation 48455. Up to 6272 conditions per place. [2023-08-26 18:18:46,755 INFO L140 encePairwiseOnDemand]: 264/272 looper letters, 72 selfloop transitions, 28 changer transitions 11/119 dead transitions. [2023-08-26 18:18:46,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 119 transitions, 1307 flow [2023-08-26 18:18:46,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:18:46,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:18:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 750 transitions. [2023-08-26 18:18:46,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45955882352941174 [2023-08-26 18:18:46,758 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 750 transitions. [2023-08-26 18:18:46,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 750 transitions. [2023-08-26 18:18:46,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:46,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 750 transitions. [2023-08-26 18:18:46,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have 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:18:46,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have 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:18:46,763 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have 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:18:46,763 INFO L175 Difference]: Start difference. First operand has 69 places, 73 transitions, 722 flow. Second operand 6 states and 750 transitions. [2023-08-26 18:18:46,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 119 transitions, 1307 flow [2023-08-26 18:18:46,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 119 transitions, 1245 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-08-26 18:18:46,889 INFO L231 Difference]: Finished difference. Result has 70 places, 81 transitions, 874 flow [2023-08-26 18:18:46,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=874, PETRI_PLACES=70, PETRI_TRANSITIONS=81} [2023-08-26 18:18:46,890 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 20 predicate places. [2023-08-26 18:18:46,890 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 81 transitions, 874 flow [2023-08-26 18:18:46,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have 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:18:46,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:46,891 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:18:46,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:18:46,891 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:46,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:46,892 INFO L85 PathProgramCache]: Analyzing trace with hash 959598468, now seen corresponding path program 4 times [2023-08-26 18:18:46,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:46,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97964297] [2023-08-26 18:18:46,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:46,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:47,220 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:18:47,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:47,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97964297] [2023-08-26 18:18:47,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97964297] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:47,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:47,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:18:47,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279460138] [2023-08-26 18:18:47,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:47,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:18:47,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:47,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:18:47,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:18:47,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 272 [2023-08-26 18:18:47,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 81 transitions, 874 flow. Second operand has 7 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have 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:18:47,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:47,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 272 [2023-08-26 18:18:47,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:48,330 INFO L124 PetriNetUnfolderBase]: 7487/10806 cut-off events. [2023-08-26 18:18:48,330 INFO L125 PetriNetUnfolderBase]: For 87247/87849 co-relation queries the response was YES. [2023-08-26 18:18:48,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55233 conditions, 10806 events. 7487/10806 cut-off events. For 87247/87849 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 60692 event pairs, 1591 based on Foata normal form. 364/10989 useless extension candidates. Maximal degree in co-relation 55211. Up to 6255 conditions per place. [2023-08-26 18:18:48,394 INFO L140 encePairwiseOnDemand]: 264/272 looper letters, 70 selfloop transitions, 35 changer transitions 11/124 dead transitions. [2023-08-26 18:18:48,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 124 transitions, 1444 flow [2023-08-26 18:18:48,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:18:48,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:18:48,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 875 transitions. [2023-08-26 18:18:48,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45955882352941174 [2023-08-26 18:18:48,397 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 875 transitions. [2023-08-26 18:18:48,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 875 transitions. [2023-08-26 18:18:48,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:48,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 875 transitions. [2023-08-26 18:18:48,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have 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:18:48,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have 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:18:48,402 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have 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:18:48,402 INFO L175 Difference]: Start difference. First operand has 70 places, 81 transitions, 874 flow. Second operand 7 states and 875 transitions. [2023-08-26 18:18:48,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 124 transitions, 1444 flow [2023-08-26 18:18:48,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 124 transitions, 1404 flow, removed 20 selfloop flow, removed 1 redundant places. [2023-08-26 18:18:48,654 INFO L231 Difference]: Finished difference. Result has 76 places, 87 transitions, 1044 flow [2023-08-26 18:18:48,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1044, PETRI_PLACES=76, PETRI_TRANSITIONS=87} [2023-08-26 18:18:48,654 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 26 predicate places. [2023-08-26 18:18:48,655 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 87 transitions, 1044 flow [2023-08-26 18:18:48,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have 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:18:48,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:48,655 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:18:48,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:18:48,655 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:48,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:48,656 INFO L85 PathProgramCache]: Analyzing trace with hash 918025608, now seen corresponding path program 5 times [2023-08-26 18:18:48,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:48,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933200177] [2023-08-26 18:18:48,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:48,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:48,990 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:18:48,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:48,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933200177] [2023-08-26 18:18:48,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933200177] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:48,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:48,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:18:48,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693151452] [2023-08-26 18:18:48,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:48,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:18:48,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:48,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:18:48,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:18:48,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 272 [2023-08-26 18:18:48,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 87 transitions, 1044 flow. Second operand has 6 states, 6 states have (on average 119.66666666666667) internal successors, (718), 6 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have 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:18:48,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:48,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 272 [2023-08-26 18:18:48,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:50,154 INFO L124 PetriNetUnfolderBase]: 8119/11799 cut-off events. [2023-08-26 18:18:50,154 INFO L125 PetriNetUnfolderBase]: For 110513/111217 co-relation queries the response was YES. [2023-08-26 18:18:50,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63765 conditions, 11799 events. 8119/11799 cut-off events. For 110513/111217 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 67973 event pairs, 1335 based on Foata normal form. 581/12226 useless extension candidates. Maximal degree in co-relation 63741. Up to 5940 conditions per place. [2023-08-26 18:18:50,227 INFO L140 encePairwiseOnDemand]: 265/272 looper letters, 82 selfloop transitions, 35 changer transitions 21/146 dead transitions. [2023-08-26 18:18:50,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 146 transitions, 1841 flow [2023-08-26 18:18:50,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:18:50,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:18:50,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1008 transitions. [2023-08-26 18:18:50,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4632352941176471 [2023-08-26 18:18:50,230 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1008 transitions. [2023-08-26 18:18:50,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1008 transitions. [2023-08-26 18:18:50,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:50,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1008 transitions. [2023-08-26 18:18:50,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.0) internal successors, (1008), 8 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have 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:18:50,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 272.0) internal successors, (2448), 9 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have 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:18:50,236 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 272.0) internal successors, (2448), 9 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have 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:18:50,236 INFO L175 Difference]: Start difference. First operand has 76 places, 87 transitions, 1044 flow. Second operand 8 states and 1008 transitions. [2023-08-26 18:18:50,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 146 transitions, 1841 flow [2023-08-26 18:18:50,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 146 transitions, 1787 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-08-26 18:18:50,474 INFO L231 Difference]: Finished difference. Result has 81 places, 91 transitions, 1201 flow [2023-08-26 18:18:50,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1201, PETRI_PLACES=81, PETRI_TRANSITIONS=91} [2023-08-26 18:18:50,474 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 31 predicate places. [2023-08-26 18:18:50,475 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 91 transitions, 1201 flow [2023-08-26 18:18:50,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.66666666666667) internal successors, (718), 6 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have 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:18:50,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:50,475 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:18:50,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:18:50,475 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:50,476 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:50,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1555933278, now seen corresponding path program 1 times [2023-08-26 18:18:50,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:50,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499987992] [2023-08-26 18:18:50,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:50,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:50,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:18:50,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:50,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499987992] [2023-08-26 18:18:50,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499987992] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:50,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:50,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:18:50,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364048525] [2023-08-26 18:18:50,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:50,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:18:50,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:50,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:18:50,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:18:50,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 272 [2023-08-26 18:18:50,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 91 transitions, 1201 flow. Second operand has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:50,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:50,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 272 [2023-08-26 18:18:50,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:51,486 INFO L124 PetriNetUnfolderBase]: 5797/8544 cut-off events. [2023-08-26 18:18:51,487 INFO L125 PetriNetUnfolderBase]: For 150380/153208 co-relation queries the response was YES. [2023-08-26 18:18:51,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50424 conditions, 8544 events. 5797/8544 cut-off events. For 150380/153208 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 51038 event pairs, 1205 based on Foata normal form. 1620/9838 useless extension candidates. Maximal degree in co-relation 50398. Up to 5544 conditions per place. [2023-08-26 18:18:51,533 INFO L140 encePairwiseOnDemand]: 265/272 looper letters, 166 selfloop transitions, 9 changer transitions 26/213 dead transitions. [2023-08-26 18:18:51,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 213 transitions, 3437 flow [2023-08-26 18:18:51,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:18:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:18:51,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 631 transitions. [2023-08-26 18:18:51,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46397058823529413 [2023-08-26 18:18:51,534 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 631 transitions. [2023-08-26 18:18:51,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 631 transitions. [2023-08-26 18:18:51,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:51,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 631 transitions. [2023-08-26 18:18:51,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have 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:18:51,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have 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:18:51,537 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have 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:18:51,538 INFO L175 Difference]: Start difference. First operand has 81 places, 91 transitions, 1201 flow. Second operand 5 states and 631 transitions. [2023-08-26 18:18:51,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 213 transitions, 3437 flow [2023-08-26 18:18:51,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 213 transitions, 3238 flow, removed 52 selfloop flow, removed 6 redundant places. [2023-08-26 18:18:51,627 INFO L231 Difference]: Finished difference. Result has 80 places, 99 transitions, 1247 flow [2023-08-26 18:18:51,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1247, PETRI_PLACES=80, PETRI_TRANSITIONS=99} [2023-08-26 18:18:51,628 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 30 predicate places. [2023-08-26 18:18:51,628 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 99 transitions, 1247 flow [2023-08-26 18:18:51,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:51,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:51,628 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:18:51,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 18:18:51,628 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:51,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:51,629 INFO L85 PathProgramCache]: Analyzing trace with hash 425241686, now seen corresponding path program 1 times [2023-08-26 18:18:51,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:51,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815806024] [2023-08-26 18:18:51,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:51,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:51,746 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:18:51,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:51,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815806024] [2023-08-26 18:18:51,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815806024] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:51,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:51,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:18:51,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573793555] [2023-08-26 18:18:51,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:51,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:18:51,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:51,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:18:51,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:18:51,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 272 [2023-08-26 18:18:51,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 99 transitions, 1247 flow. Second operand has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have 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:18:51,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:51,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 272 [2023-08-26 18:18:51,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:52,438 INFO L124 PetriNetUnfolderBase]: 4165/6349 cut-off events. [2023-08-26 18:18:52,439 INFO L125 PetriNetUnfolderBase]: For 113481/116438 co-relation queries the response was YES. [2023-08-26 18:18:52,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39348 conditions, 6349 events. 4165/6349 cut-off events. For 113481/116438 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 38777 event pairs, 441 based on Foata normal form. 1524/7627 useless extension candidates. Maximal degree in co-relation 39321. Up to 2643 conditions per place. [2023-08-26 18:18:52,478 INFO L140 encePairwiseOnDemand]: 265/272 looper letters, 231 selfloop transitions, 18 changer transitions 22/283 dead transitions. [2023-08-26 18:18:52,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 283 transitions, 4531 flow [2023-08-26 18:18:52,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:18:52,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:18:52,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 883 transitions. [2023-08-26 18:18:52,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4637605042016807 [2023-08-26 18:18:52,480 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 883 transitions. [2023-08-26 18:18:52,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 883 transitions. [2023-08-26 18:18:52,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:52,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 883 transitions. [2023-08-26 18:18:52,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have 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:18:52,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have 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:18:52,485 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have 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:18:52,485 INFO L175 Difference]: Start difference. First operand has 80 places, 99 transitions, 1247 flow. Second operand 7 states and 883 transitions. [2023-08-26 18:18:52,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 283 transitions, 4531 flow [2023-08-26 18:18:52,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 283 transitions, 4526 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:18:52,597 INFO L231 Difference]: Finished difference. Result has 88 places, 100 transitions, 1311 flow [2023-08-26 18:18:52,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1311, PETRI_PLACES=88, PETRI_TRANSITIONS=100} [2023-08-26 18:18:52,598 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 38 predicate places. [2023-08-26 18:18:52,598 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 100 transitions, 1311 flow [2023-08-26 18:18:52,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have 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:18:52,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:52,598 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:18:52,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 18:18:52,598 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:52,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:52,599 INFO L85 PathProgramCache]: Analyzing trace with hash -336656138, now seen corresponding path program 1 times [2023-08-26 18:18:52,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:52,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273848864] [2023-08-26 18:18:52,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:52,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:53,266 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:18:53,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:53,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273848864] [2023-08-26 18:18:53,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273848864] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:53,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:53,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:18:53,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9780229] [2023-08-26 18:18:53,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:53,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:18:53,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:53,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:18:53,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:18:53,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 272 [2023-08-26 18:18:53,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 100 transitions, 1311 flow. Second operand has 8 states, 8 states have (on average 106.375) internal successors, (851), 8 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have 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:18:53,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:53,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 272 [2023-08-26 18:18:53,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:55,217 INFO L124 PetriNetUnfolderBase]: 10325/15363 cut-off events. [2023-08-26 18:18:55,217 INFO L125 PetriNetUnfolderBase]: For 159148/159148 co-relation queries the response was YES. [2023-08-26 18:18:55,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97940 conditions, 15363 events. 10325/15363 cut-off events. For 159148/159148 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 94810 event pairs, 660 based on Foata normal form. 79/15442 useless extension candidates. Maximal degree in co-relation 97910. Up to 6077 conditions per place. [2023-08-26 18:18:55,341 INFO L140 encePairwiseOnDemand]: 260/272 looper letters, 149 selfloop transitions, 60 changer transitions 186/395 dead transitions. [2023-08-26 18:18:55,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 395 transitions, 5587 flow [2023-08-26 18:18:55,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 18:18:55,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 18:18:55,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1180 transitions. [2023-08-26 18:18:55,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4338235294117647 [2023-08-26 18:18:55,345 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1180 transitions. [2023-08-26 18:18:55,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1180 transitions. [2023-08-26 18:18:55,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:55,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1180 transitions. [2023-08-26 18:18:55,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 118.0) internal successors, (1180), 10 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have 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:18:55,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 272.0) internal successors, (2992), 11 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have 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:18:55,351 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 272.0) internal successors, (2992), 11 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have 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:18:55,351 INFO L175 Difference]: Start difference. First operand has 88 places, 100 transitions, 1311 flow. Second operand 10 states and 1180 transitions. [2023-08-26 18:18:55,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 395 transitions, 5587 flow [2023-08-26 18:18:56,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 395 transitions, 5295 flow, removed 103 selfloop flow, removed 3 redundant places. [2023-08-26 18:18:56,316 INFO L231 Difference]: Finished difference. Result has 101 places, 119 transitions, 1934 flow [2023-08-26 18:18:56,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=1262, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1934, PETRI_PLACES=101, PETRI_TRANSITIONS=119} [2023-08-26 18:18:56,317 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 51 predicate places. [2023-08-26 18:18:56,317 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 119 transitions, 1934 flow [2023-08-26 18:18:56,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.375) internal successors, (851), 8 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have 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:18:56,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:56,318 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:18:56,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 18:18:56,318 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:56,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:56,318 INFO L85 PathProgramCache]: Analyzing trace with hash -977099105, now seen corresponding path program 1 times [2023-08-26 18:18:56,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:56,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451607739] [2023-08-26 18:18:56,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:56,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:56,460 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:18:56,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:56,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451607739] [2023-08-26 18:18:56,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451607739] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:56,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:56,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:18:56,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144654259] [2023-08-26 18:18:56,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:56,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:18:56,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:56,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:18:56,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:18:56,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 272 [2023-08-26 18:18:56,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 119 transitions, 1934 flow. Second operand has 6 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have 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:18:56,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:56,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 272 [2023-08-26 18:18:56,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:57,011 INFO L124 PetriNetUnfolderBase]: 2215/3725 cut-off events. [2023-08-26 18:18:57,011 INFO L125 PetriNetUnfolderBase]: For 86372/87395 co-relation queries the response was YES. [2023-08-26 18:18:57,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24715 conditions, 3725 events. 2215/3725 cut-off events. For 86372/87395 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 23517 event pairs, 187 based on Foata normal form. 872/4481 useless extension candidates. Maximal degree in co-relation 24678. Up to 1305 conditions per place. [2023-08-26 18:18:57,035 INFO L140 encePairwiseOnDemand]: 265/272 looper letters, 176 selfloop transitions, 18 changer transitions 45/256 dead transitions. [2023-08-26 18:18:57,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 256 transitions, 4797 flow [2023-08-26 18:18:57,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:18:57,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:18:57,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 883 transitions. [2023-08-26 18:18:57,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4637605042016807 [2023-08-26 18:18:57,037 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 883 transitions. [2023-08-26 18:18:57,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 883 transitions. [2023-08-26 18:18:57,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:57,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 883 transitions. [2023-08-26 18:18:57,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have 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:18:57,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have 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:18:57,042 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have 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:18:57,042 INFO L175 Difference]: Start difference. First operand has 101 places, 119 transitions, 1934 flow. Second operand 7 states and 883 transitions. [2023-08-26 18:18:57,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 256 transitions, 4797 flow [2023-08-26 18:18:57,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 256 transitions, 4062 flow, removed 219 selfloop flow, removed 13 redundant places. [2023-08-26 18:18:57,144 INFO L231 Difference]: Finished difference. Result has 91 places, 103 transitions, 1319 flow [2023-08-26 18:18:57,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=1186, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1319, PETRI_PLACES=91, PETRI_TRANSITIONS=103} [2023-08-26 18:18:57,145 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 41 predicate places. [2023-08-26 18:18:57,145 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 103 transitions, 1319 flow [2023-08-26 18:18:57,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have 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:18:57,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:57,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:57,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 18:18:57,146 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:57,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:57,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2001996535, now seen corresponding path program 1 times [2023-08-26 18:18:57,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:57,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149485600] [2023-08-26 18:18:57,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:57,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:57,594 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:18:57,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:57,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149485600] [2023-08-26 18:18:57,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149485600] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:57,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:57,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:18:57,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647047195] [2023-08-26 18:18:57,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:57,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:18:57,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:57,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:18:57,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:18:57,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 272 [2023-08-26 18:18:57,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 103 transitions, 1319 flow. Second operand has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have 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:18:57,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:57,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 272 [2023-08-26 18:18:57,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:58,495 INFO L124 PetriNetUnfolderBase]: 4147/6692 cut-off events. [2023-08-26 18:18:58,496 INFO L125 PetriNetUnfolderBase]: For 59176/59176 co-relation queries the response was YES. [2023-08-26 18:18:58,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41468 conditions, 6692 events. 4147/6692 cut-off events. For 59176/59176 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 40453 event pairs, 889 based on Foata normal form. 19/6711 useless extension candidates. Maximal degree in co-relation 41435. Up to 3418 conditions per place. [2023-08-26 18:18:58,551 INFO L140 encePairwiseOnDemand]: 265/272 looper letters, 106 selfloop transitions, 16 changer transitions 55/177 dead transitions. [2023-08-26 18:18:58,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 177 transitions, 2512 flow [2023-08-26 18:18:58,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:18:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:18:58,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 716 transitions. [2023-08-26 18:18:58,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4387254901960784 [2023-08-26 18:18:58,555 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 716 transitions. [2023-08-26 18:18:58,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 716 transitions. [2023-08-26 18:18:58,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:58,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 716 transitions. [2023-08-26 18:18:58,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have 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:18:58,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have 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:18:58,559 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have 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:18:58,559 INFO L175 Difference]: Start difference. First operand has 91 places, 103 transitions, 1319 flow. Second operand 6 states and 716 transitions. [2023-08-26 18:18:58,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 177 transitions, 2512 flow [2023-08-26 18:18:58,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 177 transitions, 2377 flow, removed 55 selfloop flow, removed 3 redundant places. [2023-08-26 18:18:58,865 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 1146 flow [2023-08-26 18:18:58,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=1250, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1146, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2023-08-26 18:18:58,866 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 46 predicate places. [2023-08-26 18:18:58,866 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 1146 flow [2023-08-26 18:18:58,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have 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:18:58,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:58,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:58,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 18:18:58,866 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:58,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:58,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1908891989, now seen corresponding path program 2 times [2023-08-26 18:18:58,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:58,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517022039] [2023-08-26 18:18:58,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:58,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:59,023 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:18:59,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:59,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517022039] [2023-08-26 18:18:59,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517022039] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:59,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:59,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:18:59,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45303846] [2023-08-26 18:18:59,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:59,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:18:59,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:59,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:18:59,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:18:59,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 272 [2023-08-26 18:18:59,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 1146 flow. Second operand has 7 states, 7 states have (on average 116.71428571428571) internal successors, (817), 7 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have 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:18:59,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:59,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 272 [2023-08-26 18:18:59,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:59,521 INFO L124 PetriNetUnfolderBase]: 1737/2929 cut-off events. [2023-08-26 18:18:59,521 INFO L125 PetriNetUnfolderBase]: For 37188/37764 co-relation queries the response was YES. [2023-08-26 18:18:59,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17775 conditions, 2929 events. 1737/2929 cut-off events. For 37188/37764 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 18247 event pairs, 190 based on Foata normal form. 343/3161 useless extension candidates. Maximal degree in co-relation 17739. Up to 1055 conditions per place. [2023-08-26 18:18:59,542 INFO L140 encePairwiseOnDemand]: 265/272 looper letters, 83 selfloop transitions, 18 changer transitions 89/196 dead transitions. [2023-08-26 18:18:59,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 196 transitions, 3117 flow [2023-08-26 18:18:59,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:18:59,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:18:59,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 987 transitions. [2023-08-26 18:18:59,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45358455882352944 [2023-08-26 18:18:59,545 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 987 transitions. [2023-08-26 18:18:59,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 987 transitions. [2023-08-26 18:18:59,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:59,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 987 transitions. [2023-08-26 18:18:59,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 123.375) internal successors, (987), 8 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have 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:18:59,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 272.0) internal successors, (2448), 9 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have 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:18:59,549 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 272.0) internal successors, (2448), 9 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have 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:18:59,549 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 1146 flow. Second operand 8 states and 987 transitions. [2023-08-26 18:18:59,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 196 transitions, 3117 flow [2023-08-26 18:18:59,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 196 transitions, 2870 flow, removed 114 selfloop flow, removed 7 redundant places. [2023-08-26 18:18:59,691 INFO L231 Difference]: Finished difference. Result has 95 places, 59 transitions, 645 flow [2023-08-26 18:18:59,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=1008, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=645, PETRI_PLACES=95, PETRI_TRANSITIONS=59} [2023-08-26 18:18:59,691 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 45 predicate places. [2023-08-26 18:18:59,691 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 59 transitions, 645 flow [2023-08-26 18:18:59,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.71428571428571) internal successors, (817), 7 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have 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:18:59,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:59,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:59,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 18:18:59,692 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:59,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:59,692 INFO L85 PathProgramCache]: Analyzing trace with hash 11059699, now seen corresponding path program 1 times [2023-08-26 18:18:59,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:59,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596119271] [2023-08-26 18:18:59,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:59,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:19:00,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:19:00,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:19:00,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596119271] [2023-08-26 18:19:00,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596119271] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:19:00,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:19:00,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:19:00,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676821208] [2023-08-26 18:19:00,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:19:00,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:19:00,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:19:00,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:19:00,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:19:00,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 272 [2023-08-26 18:19:00,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 59 transitions, 645 flow. Second operand has 6 states, 6 states have (on average 109.33333333333333) internal successors, (656), 6 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have 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:19:00,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:19:00,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 272 [2023-08-26 18:19:00,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:19:00,550 INFO L124 PetriNetUnfolderBase]: 679/1169 cut-off events. [2023-08-26 18:19:00,550 INFO L125 PetriNetUnfolderBase]: For 9108/9108 co-relation queries the response was YES. [2023-08-26 18:19:00,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7362 conditions, 1169 events. 679/1169 cut-off events. For 9108/9108 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5589 event pairs, 69 based on Foata normal form. 1/1170 useless extension candidates. Maximal degree in co-relation 7329. Up to 610 conditions per place. [2023-08-26 18:19:00,555 INFO L140 encePairwiseOnDemand]: 262/272 looper letters, 52 selfloop transitions, 6 changer transitions 73/131 dead transitions. [2023-08-26 18:19:00,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 131 transitions, 1578 flow [2023-08-26 18:19:00,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:19:00,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:19:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 803 transitions. [2023-08-26 18:19:00,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4217436974789916 [2023-08-26 18:19:00,557 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 803 transitions. [2023-08-26 18:19:00,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 803 transitions. [2023-08-26 18:19:00,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:19:00,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 803 transitions. [2023-08-26 18:19:00,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have 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:19:00,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have 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:19:00,561 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have 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:19:00,561 INFO L175 Difference]: Start difference. First operand has 95 places, 59 transitions, 645 flow. Second operand 7 states and 803 transitions. [2023-08-26 18:19:00,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 131 transitions, 1578 flow [2023-08-26 18:19:00,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 131 transitions, 1199 flow, removed 99 selfloop flow, removed 23 redundant places. [2023-08-26 18:19:00,583 INFO L231 Difference]: Finished difference. Result has 77 places, 44 transitions, 301 flow [2023-08-26 18:19:00,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=301, PETRI_PLACES=77, PETRI_TRANSITIONS=44} [2023-08-26 18:19:00,583 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 27 predicate places. [2023-08-26 18:19:00,583 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 44 transitions, 301 flow [2023-08-26 18:19:00,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.33333333333333) internal successors, (656), 6 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have 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:19:00,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:19:00,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:19:00,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 18:19:00,584 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:19:00,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:19:00,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2084622735, now seen corresponding path program 2 times [2023-08-26 18:19:00,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:19:00,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196186735] [2023-08-26 18:19:00,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:19:00,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:19:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:19:00,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:19:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:19:00,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:19:00,670 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:19:00,671 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 18:19:00,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 18:19:00,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 18:19:00,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 18:19:00,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 18:19:00,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 18:19:00,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 18:19:00,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 18:19:00,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 18:19:00,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 18:19:00,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 18:19:00,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 18:19:00,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 18:19:00,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 18:19:00,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 18:19:00,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 18:19:00,675 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:19:00,680 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:19:00,680 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:19:00,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:19:00 BasicIcfg [2023-08-26 18:19:00,747 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:19:00,748 INFO L158 Benchmark]: Toolchain (without parser) took 34837.36ms. Allocated memory was 362.8MB in the beginning and 2.4GB in the end (delta: 2.0GB). Free memory was 338.0MB in the beginning and 1.9GB in the end (delta: -1.6GB). Peak memory consumption was 413.2MB. Max. memory is 16.0GB. [2023-08-26 18:19:00,748 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 362.8MB. Free memory is still 339.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:19:00,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.08ms. Allocated memory is still 362.8MB. Free memory was 337.6MB in the beginning and 314.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 18:19:00,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.82ms. Allocated memory is still 362.8MB. Free memory was 314.5MB in the beginning and 311.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:19:00,748 INFO L158 Benchmark]: Boogie Preprocessor took 28.57ms. Allocated memory is still 362.8MB. Free memory was 311.6MB in the beginning and 309.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:19:00,749 INFO L158 Benchmark]: RCFGBuilder took 686.50ms. Allocated memory is still 362.8MB. Free memory was 309.5MB in the beginning and 320.8MB in the end (delta: -11.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-26 18:19:00,749 INFO L158 Benchmark]: TraceAbstraction took 33545.45ms. Allocated memory was 362.8MB in the beginning and 2.4GB in the end (delta: 2.0GB). Free memory was 319.9MB in the beginning and 1.9GB in the end (delta: -1.6GB). Peak memory consumption was 394.3MB. Max. memory is 16.0GB. [2023-08-26 18:19:00,750 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 362.8MB. Free memory is still 339.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 525.08ms. Allocated memory is still 362.8MB. Free memory was 337.6MB in the beginning and 314.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 44.82ms. Allocated memory is still 362.8MB. Free memory was 314.5MB in the beginning and 311.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 28.57ms. Allocated memory is still 362.8MB. Free memory was 311.6MB in the beginning and 309.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 686.50ms. Allocated memory is still 362.8MB. Free memory was 309.5MB in the beginning and 320.8MB in the end (delta: -11.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * TraceAbstraction took 33545.45ms. Allocated memory was 362.8MB in the beginning and 2.4GB in the end (delta: 2.0GB). Free memory was 319.9MB in the beginning and 1.9GB in the end (delta: -1.6GB). Peak memory consumption was 394.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 144 PlacesBefore, 50 PlacesAfterwards, 134 TransitionsBefore, 38 TransitionsAfterwards, 3100 CoEnabledTransitionPairs, 6 FixpointIterations, 51 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 134 TotalNumberOfCompositions, 7421 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3915, independent: 3739, independent conditional: 0, independent unconditional: 3739, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1698, independent: 1666, independent conditional: 0, independent unconditional: 1666, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3915, independent: 2073, independent conditional: 0, independent unconditional: 2073, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 1698, unknown conditional: 0, unknown unconditional: 1698] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 185, Positive conditional cache size: 0, Positive unconditional cache size: 185, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1461; [L837] FCALL, FORK 0 pthread_create(&t1461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1461, ((void *)0), P0, ((void *)0))=-3, t1461={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L838] 0 pthread_t t1462; [L839] FCALL, FORK 0 pthread_create(&t1462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1462, ((void *)0), P1, ((void *)0))=-2, t1461={5:0}, t1462={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t1463; [L841] FCALL, FORK 0 pthread_create(&t1463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1463, ((void *)0), P2, ((void *)0))=-1, t1461={5:0}, t1462={6:0}, t1463={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 0 pthread_t t1464; [L843] FCALL, FORK 0 pthread_create(&t1464, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1464, ((void *)0), P3, ((void *)0))=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L802] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L802] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L814] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 4 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix055.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 843]: 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: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 171 locations, 15 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: 33.4s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 21.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 751 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 751 mSDsluCounter, 171 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 109 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2760 IncrementalHoareTripleChecker+Invalid, 2848 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 62 mSDtfsCounter, 2760 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1934occurred in iteration=15, InterpolantAutomatonStates: 120, 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.4s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 325 NumberOfCodeBlocks, 325 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 2385 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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:19:00,768 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...