/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-ext/48_ticket_lock_low_contention_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:04:55,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:04:55,990 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:04:55,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:04:55,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:04:56,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:04:56,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:04:56,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:04:56,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:04:56,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:04:56,016 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:04:56,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:04:56,017 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:04:56,017 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:04:56,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:04:56,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:04:56,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:04:56,018 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:04:56,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:04:56,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:04:56,019 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:04:56,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:04:56,019 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:04:56,019 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:04:56,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:04:56,020 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:04:56,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:04:56,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:04:56,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:04:56,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:04:56,021 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:04:56,021 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:04:56,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:04:56,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:04:56,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:04:56,022 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:04:56,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:04:56,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:04:56,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:04:56,272 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:04:56,273 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:04:56,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs.i [2023-08-26 18:04:57,304 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:04:57,541 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:04:57,541 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs.i [2023-08-26 18:04:57,558 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c125e2688/821daf74ccab4e3ea2ba6f7e49b6c818/FLAG12e22dc90 [2023-08-26 18:04:57,572 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c125e2688/821daf74ccab4e3ea2ba6f7e49b6c818 [2023-08-26 18:04:57,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:04:57,577 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:04:57,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:04:57,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:04:57,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:04:57,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:04:57" (1/1) ... [2023-08-26 18:04:57,584 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d3ee05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:04:57, skipping insertion in model container [2023-08-26 18:04:57,584 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:04:57" (1/1) ... [2023-08-26 18:04:57,622 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:04:57,768 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-26 18:04:57,877 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:04:57,885 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:04:57,893 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-26 18:04:57,898 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [270] [2023-08-26 18:04:57,899 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [270] [2023-08-26 18:04:57,911 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [705] [2023-08-26 18:04:57,911 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [706] [2023-08-26 18:04:57,911 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [707] [2023-08-26 18:04:57,912 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [713] [2023-08-26 18:04:57,912 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [716] [2023-08-26 18:04:57,915 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:04:57,938 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:04:57,938 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:04:57,938 WARN L669 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:04:57,942 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:04:57,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:04:57 WrapperNode [2023-08-26 18:04:57,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:04:57,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:04:57,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:04:57,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:04:57,950 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:04:57" (1/1) ... [2023-08-26 18:04:57,962 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:04:57" (1/1) ... [2023-08-26 18:04:57,976 INFO L138 Inliner]: procedures = 173, calls = 25, calls flagged for inlining = 6, calls inlined = 9, statements flattened = 115 [2023-08-26 18:04:57,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:04:57,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:04:57,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:04:57,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:04:57,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:04:57" (1/1) ... [2023-08-26 18:04:57,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:04:57" (1/1) ... [2023-08-26 18:04:57,998 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:04:57" (1/1) ... [2023-08-26 18:04:57,998 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:04:57" (1/1) ... [2023-08-26 18:04:58,001 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:04:57" (1/1) ... [2023-08-26 18:04:58,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:04:57" (1/1) ... [2023-08-26 18:04:58,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:04:57" (1/1) ... [2023-08-26 18:04:58,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:04:57" (1/1) ... [2023-08-26 18:04:58,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:04:58,007 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:04:58,008 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:04:58,008 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:04:58,008 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:04:57" (1/1) ... [2023-08-26 18:04:58,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:04:58,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:04:58,043 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:04:58,053 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:04:58,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 18:04:58,070 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-26 18:04:58,070 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-26 18:04:58,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:04:58,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:04:58,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:04:58,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:04:58,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:04:58,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:04:58,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:04:58,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:04:58,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:04:58,072 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:04:58,167 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:04:58,168 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:04:58,367 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:04:58,437 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:04:58,437 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-26 18:04:58,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:04:58 BoogieIcfgContainer [2023-08-26 18:04:58,439 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:04:58,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:04:58,440 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:04:58,442 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:04:58,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:04:57" (1/3) ... [2023-08-26 18:04:58,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd26cae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:04:58, skipping insertion in model container [2023-08-26 18:04:58,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:04:57" (2/3) ... [2023-08-26 18:04:58,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd26cae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:04:58, skipping insertion in model container [2023-08-26 18:04:58,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:04:58" (3/3) ... [2023-08-26 18:04:58,444 INFO L112 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs.i [2023-08-26 18:04:58,457 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:04:58,457 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-08-26 18:04:58,457 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:04:58,521 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:04:58,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 88 transitions, 181 flow [2023-08-26 18:04:58,580 INFO L124 PetriNetUnfolderBase]: 11/134 cut-off events. [2023-08-26 18:04:58,580 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:04:58,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 134 events. 11/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 360 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. [2023-08-26 18:04:58,585 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 88 transitions, 181 flow [2023-08-26 18:04:58,587 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 88 transitions, 181 flow [2023-08-26 18:04:58,589 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:04:58,595 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 88 transitions, 181 flow [2023-08-26 18:04:58,596 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 88 transitions, 181 flow [2023-08-26 18:04:58,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 88 transitions, 181 flow [2023-08-26 18:04:58,614 INFO L124 PetriNetUnfolderBase]: 11/134 cut-off events. [2023-08-26 18:04:58,614 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:04:58,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 134 events. 11/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 360 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. [2023-08-26 18:04:58,616 INFO L119 LiptonReduction]: Number of co-enabled transitions 2450 [2023-08-26 18:04:59,712 INFO L134 LiptonReduction]: Checked pairs total: 7035 [2023-08-26 18:04:59,712 INFO L136 LiptonReduction]: Total number of compositions: 66 [2023-08-26 18:04:59,721 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:04:59,725 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;@7622a49b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:04:59,725 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-08-26 18:04:59,727 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:04:59,727 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 18:04:59,727 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:04:59,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:04:59,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 18:04:59,727 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (and 14 more)] === [2023-08-26 18:04:59,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:04:59,731 INFO L85 PathProgramCache]: Analyzing trace with hash 13820, now seen corresponding path program 1 times [2023-08-26 18:04:59,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:04:59,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134324862] [2023-08-26 18:04:59,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:04:59,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:04:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:04:59,861 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:04:59,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:04:59,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134324862] [2023-08-26 18:04:59,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134324862] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:04:59,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:04:59,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:04:59,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723752222] [2023-08-26 18:04:59,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:04:59,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:04:59,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:04:59,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:04:59,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:04:59,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 154 [2023-08-26 18:04:59,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 40 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:04:59,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:04:59,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 154 [2023-08-26 18:04:59,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:00,006 INFO L124 PetriNetUnfolderBase]: 141/359 cut-off events. [2023-08-26 18:05:00,006 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:05:00,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 663 conditions, 359 events. 141/359 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1765 event pairs, 89 based on Foata normal form. 25/252 useless extension candidates. Maximal degree in co-relation 618. Up to 230 conditions per place. [2023-08-26 18:05:00,009 INFO L140 encePairwiseOnDemand]: 147/154 looper letters, 42 selfloop transitions, 3 changer transitions 5/59 dead transitions. [2023-08-26 18:05:00,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 59 transitions, 223 flow [2023-08-26 18:05:00,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:05:00,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:05:00,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 211 transitions. [2023-08-26 18:05:00,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45670995670995673 [2023-08-26 18:05:00,019 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 211 transitions. [2023-08-26 18:05:00,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 211 transitions. [2023-08-26 18:05:00,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:00,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 211 transitions. [2023-08-26 18:05:00,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,026 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,027 INFO L175 Difference]: Start difference. First operand has 39 places, 40 transitions, 85 flow. Second operand 3 states and 211 transitions. [2023-08-26 18:05:00,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 59 transitions, 223 flow [2023-08-26 18:05:00,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 59 transitions, 223 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:05:00,030 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 93 flow [2023-08-26 18:05:00,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2023-08-26 18:05:00,033 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2023-08-26 18:05:00,033 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 93 flow [2023-08-26 18:05:00,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:00,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 18:05:00,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:05:00,034 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (and 14 more)] === [2023-08-26 18:05:00,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:00,035 INFO L85 PathProgramCache]: Analyzing trace with hash 13821, now seen corresponding path program 1 times [2023-08-26 18:05:00,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:00,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800414689] [2023-08-26 18:05:00,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:00,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:00,115 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:05:00,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:00,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800414689] [2023-08-26 18:05:00,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800414689] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:00,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:00,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:05:00,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883472482] [2023-08-26 18:05:00,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:00,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:05:00,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:00,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:05:00,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:05:00,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 154 [2023-08-26 18:05:00,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:00,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 154 [2023-08-26 18:05:00,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:00,184 INFO L124 PetriNetUnfolderBase]: 129/328 cut-off events. [2023-08-26 18:05:00,184 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-08-26 18:05:00,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 328 events. 129/328 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1591 event pairs, 97 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 614. Up to 251 conditions per place. [2023-08-26 18:05:00,189 INFO L140 encePairwiseOnDemand]: 151/154 looper letters, 32 selfloop transitions, 2 changer transitions 1/44 dead transitions. [2023-08-26 18:05:00,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 179 flow [2023-08-26 18:05:00,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:05:00,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:05:00,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2023-08-26 18:05:00,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43506493506493504 [2023-08-26 18:05:00,194 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 201 transitions. [2023-08-26 18:05:00,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 201 transitions. [2023-08-26 18:05:00,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:00,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 201 transitions. [2023-08-26 18:05:00,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,201 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,201 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 93 flow. Second operand 3 states and 201 transitions. [2023-08-26 18:05:00,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 179 flow [2023-08-26 18:05:00,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 173 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:05:00,207 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 89 flow [2023-08-26 18:05:00,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2023-08-26 18:05:00,208 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2023-08-26 18:05:00,211 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 89 flow [2023-08-26 18:05:00,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:00,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:05:00,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:05:00,212 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (and 14 more)] === [2023-08-26 18:05:00,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:00,215 INFO L85 PathProgramCache]: Analyzing trace with hash 428799, now seen corresponding path program 1 times [2023-08-26 18:05:00,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:00,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659102968] [2023-08-26 18:05:00,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:00,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:05:00,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:00,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659102968] [2023-08-26 18:05:00,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659102968] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:00,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:00,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:05:00,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678328651] [2023-08-26 18:05:00,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:00,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:05:00,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:00,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:05:00,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:05:00,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 154 [2023-08-26 18:05:00,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:00,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 154 [2023-08-26 18:05:00,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:00,409 INFO L124 PetriNetUnfolderBase]: 119/309 cut-off events. [2023-08-26 18:05:00,409 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-08-26 18:05:00,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 309 events. 119/309 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1545 event pairs, 33 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 574. Up to 154 conditions per place. [2023-08-26 18:05:00,412 INFO L140 encePairwiseOnDemand]: 146/154 looper letters, 37 selfloop transitions, 6 changer transitions 1/52 dead transitions. [2023-08-26 18:05:00,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 213 flow [2023-08-26 18:05:00,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:05:00,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:05:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2023-08-26 18:05:00,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43722943722943725 [2023-08-26 18:05:00,413 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 202 transitions. [2023-08-26 18:05:00,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 202 transitions. [2023-08-26 18:05:00,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:00,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 202 transitions. [2023-08-26 18:05:00,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,415 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,415 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 89 flow. Second operand 3 states and 202 transitions. [2023-08-26 18:05:00,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 213 flow [2023-08-26 18:05:00,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 52 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:05:00,417 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 131 flow [2023-08-26 18:05:00,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2023-08-26 18:05:00,418 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2023-08-26 18:05:00,419 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 131 flow [2023-08-26 18:05:00,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:00,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:05:00,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:05:00,421 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (and 14 more)] === [2023-08-26 18:05:00,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:00,422 INFO L85 PathProgramCache]: Analyzing trace with hash 428800, now seen corresponding path program 1 times [2023-08-26 18:05:00,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:00,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131555221] [2023-08-26 18:05:00,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:00,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:00,514 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:05:00,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:00,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131555221] [2023-08-26 18:05:00,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131555221] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:00,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:00,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:05:00,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193864795] [2023-08-26 18:05:00,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:00,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:05:00,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:00,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:05:00,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:05:00,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 154 [2023-08-26 18:05:00,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:00,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 154 [2023-08-26 18:05:00,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:00,568 INFO L124 PetriNetUnfolderBase]: 99/265 cut-off events. [2023-08-26 18:05:00,568 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-08-26 18:05:00,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 265 events. 99/265 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1210 event pairs, 35 based on Foata normal form. 24/233 useless extension candidates. Maximal degree in co-relation 568. Up to 123 conditions per place. [2023-08-26 18:05:00,570 INFO L140 encePairwiseOnDemand]: 150/154 looper letters, 36 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-08-26 18:05:00,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 221 flow [2023-08-26 18:05:00,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:05:00,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:05:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2023-08-26 18:05:00,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43722943722943725 [2023-08-26 18:05:00,571 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 202 transitions. [2023-08-26 18:05:00,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 202 transitions. [2023-08-26 18:05:00,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:00,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 202 transitions. [2023-08-26 18:05:00,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,572 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,572 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 131 flow. Second operand 3 states and 202 transitions. [2023-08-26 18:05:00,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 221 flow [2023-08-26 18:05:00,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 46 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:05:00,574 INFO L231 Difference]: Finished difference. Result has 40 places, 37 transitions, 119 flow [2023-08-26 18:05:00,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=40, PETRI_TRANSITIONS=37} [2023-08-26 18:05:00,574 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2023-08-26 18:05:00,575 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 119 flow [2023-08-26 18:05:00,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:00,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 18:05:00,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:05:00,575 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (and 14 more)] === [2023-08-26 18:05:00,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:00,575 INFO L85 PathProgramCache]: Analyzing trace with hash 412015732, now seen corresponding path program 1 times [2023-08-26 18:05:00,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:00,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36275856] [2023-08-26 18:05:00,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:00,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:00,605 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:05:00,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:00,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36275856] [2023-08-26 18:05:00,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36275856] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:00,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:00,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:05:00,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771339035] [2023-08-26 18:05:00,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:00,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:05:00,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:00,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:05:00,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:05:00,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 154 [2023-08-26 18:05:00,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:00,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 154 [2023-08-26 18:05:00,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:00,667 INFO L124 PetriNetUnfolderBase]: 98/261 cut-off events. [2023-08-26 18:05:00,667 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2023-08-26 18:05:00,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 261 events. 98/261 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1166 event pairs, 3 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 555. Up to 142 conditions per place. [2023-08-26 18:05:00,668 INFO L140 encePairwiseOnDemand]: 145/154 looper letters, 38 selfloop transitions, 8 changer transitions 1/54 dead transitions. [2023-08-26 18:05:00,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 265 flow [2023-08-26 18:05:00,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:05:00,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:05:00,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2023-08-26 18:05:00,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2023-08-26 18:05:00,669 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 204 transitions. [2023-08-26 18:05:00,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 204 transitions. [2023-08-26 18:05:00,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:00,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 204 transitions. [2023-08-26 18:05:00,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,671 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,671 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 119 flow. Second operand 3 states and 204 transitions. [2023-08-26 18:05:00,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 265 flow [2023-08-26 18:05:00,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 257 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:05:00,672 INFO L231 Difference]: Finished difference. Result has 42 places, 42 transitions, 175 flow [2023-08-26 18:05:00,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=42, PETRI_TRANSITIONS=42} [2023-08-26 18:05:00,673 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2023-08-26 18:05:00,673 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 42 transitions, 175 flow [2023-08-26 18:05:00,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:00,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 18:05:00,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:05:00,674 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (and 14 more)] === [2023-08-26 18:05:00,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:00,674 INFO L85 PathProgramCache]: Analyzing trace with hash 412015733, now seen corresponding path program 1 times [2023-08-26 18:05:00,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:00,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209524340] [2023-08-26 18:05:00,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:00,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:00,731 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:05:00,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:00,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209524340] [2023-08-26 18:05:00,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209524340] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:00,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:00,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:05:00,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465296833] [2023-08-26 18:05:00,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:00,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:05:00,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:00,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:05:00,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:05:00,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 154 [2023-08-26 18:05:00,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:00,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 154 [2023-08-26 18:05:00,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:00,782 INFO L124 PetriNetUnfolderBase]: 76/215 cut-off events. [2023-08-26 18:05:00,782 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2023-08-26 18:05:00,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 215 events. 76/215 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 889 event pairs, 7 based on Foata normal form. 24/213 useless extension candidates. Maximal degree in co-relation 542. Up to 131 conditions per place. [2023-08-26 18:05:00,783 INFO L140 encePairwiseOnDemand]: 150/154 looper letters, 38 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2023-08-26 18:05:00,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 283 flow [2023-08-26 18:05:00,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:05:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:05:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2023-08-26 18:05:00,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2023-08-26 18:05:00,785 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 203 transitions. [2023-08-26 18:05:00,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 203 transitions. [2023-08-26 18:05:00,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:00,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 203 transitions. [2023-08-26 18:05:00,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,786 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,786 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 175 flow. Second operand 3 states and 203 transitions. [2023-08-26 18:05:00,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 283 flow [2023-08-26 18:05:00,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 267 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:05:00,788 INFO L231 Difference]: Finished difference. Result has 40 places, 40 transitions, 161 flow [2023-08-26 18:05:00,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=40, PETRI_TRANSITIONS=40} [2023-08-26 18:05:00,789 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2023-08-26 18:05:00,789 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 40 transitions, 161 flow [2023-08-26 18:05:00,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:00,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 18:05:00,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:05:00,789 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (and 14 more)] === [2023-08-26 18:05:00,790 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:00,790 INFO L85 PathProgramCache]: Analyzing trace with hash -110214342, now seen corresponding path program 1 times [2023-08-26 18:05:00,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:00,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107995130] [2023-08-26 18:05:00,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:00,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:00,844 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:05:00,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:00,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107995130] [2023-08-26 18:05:00,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107995130] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:00,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:00,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:05:00,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911530634] [2023-08-26 18:05:00,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:00,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:05:00,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:00,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:05:00,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:05:00,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 154 [2023-08-26 18:05:00,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:00,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 154 [2023-08-26 18:05:00,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:00,914 INFO L124 PetriNetUnfolderBase]: 131/299 cut-off events. [2023-08-26 18:05:00,914 INFO L125 PetriNetUnfolderBase]: For 212/212 co-relation queries the response was YES. [2023-08-26 18:05:00,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 299 events. 131/299 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1174 event pairs, 49 based on Foata normal form. 0/264 useless extension candidates. Maximal degree in co-relation 790. Up to 213 conditions per place. [2023-08-26 18:05:00,915 INFO L140 encePairwiseOnDemand]: 148/154 looper letters, 40 selfloop transitions, 4 changer transitions 16/62 dead transitions. [2023-08-26 18:05:00,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 62 transitions, 361 flow [2023-08-26 18:05:00,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:05:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:05:00,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2023-08-26 18:05:00,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4935064935064935 [2023-08-26 18:05:00,919 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 228 transitions. [2023-08-26 18:05:00,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 228 transitions. [2023-08-26 18:05:00,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:00,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 228 transitions. [2023-08-26 18:05:00,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,921 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,921 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 161 flow. Second operand 3 states and 228 transitions. [2023-08-26 18:05:00,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 62 transitions, 361 flow [2023-08-26 18:05:00,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 62 transitions, 351 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:05:00,925 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 163 flow [2023-08-26 18:05:00,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2023-08-26 18:05:00,925 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2023-08-26 18:05:00,925 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 163 flow [2023-08-26 18:05:00,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:00,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:00,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:05:00,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:05:00,926 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (and 14 more)] === [2023-08-26 18:05:00,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:00,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1092365359, now seen corresponding path program 1 times [2023-08-26 18:05:00,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:00,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647976436] [2023-08-26 18:05:00,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:00,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:01,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:05:01,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:01,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647976436] [2023-08-26 18:05:01,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647976436] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:01,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:01,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:05:01,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662942213] [2023-08-26 18:05:01,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:01,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:05:01,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:01,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:05:01,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:05:01,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 154 [2023-08-26 18:05:01,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 163 flow. Second operand has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:01,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:01,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 154 [2023-08-26 18:05:01,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:01,068 INFO L124 PetriNetUnfolderBase]: 62/197 cut-off events. [2023-08-26 18:05:01,069 INFO L125 PetriNetUnfolderBase]: For 118/124 co-relation queries the response was YES. [2023-08-26 18:05:01,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 197 events. 62/197 cut-off events. For 118/124 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 821 event pairs, 7 based on Foata normal form. 7/180 useless extension candidates. Maximal degree in co-relation 525. Up to 72 conditions per place. [2023-08-26 18:05:01,069 INFO L140 encePairwiseOnDemand]: 149/154 looper letters, 33 selfloop transitions, 5 changer transitions 4/50 dead transitions. [2023-08-26 18:05:01,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 293 flow [2023-08-26 18:05:01,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:05:01,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:05:01,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2023-08-26 18:05:01,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.387987012987013 [2023-08-26 18:05:01,070 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 239 transitions. [2023-08-26 18:05:01,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 239 transitions. [2023-08-26 18:05:01,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:01,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 239 transitions. [2023-08-26 18:05:01,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:01,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 154.0) internal successors, (770), 5 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:01,072 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 154.0) internal successors, (770), 5 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:01,072 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 163 flow. Second operand 4 states and 239 transitions. [2023-08-26 18:05:01,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 293 flow [2023-08-26 18:05:01,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 280 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:05:01,074 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 159 flow [2023-08-26 18:05:01,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2023-08-26 18:05:01,076 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2023-08-26 18:05:01,076 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 159 flow [2023-08-26 18:05:01,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:01,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:01,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:05:01,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:05:01,076 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (and 14 more)] === [2023-08-26 18:05:01,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:01,077 INFO L85 PathProgramCache]: Analyzing trace with hash -712686208, now seen corresponding path program 1 times [2023-08-26 18:05:01,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:01,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420600087] [2023-08-26 18:05:01,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:01,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:01,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 18:05:01,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:01,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420600087] [2023-08-26 18:05:01,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420600087] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:01,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:01,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:05:01,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235398791] [2023-08-26 18:05:01,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:01,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:05:01,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:01,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:05:01,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:05:01,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 154 [2023-08-26 18:05:01,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 52.2) internal successors, (261), 5 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:01,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:01,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 154 [2023-08-26 18:05:01,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:01,269 INFO L124 PetriNetUnfolderBase]: 58/179 cut-off events. [2023-08-26 18:05:01,270 INFO L125 PetriNetUnfolderBase]: For 163/171 co-relation queries the response was YES. [2023-08-26 18:05:01,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 179 events. 58/179 cut-off events. For 163/171 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 709 event pairs, 4 based on Foata normal form. 9/168 useless extension candidates. Maximal degree in co-relation 460. Up to 49 conditions per place. [2023-08-26 18:05:01,270 INFO L140 encePairwiseOnDemand]: 143/154 looper letters, 29 selfloop transitions, 10 changer transitions 6/53 dead transitions. [2023-08-26 18:05:01,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 312 flow [2023-08-26 18:05:01,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:05:01,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:05:01,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 295 transitions. [2023-08-26 18:05:01,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38311688311688313 [2023-08-26 18:05:01,272 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 295 transitions. [2023-08-26 18:05:01,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 295 transitions. [2023-08-26 18:05:01,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:01,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 295 transitions. [2023-08-26 18:05:01,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:01,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:01,275 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:01,275 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 159 flow. Second operand 5 states and 295 transitions. [2023-08-26 18:05:01,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 312 flow [2023-08-26 18:05:01,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 294 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-26 18:05:01,277 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 186 flow [2023-08-26 18:05:01,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2023-08-26 18:05:01,279 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2023-08-26 18:05:01,279 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 186 flow [2023-08-26 18:05:01,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.2) internal successors, (261), 5 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:01,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:01,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:05:01,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:05:01,280 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err4ASSERT_VIOLATIONASSERT === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (and 14 more)] === [2023-08-26 18:05:01,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:01,280 INFO L85 PathProgramCache]: Analyzing trace with hash 584085025, now seen corresponding path program 1 times [2023-08-26 18:05:01,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:01,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89066834] [2023-08-26 18:05:01,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:01,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:01,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 18:05:01,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:01,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89066834] [2023-08-26 18:05:01,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89066834] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:01,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:01,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:05:01,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664987358] [2023-08-26 18:05:01,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:01,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:05:01,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:01,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:05:01,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:05:01,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 154 [2023-08-26 18:05:01,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:01,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:01,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 154 [2023-08-26 18:05:01,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:01,523 INFO L124 PetriNetUnfolderBase]: 58/179 cut-off events. [2023-08-26 18:05:01,523 INFO L125 PetriNetUnfolderBase]: For 249/255 co-relation queries the response was YES. [2023-08-26 18:05:01,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 179 events. 58/179 cut-off events. For 249/255 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 679 event pairs, 12 based on Foata normal form. 6/167 useless extension candidates. Maximal degree in co-relation 493. Up to 84 conditions per place. [2023-08-26 18:05:01,524 INFO L140 encePairwiseOnDemand]: 148/154 looper letters, 37 selfloop transitions, 7 changer transitions 6/58 dead transitions. [2023-08-26 18:05:01,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 58 transitions, 374 flow [2023-08-26 18:05:01,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:05:01,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:05:01,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 334 transitions. [2023-08-26 18:05:01,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43376623376623374 [2023-08-26 18:05:01,525 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 334 transitions. [2023-08-26 18:05:01,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 334 transitions. [2023-08-26 18:05:01,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:01,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 334 transitions. [2023-08-26 18:05:01,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:01,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:01,528 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:01,528 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 186 flow. Second operand 5 states and 334 transitions. [2023-08-26 18:05:01,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 58 transitions, 374 flow [2023-08-26 18:05:01,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 368 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:05:01,529 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 227 flow [2023-08-26 18:05:01,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2023-08-26 18:05:01,530 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2023-08-26 18:05:01,530 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 227 flow [2023-08-26 18:05:01,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:01,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:01,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:05:01,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:05:01,531 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (and 14 more)] === [2023-08-26 18:05:01,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:01,531 INFO L85 PathProgramCache]: Analyzing trace with hash -233538629, now seen corresponding path program 1 times [2023-08-26 18:05:01,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:01,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170021076] [2023-08-26 18:05:01,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:01,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:01,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:05:01,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:01,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170021076] [2023-08-26 18:05:01,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170021076] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:01,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:01,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:05:01,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86939581] [2023-08-26 18:05:01,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:01,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:05:01,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:01,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:05:01,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:05:01,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 154 [2023-08-26 18:05:01,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 227 flow. Second operand has 7 states, 7 states have (on average 48.714285714285715) internal successors, (341), 7 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:01,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:01,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 154 [2023-08-26 18:05:01,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:01,756 INFO L124 PetriNetUnfolderBase]: 54/176 cut-off events. [2023-08-26 18:05:01,756 INFO L125 PetriNetUnfolderBase]: For 223/234 co-relation queries the response was YES. [2023-08-26 18:05:01,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 578 conditions, 176 events. 54/176 cut-off events. For 223/234 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 704 event pairs, 6 based on Foata normal form. 11/178 useless extension candidates. Maximal degree in co-relation 529. Up to 51 conditions per place. [2023-08-26 18:05:01,757 INFO L140 encePairwiseOnDemand]: 146/154 looper letters, 28 selfloop transitions, 11 changer transitions 16/63 dead transitions. [2023-08-26 18:05:01,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 440 flow [2023-08-26 18:05:01,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:05:01,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:05:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 425 transitions. [2023-08-26 18:05:01,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3449675324675325 [2023-08-26 18:05:01,759 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 425 transitions. [2023-08-26 18:05:01,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 425 transitions. [2023-08-26 18:05:01,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:01,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 425 transitions. [2023-08-26 18:05:01,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 53.125) internal successors, (425), 8 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:01,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:01,761 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:01,762 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 227 flow. Second operand 8 states and 425 transitions. [2023-08-26 18:05:01,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 440 flow [2023-08-26 18:05:01,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 434 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-26 18:05:01,763 INFO L231 Difference]: Finished difference. Result has 55 places, 37 transitions, 227 flow [2023-08-26 18:05:01,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=227, PETRI_PLACES=55, PETRI_TRANSITIONS=37} [2023-08-26 18:05:01,764 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2023-08-26 18:05:01,764 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 37 transitions, 227 flow [2023-08-26 18:05:01,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.714285714285715) internal successors, (341), 7 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:01,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:01,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:05:01,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:05:01,764 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (and 14 more)] === [2023-08-26 18:05:01,765 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:01,765 INFO L85 PathProgramCache]: Analyzing trace with hash -617770117, now seen corresponding path program 2 times [2023-08-26 18:05:01,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:01,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138811542] [2023-08-26 18:05:01,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:01,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:05:01,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:01,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138811542] [2023-08-26 18:05:01,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138811542] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:01,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:01,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:05:01,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826028805] [2023-08-26 18:05:01,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:01,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:05:01,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:01,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:05:01,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:05:01,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 154 [2023-08-26 18:05:01,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 37 transitions, 227 flow. Second operand has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:01,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:01,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 154 [2023-08-26 18:05:01,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:01,929 INFO L124 PetriNetUnfolderBase]: 44/156 cut-off events. [2023-08-26 18:05:01,930 INFO L125 PetriNetUnfolderBase]: For 299/306 co-relation queries the response was YES. [2023-08-26 18:05:01,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 156 events. 44/156 cut-off events. For 299/306 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 605 event pairs, 6 based on Foata normal form. 9/157 useless extension candidates. Maximal degree in co-relation 491. Up to 44 conditions per place. [2023-08-26 18:05:01,930 INFO L140 encePairwiseOnDemand]: 146/154 looper letters, 20 selfloop transitions, 8 changer transitions 17/53 dead transitions. [2023-08-26 18:05:01,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 53 transitions, 378 flow [2023-08-26 18:05:01,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:05:01,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:05:01,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 370 transitions. [2023-08-26 18:05:01,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3432282003710575 [2023-08-26 18:05:01,932 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 370 transitions. [2023-08-26 18:05:01,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 370 transitions. [2023-08-26 18:05:01,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:01,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 370 transitions. [2023-08-26 18:05:01,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 52.857142857142854) internal successors, (370), 7 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:01,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:01,934 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:01,934 INFO L175 Difference]: Start difference. First operand has 55 places, 37 transitions, 227 flow. Second operand 7 states and 370 transitions. [2023-08-26 18:05:01,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 53 transitions, 378 flow [2023-08-26 18:05:01,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 53 transitions, 325 flow, removed 4 selfloop flow, removed 10 redundant places. [2023-08-26 18:05:01,936 INFO L231 Difference]: Finished difference. Result has 48 places, 29 transitions, 143 flow [2023-08-26 18:05:01,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=143, PETRI_PLACES=48, PETRI_TRANSITIONS=29} [2023-08-26 18:05:01,936 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2023-08-26 18:05:01,936 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 29 transitions, 143 flow [2023-08-26 18:05:01,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:01,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:01,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:05:01,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:05:01,937 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err4ASSERT_VIOLATIONASSERT === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (and 14 more)] === [2023-08-26 18:05:01,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:01,937 INFO L85 PathProgramCache]: Analyzing trace with hash -160638747, now seen corresponding path program 2 times [2023-08-26 18:05:01,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:01,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720139887] [2023-08-26 18:05:01,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:01,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:02,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 18:05:02,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:02,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720139887] [2023-08-26 18:05:02,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720139887] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:02,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:02,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:05:02,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82327569] [2023-08-26 18:05:02,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:02,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:05:02,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:02,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:05:02,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:05:02,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 154 [2023-08-26 18:05:02,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 29 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:02,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:02,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 154 [2023-08-26 18:05:02,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:02,110 INFO L124 PetriNetUnfolderBase]: 19/63 cut-off events. [2023-08-26 18:05:02,110 INFO L125 PetriNetUnfolderBase]: For 58/60 co-relation queries the response was YES. [2023-08-26 18:05:02,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 63 events. 19/63 cut-off events. For 58/60 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 109 event pairs, 3 based on Foata normal form. 2/58 useless extension candidates. Maximal degree in co-relation 180. Up to 18 conditions per place. [2023-08-26 18:05:02,110 INFO L140 encePairwiseOnDemand]: 149/154 looper letters, 0 selfloop transitions, 0 changer transitions 31/31 dead transitions. [2023-08-26 18:05:02,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 31 transitions, 201 flow [2023-08-26 18:05:02,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:05:02,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:05:02,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 309 transitions. [2023-08-26 18:05:02,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4012987012987013 [2023-08-26 18:05:02,111 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 309 transitions. [2023-08-26 18:05:02,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 309 transitions. [2023-08-26 18:05:02,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:02,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 309 transitions. [2023-08-26 18:05:02,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 61.8) internal successors, (309), 5 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:02,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:02,113 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:02,113 INFO L175 Difference]: Start difference. First operand has 48 places, 29 transitions, 143 flow. Second operand 5 states and 309 transitions. [2023-08-26 18:05:02,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 31 transitions, 201 flow [2023-08-26 18:05:02,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 31 transitions, 151 flow, removed 6 selfloop flow, removed 12 redundant places. [2023-08-26 18:05:02,114 INFO L231 Difference]: Finished difference. Result has 37 places, 0 transitions, 0 flow [2023-08-26 18:05:02,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=37, PETRI_TRANSITIONS=0} [2023-08-26 18:05:02,114 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2023-08-26 18:05:02,115 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 0 transitions, 0 flow [2023-08-26 18:05:02,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:02,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 17 remaining) [2023-08-26 18:05:02,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining) [2023-08-26 18:05:02,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (14 of 17 remaining) [2023-08-26 18:05:02,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2023-08-26 18:05:02,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining) [2023-08-26 18:05:02,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining) [2023-08-26 18:05:02,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining) [2023-08-26 18:05:02,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONASSERT (9 of 17 remaining) [2023-08-26 18:05:02,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2023-08-26 18:05:02,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2023-08-26 18:05:02,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2023-08-26 18:05:02,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2023-08-26 18:05:02,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONASSERT (4 of 17 remaining) [2023-08-26 18:05:02,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 17 remaining) [2023-08-26 18:05:02,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 17 remaining) [2023-08-26 18:05:02,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 17 remaining) [2023-08-26 18:05:02,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 17 remaining) [2023-08-26 18:05:02,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 18:05:02,118 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:05:02,119 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-26 18:05:02,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 88 transitions, 181 flow [2023-08-26 18:05:02,128 INFO L124 PetriNetUnfolderBase]: 11/134 cut-off events. [2023-08-26 18:05:02,128 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:05:02,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 134 events. 11/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 360 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. [2023-08-26 18:05:02,129 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 88 transitions, 181 flow [2023-08-26 18:05:02,129 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 88 transitions, 181 flow [2023-08-26 18:05:02,129 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:05:02,129 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 88 transitions, 181 flow [2023-08-26 18:05:02,130 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 88 transitions, 181 flow [2023-08-26 18:05:02,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 88 transitions, 181 flow [2023-08-26 18:05:02,135 INFO L124 PetriNetUnfolderBase]: 11/134 cut-off events. [2023-08-26 18:05:02,135 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:05:02,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 134 events. 11/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 360 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. [2023-08-26 18:05:02,136 INFO L119 LiptonReduction]: Number of co-enabled transitions 2450 [2023-08-26 18:05:03,054 INFO L134 LiptonReduction]: Checked pairs total: 7511 [2023-08-26 18:05:03,054 INFO L136 LiptonReduction]: Total number of compositions: 66 [2023-08-26 18:05:03,056 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-26 18:05:03,056 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;@7622a49b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:05:03,056 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-26 18:05:03,058 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:05:03,058 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2023-08-26 18:05:03,058 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:05:03,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:03,058 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-26 18:05:03,058 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 18:05:03,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:03,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1837208937, now seen corresponding path program 1 times [2023-08-26 18:05:03,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:03,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181601015] [2023-08-26 18:05:03,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:03,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:05:03,065 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:05:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:05:03,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:05:03,079 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:05:03,079 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-26 18:05:03,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 18:05:03,079 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-26 18:05:03,080 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-26 18:05:03,080 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-26 18:05:03,080 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-26 18:05:03,099 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:05:03,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 114 transitions, 240 flow [2023-08-26 18:05:03,115 INFO L124 PetriNetUnfolderBase]: 18/208 cut-off events. [2023-08-26 18:05:03,115 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 18:05:03,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 18/208 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 668 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 135. Up to 6 conditions per place. [2023-08-26 18:05:03,116 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 114 transitions, 240 flow [2023-08-26 18:05:03,117 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 114 transitions, 240 flow [2023-08-26 18:05:03,117 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:05:03,117 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 114 transitions, 240 flow [2023-08-26 18:05:03,117 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 114 transitions, 240 flow [2023-08-26 18:05:03,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 114 transitions, 240 flow [2023-08-26 18:05:03,130 INFO L124 PetriNetUnfolderBase]: 18/208 cut-off events. [2023-08-26 18:05:03,130 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 18:05:03,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 18/208 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 668 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 135. Up to 6 conditions per place. [2023-08-26 18:05:03,133 INFO L119 LiptonReduction]: Number of co-enabled transitions 6200 [2023-08-26 18:05:04,171 INFO L134 LiptonReduction]: Checked pairs total: 18730 [2023-08-26 18:05:04,171 INFO L136 LiptonReduction]: Total number of compositions: 78 [2023-08-26 18:05:04,172 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:05:04,172 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;@7622a49b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:05:04,172 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-08-26 18:05:04,173 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:05:04,173 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-26 18:05:04,173 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:05:04,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:04,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 18:05:04,173 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:05:04,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:04,173 INFO L85 PathProgramCache]: Analyzing trace with hash 22755, now seen corresponding path program 1 times [2023-08-26 18:05:04,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:04,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886750583] [2023-08-26 18:05:04,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:04,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:04,186 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:05:04,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:04,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886750583] [2023-08-26 18:05:04,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886750583] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:04,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:04,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:05:04,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256131393] [2023-08-26 18:05:04,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:04,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:05:04,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:04,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:05:04,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:05:04,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 192 [2023-08-26 18:05:04,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 62 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:04,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:04,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 192 [2023-08-26 18:05:04,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:04,549 INFO L124 PetriNetUnfolderBase]: 3455/5962 cut-off events. [2023-08-26 18:05:04,549 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-08-26 18:05:04,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11394 conditions, 5962 events. 3455/5962 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 43085 event pairs, 2114 based on Foata normal form. 769/4198 useless extension candidates. Maximal degree in co-relation 1552. Up to 3796 conditions per place. [2023-08-26 18:05:04,572 INFO L140 encePairwiseOnDemand]: 181/192 looper letters, 69 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2023-08-26 18:05:04,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 89 transitions, 343 flow [2023-08-26 18:05:04,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:05:04,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:05:04,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2023-08-26 18:05:04,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2023-08-26 18:05:04,574 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 280 transitions. [2023-08-26 18:05:04,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 280 transitions. [2023-08-26 18:05:04,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:04,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 280 transitions. [2023-08-26 18:05:04,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:04,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:04,575 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:04,575 INFO L175 Difference]: Start difference. First operand has 59 places, 62 transitions, 136 flow. Second operand 3 states and 280 transitions. [2023-08-26 18:05:04,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 89 transitions, 343 flow [2023-08-26 18:05:04,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 89 transitions, 341 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-26 18:05:04,577 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 156 flow [2023-08-26 18:05:04,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2023-08-26 18:05:04,578 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 1 predicate places. [2023-08-26 18:05:04,578 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 156 flow [2023-08-26 18:05:04,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:04,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:04,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 18:05:04,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 18:05:04,578 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:05:04,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:04,578 INFO L85 PathProgramCache]: Analyzing trace with hash 22756, now seen corresponding path program 1 times [2023-08-26 18:05:04,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:04,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779564018] [2023-08-26 18:05:04,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:04,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:04,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:05:04,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:04,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779564018] [2023-08-26 18:05:04,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779564018] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:04,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:04,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:05:04,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578758478] [2023-08-26 18:05:04,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:04,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:05:04,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:04,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:05:04,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:05:04,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 192 [2023-08-26 18:05:04,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:04,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:04,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 192 [2023-08-26 18:05:04,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:05,009 INFO L124 PetriNetUnfolderBase]: 3614/6388 cut-off events. [2023-08-26 18:05:05,009 INFO L125 PetriNetUnfolderBase]: For 1030/1033 co-relation queries the response was YES. [2023-08-26 18:05:05,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13275 conditions, 6388 events. 3614/6388 cut-off events. For 1030/1033 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 47477 event pairs, 2638 based on Foata normal form. 0/3859 useless extension candidates. Maximal degree in co-relation 11752. Up to 5215 conditions per place. [2023-08-26 18:05:05,038 INFO L140 encePairwiseOnDemand]: 186/192 looper letters, 64 selfloop transitions, 6 changer transitions 2/87 dead transitions. [2023-08-26 18:05:05,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 87 transitions, 383 flow [2023-08-26 18:05:05,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:05:05,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:05:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2023-08-26 18:05:05,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4739583333333333 [2023-08-26 18:05:05,040 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 273 transitions. [2023-08-26 18:05:05,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 273 transitions. [2023-08-26 18:05:05,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:05,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 273 transitions. [2023-08-26 18:05:05,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:05,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:05,041 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:05,041 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 156 flow. Second operand 3 states and 273 transitions. [2023-08-26 18:05:05,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 87 transitions, 383 flow [2023-08-26 18:05:05,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 87 transitions, 367 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:05:05,051 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 196 flow [2023-08-26 18:05:05,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2023-08-26 18:05:05,051 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 3 predicate places. [2023-08-26 18:05:05,051 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 196 flow [2023-08-26 18:05:05,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:05,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:05,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:05:05,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 18:05:05,052 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:05:05,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:05,052 INFO L85 PathProgramCache]: Analyzing trace with hash 706030, now seen corresponding path program 1 times [2023-08-26 18:05:05,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:05,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516890210] [2023-08-26 18:05:05,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:05,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:05,069 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:05:05,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:05,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516890210] [2023-08-26 18:05:05,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516890210] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:05,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:05,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:05:05,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560521411] [2023-08-26 18:05:05,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:05,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:05:05,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:05,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:05:05,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:05:05,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 192 [2023-08-26 18:05:05,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:05,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:05,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 192 [2023-08-26 18:05:05,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:05,447 INFO L124 PetriNetUnfolderBase]: 3570/6478 cut-off events. [2023-08-26 18:05:05,447 INFO L125 PetriNetUnfolderBase]: For 1649/1716 co-relation queries the response was YES. [2023-08-26 18:05:05,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13896 conditions, 6478 events. 3570/6478 cut-off events. For 1649/1716 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 49433 event pairs, 2267 based on Foata normal form. 0/4011 useless extension candidates. Maximal degree in co-relation 9146. Up to 2900 conditions per place. [2023-08-26 18:05:05,509 INFO L140 encePairwiseOnDemand]: 183/192 looper letters, 70 selfloop transitions, 11 changer transitions 0/95 dead transitions. [2023-08-26 18:05:05,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 95 transitions, 436 flow [2023-08-26 18:05:05,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:05:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:05:05,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2023-08-26 18:05:05,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4635416666666667 [2023-08-26 18:05:05,511 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 267 transitions. [2023-08-26 18:05:05,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 267 transitions. [2023-08-26 18:05:05,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:05,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 267 transitions. [2023-08-26 18:05:05,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:05,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:05,513 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:05,513 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 196 flow. Second operand 3 states and 267 transitions. [2023-08-26 18:05:05,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 95 transitions, 436 flow [2023-08-26 18:05:05,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 95 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:05:05,516 INFO L231 Difference]: Finished difference. Result has 64 places, 71 transitions, 274 flow [2023-08-26 18:05:05,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=64, PETRI_TRANSITIONS=71} [2023-08-26 18:05:05,517 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 5 predicate places. [2023-08-26 18:05:05,517 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 71 transitions, 274 flow [2023-08-26 18:05:05,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:05,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:05,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:05:05,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 18:05:05,517 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:05:05,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:05,517 INFO L85 PathProgramCache]: Analyzing trace with hash 706031, now seen corresponding path program 1 times [2023-08-26 18:05:05,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:05,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687704373] [2023-08-26 18:05:05,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:05,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:05,547 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:05:05,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:05,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687704373] [2023-08-26 18:05:05,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687704373] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:05,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:05,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:05:05,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023717860] [2023-08-26 18:05:05,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:05,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:05:05,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:05,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:05:05,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:05:05,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 192 [2023-08-26 18:05:05,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 71 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:05,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:05,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 192 [2023-08-26 18:05:05,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:05,883 INFO L124 PetriNetUnfolderBase]: 2998/5416 cut-off events. [2023-08-26 18:05:05,884 INFO L125 PetriNetUnfolderBase]: For 3472/3560 co-relation queries the response was YES. [2023-08-26 18:05:05,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13255 conditions, 5416 events. 2998/5416 cut-off events. For 3472/3560 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 40313 event pairs, 2074 based on Foata normal form. 330/4055 useless extension candidates. Maximal degree in co-relation 8437. Up to 2496 conditions per place. [2023-08-26 18:05:05,900 INFO L140 encePairwiseOnDemand]: 188/192 looper letters, 72 selfloop transitions, 5 changer transitions 0/91 dead transitions. [2023-08-26 18:05:05,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 91 transitions, 480 flow [2023-08-26 18:05:05,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:05:05,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:05:05,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2023-08-26 18:05:05,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4670138888888889 [2023-08-26 18:05:05,901 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 269 transitions. [2023-08-26 18:05:05,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 269 transitions. [2023-08-26 18:05:05,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:05,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 269 transitions. [2023-08-26 18:05:05,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:05,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:05,903 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:05,903 INFO L175 Difference]: Start difference. First operand has 64 places, 71 transitions, 274 flow. Second operand 3 states and 269 transitions. [2023-08-26 18:05:05,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 91 transitions, 480 flow [2023-08-26 18:05:05,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 91 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:05:05,908 INFO L231 Difference]: Finished difference. Result has 62 places, 69 transitions, 258 flow [2023-08-26 18:05:05,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=62, PETRI_TRANSITIONS=69} [2023-08-26 18:05:05,908 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 3 predicate places. [2023-08-26 18:05:05,908 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 69 transitions, 258 flow [2023-08-26 18:05:05,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:05,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:05,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 18:05:05,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 18:05:05,909 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:05:05,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:05,909 INFO L85 PathProgramCache]: Analyzing trace with hash 678467668, now seen corresponding path program 1 times [2023-08-26 18:05:05,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:05,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554748660] [2023-08-26 18:05:05,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:05,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:05,930 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:05:05,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:05,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554748660] [2023-08-26 18:05:05,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554748660] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:05,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:05,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:05:05,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588442048] [2023-08-26 18:05:05,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:05,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:05:05,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:05,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:05:05,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:05:05,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 192 [2023-08-26 18:05:05,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 69 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:05,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:05,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 192 [2023-08-26 18:05:05,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:06,299 INFO L124 PetriNetUnfolderBase]: 3305/6134 cut-off events. [2023-08-26 18:05:06,299 INFO L125 PetriNetUnfolderBase]: For 3406/3432 co-relation queries the response was YES. [2023-08-26 18:05:06,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14539 conditions, 6134 events. 3305/6134 cut-off events. For 3406/3432 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 47996 event pairs, 1182 based on Foata normal form. 7/4269 useless extension candidates. Maximal degree in co-relation 12977. Up to 3157 conditions per place. [2023-08-26 18:05:06,321 INFO L140 encePairwiseOnDemand]: 182/192 looper letters, 86 selfloop transitions, 16 changer transitions 1/116 dead transitions. [2023-08-26 18:05:06,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 116 transitions, 653 flow [2023-08-26 18:05:06,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:05:06,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:05:06,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2023-08-26 18:05:06,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4739583333333333 [2023-08-26 18:05:06,323 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 273 transitions. [2023-08-26 18:05:06,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 273 transitions. [2023-08-26 18:05:06,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:06,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 273 transitions. [2023-08-26 18:05:06,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:06,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:06,325 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:06,325 INFO L175 Difference]: Start difference. First operand has 62 places, 69 transitions, 258 flow. Second operand 3 states and 273 transitions. [2023-08-26 18:05:06,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 116 transitions, 653 flow [2023-08-26 18:05:06,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 116 transitions, 633 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:05:06,330 INFO L231 Difference]: Finished difference. Result has 64 places, 81 transitions, 396 flow [2023-08-26 18:05:06,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=64, PETRI_TRANSITIONS=81} [2023-08-26 18:05:06,330 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 5 predicate places. [2023-08-26 18:05:06,330 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 81 transitions, 396 flow [2023-08-26 18:05:06,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:06,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:06,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 18:05:06,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 18:05:06,331 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:05:06,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:06,331 INFO L85 PathProgramCache]: Analyzing trace with hash 678467669, now seen corresponding path program 1 times [2023-08-26 18:05:06,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:06,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985370041] [2023-08-26 18:05:06,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:06,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:06,370 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:05:06,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:06,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985370041] [2023-08-26 18:05:06,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985370041] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:06,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:06,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:05:06,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160201036] [2023-08-26 18:05:06,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:06,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:05:06,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:06,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:05:06,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:05:06,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 192 [2023-08-26 18:05:06,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 81 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:06,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:06,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 192 [2023-08-26 18:05:06,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:06,720 INFO L124 PetriNetUnfolderBase]: 2665/4943 cut-off events. [2023-08-26 18:05:06,720 INFO L125 PetriNetUnfolderBase]: For 5157/5220 co-relation queries the response was YES. [2023-08-26 18:05:06,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13600 conditions, 4943 events. 2665/4943 cut-off events. For 5157/5220 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 37442 event pairs, 1156 based on Foata normal form. 372/4080 useless extension candidates. Maximal degree in co-relation 12104. Up to 3247 conditions per place. [2023-08-26 18:05:06,741 INFO L140 encePairwiseOnDemand]: 188/192 looper letters, 89 selfloop transitions, 8 changer transitions 0/111 dead transitions. [2023-08-26 18:05:06,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 111 transitions, 717 flow [2023-08-26 18:05:06,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:05:06,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:05:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2023-08-26 18:05:06,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2023-08-26 18:05:06,743 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 272 transitions. [2023-08-26 18:05:06,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 272 transitions. [2023-08-26 18:05:06,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:06,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 272 transitions. [2023-08-26 18:05:06,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:06,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:06,745 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:06,746 INFO L175 Difference]: Start difference. First operand has 64 places, 81 transitions, 396 flow. Second operand 3 states and 272 transitions. [2023-08-26 18:05:06,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 111 transitions, 717 flow [2023-08-26 18:05:06,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 111 transitions, 685 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:05:06,750 INFO L231 Difference]: Finished difference. Result has 62 places, 79 transitions, 376 flow [2023-08-26 18:05:06,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=62, PETRI_TRANSITIONS=79} [2023-08-26 18:05:06,751 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 3 predicate places. [2023-08-26 18:05:06,751 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 79 transitions, 376 flow [2023-08-26 18:05:06,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:06,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:06,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 18:05:06,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 18:05:06,751 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:05:06,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:06,754 INFO L85 PathProgramCache]: Analyzing trace with hash -440915893, now seen corresponding path program 1 times [2023-08-26 18:05:06,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:06,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234470772] [2023-08-26 18:05:06,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:06,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:06,784 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:05:06,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:06,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234470772] [2023-08-26 18:05:06,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234470772] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:06,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:06,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:05:06,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296752317] [2023-08-26 18:05:06,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:06,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:05:06,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:06,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:05:06,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:05:06,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 192 [2023-08-26 18:05:06,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 79 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:06,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:06,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 192 [2023-08-26 18:05:06,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:07,236 INFO L124 PetriNetUnfolderBase]: 4920/8212 cut-off events. [2023-08-26 18:05:07,236 INFO L125 PetriNetUnfolderBase]: For 7652/7713 co-relation queries the response was YES. [2023-08-26 18:05:07,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22515 conditions, 8212 events. 4920/8212 cut-off events. For 7652/7713 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 55303 event pairs, 1970 based on Foata normal form. 0/6601 useless extension candidates. Maximal degree in co-relation 17048. Up to 5576 conditions per place. [2023-08-26 18:05:07,264 INFO L140 encePairwiseOnDemand]: 181/192 looper letters, 117 selfloop transitions, 6 changer transitions 12/142 dead transitions. [2023-08-26 18:05:07,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 142 transitions, 967 flow [2023-08-26 18:05:07,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:05:07,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:05:07,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2023-08-26 18:05:07,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515625 [2023-08-26 18:05:07,266 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 297 transitions. [2023-08-26 18:05:07,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 297 transitions. [2023-08-26 18:05:07,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:07,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 297 transitions. [2023-08-26 18:05:07,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:07,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:07,268 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:07,268 INFO L175 Difference]: Start difference. First operand has 62 places, 79 transitions, 376 flow. Second operand 3 states and 297 transitions. [2023-08-26 18:05:07,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 142 transitions, 967 flow [2023-08-26 18:05:07,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 142 transitions, 935 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:05:07,272 INFO L231 Difference]: Finished difference. Result has 64 places, 85 transitions, 418 flow [2023-08-26 18:05:07,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=64, PETRI_TRANSITIONS=85} [2023-08-26 18:05:07,273 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 5 predicate places. [2023-08-26 18:05:07,273 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 85 transitions, 418 flow [2023-08-26 18:05:07,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:07,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:07,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:05:07,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 18:05:07,273 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:05:07,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:07,274 INFO L85 PathProgramCache]: Analyzing trace with hash -827673481, now seen corresponding path program 1 times [2023-08-26 18:05:07,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:07,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012686193] [2023-08-26 18:05:07,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:07,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:07,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 18:05:07,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:07,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012686193] [2023-08-26 18:05:07,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012686193] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:07,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:07,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:05:07,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64026051] [2023-08-26 18:05:07,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:07,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:05:07,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:07,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:05:07,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:05:07,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 192 [2023-08-26 18:05:07,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 85 transitions, 418 flow. Second operand has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:07,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:07,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 192 [2023-08-26 18:05:07,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:07,747 INFO L124 PetriNetUnfolderBase]: 3230/6166 cut-off events. [2023-08-26 18:05:07,747 INFO L125 PetriNetUnfolderBase]: For 5205/5739 co-relation queries the response was YES. [2023-08-26 18:05:07,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17809 conditions, 6166 events. 3230/6166 cut-off events. For 5205/5739 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 48237 event pairs, 845 based on Foata normal form. 377/4925 useless extension candidates. Maximal degree in co-relation 13939. Up to 1859 conditions per place. [2023-08-26 18:05:07,770 INFO L140 encePairwiseOnDemand]: 182/192 looper letters, 124 selfloop transitions, 19 changer transitions 4/165 dead transitions. [2023-08-26 18:05:07,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 165 transitions, 1051 flow [2023-08-26 18:05:07,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:05:07,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:05:07,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 353 transitions. [2023-08-26 18:05:07,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4596354166666667 [2023-08-26 18:05:07,772 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 353 transitions. [2023-08-26 18:05:07,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 353 transitions. [2023-08-26 18:05:07,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:07,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 353 transitions. [2023-08-26 18:05:07,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:07,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:07,783 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:07,783 INFO L175 Difference]: Start difference. First operand has 64 places, 85 transitions, 418 flow. Second operand 4 states and 353 transitions. [2023-08-26 18:05:07,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 165 transitions, 1051 flow [2023-08-26 18:05:07,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 165 transitions, 1039 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:05:07,788 INFO L231 Difference]: Finished difference. Result has 67 places, 93 transitions, 533 flow [2023-08-26 18:05:07,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=533, PETRI_PLACES=67, PETRI_TRANSITIONS=93} [2023-08-26 18:05:07,788 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 8 predicate places. [2023-08-26 18:05:07,788 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 93 transitions, 533 flow [2023-08-26 18:05:07,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:07,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:07,789 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:05:07,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 18:05:07,789 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:05:07,790 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:07,790 INFO L85 PathProgramCache]: Analyzing trace with hash -359150438, now seen corresponding path program 1 times [2023-08-26 18:05:07,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:07,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966026209] [2023-08-26 18:05:07,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:07,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:07,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 18:05:07,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:07,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966026209] [2023-08-26 18:05:07,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966026209] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:07,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:07,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:05:07,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050903411] [2023-08-26 18:05:07,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:07,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:05:07,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:07,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:05:07,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:05:07,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 192 [2023-08-26 18:05:07,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 93 transitions, 533 flow. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:07,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:07,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 192 [2023-08-26 18:05:07,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:08,210 INFO L124 PetriNetUnfolderBase]: 3528/6879 cut-off events. [2023-08-26 18:05:08,211 INFO L125 PetriNetUnfolderBase]: For 9091/9585 co-relation queries the response was YES. [2023-08-26 18:05:08,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20855 conditions, 6879 events. 3528/6879 cut-off events. For 9091/9585 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 55937 event pairs, 666 based on Foata normal form. 295/5501 useless extension candidates. Maximal degree in co-relation 16552. Up to 3210 conditions per place. [2023-08-26 18:05:08,235 INFO L140 encePairwiseOnDemand]: 182/192 looper letters, 102 selfloop transitions, 26 changer transitions 2/148 dead transitions. [2023-08-26 18:05:08,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 148 transitions, 1112 flow [2023-08-26 18:05:08,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:05:08,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:05:08,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2023-08-26 18:05:08,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2023-08-26 18:05:08,236 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 270 transitions. [2023-08-26 18:05:08,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 270 transitions. [2023-08-26 18:05:08,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:08,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 270 transitions. [2023-08-26 18:05:08,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:08,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:08,238 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:08,238 INFO L175 Difference]: Start difference. First operand has 67 places, 93 transitions, 533 flow. Second operand 3 states and 270 transitions. [2023-08-26 18:05:08,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 148 transitions, 1112 flow [2023-08-26 18:05:08,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 148 transitions, 1093 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:05:08,243 INFO L231 Difference]: Finished difference. Result has 70 places, 111 transitions, 795 flow [2023-08-26 18:05:08,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=795, PETRI_PLACES=70, PETRI_TRANSITIONS=111} [2023-08-26 18:05:08,243 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 11 predicate places. [2023-08-26 18:05:08,244 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 111 transitions, 795 flow [2023-08-26 18:05:08,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:08,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:08,244 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:05:08,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 18:05:08,244 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:05:08,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:08,244 INFO L85 PathProgramCache]: Analyzing trace with hash -359150437, now seen corresponding path program 1 times [2023-08-26 18:05:08,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:08,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764509783] [2023-08-26 18:05:08,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:08,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:08,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 18:05:08,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:08,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764509783] [2023-08-26 18:05:08,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764509783] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:08,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:08,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:05:08,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918942562] [2023-08-26 18:05:08,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:08,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:05:08,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:08,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:05:08,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:05:08,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 192 [2023-08-26 18:05:08,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 111 transitions, 795 flow. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:08,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:08,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 192 [2023-08-26 18:05:08,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:08,695 INFO L124 PetriNetUnfolderBase]: 2922/5858 cut-off events. [2023-08-26 18:05:08,695 INFO L125 PetriNetUnfolderBase]: For 11698/12134 co-relation queries the response was YES. [2023-08-26 18:05:08,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20288 conditions, 5858 events. 2922/5858 cut-off events. For 11698/12134 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 47091 event pairs, 760 based on Foata normal form. 575/5411 useless extension candidates. Maximal degree in co-relation 16146. Up to 3088 conditions per place. [2023-08-26 18:05:08,721 INFO L140 encePairwiseOnDemand]: 188/192 looper letters, 109 selfloop transitions, 14 changer transitions 3/146 dead transitions. [2023-08-26 18:05:08,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 146 transitions, 1266 flow [2023-08-26 18:05:08,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:05:08,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:05:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2023-08-26 18:05:08,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4635416666666667 [2023-08-26 18:05:08,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 267 transitions. [2023-08-26 18:05:08,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 267 transitions. [2023-08-26 18:05:08,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:08,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 267 transitions. [2023-08-26 18:05:08,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:08,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:08,724 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:08,724 INFO L175 Difference]: Start difference. First operand has 70 places, 111 transitions, 795 flow. Second operand 3 states and 267 transitions. [2023-08-26 18:05:08,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 146 transitions, 1266 flow [2023-08-26 18:05:08,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 146 transitions, 1214 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:05:08,731 INFO L231 Difference]: Finished difference. Result has 68 places, 107 transitions, 750 flow [2023-08-26 18:05:08,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=68, PETRI_TRANSITIONS=107} [2023-08-26 18:05:08,732 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 9 predicate places. [2023-08-26 18:05:08,732 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 107 transitions, 750 flow [2023-08-26 18:05:08,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:08,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:08,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:05:08,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-26 18:05:08,733 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:05:08,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:08,733 INFO L85 PathProgramCache]: Analyzing trace with hash -510630397, now seen corresponding path program 1 times [2023-08-26 18:05:08,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:08,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847920460] [2023-08-26 18:05:08,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:08,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:05:08,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:08,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847920460] [2023-08-26 18:05:08,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847920460] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:08,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:08,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:05:08,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858147156] [2023-08-26 18:05:08,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:08,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:05:08,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:08,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:05:08,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:05:08,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 192 [2023-08-26 18:05:08,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 107 transitions, 750 flow. Second operand has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:08,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:08,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 192 [2023-08-26 18:05:08,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:09,196 INFO L124 PetriNetUnfolderBase]: 2950/5900 cut-off events. [2023-08-26 18:05:09,196 INFO L125 PetriNetUnfolderBase]: For 10118/10532 co-relation queries the response was YES. [2023-08-26 18:05:09,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20025 conditions, 5900 events. 2950/5900 cut-off events. For 10118/10532 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 47478 event pairs, 747 based on Foata normal form. 263/4939 useless extension candidates. Maximal degree in co-relation 18439. Up to 2743 conditions per place. [2023-08-26 18:05:09,217 INFO L140 encePairwiseOnDemand]: 183/192 looper letters, 122 selfloop transitions, 26 changer transitions 8/174 dead transitions. [2023-08-26 18:05:09,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 174 transitions, 1417 flow [2023-08-26 18:05:09,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:05:09,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:05:09,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 344 transitions. [2023-08-26 18:05:09,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2023-08-26 18:05:09,219 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 344 transitions. [2023-08-26 18:05:09,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 344 transitions. [2023-08-26 18:05:09,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:09,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 344 transitions. [2023-08-26 18:05:09,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:09,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:09,221 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:09,221 INFO L175 Difference]: Start difference. First operand has 68 places, 107 transitions, 750 flow. Second operand 4 states and 344 transitions. [2023-08-26 18:05:09,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 174 transitions, 1417 flow [2023-08-26 18:05:09,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 174 transitions, 1365 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:05:09,228 INFO L231 Difference]: Finished difference. Result has 70 places, 115 transitions, 887 flow [2023-08-26 18:05:09,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=887, PETRI_PLACES=70, PETRI_TRANSITIONS=115} [2023-08-26 18:05:09,228 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 11 predicate places. [2023-08-26 18:05:09,229 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 115 transitions, 887 flow [2023-08-26 18:05:09,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:09,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:09,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:05:09,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-26 18:05:09,229 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:05:09,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:09,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1176301037, now seen corresponding path program 1 times [2023-08-26 18:05:09,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:09,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323278429] [2023-08-26 18:05:09,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:09,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:09,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 18:05:09,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:09,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323278429] [2023-08-26 18:05:09,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323278429] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:09,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:09,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:05:09,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983030080] [2023-08-26 18:05:09,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:09,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:05:09,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:09,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:05:09,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:05:09,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 192 [2023-08-26 18:05:09,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 115 transitions, 887 flow. Second operand has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:09,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:09,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 192 [2023-08-26 18:05:09,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:09,791 INFO L124 PetriNetUnfolderBase]: 2889/5842 cut-off events. [2023-08-26 18:05:09,791 INFO L125 PetriNetUnfolderBase]: For 13952/14307 co-relation queries the response was YES. [2023-08-26 18:05:09,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20017 conditions, 5842 events. 2889/5842 cut-off events. For 13952/14307 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 47382 event pairs, 529 based on Foata normal form. 279/5094 useless extension candidates. Maximal degree in co-relation 18415. Up to 1520 conditions per place. [2023-08-26 18:05:09,813 INFO L140 encePairwiseOnDemand]: 176/192 looper letters, 134 selfloop transitions, 71 changer transitions 4/227 dead transitions. [2023-08-26 18:05:09,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 227 transitions, 1894 flow [2023-08-26 18:05:09,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:05:09,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:05:09,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 577 transitions. [2023-08-26 18:05:09,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42931547619047616 [2023-08-26 18:05:09,815 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 577 transitions. [2023-08-26 18:05:09,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 577 transitions. [2023-08-26 18:05:09,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:09,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 577 transitions. [2023-08-26 18:05:09,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 82.42857142857143) internal successors, (577), 7 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:09,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:09,818 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:09,818 INFO L175 Difference]: Start difference. First operand has 70 places, 115 transitions, 887 flow. Second operand 7 states and 577 transitions. [2023-08-26 18:05:09,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 227 transitions, 1894 flow [2023-08-26 18:05:09,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 227 transitions, 1894 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:05:09,827 INFO L231 Difference]: Finished difference. Result has 78 places, 148 transitions, 1381 flow [2023-08-26 18:05:09,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1381, PETRI_PLACES=78, PETRI_TRANSITIONS=148} [2023-08-26 18:05:09,827 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 19 predicate places. [2023-08-26 18:05:09,827 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 148 transitions, 1381 flow [2023-08-26 18:05:09,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:09,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:09,828 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:05:09,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-26 18:05:09,828 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err4ASSERT_VIOLATIONASSERT === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:05:09,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:09,828 INFO L85 PathProgramCache]: Analyzing trace with hash -2114685302, now seen corresponding path program 1 times [2023-08-26 18:05:09,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:09,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245970559] [2023-08-26 18:05:09,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:09,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:09,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 18:05:09,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:09,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245970559] [2023-08-26 18:05:09,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245970559] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:09,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:09,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:05:09,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020464869] [2023-08-26 18:05:09,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:09,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:05:09,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:09,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:05:09,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:05:09,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 192 [2023-08-26 18:05:09,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 148 transitions, 1381 flow. Second operand has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:09,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:09,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 192 [2023-08-26 18:05:09,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:10,337 INFO L124 PetriNetUnfolderBase]: 2860/5834 cut-off events. [2023-08-26 18:05:10,337 INFO L125 PetriNetUnfolderBase]: For 20375/20734 co-relation queries the response was YES. [2023-08-26 18:05:10,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22373 conditions, 5834 events. 2860/5834 cut-off events. For 20375/20734 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 47217 event pairs, 824 based on Foata normal form. 237/5074 useless extension candidates. Maximal degree in co-relation 17785. Up to 4196 conditions per place. [2023-08-26 18:05:10,359 INFO L140 encePairwiseOnDemand]: 183/192 looper letters, 162 selfloop transitions, 15 changer transitions 0/198 dead transitions. [2023-08-26 18:05:10,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 198 transitions, 2077 flow [2023-08-26 18:05:10,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:05:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:05:10,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2023-08-26 18:05:10,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46041666666666664 [2023-08-26 18:05:10,360 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 442 transitions. [2023-08-26 18:05:10,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 442 transitions. [2023-08-26 18:05:10,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:10,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 442 transitions. [2023-08-26 18:05:10,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:10,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:10,362 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:10,362 INFO L175 Difference]: Start difference. First operand has 78 places, 148 transitions, 1381 flow. Second operand 5 states and 442 transitions. [2023-08-26 18:05:10,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 198 transitions, 2077 flow [2023-08-26 18:05:10,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 198 transitions, 2039 flow, removed 19 selfloop flow, removed 0 redundant places. [2023-08-26 18:05:10,374 INFO L231 Difference]: Finished difference. Result has 84 places, 162 transitions, 1452 flow [2023-08-26 18:05:10,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=1343, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1452, PETRI_PLACES=84, PETRI_TRANSITIONS=162} [2023-08-26 18:05:10,375 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 25 predicate places. [2023-08-26 18:05:10,375 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 162 transitions, 1452 flow [2023-08-26 18:05:10,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:10,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:10,375 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:05:10,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-26 18:05:10,375 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:05:10,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:10,375 INFO L85 PathProgramCache]: Analyzing trace with hash 485195371, now seen corresponding path program 1 times [2023-08-26 18:05:10,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:10,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425579986] [2023-08-26 18:05:10,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:10,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:10,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:05:10,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:10,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425579986] [2023-08-26 18:05:10,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425579986] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:10,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:10,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:05:10,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872310261] [2023-08-26 18:05:10,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:10,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:05:10,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:10,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:05:10,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:05:10,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 192 [2023-08-26 18:05:10,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 162 transitions, 1452 flow. Second operand has 7 states, 7 states have (on average 61.57142857142857) internal successors, (431), 7 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:10,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:10,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 192 [2023-08-26 18:05:10,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:11,074 INFO L124 PetriNetUnfolderBase]: 3096/6262 cut-off events. [2023-08-26 18:05:11,075 INFO L125 PetriNetUnfolderBase]: For 21379/21921 co-relation queries the response was YES. [2023-08-26 18:05:11,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25163 conditions, 6262 events. 3096/6262 cut-off events. For 21379/21921 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 51232 event pairs, 523 based on Foata normal form. 316/5665 useless extension candidates. Maximal degree in co-relation 23233. Up to 1304 conditions per place. [2023-08-26 18:05:11,097 INFO L140 encePairwiseOnDemand]: 178/192 looper letters, 204 selfloop transitions, 77 changer transitions 17/316 dead transitions. [2023-08-26 18:05:11,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 316 transitions, 2926 flow [2023-08-26 18:05:11,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:05:11,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:05:11,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 707 transitions. [2023-08-26 18:05:11,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40914351851851855 [2023-08-26 18:05:11,099 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 707 transitions. [2023-08-26 18:05:11,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 707 transitions. [2023-08-26 18:05:11,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:11,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 707 transitions. [2023-08-26 18:05:11,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 78.55555555555556) internal successors, (707), 9 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:11,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 192.0) internal successors, (1920), 10 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:11,102 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 192.0) internal successors, (1920), 10 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:11,102 INFO L175 Difference]: Start difference. First operand has 84 places, 162 transitions, 1452 flow. Second operand 9 states and 707 transitions. [2023-08-26 18:05:11,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 316 transitions, 2926 flow [2023-08-26 18:05:11,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 316 transitions, 2924 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-26 18:05:11,119 INFO L231 Difference]: Finished difference. Result has 96 places, 180 transitions, 1930 flow [2023-08-26 18:05:11,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1930, PETRI_PLACES=96, PETRI_TRANSITIONS=180} [2023-08-26 18:05:11,120 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 37 predicate places. [2023-08-26 18:05:11,120 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 180 transitions, 1930 flow [2023-08-26 18:05:11,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 61.57142857142857) internal successors, (431), 7 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:11,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:11,120 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:05:11,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-26 18:05:11,120 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:05:11,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:11,120 INFO L85 PathProgramCache]: Analyzing trace with hash -2104667691, now seen corresponding path program 2 times [2023-08-26 18:05:11,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:11,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784582443] [2023-08-26 18:05:11,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:11,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:05:11,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:11,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784582443] [2023-08-26 18:05:11,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784582443] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:11,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:11,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:05:11,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749973816] [2023-08-26 18:05:11,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:11,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:05:11,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:11,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:05:11,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:05:11,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 192 [2023-08-26 18:05:11,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 180 transitions, 1930 flow. Second operand has 6 states, 6 states have (on average 61.833333333333336) internal successors, (371), 6 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:11,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:11,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 192 [2023-08-26 18:05:11,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:11,828 INFO L124 PetriNetUnfolderBase]: 3093/6267 cut-off events. [2023-08-26 18:05:11,828 INFO L125 PetriNetUnfolderBase]: For 32944/33432 co-relation queries the response was YES. [2023-08-26 18:05:11,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27352 conditions, 6267 events. 3093/6267 cut-off events. For 32944/33432 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 51257 event pairs, 471 based on Foata normal form. 313/5686 useless extension candidates. Maximal degree in co-relation 25277. Up to 1400 conditions per place. [2023-08-26 18:05:11,851 INFO L140 encePairwiseOnDemand]: 178/192 looper letters, 210 selfloop transitions, 97 changer transitions 10/335 dead transitions. [2023-08-26 18:05:11,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 335 transitions, 3501 flow [2023-08-26 18:05:11,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:05:11,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:05:11,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 712 transitions. [2023-08-26 18:05:11,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41203703703703703 [2023-08-26 18:05:11,854 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 712 transitions. [2023-08-26 18:05:11,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 712 transitions. [2023-08-26 18:05:11,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:11,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 712 transitions. [2023-08-26 18:05:11,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 79.11111111111111) internal successors, (712), 9 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:05:11,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 192.0) internal successors, (1920), 10 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:11,856 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 192.0) internal successors, (1920), 10 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:11,856 INFO L175 Difference]: Start difference. First operand has 96 places, 180 transitions, 1930 flow. Second operand 9 states and 712 transitions. [2023-08-26 18:05:11,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 335 transitions, 3501 flow [2023-08-26 18:05:11,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 335 transitions, 3370 flow, removed 49 selfloop flow, removed 2 redundant places. [2023-08-26 18:05:11,912 INFO L231 Difference]: Finished difference. Result has 104 places, 198 transitions, 2394 flow [2023-08-26 18:05:11,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=1809, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2394, PETRI_PLACES=104, PETRI_TRANSITIONS=198} [2023-08-26 18:05:11,912 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 45 predicate places. [2023-08-26 18:05:11,912 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 198 transitions, 2394 flow [2023-08-26 18:05:11,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 61.833333333333336) internal successors, (371), 6 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:11,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:11,913 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:05:11,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-26 18:05:11,913 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err4ASSERT_VIOLATIONASSERT === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:05:11,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:11,913 INFO L85 PathProgramCache]: Analyzing trace with hash -731544050, now seen corresponding path program 2 times [2023-08-26 18:05:11,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:11,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259929983] [2023-08-26 18:05:11,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:11,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 18:05:12,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:12,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259929983] [2023-08-26 18:05:12,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259929983] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:12,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:12,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:05:12,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277969949] [2023-08-26 18:05:12,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:12,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:05:12,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:12,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:05:12,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:05:12,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 192 [2023-08-26 18:05:12,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 198 transitions, 2394 flow. Second operand has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:12,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:12,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 192 [2023-08-26 18:05:12,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:12,613 INFO L124 PetriNetUnfolderBase]: 2878/5868 cut-off events. [2023-08-26 18:05:12,614 INFO L125 PetriNetUnfolderBase]: For 42116/42606 co-relation queries the response was YES. [2023-08-26 18:05:12,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26958 conditions, 5868 events. 2878/5868 cut-off events. For 42116/42606 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 47777 event pairs, 830 based on Foata normal form. 279/5264 useless extension candidates. Maximal degree in co-relation 21729. Up to 4229 conditions per place. [2023-08-26 18:05:12,641 INFO L140 encePairwiseOnDemand]: 184/192 looper letters, 203 selfloop transitions, 14 changer transitions 0/238 dead transitions. [2023-08-26 18:05:12,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 238 transitions, 3224 flow [2023-08-26 18:05:12,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:05:12,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:05:12,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 436 transitions. [2023-08-26 18:05:12,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45416666666666666 [2023-08-26 18:05:12,643 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 436 transitions. [2023-08-26 18:05:12,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 436 transitions. [2023-08-26 18:05:12,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:12,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 436 transitions. [2023-08-26 18:05:12,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:12,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:12,645 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:12,645 INFO L175 Difference]: Start difference. First operand has 104 places, 198 transitions, 2394 flow. Second operand 5 states and 436 transitions. [2023-08-26 18:05:12,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 238 transitions, 3224 flow [2023-08-26 18:05:12,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 238 transitions, 3137 flow, removed 24 selfloop flow, removed 2 redundant places. [2023-08-26 18:05:12,749 INFO L231 Difference]: Finished difference. Result has 107 places, 202 transitions, 2383 flow [2023-08-26 18:05:12,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=2320, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2383, PETRI_PLACES=107, PETRI_TRANSITIONS=202} [2023-08-26 18:05:12,750 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 48 predicate places. [2023-08-26 18:05:12,750 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 202 transitions, 2383 flow [2023-08-26 18:05:12,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:12,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:12,750 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:05:12,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-26 18:05:12,750 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:05:12,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:12,750 INFO L85 PathProgramCache]: Analyzing trace with hash 678522307, now seen corresponding path program 1 times [2023-08-26 18:05:12,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:12,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383326646] [2023-08-26 18:05:12,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:12,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:12,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 18:05:12,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:12,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383326646] [2023-08-26 18:05:12,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383326646] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:12,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:12,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:05:12,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420394476] [2023-08-26 18:05:12,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:12,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:05:12,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:12,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:05:12,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:05:12,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 192 [2023-08-26 18:05:12,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 202 transitions, 2383 flow. Second operand has 5 states, 5 states have (on average 66.2) internal successors, (331), 5 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:12,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:12,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 192 [2023-08-26 18:05:12,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:13,484 INFO L124 PetriNetUnfolderBase]: 3036/6133 cut-off events. [2023-08-26 18:05:13,484 INFO L125 PetriNetUnfolderBase]: For 41552/42133 co-relation queries the response was YES. [2023-08-26 18:05:13,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28801 conditions, 6133 events. 3036/6133 cut-off events. For 41552/42133 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 49897 event pairs, 413 based on Foata normal form. 358/5750 useless extension candidates. Maximal degree in co-relation 26817. Up to 1392 conditions per place. [2023-08-26 18:05:13,517 INFO L140 encePairwiseOnDemand]: 176/192 looper letters, 184 selfloop transitions, 123 changer transitions 7/332 dead transitions. [2023-08-26 18:05:13,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 332 transitions, 4132 flow [2023-08-26 18:05:13,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:05:13,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:05:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 518 transitions. [2023-08-26 18:05:13,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4496527777777778 [2023-08-26 18:05:13,518 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 518 transitions. [2023-08-26 18:05:13,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 518 transitions. [2023-08-26 18:05:13,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:13,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 518 transitions. [2023-08-26 18:05:13,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 86.33333333333333) internal successors, (518), 6 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:13,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:13,520 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:13,520 INFO L175 Difference]: Start difference. First operand has 107 places, 202 transitions, 2383 flow. Second operand 6 states and 518 transitions. [2023-08-26 18:05:13,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 332 transitions, 4132 flow [2023-08-26 18:05:13,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 332 transitions, 4035 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-08-26 18:05:13,631 INFO L231 Difference]: Finished difference. Result has 111 places, 239 transitions, 3297 flow [2023-08-26 18:05:13,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=2317, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3297, PETRI_PLACES=111, PETRI_TRANSITIONS=239} [2023-08-26 18:05:13,631 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 52 predicate places. [2023-08-26 18:05:13,631 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 239 transitions, 3297 flow [2023-08-26 18:05:13,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.2) internal successors, (331), 5 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:13,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:13,632 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:05:13,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-26 18:05:13,632 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:05:13,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:13,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1960356484, now seen corresponding path program 1 times [2023-08-26 18:05:13,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:13,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142306402] [2023-08-26 18:05:13,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:13,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:13,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:05:13,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:13,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142306402] [2023-08-26 18:05:13,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142306402] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:13,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:13,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:05:13,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575568687] [2023-08-26 18:05:13,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:13,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:05:13,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:13,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:05:13,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:05:13,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 192 [2023-08-26 18:05:13,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 239 transitions, 3297 flow. Second operand has 4 states, 4 states have (on average 65.5) internal successors, (262), 4 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:13,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:13,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 192 [2023-08-26 18:05:13,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:14,273 INFO L124 PetriNetUnfolderBase]: 3021/6108 cut-off events. [2023-08-26 18:05:14,273 INFO L125 PetriNetUnfolderBase]: For 56428/57059 co-relation queries the response was YES. [2023-08-26 18:05:14,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31192 conditions, 6108 events. 3021/6108 cut-off events. For 56428/57059 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 49521 event pairs, 566 based on Foata normal form. 337/5724 useless extension candidates. Maximal degree in co-relation 25875. Up to 2894 conditions per place. [2023-08-26 18:05:14,304 INFO L140 encePairwiseOnDemand]: 185/192 looper letters, 238 selfloop transitions, 31 changer transitions 17/304 dead transitions. [2023-08-26 18:05:14,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 304 transitions, 4391 flow [2023-08-26 18:05:14,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:05:14,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:05:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 340 transitions. [2023-08-26 18:05:14,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4427083333333333 [2023-08-26 18:05:14,306 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 340 transitions. [2023-08-26 18:05:14,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 340 transitions. [2023-08-26 18:05:14,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:14,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 340 transitions. [2023-08-26 18:05:14,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:14,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:14,307 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:14,307 INFO L175 Difference]: Start difference. First operand has 111 places, 239 transitions, 3297 flow. Second operand 4 states and 340 transitions. [2023-08-26 18:05:14,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 304 transitions, 4391 flow [2023-08-26 18:05:14,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 304 transitions, 4377 flow, removed 7 selfloop flow, removed 0 redundant places. [2023-08-26 18:05:14,436 INFO L231 Difference]: Finished difference. Result has 115 places, 240 transitions, 3424 flow [2023-08-26 18:05:14,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=3258, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3424, PETRI_PLACES=115, PETRI_TRANSITIONS=240} [2023-08-26 18:05:14,437 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 56 predicate places. [2023-08-26 18:05:14,437 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 240 transitions, 3424 flow [2023-08-26 18:05:14,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 4 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:14,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:14,437 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:05:14,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-26 18:05:14,437 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err4ASSERT_VIOLATIONASSERT === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:05:14,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:14,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1004857002, now seen corresponding path program 1 times [2023-08-26 18:05:14,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:14,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212066115] [2023-08-26 18:05:14,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:14,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:14,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 18:05:14,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:14,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212066115] [2023-08-26 18:05:14,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212066115] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:05:14,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150154820] [2023-08-26 18:05:14,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:14,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:05:14,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:05:14,533 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:05:14,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 18:05:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:14,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-26 18:05:14,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:05:14,718 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-26 18:05:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 18:05:14,736 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:05:14,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 18:05:14,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150154820] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:05:14,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:05:14,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 6] total 11 [2023-08-26 18:05:14,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296497998] [2023-08-26 18:05:14,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:05:14,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 18:05:14,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:14,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 18:05:14,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-08-26 18:05:14,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 192 [2023-08-26 18:05:14,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 240 transitions, 3424 flow. Second operand has 12 states, 12 states have (on average 63.75) internal successors, (765), 12 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:05:14,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:14,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 192 [2023-08-26 18:05:14,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:17,919 INFO L124 PetriNetUnfolderBase]: 11516/19851 cut-off events. [2023-08-26 18:05:17,919 INFO L125 PetriNetUnfolderBase]: For 257571/257613 co-relation queries the response was YES. [2023-08-26 18:05:17,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110341 conditions, 19851 events. 11516/19851 cut-off events. For 257571/257613 co-relation queries the response was YES. Maximal size of possible extension queue 1046. Compared 159005 event pairs, 916 based on Foata normal form. 491/19115 useless extension candidates. Maximal degree in co-relation 98246. Up to 4890 conditions per place. [2023-08-26 18:05:18,030 INFO L140 encePairwiseOnDemand]: 172/192 looper letters, 1040 selfloop transitions, 247 changer transitions 240/1533 dead transitions. [2023-08-26 18:05:18,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 1533 transitions, 24685 flow [2023-08-26 18:05:18,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-26 18:05:18,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-26 18:05:18,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2211 transitions. [2023-08-26 18:05:18,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41127232142857145 [2023-08-26 18:05:18,032 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 2211 transitions. [2023-08-26 18:05:18,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 2211 transitions. [2023-08-26 18:05:18,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:18,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 2211 transitions. [2023-08-26 18:05:18,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 78.96428571428571) internal successors, (2211), 28 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:18,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 192.0) internal successors, (5568), 29 states have internal predecessors, (5568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:18,039 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 192.0) internal successors, (5568), 29 states have internal predecessors, (5568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:18,039 INFO L175 Difference]: Start difference. First operand has 115 places, 240 transitions, 3424 flow. Second operand 28 states and 2211 transitions. [2023-08-26 18:05:18,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 1533 transitions, 24685 flow [2023-08-26 18:05:19,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 1533 transitions, 24685 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:05:19,248 INFO L231 Difference]: Finished difference. Result has 165 places, 461 transitions, 6404 flow [2023-08-26 18:05:19,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=3424, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=6404, PETRI_PLACES=165, PETRI_TRANSITIONS=461} [2023-08-26 18:05:19,249 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 106 predicate places. [2023-08-26 18:05:19,249 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 461 transitions, 6404 flow [2023-08-26 18:05:19,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 63.75) internal successors, (765), 12 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:05:19,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:19,249 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:05:19,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 18:05:19,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-08-26 18:05:19,451 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:05:19,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:19,452 INFO L85 PathProgramCache]: Analyzing trace with hash 703821077, now seen corresponding path program 1 times [2023-08-26 18:05:19,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:19,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300647746] [2023-08-26 18:05:19,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:19,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:19,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:05:19,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:19,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300647746] [2023-08-26 18:05:19,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300647746] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:19,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:19,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:05:19,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854846977] [2023-08-26 18:05:19,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:19,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:05:19,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:19,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:05:19,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:05:19,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 192 [2023-08-26 18:05:19,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 461 transitions, 6404 flow. Second operand has 5 states, 5 states have (on average 65.2) internal successors, (326), 5 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:19,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:19,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 192 [2023-08-26 18:05:19,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:21,870 INFO L124 PetriNetUnfolderBase]: 7326/14438 cut-off events. [2023-08-26 18:05:21,870 INFO L125 PetriNetUnfolderBase]: For 222138/224305 co-relation queries the response was YES. [2023-08-26 18:05:21,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99187 conditions, 14438 events. 7326/14438 cut-off events. For 222138/224305 co-relation queries the response was YES. Maximal size of possible extension queue 1061. Compared 131895 event pairs, 755 based on Foata normal form. 758/14322 useless extension candidates. Maximal degree in co-relation 86319. Up to 3945 conditions per place. [2023-08-26 18:05:21,974 INFO L140 encePairwiseOnDemand]: 176/192 looper letters, 457 selfloop transitions, 176 changer transitions 19/718 dead transitions. [2023-08-26 18:05:21,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 718 transitions, 10449 flow [2023-08-26 18:05:21,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:05:21,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:05:21,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 499 transitions. [2023-08-26 18:05:21,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4331597222222222 [2023-08-26 18:05:21,976 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 499 transitions. [2023-08-26 18:05:21,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 499 transitions. [2023-08-26 18:05:21,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:21,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 499 transitions. [2023-08-26 18:05:21,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 83.16666666666667) internal successors, (499), 6 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:21,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:21,977 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:21,977 INFO L175 Difference]: Start difference. First operand has 165 places, 461 transitions, 6404 flow. Second operand 6 states and 499 transitions. [2023-08-26 18:05:21,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 718 transitions, 10449 flow [2023-08-26 18:05:23,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 718 transitions, 9972 flow, removed 177 selfloop flow, removed 6 redundant places. [2023-08-26 18:05:23,186 INFO L231 Difference]: Finished difference. Result has 165 places, 525 transitions, 7808 flow [2023-08-26 18:05:23,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=6169, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7808, PETRI_PLACES=165, PETRI_TRANSITIONS=525} [2023-08-26 18:05:23,186 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 106 predicate places. [2023-08-26 18:05:23,186 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 525 transitions, 7808 flow [2023-08-26 18:05:23,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.2) internal successors, (326), 5 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:23,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:23,186 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:05:23,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-08-26 18:05:23,187 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:05:23,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:23,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1962840487, now seen corresponding path program 1 times [2023-08-26 18:05:23,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:23,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665546697] [2023-08-26 18:05:23,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:23,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:23,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 18:05:23,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:23,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665546697] [2023-08-26 18:05:23,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665546697] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:05:23,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758440160] [2023-08-26 18:05:23,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:23,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:05:23,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:05:23,293 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:05:23,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 18:05:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:23,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-26 18:05:23,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:05:23,373 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 18:05:23,413 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 18:05:23,413 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 18:05:23,417 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-26 18:05:23,456 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 18:05:23,456 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-08-26 18:05:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:05:23,480 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:05:23,619 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-08-26 18:05:23,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:05:23,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758440160] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:05:23,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:05:23,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2023-08-26 18:05:23,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145071989] [2023-08-26 18:05:23,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:05:23,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 18:05:23,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:23,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 18:05:23,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-08-26 18:05:23,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 192 [2023-08-26 18:05:23,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 525 transitions, 7808 flow. Second operand has 12 states, 12 states have (on average 63.666666666666664) internal successors, (764), 12 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:23,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:23,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 192 [2023-08-26 18:05:23,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:26,164 INFO L124 PetriNetUnfolderBase]: 7487/14831 cut-off events. [2023-08-26 18:05:26,164 INFO L125 PetriNetUnfolderBase]: For 259709/262070 co-relation queries the response was YES. [2023-08-26 18:05:26,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105281 conditions, 14831 events. 7487/14831 cut-off events. For 259709/262070 co-relation queries the response was YES. Maximal size of possible extension queue 1107. Compared 136905 event pairs, 844 based on Foata normal form. 654/14587 useless extension candidates. Maximal degree in co-relation 100958. Up to 3306 conditions per place. [2023-08-26 18:05:26,257 INFO L140 encePairwiseOnDemand]: 185/192 looper letters, 608 selfloop transitions, 79 changer transitions 40/793 dead transitions. [2023-08-26 18:05:26,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 793 transitions, 12234 flow [2023-08-26 18:05:26,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:05:26,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:05:26,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 488 transitions. [2023-08-26 18:05:26,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2023-08-26 18:05:26,258 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 488 transitions. [2023-08-26 18:05:26,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 488 transitions. [2023-08-26 18:05:26,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:26,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 488 transitions. [2023-08-26 18:05:26,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 81.33333333333333) internal successors, (488), 6 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:26,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:26,260 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:26,260 INFO L175 Difference]: Start difference. First operand has 165 places, 525 transitions, 7808 flow. Second operand 6 states and 488 transitions. [2023-08-26 18:05:26,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 793 transitions, 12234 flow [2023-08-26 18:05:27,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 793 transitions, 12166 flow, removed 27 selfloop flow, removed 1 redundant places. [2023-08-26 18:05:27,425 INFO L231 Difference]: Finished difference. Result has 169 places, 533 transitions, 8124 flow [2023-08-26 18:05:27,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=7742, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8124, PETRI_PLACES=169, PETRI_TRANSITIONS=533} [2023-08-26 18:05:27,426 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 110 predicate places. [2023-08-26 18:05:27,426 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 533 transitions, 8124 flow [2023-08-26 18:05:27,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 63.666666666666664) internal successors, (764), 12 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:27,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:27,426 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:05:27,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-26 18:05:27,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-08-26 18:05:27,630 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:05:27,630 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:27,630 INFO L85 PathProgramCache]: Analyzing trace with hash 673124157, now seen corresponding path program 1 times [2023-08-26 18:05:27,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:27,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413761067] [2023-08-26 18:05:27,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:27,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-26 18:05:27,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:27,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413761067] [2023-08-26 18:05:27,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413761067] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:27,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:27,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:05:27,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210882940] [2023-08-26 18:05:27,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:27,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:05:27,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:27,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:05:27,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:05:27,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 192 [2023-08-26 18:05:27,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 533 transitions, 8124 flow. Second operand has 6 states, 6 states have (on average 62.166666666666664) internal successors, (373), 6 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:27,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:27,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 192 [2023-08-26 18:05:27,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:30,389 INFO L124 PetriNetUnfolderBase]: 7952/15750 cut-off events. [2023-08-26 18:05:30,389 INFO L125 PetriNetUnfolderBase]: For 300017/302789 co-relation queries the response was YES. [2023-08-26 18:05:30,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115054 conditions, 15750 events. 7952/15750 cut-off events. For 300017/302789 co-relation queries the response was YES. Maximal size of possible extension queue 1196. Compared 146734 event pairs, 767 based on Foata normal form. 992/15795 useless extension candidates. Maximal degree in co-relation 101504. Up to 3987 conditions per place. [2023-08-26 18:05:30,494 INFO L140 encePairwiseOnDemand]: 179/192 looper letters, 546 selfloop transitions, 227 changer transitions 35/874 dead transitions. [2023-08-26 18:05:30,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 874 transitions, 13509 flow [2023-08-26 18:05:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:05:30,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:05:30,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 632 transitions. [2023-08-26 18:05:30,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4114583333333333 [2023-08-26 18:05:30,495 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 632 transitions. [2023-08-26 18:05:30,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 632 transitions. [2023-08-26 18:05:30,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:30,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 632 transitions. [2023-08-26 18:05:30,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 79.0) internal successors, (632), 8 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:30,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 192.0) internal successors, (1728), 9 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:30,497 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 192.0) internal successors, (1728), 9 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:30,497 INFO L175 Difference]: Start difference. First operand has 169 places, 533 transitions, 8124 flow. Second operand 8 states and 632 transitions. [2023-08-26 18:05:30,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 874 transitions, 13509 flow [2023-08-26 18:05:31,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 874 transitions, 13425 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:05:31,893 INFO L231 Difference]: Finished difference. Result has 177 places, 588 transitions, 9941 flow [2023-08-26 18:05:31,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=8050, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9941, PETRI_PLACES=177, PETRI_TRANSITIONS=588} [2023-08-26 18:05:31,894 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 118 predicate places. [2023-08-26 18:05:31,894 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 588 transitions, 9941 flow [2023-08-26 18:05:31,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.166666666666664) internal successors, (373), 6 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:31,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:31,894 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:05:31,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-08-26 18:05:31,894 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:05:31,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:31,895 INFO L85 PathProgramCache]: Analyzing trace with hash 671999787, now seen corresponding path program 2 times [2023-08-26 18:05:31,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:31,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980300977] [2023-08-26 18:05:31,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:31,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-26 18:05:31,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:31,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980300977] [2023-08-26 18:05:31,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980300977] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:05:31,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:05:31,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:05:31,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217661465] [2023-08-26 18:05:31,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:05:31,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:05:31,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:31,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:05:31,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:05:31,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 192 [2023-08-26 18:05:31,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 588 transitions, 9941 flow. Second operand has 8 states, 8 states have (on average 61.625) internal successors, (493), 8 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:31,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:31,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 192 [2023-08-26 18:05:31,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:34,867 INFO L124 PetriNetUnfolderBase]: 7810/15491 cut-off events. [2023-08-26 18:05:34,868 INFO L125 PetriNetUnfolderBase]: For 352619/355326 co-relation queries the response was YES. [2023-08-26 18:05:34,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118416 conditions, 15491 events. 7810/15491 cut-off events. For 352619/355326 co-relation queries the response was YES. Maximal size of possible extension queue 1182. Compared 144095 event pairs, 744 based on Foata normal form. 1007/15553 useless extension candidates. Maximal degree in co-relation 104741. Up to 3611 conditions per place. [2023-08-26 18:05:34,968 INFO L140 encePairwiseOnDemand]: 179/192 looper letters, 558 selfloop transitions, 188 changer transitions 25/837 dead transitions. [2023-08-26 18:05:34,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 837 transitions, 13950 flow [2023-08-26 18:05:34,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:05:34,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:05:34,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 622 transitions. [2023-08-26 18:05:34,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049479166666667 [2023-08-26 18:05:34,969 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 622 transitions. [2023-08-26 18:05:34,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 622 transitions. [2023-08-26 18:05:34,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:34,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 622 transitions. [2023-08-26 18:05:34,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 77.75) internal successors, (622), 8 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:34,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 192.0) internal successors, (1728), 9 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:34,971 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 192.0) internal successors, (1728), 9 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:34,971 INFO L175 Difference]: Start difference. First operand has 177 places, 588 transitions, 9941 flow. Second operand 8 states and 622 transitions. [2023-08-26 18:05:34,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 837 transitions, 13950 flow [2023-08-26 18:05:36,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 837 transitions, 13816 flow, removed 53 selfloop flow, removed 1 redundant places. [2023-08-26 18:05:36,689 INFO L231 Difference]: Finished difference. Result has 185 places, 594 transitions, 10600 flow [2023-08-26 18:05:36,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=9809, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10600, PETRI_PLACES=185, PETRI_TRANSITIONS=594} [2023-08-26 18:05:36,689 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 126 predicate places. [2023-08-26 18:05:36,689 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 594 transitions, 10600 flow [2023-08-26 18:05:36,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 61.625) internal successors, (493), 8 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:36,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:36,690 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:05:36,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-08-26 18:05:36,690 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thr1Err4ASSERT_VIOLATIONASSERT === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:05:36,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:36,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1694723634, now seen corresponding path program 2 times [2023-08-26 18:05:36,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:36,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315601048] [2023-08-26 18:05:36,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:36,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:36,892 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 18:05:36,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:36,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315601048] [2023-08-26 18:05:36,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315601048] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:05:36,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318785693] [2023-08-26 18:05:36,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 18:05:36,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:05:36,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:05:36,893 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:05:36,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 18:05:36,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 18:05:36,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 18:05:36,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-26 18:05:36,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:05:36,977 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 18:05:37,004 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 18:05:37,004 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-08-26 18:05:37,050 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 18:05:37,050 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 18:05:37,073 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-26 18:05:37,109 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-08-26 18:05:37,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 18:05:37,128 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:05:37,203 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:05:37,203 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-26 18:05:37,205 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2023-08-26 18:05:37,211 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-26 18:05:37,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 18:05:37,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318785693] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:05:37,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:05:37,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 20 [2023-08-26 18:05:37,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261212303] [2023-08-26 18:05:37,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:05:37,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-26 18:05:37,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:37,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-26 18:05:37,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=350, Unknown=1, NotChecked=0, Total=420 [2023-08-26 18:05:37,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 192 [2023-08-26 18:05:37,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 594 transitions, 10600 flow. Second operand has 21 states, 21 states have (on average 45.857142857142854) internal successors, (963), 21 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:37,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:37,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 192 [2023-08-26 18:05:37,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:05:45,671 INFO L124 PetriNetUnfolderBase]: 12504/21830 cut-off events. [2023-08-26 18:05:45,672 INFO L125 PetriNetUnfolderBase]: For 700968/701043 co-relation queries the response was YES. [2023-08-26 18:05:45,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182245 conditions, 21830 events. 12504/21830 cut-off events. For 700968/701043 co-relation queries the response was YES. Maximal size of possible extension queue 1219. Compared 179193 event pairs, 1143 based on Foata normal form. 26/21068 useless extension candidates. Maximal degree in co-relation 175821. Up to 10865 conditions per place. [2023-08-26 18:05:45,825 INFO L140 encePairwiseOnDemand]: 168/192 looper letters, 847 selfloop transitions, 453 changer transitions 133/1436 dead transitions. [2023-08-26 18:05:45,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 1436 transitions, 28336 flow [2023-08-26 18:05:45,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-08-26 18:05:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-08-26 18:05:45,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 2638 transitions. [2023-08-26 18:05:45,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29868659420289856 [2023-08-26 18:05:45,828 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 2638 transitions. [2023-08-26 18:05:45,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 2638 transitions. [2023-08-26 18:05:45,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:05:45,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 2638 transitions. [2023-08-26 18:05:45,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 57.34782608695652) internal successors, (2638), 46 states have internal predecessors, (2638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:45,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 192.0) internal successors, (9024), 47 states have internal predecessors, (9024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:45,837 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 192.0) internal successors, (9024), 47 states have internal predecessors, (9024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:45,837 INFO L175 Difference]: Start difference. First operand has 185 places, 594 transitions, 10600 flow. Second operand 46 states and 2638 transitions. [2023-08-26 18:05:45,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 1436 transitions, 28336 flow [2023-08-26 18:05:49,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 1436 transitions, 27956 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-26 18:05:49,942 INFO L231 Difference]: Finished difference. Result has 247 places, 845 transitions, 16607 flow [2023-08-26 18:05:49,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=10483, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=228, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=16607, PETRI_PLACES=247, PETRI_TRANSITIONS=845} [2023-08-26 18:05:49,942 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 188 predicate places. [2023-08-26 18:05:49,943 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 845 transitions, 16607 flow [2023-08-26 18:05:49,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 45.857142857142854) internal successors, (963), 21 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:49,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:05:49,943 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:05:49,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-26 18:05:50,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:05:50,148 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thr1Err4ASSERT_VIOLATIONASSERT === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:05:50,148 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:05:50,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1151089962, now seen corresponding path program 3 times [2023-08-26 18:05:50,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:05:50,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412113468] [2023-08-26 18:05:50,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:05:50,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:05:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:05:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 18:05:50,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:05:50,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412113468] [2023-08-26 18:05:50,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412113468] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:05:50,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19709943] [2023-08-26 18:05:50,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 18:05:50,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:05:50,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:05:50,350 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:05:50,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-26 18:05:50,431 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-26 18:05:50,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 18:05:50,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-26 18:05:50,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:05:50,438 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 18:05:50,468 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-26 18:05:50,468 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-08-26 18:05:50,497 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 18:05:50,497 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 18:05:50,565 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-26 18:05:50,597 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-26 18:05:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 18:05:50,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:05:50,683 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:05:50,683 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-26 18:05:50,685 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2023-08-26 18:05:50,690 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-26 18:05:50,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 18:05:50,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19709943] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:05:50,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:05:50,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2023-08-26 18:05:50,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150736791] [2023-08-26 18:05:50,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:05:50,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-26 18:05:50,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:05:50,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-26 18:05:50,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2023-08-26 18:05:50,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 192 [2023-08-26 18:05:50,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 845 transitions, 16607 flow. Second operand has 21 states, 21 states have (on average 46.0) internal successors, (966), 21 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:05:50,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:05:50,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 192 [2023-08-26 18:05:50,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:06:01,507 INFO L124 PetriNetUnfolderBase]: 17063/29883 cut-off events. [2023-08-26 18:06:01,508 INFO L125 PetriNetUnfolderBase]: For 1141032/1141153 co-relation queries the response was YES. [2023-08-26 18:06:01,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282299 conditions, 29883 events. 17063/29883 cut-off events. For 1141032/1141153 co-relation queries the response was YES. Maximal size of possible extension queue 1537. Compared 257671 event pairs, 887 based on Foata normal form. 45/28936 useless extension candidates. Maximal degree in co-relation 281123. Up to 10289 conditions per place. [2023-08-26 18:06:01,786 INFO L140 encePairwiseOnDemand]: 162/192 looper letters, 1311 selfloop transitions, 1128 changer transitions 277/2719 dead transitions. [2023-08-26 18:06:01,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 2719 transitions, 60361 flow [2023-08-26 18:06:01,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-08-26 18:06:01,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-08-26 18:06:01,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 2824 transitions. [2023-08-26 18:06:01,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3064236111111111 [2023-08-26 18:06:01,789 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 2824 transitions. [2023-08-26 18:06:01,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 2824 transitions. [2023-08-26 18:06:01,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:06:01,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 2824 transitions. [2023-08-26 18:06:01,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 58.833333333333336) internal successors, (2824), 48 states have internal predecessors, (2824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:06:01,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 192.0) internal successors, (9408), 49 states have internal predecessors, (9408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:06:01,798 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 192.0) internal successors, (9408), 49 states have internal predecessors, (9408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:06:01,798 INFO L175 Difference]: Start difference. First operand has 247 places, 845 transitions, 16607 flow. Second operand 48 states and 2824 transitions. [2023-08-26 18:06:01,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 2719 transitions, 60361 flow [2023-08-26 18:06:15,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 2719 transitions, 59514 flow, removed 216 selfloop flow, removed 16 redundant places. [2023-08-26 18:06:15,870 INFO L231 Difference]: Finished difference. Result has 299 places, 1691 transitions, 37398 flow [2023-08-26 18:06:15,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=16223, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=845, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=398, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=37398, PETRI_PLACES=299, PETRI_TRANSITIONS=1691} [2023-08-26 18:06:15,871 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 240 predicate places. [2023-08-26 18:06:15,871 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 1691 transitions, 37398 flow [2023-08-26 18:06:15,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 46.0) internal successors, (966), 21 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:06:15,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:06:15,871 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:06:15,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-26 18:06:16,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-08-26 18:06:16,076 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thr1Err4ASSERT_VIOLATIONASSERT === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:06:16,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:06:16,077 INFO L85 PathProgramCache]: Analyzing trace with hash -875604600, now seen corresponding path program 1 times [2023-08-26 18:06:16,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:06:16,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538213299] [2023-08-26 18:06:16,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:06:16,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:06:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:06:16,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:06:16,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:06:16,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538213299] [2023-08-26 18:06:16,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538213299] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:06:16,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906588533] [2023-08-26 18:06:16,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:06:16,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:06:16,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:06:16,244 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:06:16,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-26 18:06:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:06:16,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-26 18:06:16,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:06:16,334 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 18:06:16,360 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 18:06:16,360 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 18:06:16,431 INFO L322 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-08-26 18:06:16,432 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 28 [2023-08-26 18:06:16,479 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-26 18:06:16,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 18:06:16,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:06:16,562 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int))) (not (= (mod c_~s~0 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_~#l~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of2ForFork0_~#l~0#1.base|) |c_thr1Thread1of2ForFork0_~#l~0#1.offset| c_~t~0)) |c_ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_458) |c_thr1Thread1of2ForFork0_~#l~0#1.base|) |c_thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296)))) is different from false [2023-08-26 18:06:16,579 INFO L322 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-08-26 18:06:16,579 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 50 [2023-08-26 18:06:16,589 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:06:16,589 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 64 [2023-08-26 18:06:16,603 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-26 18:06:16,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 18:06:16,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906588533] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:06:16,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:06:16,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 20 [2023-08-26 18:06:16,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781479845] [2023-08-26 18:06:16,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:06:16,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-26 18:06:16,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:06:16,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-26 18:06:16,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=314, Unknown=3, NotChecked=36, Total=420 [2023-08-26 18:06:16,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 192 [2023-08-26 18:06:16,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 1691 transitions, 37398 flow. Second operand has 21 states, 21 states have (on average 47.95238095238095) internal successors, (1007), 21 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:06:16,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:06:16,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 192 [2023-08-26 18:06:16,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:06:18,091 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_458 (Array Int Int))) (not (= (mod c_~s~0 4294967296) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_458) |c_thr1Thread1of2ForFork0_~#l~0#1.base|) |c_thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296)))) (not (= (mod c_~c~0 4294967296) 1))) is different from false [2023-08-26 18:06:18,668 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_458 (Array Int Int))) (not (= (mod c_~s~0 4294967296) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_458) |c_thr1Thread1of2ForFork0_~#l~0#1.base|) |c_thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296)))) (= (mod c_~c~0 4294967296) 1)) is different from false [2023-08-26 18:06:35,319 INFO L124 PetriNetUnfolderBase]: 23962/40878 cut-off events. [2023-08-26 18:06:35,320 INFO L125 PetriNetUnfolderBase]: For 1957419/1957614 co-relation queries the response was YES. [2023-08-26 18:06:35,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438389 conditions, 40878 events. 23962/40878 cut-off events. For 1957419/1957614 co-relation queries the response was YES. Maximal size of possible extension queue 1807. Compared 354370 event pairs, 1411 based on Foata normal form. 1151/40766 useless extension candidates. Maximal degree in co-relation 433736. Up to 18630 conditions per place. [2023-08-26 18:06:36,027 INFO L140 encePairwiseOnDemand]: 164/192 looper letters, 2205 selfloop transitions, 1654 changer transitions 384/4246 dead transitions. [2023-08-26 18:06:36,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 4246 transitions, 102367 flow [2023-08-26 18:06:36,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-08-26 18:06:36,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-08-26 18:06:36,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 2416 transitions. [2023-08-26 18:06:36,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32264957264957267 [2023-08-26 18:06:36,031 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 2416 transitions. [2023-08-26 18:06:36,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 2416 transitions. [2023-08-26 18:06:36,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:06:36,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 2416 transitions. [2023-08-26 18:06:36,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 61.94871794871795) internal successors, (2416), 39 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:06:36,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 192.0) internal successors, (7680), 40 states have internal predecessors, (7680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:06:36,043 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 192.0) internal successors, (7680), 40 states have internal predecessors, (7680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:06:36,043 INFO L175 Difference]: Start difference. First operand has 299 places, 1691 transitions, 37398 flow. Second operand 39 states and 2416 transitions. [2023-08-26 18:06:36,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 4246 transitions, 102367 flow [2023-08-26 18:07:24,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 4246 transitions, 99679 flow, removed 1239 selfloop flow, removed 12 redundant places. [2023-08-26 18:07:24,118 INFO L231 Difference]: Finished difference. Result has 355 places, 2962 transitions, 69013 flow [2023-08-26 18:07:24,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=36573, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=566, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=848, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=69013, PETRI_PLACES=355, PETRI_TRANSITIONS=2962} [2023-08-26 18:07:24,119 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 296 predicate places. [2023-08-26 18:07:24,119 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 2962 transitions, 69013 flow [2023-08-26 18:07:24,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 47.95238095238095) internal successors, (1007), 21 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:07:24,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:07:24,120 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:07:24,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-26 18:07:24,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-08-26 18:07:24,327 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thr1Err4ASSERT_VIOLATIONASSERT === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:07:24,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:07:24,327 INFO L85 PathProgramCache]: Analyzing trace with hash 135843854, now seen corresponding path program 2 times [2023-08-26 18:07:24,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:07:24,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414946038] [2023-08-26 18:07:24,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:07:24,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:07:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:07:24,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 18:07:24,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:07:24,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414946038] [2023-08-26 18:07:24,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414946038] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:07:24,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499059316] [2023-08-26 18:07:24,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 18:07:24,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:07:24,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:07:24,521 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:07:24,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-26 18:07:24,657 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 18:07:24,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 18:07:24,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-26 18:07:24,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:07:24,663 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 18:07:24,690 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 18:07:24,690 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-08-26 18:07:24,732 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 18:07:24,732 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 18:07:24,753 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-26 18:07:24,791 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-08-26 18:07:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 18:07:24,810 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:07:24,884 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:07:24,885 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-26 18:07:24,886 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2023-08-26 18:07:24,892 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-26 18:07:25,044 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 18:07:25,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499059316] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:07:25,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:07:25,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 20 [2023-08-26 18:07:25,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621902091] [2023-08-26 18:07:25,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:07:25,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-26 18:07:25,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:07:25,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-26 18:07:25,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=350, Unknown=1, NotChecked=0, Total=420 [2023-08-26 18:07:25,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 192 [2023-08-26 18:07:25,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 2962 transitions, 69013 flow. Second operand has 21 states, 21 states have (on average 45.80952380952381) internal successors, (962), 21 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:07:25,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:07:25,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 192 [2023-08-26 18:07:25,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:07:53,443 INFO L124 PetriNetUnfolderBase]: 22609/38866 cut-off events. [2023-08-26 18:07:53,444 INFO L125 PetriNetUnfolderBase]: For 2255752/2255965 co-relation queries the response was YES. [2023-08-26 18:07:53,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471836 conditions, 38866 events. 22609/38866 cut-off events. For 2255752/2255965 co-relation queries the response was YES. Maximal size of possible extension queue 1776. Compared 337005 event pairs, 923 based on Foata normal form. 406/38576 useless extension candidates. Maximal degree in co-relation 467159. Up to 19279 conditions per place. [2023-08-26 18:07:53,984 INFO L140 encePairwiseOnDemand]: 168/192 looper letters, 2180 selfloop transitions, 1574 changer transitions 228/3984 dead transitions. [2023-08-26 18:07:53,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 3984 transitions, 100770 flow [2023-08-26 18:07:53,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-08-26 18:07:53,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-08-26 18:07:53,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 2677 transitions. [2023-08-26 18:07:53,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29665336879432624 [2023-08-26 18:07:53,987 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 2677 transitions. [2023-08-26 18:07:53,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 2677 transitions. [2023-08-26 18:07:53,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:07:53,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 2677 transitions. [2023-08-26 18:07:53,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 56.95744680851064) internal successors, (2677), 47 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:07:53,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 192.0) internal successors, (9216), 48 states have internal predecessors, (9216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:07:53,995 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 192.0) internal successors, (9216), 48 states have internal predecessors, (9216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:07:53,995 INFO L175 Difference]: Start difference. First operand has 355 places, 2962 transitions, 69013 flow. Second operand 47 states and 2677 transitions. [2023-08-26 18:07:53,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 3984 transitions, 100770 flow [2023-08-26 18:08:34,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 3984 transitions, 99647 flow, removed 515 selfloop flow, removed 3 redundant places. [2023-08-26 18:08:34,442 INFO L231 Difference]: Finished difference. Result has 421 places, 3179 transitions, 79528 flow [2023-08-26 18:08:34,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=67011, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2887, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1276, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=79528, PETRI_PLACES=421, PETRI_TRANSITIONS=3179} [2023-08-26 18:08:34,444 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 362 predicate places. [2023-08-26 18:08:34,444 INFO L495 AbstractCegarLoop]: Abstraction has has 421 places, 3179 transitions, 79528 flow [2023-08-26 18:08:34,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 45.80952380952381) internal successors, (962), 21 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:08:34,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:08:34,444 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:08:34,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-26 18:08:34,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:08:34,645 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:08:34,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:08:34,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1025322597, now seen corresponding path program 1 times [2023-08-26 18:08:34,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:08:34,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715415383] [2023-08-26 18:08:34,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:08:34,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:08:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:08:34,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:08:34,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:08:34,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715415383] [2023-08-26 18:08:34,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715415383] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:08:34,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:08:34,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:08:34,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334497404] [2023-08-26 18:08:34,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:08:34,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:08:34,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:08:34,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:08:34,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:08:34,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 192 [2023-08-26 18:08:34,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 3179 transitions, 79528 flow. Second operand has 7 states, 7 states have (on average 60.857142857142854) internal successors, (426), 7 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:08:34,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:08:34,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 192 [2023-08-26 18:08:34,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:08:54,410 INFO L124 PetriNetUnfolderBase]: 17997/32629 cut-off events. [2023-08-26 18:08:54,410 INFO L125 PetriNetUnfolderBase]: For 2036437/2039898 co-relation queries the response was YES. [2023-08-26 18:08:54,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408459 conditions, 32629 events. 17997/32629 cut-off events. For 2036437/2039898 co-relation queries the response was YES. Maximal size of possible extension queue 1673. Compared 300024 event pairs, 1104 based on Foata normal form. 612/32552 useless extension candidates. Maximal degree in co-relation 405289. Up to 23637 conditions per place. [2023-08-26 18:08:55,040 INFO L140 encePairwiseOnDemand]: 183/192 looper letters, 2400 selfloop transitions, 152 changer transitions 14/3207 dead transitions. [2023-08-26 18:08:55,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 3207 transitions, 85344 flow [2023-08-26 18:08:55,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:08:55,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:08:55,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 430 transitions. [2023-08-26 18:08:55,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3732638888888889 [2023-08-26 18:08:55,041 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 430 transitions. [2023-08-26 18:08:55,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 430 transitions. [2023-08-26 18:08:55,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:08:55,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 430 transitions. [2023-08-26 18:08:55,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 71.66666666666667) internal successors, (430), 6 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:08:55,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:08:55,043 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:08:55,043 INFO L175 Difference]: Start difference. First operand has 421 places, 3179 transitions, 79528 flow. Second operand 6 states and 430 transitions. [2023-08-26 18:08:55,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 3207 transitions, 85344 flow [2023-08-26 18:09:32,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 3207 transitions, 84154 flow, removed 322 selfloop flow, removed 18 redundant places. [2023-08-26 18:09:32,686 INFO L231 Difference]: Finished difference. Result has 406 places, 3163 transitions, 78429 flow [2023-08-26 18:09:32,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=78085, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3013, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=78429, PETRI_PLACES=406, PETRI_TRANSITIONS=3163} [2023-08-26 18:09:32,688 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 347 predicate places. [2023-08-26 18:09:32,688 INFO L495 AbstractCegarLoop]: Abstraction has has 406 places, 3163 transitions, 78429 flow [2023-08-26 18:09:32,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 60.857142857142854) internal successors, (426), 7 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:09:32,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:09:32,688 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:09:32,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-08-26 18:09:32,688 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:09:32,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:09:32,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1213129317, now seen corresponding path program 2 times [2023-08-26 18:09:32,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:09:32,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538654183] [2023-08-26 18:09:32,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:09:32,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:09:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:09:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:09:32,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:09:32,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538654183] [2023-08-26 18:09:32,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538654183] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:09:32,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:09:32,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:09:32,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607327123] [2023-08-26 18:09:32,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:09:32,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:09:32,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:09:32,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:09:32,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:09:32,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 192 [2023-08-26 18:09:32,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 3163 transitions, 78429 flow. Second operand has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:09:32,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:09:32,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 192 [2023-08-26 18:09:32,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:09:51,982 INFO L124 PetriNetUnfolderBase]: 17816/32362 cut-off events. [2023-08-26 18:09:51,982 INFO L125 PetriNetUnfolderBase]: For 1959409/1962685 co-relation queries the response was YES. [2023-08-26 18:09:52,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402377 conditions, 32362 events. 17816/32362 cut-off events. For 1959409/1962685 co-relation queries the response was YES. Maximal size of possible extension queue 1679. Compared 298026 event pairs, 1075 based on Foata normal form. 622/32298 useless extension candidates. Maximal degree in co-relation 399471. Up to 22570 conditions per place. [2023-08-26 18:09:52,508 INFO L140 encePairwiseOnDemand]: 184/192 looper letters, 2298 selfloop transitions, 244 changer transitions 23/3190 dead transitions. [2023-08-26 18:09:52,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 3190 transitions, 84037 flow [2023-08-26 18:09:52,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:09:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:09:52,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 517 transitions. [2023-08-26 18:09:52,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4487847222222222 [2023-08-26 18:09:52,509 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 517 transitions. [2023-08-26 18:09:52,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 517 transitions. [2023-08-26 18:09:52,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:09:52,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 517 transitions. [2023-08-26 18:09:52,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:09:52,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:09:52,511 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:09:52,511 INFO L175 Difference]: Start difference. First operand has 406 places, 3163 transitions, 78429 flow. Second operand 6 states and 517 transitions. [2023-08-26 18:09:52,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 3190 transitions, 84037 flow [2023-08-26 18:10:28,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 3190 transitions, 83650 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-08-26 18:10:28,476 INFO L231 Difference]: Finished difference. Result has 408 places, 3118 transitions, 77661 flow [2023-08-26 18:10:28,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=77329, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=240, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2887, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=77661, PETRI_PLACES=408, PETRI_TRANSITIONS=3118} [2023-08-26 18:10:28,478 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 349 predicate places. [2023-08-26 18:10:28,478 INFO L495 AbstractCegarLoop]: Abstraction has has 408 places, 3118 transitions, 77661 flow [2023-08-26 18:10:28,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:10:28,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:10:28,478 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:10:28,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-08-26 18:10:28,478 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:10:28,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:10:28,479 INFO L85 PathProgramCache]: Analyzing trace with hash 551089694, now seen corresponding path program 1 times [2023-08-26 18:10:28,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:10:28,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219750878] [2023-08-26 18:10:28,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:10:28,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:10:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:10:28,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:10:28,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:10:28,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219750878] [2023-08-26 18:10:28,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219750878] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:10:28,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:10:28,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:10:28,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422264994] [2023-08-26 18:10:28,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:10:28,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:10:28,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:10:28,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:10:28,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:10:28,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 192 [2023-08-26 18:10:28,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 3118 transitions, 77661 flow. Second operand has 8 states, 8 states have (on average 71.75) internal successors, (574), 8 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:10:28,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:10:28,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 192 [2023-08-26 18:10:28,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:10:47,844 INFO L124 PetriNetUnfolderBase]: 17875/32466 cut-off events. [2023-08-26 18:10:47,844 INFO L125 PetriNetUnfolderBase]: For 1969531/1973064 co-relation queries the response was YES. [2023-08-26 18:10:48,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404324 conditions, 32466 events. 17875/32466 cut-off events. For 1969531/1973064 co-relation queries the response was YES. Maximal size of possible extension queue 1711. Compared 299555 event pairs, 1128 based on Foata normal form. 574/32320 useless extension candidates. Maximal degree in co-relation 401487. Up to 23869 conditions per place. [2023-08-26 18:10:48,324 INFO L140 encePairwiseOnDemand]: 182/192 looper letters, 2470 selfloop transitions, 143 changer transitions 13/3251 dead transitions. [2023-08-26 18:10:48,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 3251 transitions, 85709 flow [2023-08-26 18:10:48,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:10:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:10:48,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 644 transitions. [2023-08-26 18:10:48,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4192708333333333 [2023-08-26 18:10:48,325 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 644 transitions. [2023-08-26 18:10:48,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 644 transitions. [2023-08-26 18:10:48,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:10:48,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 644 transitions. [2023-08-26 18:10:48,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 80.5) internal successors, (644), 8 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:10:48,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 192.0) internal successors, (1728), 9 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:10:48,327 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 192.0) internal successors, (1728), 9 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:10:48,327 INFO L175 Difference]: Start difference. First operand has 408 places, 3118 transitions, 77661 flow. Second operand 8 states and 644 transitions. [2023-08-26 18:10:48,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 3251 transitions, 85709 flow [2023-08-26 18:11:23,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 3251 transitions, 85064 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-08-26 18:11:23,065 INFO L231 Difference]: Finished difference. Result has 416 places, 3207 transitions, 79550 flow [2023-08-26 18:11:23,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=77180, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2981, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=79550, PETRI_PLACES=416, PETRI_TRANSITIONS=3207} [2023-08-26 18:11:23,067 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 357 predicate places. [2023-08-26 18:11:23,067 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 3207 transitions, 79550 flow [2023-08-26 18:11:23,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 71.75) internal successors, (574), 8 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:23,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:11:23,067 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:11:23,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-08-26 18:11:23,067 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:11:23,067 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:11:23,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1072555913, now seen corresponding path program 3 times [2023-08-26 18:11:23,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:11:23,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133276294] [2023-08-26 18:11:23,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:11:23,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:11:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:11:23,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:11:23,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:11:23,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133276294] [2023-08-26 18:11:23,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133276294] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:11:23,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:11:23,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:11:23,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860321123] [2023-08-26 18:11:23,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:11:23,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:11:23,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:11:23,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:11:23,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:11:23,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 192 [2023-08-26 18:11:23,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 3207 transitions, 79550 flow. Second operand has 8 states, 8 states have (on average 60.625) internal successors, (485), 8 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:23,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:11:23,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 192 [2023-08-26 18:11:23,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:11:42,166 INFO L124 PetriNetUnfolderBase]: 18057/32739 cut-off events. [2023-08-26 18:11:42,166 INFO L125 PetriNetUnfolderBase]: For 1982030/1985636 co-relation queries the response was YES. [2023-08-26 18:11:42,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408213 conditions, 32739 events. 18057/32739 cut-off events. For 1982030/1985636 co-relation queries the response was YES. Maximal size of possible extension queue 1718. Compared 301136 event pairs, 1206 based on Foata normal form. 575/32593 useless extension candidates. Maximal degree in co-relation 405165. Up to 24273 conditions per place. [2023-08-26 18:11:42,656 INFO L140 encePairwiseOnDemand]: 182/192 looper letters, 2582 selfloop transitions, 90 changer transitions 11/3306 dead transitions. [2023-08-26 18:11:42,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 3306 transitions, 87006 flow [2023-08-26 18:11:42,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:11:42,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:11:42,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 486 transitions. [2023-08-26 18:11:42,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36160714285714285 [2023-08-26 18:11:42,658 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 486 transitions. [2023-08-26 18:11:42,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 486 transitions. [2023-08-26 18:11:42,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:11:42,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 486 transitions. [2023-08-26 18:11:42,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 69.42857142857143) internal successors, (486), 7 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:42,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:42,659 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:42,659 INFO L175 Difference]: Start difference. First operand has 416 places, 3207 transitions, 79550 flow. Second operand 7 states and 486 transitions. [2023-08-26 18:11:42,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 3306 transitions, 87006 flow [2023-08-26 18:12:17,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 3306 transitions, 86849 flow, removed 10 selfloop flow, removed 1 redundant places. [2023-08-26 18:12:18,031 INFO L231 Difference]: Finished difference. Result has 423 places, 3271 transitions, 81131 flow [2023-08-26 18:12:18,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=79442, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=81131, PETRI_PLACES=423, PETRI_TRANSITIONS=3271} [2023-08-26 18:12:18,033 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 364 predicate places. [2023-08-26 18:12:18,033 INFO L495 AbstractCegarLoop]: Abstraction has has 423 places, 3271 transitions, 81131 flow [2023-08-26 18:12:18,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 60.625) internal successors, (485), 8 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:12:18,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:12:18,033 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:12:18,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-08-26 18:12:18,034 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:12:18,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:12:18,034 INFO L85 PathProgramCache]: Analyzing trace with hash 997892187, now seen corresponding path program 1 times [2023-08-26 18:12:18,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:12:18,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004911572] [2023-08-26 18:12:18,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:12:18,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:12:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:12:18,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:12:18,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:12:18,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004911572] [2023-08-26 18:12:18,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004911572] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:12:18,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:12:18,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:12:18,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213560457] [2023-08-26 18:12:18,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:12:18,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:12:18,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:12:18,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:12:18,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:12:18,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 192 [2023-08-26 18:12:18,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 3271 transitions, 81131 flow. Second operand has 7 states, 7 states have (on average 60.857142857142854) internal successors, (426), 7 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:12:18,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:12:18,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 192 [2023-08-26 18:12:18,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:12:37,867 INFO L124 PetriNetUnfolderBase]: 18115/32801 cut-off events. [2023-08-26 18:12:37,867 INFO L125 PetriNetUnfolderBase]: For 1990258/1993872 co-relation queries the response was YES. [2023-08-26 18:12:38,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 409744 conditions, 32801 events. 18115/32801 cut-off events. For 1990258/1993872 co-relation queries the response was YES. Maximal size of possible extension queue 1716. Compared 300980 event pairs, 1064 based on Foata normal form. 592/32675 useless extension candidates. Maximal degree in co-relation 406701. Up to 23628 conditions per place. [2023-08-26 18:12:38,356 INFO L140 encePairwiseOnDemand]: 183/192 looper letters, 2392 selfloop transitions, 273 changer transitions 16/3302 dead transitions. [2023-08-26 18:12:38,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 3302 transitions, 87199 flow [2023-08-26 18:12:38,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:12:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:12:38,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 430 transitions. [2023-08-26 18:12:38,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3732638888888889 [2023-08-26 18:12:38,357 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 430 transitions. [2023-08-26 18:12:38,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 430 transitions. [2023-08-26 18:12:38,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:12:38,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 430 transitions. [2023-08-26 18:12:38,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 71.66666666666667) internal successors, (430), 6 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:12:38,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:12:38,358 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:12:38,358 INFO L175 Difference]: Start difference. First operand has 423 places, 3271 transitions, 81131 flow. Second operand 6 states and 430 transitions. [2023-08-26 18:12:38,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 3302 transitions, 87199 flow [2023-08-26 18:13:13,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 3302 transitions, 87097 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-26 18:13:13,426 INFO L231 Difference]: Finished difference. Result has 427 places, 3267 transitions, 81607 flow [2023-08-26 18:13:13,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=80981, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=269, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2996, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=81607, PETRI_PLACES=427, PETRI_TRANSITIONS=3267} [2023-08-26 18:13:13,428 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 368 predicate places. [2023-08-26 18:13:13,428 INFO L495 AbstractCegarLoop]: Abstraction has has 427 places, 3267 transitions, 81607 flow [2023-08-26 18:13:13,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 60.857142857142854) internal successors, (426), 7 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:13:13,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:13,428 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:13,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-08-26 18:13:13,428 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:13:13,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:13,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1886534741, now seen corresponding path program 2 times [2023-08-26 18:13:13,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:13,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061917542] [2023-08-26 18:13:13,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:13,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:13,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:13:13,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:13,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061917542] [2023-08-26 18:13:13,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061917542] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:13,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:13,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:13:13,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386581603] [2023-08-26 18:13:13,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:13,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:13:13,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:13,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:13:13,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:13:13,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 192 [2023-08-26 18:13:13,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 3267 transitions, 81607 flow. Second operand has 8 states, 8 states have (on average 71.625) internal successors, (573), 8 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:13:13,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:13,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 192 [2023-08-26 18:13:13,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:33,556 INFO L124 PetriNetUnfolderBase]: 18085/32786 cut-off events. [2023-08-26 18:13:33,557 INFO L125 PetriNetUnfolderBase]: For 1998825/2002465 co-relation queries the response was YES. [2023-08-26 18:13:33,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410173 conditions, 32786 events. 18085/32786 cut-off events. For 1998825/2002465 co-relation queries the response was YES. Maximal size of possible extension queue 1733. Compared 301727 event pairs, 1132 based on Foata normal form. 598/32662 useless extension candidates. Maximal degree in co-relation 407343. Up to 23992 conditions per place. [2023-08-26 18:13:34,043 INFO L140 encePairwiseOnDemand]: 182/192 looper letters, 2488 selfloop transitions, 197 changer transitions 16/3324 dead transitions. [2023-08-26 18:13:34,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 3324 transitions, 88147 flow [2023-08-26 18:13:34,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:13:34,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:13:34,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 644 transitions. [2023-08-26 18:13:34,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4192708333333333 [2023-08-26 18:13:34,044 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 644 transitions. [2023-08-26 18:13:34,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 644 transitions. [2023-08-26 18:13:34,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:34,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 644 transitions. [2023-08-26 18:13:34,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 80.5) internal successors, (644), 8 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:13:34,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 192.0) internal successors, (1728), 9 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:13:34,045 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 192.0) internal successors, (1728), 9 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:13:34,045 INFO L175 Difference]: Start difference. First operand has 427 places, 3267 transitions, 81607 flow. Second operand 8 states and 644 transitions. [2023-08-26 18:13:34,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 3324 transitions, 88147 flow [2023-08-26 18:14:12,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 3324 transitions, 87601 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 18:14:12,088 INFO L231 Difference]: Finished difference. Result has 432 places, 3270 transitions, 81721 flow [2023-08-26 18:14:12,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=81061, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3070, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=81721, PETRI_PLACES=432, PETRI_TRANSITIONS=3270} [2023-08-26 18:14:12,090 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 373 predicate places. [2023-08-26 18:14:12,090 INFO L495 AbstractCegarLoop]: Abstraction has has 432 places, 3270 transitions, 81721 flow [2023-08-26 18:14:12,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 71.625) internal successors, (573), 8 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:12,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:14:12,091 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:14:12,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-08-26 18:14:12,091 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:14:12,091 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:14:12,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1398201393, now seen corresponding path program 3 times [2023-08-26 18:14:12,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:14:12,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459557539] [2023-08-26 18:14:12,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:14:12,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:14:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:14:12,257 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:14:12,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:14:12,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459557539] [2023-08-26 18:14:12,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459557539] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:14:12,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:14:12,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:14:12,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943647723] [2023-08-26 18:14:12,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:14:12,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:14:12,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:14:12,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:14:12,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:14:12,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 192 [2023-08-26 18:14:12,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 3270 transitions, 81721 flow. Second operand has 8 states, 8 states have (on average 71.625) internal successors, (573), 8 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:12,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:14:12,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 192 [2023-08-26 18:14:12,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:14:32,427 INFO L124 PetriNetUnfolderBase]: 18425/33313 cut-off events. [2023-08-26 18:14:32,427 INFO L125 PetriNetUnfolderBase]: For 2021737/2025091 co-relation queries the response was YES. [2023-08-26 18:14:32,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416643 conditions, 33313 events. 18425/33313 cut-off events. For 2021737/2025091 co-relation queries the response was YES. Maximal size of possible extension queue 1723. Compared 305475 event pairs, 1264 based on Foata normal form. 596/33195 useless extension candidates. Maximal degree in co-relation 413811. Up to 24463 conditions per place. [2023-08-26 18:14:32,934 INFO L140 encePairwiseOnDemand]: 182/192 looper letters, 2631 selfloop transitions, 128 changer transitions 21/3403 dead transitions. [2023-08-26 18:14:32,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 3403 transitions, 90452 flow [2023-08-26 18:14:32,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:14:32,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:14:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 638 transitions. [2023-08-26 18:14:32,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4153645833333333 [2023-08-26 18:14:32,935 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 638 transitions. [2023-08-26 18:14:32,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 638 transitions. [2023-08-26 18:14:32,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:14:32,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 638 transitions. [2023-08-26 18:14:32,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 79.75) internal successors, (638), 8 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:32,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 192.0) internal successors, (1728), 9 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:32,939 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 192.0) internal successors, (1728), 9 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:32,939 INFO L175 Difference]: Start difference. First operand has 432 places, 3270 transitions, 81721 flow. Second operand 8 states and 638 transitions. [2023-08-26 18:14:32,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 3403 transitions, 90452 flow [2023-08-26 18:15:10,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 3403 transitions, 90222 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:15:10,295 INFO L231 Difference]: Finished difference. Result has 439 places, 3352 transitions, 84096 flow [2023-08-26 18:15:10,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=81553, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=84096, PETRI_PLACES=439, PETRI_TRANSITIONS=3352} [2023-08-26 18:15:10,297 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 380 predicate places. [2023-08-26 18:15:10,297 INFO L495 AbstractCegarLoop]: Abstraction has has 439 places, 3352 transitions, 84096 flow [2023-08-26 18:15:10,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 71.625) internal successors, (573), 8 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:10,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:10,297 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:10,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-08-26 18:15:10,297 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:15:10,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:10,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1744532007, now seen corresponding path program 4 times [2023-08-26 18:15:10,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:10,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562574012] [2023-08-26 18:15:10,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:10,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 18:15:10,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:10,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562574012] [2023-08-26 18:15:10,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562574012] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:15:10,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365136576] [2023-08-26 18:15:10,440 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 18:15:10,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:15:10,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:15:10,441 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:15:10,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-26 18:15:10,543 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 18:15:10,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 18:15:10,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-26 18:15:10,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:15:10,590 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 18:15:10,612 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 18:15:10,612 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 18:15:10,636 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-26 18:15:10,655 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-08-26 18:15:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 18:15:10,672 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:15:10,708 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_661 (Array Int Int))) (not (= (mod c_~s~0 4294967296) (mod (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_~#l~0#1.base| v_ArrVal_661) |c_ULTIMATE.start_thr1_~#l~0#1.base|) |c_ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296)))) is different from false [2023-08-26 18:15:10,713 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:15:10,714 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-26 18:15:10,715 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2023-08-26 18:15:10,720 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-26 18:15:10,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 18:15:10,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365136576] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:15:10,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:15:10,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 19 [2023-08-26 18:15:10,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618290567] [2023-08-26 18:15:10,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:15:10,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-26 18:15:10,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:10,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-26 18:15:10,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=277, Unknown=1, NotChecked=34, Total=380 [2023-08-26 18:15:10,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 192 [2023-08-26 18:15:10,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 3352 transitions, 84096 flow. Second operand has 20 states, 20 states have (on average 47.95) internal successors, (959), 20 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:10,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:10,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 192 [2023-08-26 18:15:10,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:41,044 INFO L124 PetriNetUnfolderBase]: 22106/37831 cut-off events. [2023-08-26 18:15:41,045 INFO L125 PetriNetUnfolderBase]: For 2427648/2427870 co-relation queries the response was YES. [2023-08-26 18:15:41,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485684 conditions, 37831 events. 22106/37831 cut-off events. For 2427648/2427870 co-relation queries the response was YES. Maximal size of possible extension queue 1602. Compared 322636 event pairs, 823 based on Foata normal form. 661/38281 useless extension candidates. Maximal degree in co-relation 482416. Up to 8508 conditions per place. [2023-08-26 18:15:41,639 INFO L140 encePairwiseOnDemand]: 170/192 looper letters, 2410 selfloop transitions, 2250 changer transitions 614/5276 dead transitions. [2023-08-26 18:15:41,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 5276 transitions, 141238 flow [2023-08-26 18:15:41,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-08-26 18:15:41,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2023-08-26 18:15:41,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 3355 transitions. [2023-08-26 18:15:41,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2961687853107345 [2023-08-26 18:15:41,643 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 3355 transitions. [2023-08-26 18:15:41,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 3355 transitions. [2023-08-26 18:15:41,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:41,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 3355 transitions. [2023-08-26 18:15:41,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 60 states, 59 states have (on average 56.86440677966102) internal successors, (3355), 59 states have internal predecessors, (3355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:41,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 60 states, 60 states have (on average 192.0) internal successors, (11520), 60 states have internal predecessors, (11520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:41,659 INFO L81 ComplementDD]: Finished complementDD. Result has 60 states, 60 states have (on average 192.0) internal successors, (11520), 60 states have internal predecessors, (11520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:41,659 INFO L175 Difference]: Start difference. First operand has 439 places, 3352 transitions, 84096 flow. Second operand 59 states and 3355 transitions. [2023-08-26 18:15:41,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 5276 transitions, 141238 flow [2023-08-26 18:16:29,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 5276 transitions, 140675 flow, removed 64 selfloop flow, removed 4 redundant places. [2023-08-26 18:16:29,958 INFO L231 Difference]: Finished difference. Result has 524 places, 3725 transitions, 99771 flow [2023-08-26 18:16:29,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=81968, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1727, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=99771, PETRI_PLACES=524, PETRI_TRANSITIONS=3725} [2023-08-26 18:16:29,961 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 465 predicate places. [2023-08-26 18:16:29,961 INFO L495 AbstractCegarLoop]: Abstraction has has 524 places, 3725 transitions, 99771 flow [2023-08-26 18:16:29,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 47.95) internal successors, (959), 20 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:16:29,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:16:29,961 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:16:29,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-26 18:16:30,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:16:30,167 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:16:30,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:16:30,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1661764711, now seen corresponding path program 1 times [2023-08-26 18:16:30,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:16:30,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897963797] [2023-08-26 18:16:30,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:16:30,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:16:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:16:30,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 18:16:30,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:16:30,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897963797] [2023-08-26 18:16:30,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897963797] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:16:30,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:16:30,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:16:30,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670514321] [2023-08-26 18:16:30,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:16:30,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:16:30,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:16:30,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:16:30,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:16:30,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 192 [2023-08-26 18:16:30,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 3725 transitions, 99771 flow. Second operand has 6 states, 6 states have (on average 63.666666666666664) internal successors, (382), 6 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:16:30,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:16:30,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 192 [2023-08-26 18:16:30,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:16:50,113 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L718-3-->L719: Formula: (= v_~c~0_4 0) InVars {} OutVars{~c~0=v_~c~0_4} AuxVars[] AssignedVars[~c~0][1690], [Black: 252#(= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1), 1979#true, 9#L719true, Black: 1189#(not (= (mod (select (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))), Black: 1259#(and (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (not (= (mod ~c~0 4294967296) 1))), Black: 1282#(and (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), 695#(not (= (mod ~c~0 4294967296) 1)), Black: 1268#(and (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1534#(and (or (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_41|) 0)))) (or (forall ((v_ArrVal_495 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_495) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (not (= (mod ~c~0 4294967296) 1))), Black: 1250#(and (= |thr1Thread1of2ForFork0_~#l~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (= ~t~0 1) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (exists ((|thr1Thread2of2ForFork0_~#l~0#1.base| Int) (|thr1Thread2of2ForFork0_~#l~0#1.offset| Int)) (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) 0)) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 1564#(and (or (forall ((v_ArrVal_495 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_495) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0)) (= (mod ~c~0 4294967296) 1)), Black: 1287#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (forall ((v_ArrVal_458 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_458) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (= (mod ~c~0 4294967296) 1)), Black: 1248#(and (= |thr1Thread1of2ForFork0_~#l~0#1.offset| 0) (not (= (mod (select (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (= ~t~0 1) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 1422#(= (mod ~c~0 4294967296) 1), Black: 1294#(and (not (= (mod (select (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1506#(and (forall ((|v_thr1Thread2of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select (store |#valid| |v_thr1Thread2of2ForFork0_~#l~0#1.base_41| 1) |ULTIMATE.start_main_~#t~1#1.base|) 0))) (or (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_41| Int) (|v_thr1Thread2of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select (store |#valid| |v_thr1Thread2of2ForFork0_~#l~0#1.base_41| 1) |v_thr1Thread1of2ForFork0_~#l~0#1.base_41|) 0))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296)))) (not (= (mod ~c~0 4294967296) 1))), Black: 1544#(and (or (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_41|) 0)))) (or (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0)) (or (forall ((v_ArrVal_495 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_495) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (= (mod ~c~0 4294967296) 1)), Black: 1292#(and (not (= (mod (select (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 1310#(and (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 1560#(and (or (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0) (and (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))))) (not (= (mod ~c~0 4294967296) 1))), Black: 1566#(and (or (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0) (and (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))))) (= (mod ~c~0 4294967296) 1)), Black: 1289#(and (forall ((v_ArrVal_458 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_458) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (not (= (mod ~c~0 4294967296) 1))), Black: 1246#(and (= |thr1Thread1of2ForFork0_~#l~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (= ~t~0 1) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 1284#(and (not (= (mod (select (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1492#(and (<= ~t~0 1) (or (not (= (mod (select (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0)) (= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 1096#true, Black: 1546#(and (or (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_41|) 0)))) (or (forall ((v_ArrVal_495 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_495) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (= (mod ~c~0 4294967296) 1)), Black: 1490#(and (<= ~t~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 1275#(and (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (= (mod ~c~0 4294967296) 1)), 400#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1542#(and (or (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_41|) 0)))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (= (mod ~c~0 4294967296) 1)), Black: 974#(or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_main_~#t~1#1.base|)) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))))), Black: 1303#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (forall ((v_ArrVal_458 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_458) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (not (= (mod ~c~0 4294967296) 1))), Black: 1570#(and (or (not (= (mod (select (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0)) (= (mod ~c~0 4294967296) 1)), Black: 1063#(and (or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_main_~#t~1#1.base|)) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))))) (= (mod ~c~0 4294967296) 1)), Black: 1296#(and (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1041#(and (or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_main_~#t~1#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))))) (= (mod ~c~0 4294967296) 1)), Black: 1572#(and (or (not (= (select |#valid| |thr1Thread2of2ForFork0_~#l~0#1.base|) 1)) (and (or (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_41|) 0)))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))))) (not (= (mod ~c~0 4294967296) 1))), Black: 1312#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (forall ((v_ArrVal_458 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_458) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (= (mod ~c~0 4294967296) 1)), Black: 1266#(and (= |thr1Thread1of2ForFork0_~#l~0#1.offset| 0) (forall ((v_ArrVal_458 (Array Int Int))) (not (= (mod (select (select (store (store |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base| (store (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset| ~t~0)) |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_458) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (= ~t~0 1) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (exists ((|thr1Thread2of2ForFork0_~#l~0#1.base| Int) (|thr1Thread2of2ForFork0_~#l~0#1.offset| Int)) (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) 0)) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 1558#(and (or (forall ((v_ArrVal_495 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_495) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0)) (not (= (mod ~c~0 4294967296) 1))), Black: 1532#(and (or (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_41|) 0)))) (or (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0)) (or (forall ((v_ArrVal_495 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_495) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (not (= (mod ~c~0 4294967296) 1))), Black: 1298#(and (forall ((v_ArrVal_458 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_458) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (= (mod ~c~0 4294967296) 1)), Black: 1530#(and (or (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_41|) 0)))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (not (= (mod ~c~0 4294967296) 1))), Black: 1067#(and (or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_main_~#t~1#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296)))) (not (= (mod ~c~0 4294967296) 1))) (or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (not (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))))), Black: 1498#(and (<= ~t~0 1) (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_main_~#t~1#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 1244#(and (= |thr1Thread1of2ForFork0_~#l~0#1.offset| 0) (forall ((v_ArrVal_458 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_458) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (= ~t~0 1) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (exists ((|thr1Thread2of2ForFork0_~#l~0#1.base| Int) (|thr1Thread2of2ForFork0_~#l~0#1.offset| Int)) (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) 0)) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 1305#(and (not (= (mod (select (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 1554#(and (or (not (= (mod (select (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0)) (not (= (mod ~c~0 4294967296) 1))), Black: 1500#(and (or (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_41| Int) (|v_thr1Thread2of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select (store |#valid| |v_thr1Thread2of2ForFork0_~#l~0#1.base_41| 1) |v_thr1Thread1of2ForFork0_~#l~0#1.base_41|) 0))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296)))) (or (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_41|) 0)))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (not (= (mod ~c~0 4294967296) 1))), Black: 859#true, Black: 1242#(and (= |thr1Thread1of2ForFork0_~#l~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (= ~t~0 1) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (exists ((|thr1Thread2of2ForFork0_~#l~0#1.base| Int) (|thr1Thread2of2ForFork0_~#l~0#1.offset| Int)) (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) 0)) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 1540#(and (forall ((|v_thr1Thread2of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select (store |#valid| |v_thr1Thread2of2ForFork0_~#l~0#1.base_41| 1) |ULTIMATE.start_main_~#t~1#1.base|) 0))) (or (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_41| Int) (|v_thr1Thread2of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select (store |#valid| |v_thr1Thread2of2ForFork0_~#l~0#1.base_41| 1) |v_thr1Thread1of2ForFork0_~#l~0#1.base_41|) 0))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296)))) (= (mod ~c~0 4294967296) 1)), Black: 936#(= (mod ~c~0 4294967296) 1), Black: 1277#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (forall ((v_ArrVal_458 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_458) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (not (= (mod ~c~0 4294967296) 1))), Black: 1261#(and (not (= (mod (select (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (not (= (mod ~c~0 4294967296) 1))), Black: 1172#(= (mod ~c~0 4294967296) 1), Black: 1047#(and (or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296)))) (or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_main_~#t~1#1.base|)) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))))) (or (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread2of2ForFork0_~#l~0#1.base_37| Int)) (not (= (select |#valid| |v_thr1Thread2of2ForFork0_~#l~0#1.base_37|) 0)))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (not (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))))), Black: 1254#(and (or (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_39| Int)) (not (= (select |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_39|) 0)))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (not (= (mod ~c~0 4294967296) 1))), Black: 862#(and (= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1) (= ~t~0 0) (= ~s~0 0)), Black: 1300#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (forall ((v_ArrVal_458 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_458) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (not (= (mod ~c~0 4294967296) 1))), Black: 891#(and (= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1) (= ~t~0 0) (= (select |#valid| |thr1Thread1of2ForFork0_~#l~0#1.base|) 1) (= ~s~0 0)), Black: 460#(and (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (<= |ULTIMATE.start_main_~#t~1#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#t~1#1.offset|) (= (select |#length| |ULTIMATE.start_main_~#t~1#1.base|) 4)), Black: 960#(or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_main_~#t~1#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))))), Black: 1017#(and (or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_main_~#t~1#1.base|)) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))))) (or (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread2of2ForFork0_~#l~0#1.base_37| Int)) (not (= (select |#valid| |v_thr1Thread2of2ForFork0_~#l~0#1.base_37|) 0)))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|)))), Black: 808#(and (or (forall ((|v_thr1Thread2of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select |#valid| |v_thr1Thread2of2ForFork0_~#l~0#1.base_35|) 0))) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296)))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (= (mod ~c~0 4294967296) 1)), Black: 1602#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 1) (= ~s~0 0)), Black: 1606#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 1) (= ~s~0 0)), Black: 766#(and (not (= (mod ~c~0 4294967296) 1)) (or (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_35| Int) (|v_thr1Thread2of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select (store |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_35| 1) |v_thr1Thread2of2ForFork0_~#l~0#1.base_35|) 0)))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select (store |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_35| 1) |ULTIMATE.start_main_~#t~1#1.base|) 0)))), Black: 806#(and (or (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_35| Int) (|v_thr1Thread2of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select (store |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_35| 1) |v_thr1Thread2of2ForFork0_~#l~0#1.base_35|) 0)))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select (store |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_35| 1) |ULTIMATE.start_main_~#t~1#1.base|) 0))) (= (mod ~c~0 4294967296) 1)), Black: 824#(and (or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_main_~#t~1#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))))) (not (= (mod ~c~0 4294967296) 1))), Black: 688#(= (mod ~c~0 4294967296) 1), 174#true, Black: 822#(and (or (forall ((v_ArrVal_385 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_385) |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0)) (not (= (mod ~c~0 4294967296) 1))), 1904#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1615#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (< (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296) 1) (= ~s~0 0)), Black: 582#(= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1), Black: 830#(and (or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_main_~#t~1#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))))) (= (mod ~c~0 4294967296) 1)), Black: 587#(and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_main_~#t~1#1.base|)) (= (select |#valid| |thr1Thread2of2ForFork0_~#l~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1)), Black: 585#(= (select |#valid| |thr1Thread2of2ForFork0_~#l~0#1.base|) 1), 1432#(not (= (mod ~c~0 4294967296) 1)), Black: 836#(and (or (not (= (select |#valid| |thr1Thread1of2ForFork0_~#l~0#1.base|) 1)) (and (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (or (forall ((|v_thr1Thread2of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select |#valid| |v_thr1Thread2of2ForFork0_~#l~0#1.base_35|) 0))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296)))))) (not (= (mod ~c~0 4294967296) 1))), Black: 774#(and (or (forall ((|v_thr1Thread2of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select |#valid| |v_thr1Thread2of2ForFork0_~#l~0#1.base_35|) 0))) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296)))) (or (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_35| Int) (|v_thr1Thread2of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select (store |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_35| 1) |v_thr1Thread2of2ForFork0_~#l~0#1.base_35|) 0)))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select (store |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_35| 1) |ULTIMATE.start_main_~#t~1#1.base|) 0))) (= (mod ~c~0 4294967296) 1)), 236#true, Black: 828#(and (or (forall ((v_ArrVal_385 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_385) |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0)) (= (mod ~c~0 4294967296) 1)), Black: 796#(and (or (forall ((|v_thr1Thread2of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select |#valid| |v_thr1Thread2of2ForFork0_~#l~0#1.base_35|) 0))) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296)))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (not (= (mod ~c~0 4294967296) 1))), Black: 768#(and (or (forall ((|v_thr1Thread2of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select |#valid| |v_thr1Thread2of2ForFork0_~#l~0#1.base_35|) 0))) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296)))) (not (= (mod ~c~0 4294967296) 1)) (or (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_35| Int) (|v_thr1Thread2of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select (store |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_35| 1) |v_thr1Thread2of2ForFork0_~#l~0#1.base_35|) 0)))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select (store |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_35| 1) |ULTIMATE.start_main_~#t~1#1.base|) 0)))), Black: 1622#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), Black: 1620#(and (= ~t~0 0) (= ~s~0 0)), Black: 1627#(and (<= ~t~0 1) (<= 1 ~t~0) (= |thr1Thread2of2ForFork0_~#l~0#1.offset| |ULTIMATE.start_thr1_~#l~0#1.offset|) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), Black: 1625#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (< (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296) 1) (= ~s~0 0)), Black: 1624#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (<= 2 ~t~0) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (<= ~t~0 2) (= |thr1Thread2of2ForFork0_~#l~0#1.offset| |ULTIMATE.start_thr1_~#l~0#1.offset|) (= ~s~0 0)), Black: 597#true, 443#true, 36#L718-3true, thr1Thread1of2ForFork0InUse, Black: 1639#(and (<= ~t~0 1) (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (<= 1 ~t~0) (= ~s~0 0)), thr1Thread2of2ForFork0InUse, Black: 1640#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (= ~s~0 0)), Black: 114#(= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1), Black: 1651#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 1) (= ~s~0 0)), Black: 120#(and (<= 0 |ULTIMATE.start_main_~#t~1#1.offset|) (<= (+ |ULTIMATE.start_main_~#t~1#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t~1#1.base|))), Black: 1655#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 1) (not (= |thr1Thread1of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (= ~s~0 0)), 580#true, Black: 126#(= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 1), 201#(= (select |#valid| |thr1Thread1of2ForFork0_~#l~0#1.base|) 1), Black: 1663#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), Black: 1666#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (< (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296) 1) (= ~s~0 0)), Black: 136#(= (select |#valid| |thr1Thread1of2ForFork0_~#l~0#1.base|) 1), Black: 1677#(and (<= ~t~0 1) (= |ULTIMATE.start_thr1_~#l~0#1.offset| |thr1Thread1of2ForFork0_~#l~0#1.offset|) (<= 1 ~t~0) (= ~s~0 0)), Black: 1678#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (= |ULTIMATE.start_thr1_~#l~0#1.offset| |thr1Thread1of2ForFork0_~#l~0#1.offset|) (<= 2 ~t~0) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (<= ~t~0 2) (= ~s~0 0)), Black: 146#(= ~c~0 1), Black: 1679#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (< (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296) 1) (= ~s~0 0)), 604#(= (select |#valid| |thr1Thread2of2ForFork0_~#l~0#1.base|) 1), Black: 1898#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (forall ((v_ArrVal_661 (Array Int Int))) (not (= (mod ~s~0 4294967296) (mod (select (select (store |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base| v_ArrVal_661) |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296)))) (not (= (mod ~c~0 4294967296) 1))), Black: 152#(and (<= 0 |ULTIMATE.start_main_~#t~1#1.offset|) (<= (+ |ULTIMATE.start_main_~#t~1#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t~1#1.base|))), Black: 1945#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), 964#(or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_main_~#t~1#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296)))) (not (= (mod ~c~0 4294967296) 1))), Black: 1933#(and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1892#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1914#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 1861#(and (<= ~t~0 1) (<= 1 ~t~0) (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 1) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 1918#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1855#(and (<= ~t~0 1) (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (<= 1 ~t~0) (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 1) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 159#(= (select |#valid| |thr1Thread2of2ForFork0_~#l~0#1.base|) 1), Black: 408#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 1863#(and (<= ~t~0 1) (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (<= 1 ~t~0) (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 1) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 406#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), 1182#(not (= (mod ~c~0 4294967296) 1)), Black: 1941#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 1845#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 378#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1764#(= (mod ~c~0 4294967296) 1), Black: 418#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 376#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 1877#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1847#(and (<= ~t~0 1) (<= 1 ~t~0) (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 1) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 394#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1937#(and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 386#(and (<= 1 (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|)) (< (div (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) 1) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 1884#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 325#(not (= (mod ~c~0 4294967296) 1)), Black: 169#(= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1), Black: 1853#(and (<= ~t~0 1) (<= 1 ~t~0) (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 1) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 396#(and (<= 1 (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|)) (< (div (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) 1) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 1900#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) 0) 1) (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), Black: 1920#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 414#(and (not (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1908#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1890#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 398#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= 1 (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) 0)) (= |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) 0) 1) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 1926#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) 0) 1) (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0) (= (mod ~c~0 4294967296) 1)), Black: 1771#(not (= (mod ~c~0 4294967296) 1)), Black: 404#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 1865#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 412#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 380#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1931#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 1857#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 384#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 416#(and (not (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 1902#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 318#(= (mod ~c~0 4294967296) 1), Black: 1943#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 402#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1873#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 176#(= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 1), Black: 1916#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 374#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 388#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= 1 (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) 0)) (= |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) 0) 1) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 1935#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 178#(= (select |#valid| |thr1Thread1of2ForFork0_~#l~0#1.base|) 1), Black: 191#(and (<= 1 (select (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|)) (< (div (select (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) 1) (= ~s~0 0)), Black: 445#(= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 1), 2#ULTIMATE.startEXITtrue, Black: 447#(= (select |#valid| |thr1Thread2of2ForFork0_~#l~0#1.base|) 1), 213#true, Black: 195#true, Black: 203#(and (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1) (= (select |#valid| |thr1Thread1of2ForFork0_~#l~0#1.base|) 1)), Black: 197#(= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1), Black: 215#(= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1), Black: 218#(= (select |#valid| |thr1Thread1of2ForFork0_~#l~0#1.base|) 1), Black: 233#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (< (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296) 1) (= ~s~0 0)), Black: 240#(= (select |#valid| |thr1Thread2of2ForFork0_~#l~0#1.base|) 1), Black: 238#(= (select |#valid| |thr1Thread1of2ForFork0_~#l~0#1.base|) 1)]) [2023-08-26 18:16:50,114 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2023-08-26 18:16:50,114 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-08-26 18:16:50,114 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-08-26 18:16:50,114 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-08-26 18:16:50,115 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L718-3-->L719: Formula: (= v_~c~0_4 0) InVars {} OutVars{~c~0=v_~c~0_4} AuxVars[] AssignedVars[~c~0][1709], [Black: 252#(= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1), 54#L719true, 1979#true, Black: 1189#(not (= (mod (select (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))), Black: 1259#(and (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (not (= (mod ~c~0 4294967296) 1))), Black: 1282#(and (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 1268#(and (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), 695#(not (= (mod ~c~0 4294967296) 1)), Black: 1534#(and (or (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_41|) 0)))) (or (forall ((v_ArrVal_495 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_495) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (not (= (mod ~c~0 4294967296) 1))), Black: 1250#(and (= |thr1Thread1of2ForFork0_~#l~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (= ~t~0 1) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (exists ((|thr1Thread2of2ForFork0_~#l~0#1.base| Int) (|thr1Thread2of2ForFork0_~#l~0#1.offset| Int)) (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) 0)) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 1564#(and (or (forall ((v_ArrVal_495 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_495) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0)) (= (mod ~c~0 4294967296) 1)), Black: 1287#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (forall ((v_ArrVal_458 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_458) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (= (mod ~c~0 4294967296) 1)), Black: 1248#(and (= |thr1Thread1of2ForFork0_~#l~0#1.offset| 0) (not (= (mod (select (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (= ~t~0 1) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 1422#(= (mod ~c~0 4294967296) 1), Black: 1294#(and (not (= (mod (select (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1506#(and (forall ((|v_thr1Thread2of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select (store |#valid| |v_thr1Thread2of2ForFork0_~#l~0#1.base_41| 1) |ULTIMATE.start_main_~#t~1#1.base|) 0))) (or (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_41| Int) (|v_thr1Thread2of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select (store |#valid| |v_thr1Thread2of2ForFork0_~#l~0#1.base_41| 1) |v_thr1Thread1of2ForFork0_~#l~0#1.base_41|) 0))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296)))) (not (= (mod ~c~0 4294967296) 1))), Black: 1544#(and (or (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_41|) 0)))) (or (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0)) (or (forall ((v_ArrVal_495 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_495) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (= (mod ~c~0 4294967296) 1)), Black: 1292#(and (not (= (mod (select (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 1310#(and (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 1560#(and (or (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0) (and (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))))) (not (= (mod ~c~0 4294967296) 1))), Black: 1566#(and (or (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0) (and (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))))) (= (mod ~c~0 4294967296) 1)), Black: 1289#(and (forall ((v_ArrVal_458 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_458) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (not (= (mod ~c~0 4294967296) 1))), Black: 1246#(and (= |thr1Thread1of2ForFork0_~#l~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (= ~t~0 1) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 1284#(and (not (= (mod (select (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1492#(and (<= ~t~0 1) (or (not (= (mod (select (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0)) (= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 1096#true, Black: 1546#(and (or (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_41|) 0)))) (or (forall ((v_ArrVal_495 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_495) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (= (mod ~c~0 4294967296) 1)), Black: 1490#(and (<= ~t~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 1275#(and (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (= (mod ~c~0 4294967296) 1)), 400#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1542#(and (or (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_41|) 0)))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (= (mod ~c~0 4294967296) 1)), Black: 974#(or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_main_~#t~1#1.base|)) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))))), Black: 1303#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (forall ((v_ArrVal_458 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_458) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (not (= (mod ~c~0 4294967296) 1))), Black: 1570#(and (or (not (= (mod (select (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0)) (= (mod ~c~0 4294967296) 1)), Black: 1063#(and (or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_main_~#t~1#1.base|)) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))))) (= (mod ~c~0 4294967296) 1)), Black: 1296#(and (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1041#(and (or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_main_~#t~1#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))))) (= (mod ~c~0 4294967296) 1)), Black: 1572#(and (or (not (= (select |#valid| |thr1Thread2of2ForFork0_~#l~0#1.base|) 1)) (and (or (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_41|) 0)))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))))) (not (= (mod ~c~0 4294967296) 1))), Black: 1312#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (forall ((v_ArrVal_458 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_458) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (= (mod ~c~0 4294967296) 1)), Black: 1266#(and (= |thr1Thread1of2ForFork0_~#l~0#1.offset| 0) (forall ((v_ArrVal_458 (Array Int Int))) (not (= (mod (select (select (store (store |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base| (store (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset| ~t~0)) |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_458) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (= ~t~0 1) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (exists ((|thr1Thread2of2ForFork0_~#l~0#1.base| Int) (|thr1Thread2of2ForFork0_~#l~0#1.offset| Int)) (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) 0)) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 1558#(and (or (forall ((v_ArrVal_495 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_495) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0)) (not (= (mod ~c~0 4294967296) 1))), Black: 1532#(and (or (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_41|) 0)))) (or (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0)) (or (forall ((v_ArrVal_495 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_495) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (not (= (mod ~c~0 4294967296) 1))), Black: 1298#(and (forall ((v_ArrVal_458 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_458) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (= (mod ~c~0 4294967296) 1)), Black: 1530#(and (or (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_41|) 0)))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (not (= (mod ~c~0 4294967296) 1))), Black: 1067#(and (or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_main_~#t~1#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296)))) (not (= (mod ~c~0 4294967296) 1))) (or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (not (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))))), Black: 1498#(and (<= ~t~0 1) (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_main_~#t~1#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 1244#(and (= |thr1Thread1of2ForFork0_~#l~0#1.offset| 0) (forall ((v_ArrVal_458 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_458) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (= ~t~0 1) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (exists ((|thr1Thread2of2ForFork0_~#l~0#1.base| Int) (|thr1Thread2of2ForFork0_~#l~0#1.offset| Int)) (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) 0)) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 1305#(and (not (= (mod (select (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 1554#(and (or (not (= (mod (select (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (< |thr1Thread1of2ForFork0_~#l~0#1.offset| 0)) (not (= (mod ~c~0 4294967296) 1))), Black: 1500#(and (or (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_41| Int) (|v_thr1Thread2of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select (store |#valid| |v_thr1Thread2of2ForFork0_~#l~0#1.base_41| 1) |v_thr1Thread1of2ForFork0_~#l~0#1.base_41|) 0))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296)))) (or (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_41|) 0)))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (not (= (mod ~c~0 4294967296) 1))), Black: 859#true, Black: 1242#(and (= |thr1Thread1of2ForFork0_~#l~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (= ~t~0 1) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (exists ((|thr1Thread2of2ForFork0_~#l~0#1.base| Int) (|thr1Thread2of2ForFork0_~#l~0#1.offset| Int)) (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) 0)) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 1540#(and (forall ((|v_thr1Thread2of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select (store |#valid| |v_thr1Thread2of2ForFork0_~#l~0#1.base_41| 1) |ULTIMATE.start_main_~#t~1#1.base|) 0))) (or (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_41| Int) (|v_thr1Thread2of2ForFork0_~#l~0#1.base_41| Int)) (not (= (select (store |#valid| |v_thr1Thread2of2ForFork0_~#l~0#1.base_41| 1) |v_thr1Thread1of2ForFork0_~#l~0#1.base_41|) 0))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296)))) (= (mod ~c~0 4294967296) 1)), Black: 936#(= (mod ~c~0 4294967296) 1), Black: 1277#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (forall ((v_ArrVal_458 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_458) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (not (= (mod ~c~0 4294967296) 1))), Black: 1261#(and (not (= (mod (select (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (not (= (mod ~c~0 4294967296) 1))), Black: 1172#(= (mod ~c~0 4294967296) 1), Black: 1047#(and (or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296)))) (or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_main_~#t~1#1.base|)) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))))) (or (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread2of2ForFork0_~#l~0#1.base_37| Int)) (not (= (select |#valid| |v_thr1Thread2of2ForFork0_~#l~0#1.base_37|) 0)))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (not (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))))), Black: 1254#(and (or (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_39| Int)) (not (= (select |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_39|) 0)))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (not (= (mod ~c~0 4294967296) 1))), Black: 862#(and (= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1) (= ~t~0 0) (= ~s~0 0)), Black: 1300#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (forall ((v_ArrVal_458 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_458) |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (not (= (mod ~c~0 4294967296) 1))), Black: 891#(and (= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1) (= ~t~0 0) (= (select |#valid| |thr1Thread1of2ForFork0_~#l~0#1.base|) 1) (= ~s~0 0)), Black: 460#(and (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (<= |ULTIMATE.start_main_~#t~1#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#t~1#1.offset|) (= (select |#length| |ULTIMATE.start_main_~#t~1#1.base|) 4)), Black: 960#(or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_main_~#t~1#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))))), 44#L718-3true, Black: 1017#(and (or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_main_~#t~1#1.base|)) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))))) (or (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread2of2ForFork0_~#l~0#1.base_37| Int)) (not (= (select |#valid| |v_thr1Thread2of2ForFork0_~#l~0#1.base_37|) 0)))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|)))), Black: 808#(and (or (forall ((|v_thr1Thread2of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select |#valid| |v_thr1Thread2of2ForFork0_~#l~0#1.base_35|) 0))) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296)))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (= (mod ~c~0 4294967296) 1)), Black: 1602#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 1) (= ~s~0 0)), Black: 1606#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 1) (= ~s~0 0)), Black: 766#(and (not (= (mod ~c~0 4294967296) 1)) (or (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_35| Int) (|v_thr1Thread2of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select (store |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_35| 1) |v_thr1Thread2of2ForFork0_~#l~0#1.base_35|) 0)))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select (store |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_35| 1) |ULTIMATE.start_main_~#t~1#1.base|) 0)))), Black: 806#(and (or (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_35| Int) (|v_thr1Thread2of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select (store |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_35| 1) |v_thr1Thread2of2ForFork0_~#l~0#1.base_35|) 0)))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select (store |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_35| 1) |ULTIMATE.start_main_~#t~1#1.base|) 0))) (= (mod ~c~0 4294967296) 1)), Black: 824#(and (or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_main_~#t~1#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))))) (not (= (mod ~c~0 4294967296) 1))), Black: 688#(= (mod ~c~0 4294967296) 1), 174#true, Black: 822#(and (or (forall ((v_ArrVal_385 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_385) |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0)) (not (= (mod ~c~0 4294967296) 1))), 1904#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1615#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (< (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296) 1) (= ~s~0 0)), Black: 582#(= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1), Black: 830#(and (or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_main_~#t~1#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))))) (= (mod ~c~0 4294967296) 1)), Black: 587#(and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_main_~#t~1#1.base|)) (= (select |#valid| |thr1Thread2of2ForFork0_~#l~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1)), Black: 585#(= (select |#valid| |thr1Thread2of2ForFork0_~#l~0#1.base|) 1), 1432#(not (= (mod ~c~0 4294967296) 1)), Black: 836#(and (or (not (= (select |#valid| |thr1Thread1of2ForFork0_~#l~0#1.base|) 1)) (and (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (or (forall ((|v_thr1Thread2of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select |#valid| |v_thr1Thread2of2ForFork0_~#l~0#1.base_35|) 0))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296)))))) (not (= (mod ~c~0 4294967296) 1))), Black: 774#(and (or (forall ((|v_thr1Thread2of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select |#valid| |v_thr1Thread2of2ForFork0_~#l~0#1.base_35|) 0))) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296)))) (or (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_35| Int) (|v_thr1Thread2of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select (store |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_35| 1) |v_thr1Thread2of2ForFork0_~#l~0#1.base_35|) 0)))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select (store |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_35| 1) |ULTIMATE.start_main_~#t~1#1.base|) 0))) (= (mod ~c~0 4294967296) 1)), 236#true, Black: 828#(and (or (forall ((v_ArrVal_385 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~1#1.base| v_ArrVal_385) |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296)))) (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0)) (= (mod ~c~0 4294967296) 1)), Black: 796#(and (or (forall ((|v_thr1Thread2of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select |#valid| |v_thr1Thread2of2ForFork0_~#l~0#1.base_35|) 0))) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296)))) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|))) (not (= (mod ~c~0 4294967296) 1))), Black: 768#(and (or (forall ((|v_thr1Thread2of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select |#valid| |v_thr1Thread2of2ForFork0_~#l~0#1.base_35|) 0))) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296)))) (not (= (mod ~c~0 4294967296) 1)) (or (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_35| Int) (|v_thr1Thread2of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select (store |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_35| 1) |v_thr1Thread2of2ForFork0_~#l~0#1.base_35|) 0)))) (forall ((|v_thr1Thread1of2ForFork0_~#l~0#1.base_35| Int)) (not (= (select (store |#valid| |v_thr1Thread1of2ForFork0_~#l~0#1.base_35| 1) |ULTIMATE.start_main_~#t~1#1.base|) 0)))), Black: 1622#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), Black: 1620#(and (= ~t~0 0) (= ~s~0 0)), Black: 1627#(and (<= ~t~0 1) (<= 1 ~t~0) (= |thr1Thread2of2ForFork0_~#l~0#1.offset| |ULTIMATE.start_thr1_~#l~0#1.offset|) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), Black: 1625#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (< (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296) 1) (= ~s~0 0)), Black: 1624#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (<= 2 ~t~0) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (<= ~t~0 2) (= |thr1Thread2of2ForFork0_~#l~0#1.offset| |ULTIMATE.start_thr1_~#l~0#1.offset|) (= ~s~0 0)), Black: 597#true, 443#true, thr1Thread1of2ForFork0InUse, Black: 1639#(and (<= ~t~0 1) (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (<= 1 ~t~0) (= ~s~0 0)), thr1Thread2of2ForFork0InUse, Black: 1640#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (= ~s~0 0)), Black: 114#(= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1), Black: 1651#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 1) (= ~s~0 0)), Black: 120#(and (<= 0 |ULTIMATE.start_main_~#t~1#1.offset|) (<= (+ |ULTIMATE.start_main_~#t~1#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t~1#1.base|))), Black: 1655#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 1) (not (= |thr1Thread1of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (= ~s~0 0)), 580#true, Black: 126#(= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 1), 201#(= (select |#valid| |thr1Thread1of2ForFork0_~#l~0#1.base|) 1), Black: 1663#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), Black: 1666#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (< (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296) 1) (= ~s~0 0)), Black: 136#(= (select |#valid| |thr1Thread1of2ForFork0_~#l~0#1.base|) 1), Black: 1677#(and (<= ~t~0 1) (= |ULTIMATE.start_thr1_~#l~0#1.offset| |thr1Thread1of2ForFork0_~#l~0#1.offset|) (<= 1 ~t~0) (= ~s~0 0)), Black: 1678#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (= |ULTIMATE.start_thr1_~#l~0#1.offset| |thr1Thread1of2ForFork0_~#l~0#1.offset|) (<= 2 ~t~0) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (<= ~t~0 2) (= ~s~0 0)), Black: 146#(= ~c~0 1), Black: 1679#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (< (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296) 1) (= ~s~0 0)), 604#(= (select |#valid| |thr1Thread2of2ForFork0_~#l~0#1.base|) 1), Black: 1898#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (forall ((v_ArrVal_661 (Array Int Int))) (not (= (mod ~s~0 4294967296) (mod (select (select (store |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base| v_ArrVal_661) |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296)))) (not (= (mod ~c~0 4294967296) 1))), Black: 152#(and (<= 0 |ULTIMATE.start_main_~#t~1#1.offset|) (<= (+ |ULTIMATE.start_main_~#t~1#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t~1#1.base|))), Black: 1945#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), 964#(or (< |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_main_~#t~1#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296)))) (not (= (mod ~c~0 4294967296) 1))), Black: 1933#(and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1892#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1914#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 1861#(and (<= ~t~0 1) (<= 1 ~t~0) (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 1) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 1918#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1855#(and (<= ~t~0 1) (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (<= 1 ~t~0) (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 1) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 159#(= (select |#valid| |thr1Thread2of2ForFork0_~#l~0#1.base|) 1), Black: 408#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 1863#(and (<= ~t~0 1) (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (<= 1 ~t~0) (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 1) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 406#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), 1182#(not (= (mod ~c~0 4294967296) 1)), Black: 1941#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 1845#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 378#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1764#(= (mod ~c~0 4294967296) 1), Black: 418#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 376#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 1877#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1847#(and (<= ~t~0 1) (<= 1 ~t~0) (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 1) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 394#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1937#(and (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 386#(and (<= 1 (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|)) (< (div (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) 1) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 1884#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 325#(not (= (mod ~c~0 4294967296) 1)), Black: 169#(= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1), Black: 1853#(and (<= ~t~0 1) (<= 1 ~t~0) (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 1) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 396#(and (<= 1 (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|)) (< (div (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) 1) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 1900#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) 0) 1) (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), Black: 1920#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 414#(and (not (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1908#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1890#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 398#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= 1 (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) 0)) (= |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) 0) 1) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 1926#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) 0) 1) (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0) (= (mod ~c~0 4294967296) 1)), Black: 1771#(not (= (mod ~c~0 4294967296) 1)), Black: 404#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 1865#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (not (= |thr1Thread2of2ForFork0_~#l~0#1.base| |ULTIMATE.start_thr1_~#l~0#1.base|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 412#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 380#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1931#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 1857#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 384#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 416#(and (not (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 1902#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 318#(= (mod ~c~0 4294967296) 1), Black: 1943#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 402#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 1873#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 176#(= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 1), Black: 1916#(and (not (= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 0)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 374#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 388#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= 1 (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) 0)) (= |thr1Thread2of2ForFork0_~#l~0#1.offset| 0) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |thr1Thread2of2ForFork0_~#l~0#1.base|) 0) 1) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 1935#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 178#(= (select |#valid| |thr1Thread1of2ForFork0_~#l~0#1.base|) 1), Black: 191#(and (<= 1 (select (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|)) (< (div (select (select |#memory_int| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 4294967296) 1) (= ~s~0 0)), Black: 445#(= (select |#valid| |ULTIMATE.start_thr1_~#l~0#1.base|) 1), 2#ULTIMATE.startEXITtrue, Black: 447#(= (select |#valid| |thr1Thread2of2ForFork0_~#l~0#1.base|) 1), 213#true, Black: 195#true, Black: 203#(and (not (= |ULTIMATE.start_main_~#t~1#1.base| |thr1Thread1of2ForFork0_~#l~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1) (= (select |#valid| |thr1Thread1of2ForFork0_~#l~0#1.base|) 1)), Black: 197#(= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1), Black: 215#(= (select |#valid| |ULTIMATE.start_main_~#t~1#1.base|) 1), Black: 218#(= (select |#valid| |thr1Thread1of2ForFork0_~#l~0#1.base|) 1), Black: 233#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (< (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296) 1) (= ~s~0 0)), Black: 240#(= (select |#valid| |thr1Thread2of2ForFork0_~#l~0#1.base|) 1), Black: 238#(= (select |#valid| |thr1Thread1of2ForFork0_~#l~0#1.base|) 1)]) [2023-08-26 18:16:50,115 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2023-08-26 18:16:50,115 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-08-26 18:16:50,115 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-08-26 18:16:50,116 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-08-26 18:16:53,176 INFO L124 PetriNetUnfolderBase]: 17243/31615 cut-off events. [2023-08-26 18:16:53,176 INFO L125 PetriNetUnfolderBase]: For 2309434/2312932 co-relation queries the response was YES. [2023-08-26 18:16:53,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438815 conditions, 31615 events. 17243/31615 cut-off events. For 2309434/2312932 co-relation queries the response was YES. Maximal size of possible extension queue 1643. Compared 292742 event pairs, 901 based on Foata normal form. 664/31805 useless extension candidates. Maximal degree in co-relation 435623. Up to 12436 conditions per place. [2023-08-26 18:16:53,736 INFO L140 encePairwiseOnDemand]: 185/192 looper letters, 2938 selfloop transitions, 316 changer transitions 36/4030 dead transitions. [2023-08-26 18:16:53,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 4030 transitions, 111594 flow [2023-08-26 18:16:53,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:16:53,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:16:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 451 transitions. [2023-08-26 18:16:53,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3914930555555556 [2023-08-26 18:16:53,737 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 451 transitions. [2023-08-26 18:16:53,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 451 transitions. [2023-08-26 18:16:53,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:16:53,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 451 transitions. [2023-08-26 18:16:53,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:16:53,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:16:53,739 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:16:53,739 INFO L175 Difference]: Start difference. First operand has 524 places, 3725 transitions, 99771 flow. Second operand 6 states and 451 transitions. [2023-08-26 18:16:53,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 4030 transitions, 111594 flow [2023-08-26 18:17:35,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 4030 transitions, 109525 flow, removed 512 selfloop flow, removed 19 redundant places. [2023-08-26 18:17:35,606 INFO L231 Difference]: Finished difference. Result has 494 places, 3717 transitions, 98378 flow [2023-08-26 18:17:35,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=97856, PETRI_DIFFERENCE_MINUEND_PLACES=488, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3724, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=314, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=98378, PETRI_PLACES=494, PETRI_TRANSITIONS=3717} [2023-08-26 18:17:35,608 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 435 predicate places. [2023-08-26 18:17:35,608 INFO L495 AbstractCegarLoop]: Abstraction has has 494 places, 3717 transitions, 98378 flow [2023-08-26 18:17:35,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.666666666666664) internal successors, (382), 6 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:35,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:35,609 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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:17:35,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2023-08-26 18:17:35,609 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 18:17:35,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:35,609 INFO L85 PathProgramCache]: Analyzing trace with hash -915482492, now seen corresponding path program 1 times [2023-08-26 18:17:35,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:35,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612309517] [2023-08-26 18:17:35,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:35,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:35,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:17:35,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:35,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612309517] [2023-08-26 18:17:35,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612309517] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:35,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:35,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:17:35,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321227944] [2023-08-26 18:17:35,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:35,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:17:35,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:35,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:17:35,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:17:35,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 192 [2023-08-26 18:17:35,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 3717 transitions, 98378 flow. Second operand has 5 states, 5 states have (on average 64.2) internal successors, (321), 5 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:35,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:35,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 192 [2023-08-26 18:17:35,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:10,150 INFO L124 PetriNetUnfolderBase]: 26818/48844 cut-off events. [2023-08-26 18:18:10,150 INFO L125 PetriNetUnfolderBase]: For 3584634/3589846 co-relation queries the response was YES. [2023-08-26 18:18:10,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671756 conditions, 48844 events. 26818/48844 cut-off events. For 3584634/3589846 co-relation queries the response was YES. Maximal size of possible extension queue 2599. Compared 478069 event pairs, 1609 based on Foata normal form. 782/48832 useless extension candidates. Maximal degree in co-relation 669735. Up to 17996 conditions per place. [2023-08-26 18:18:11,201 INFO L140 encePairwiseOnDemand]: 181/192 looper letters, 4103 selfloop transitions, 765 changer transitions 192/5800 dead transitions. [2023-08-26 18:18:11,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 5800 transitions, 158357 flow [2023-08-26 18:18:11,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:18:11,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:18:11,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 476 transitions. [2023-08-26 18:18:11,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4131944444444444 [2023-08-26 18:18:11,202 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 476 transitions. [2023-08-26 18:18:11,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 476 transitions. [2023-08-26 18:18:11,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:11,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 476 transitions. [2023-08-26 18:18:11,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 79.33333333333333) internal successors, (476), 6 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:11,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call 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:11,203 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call 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:11,203 INFO L175 Difference]: Start difference. First operand has 494 places, 3717 transitions, 98378 flow. Second operand 6 states and 476 transitions. [2023-08-26 18:18:11,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 499 places, 5800 transitions, 158357 flow Received shutdown request... [2023-08-26 18:18:43,298 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 18:18:43,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 22 remaining) [2023-08-26 18:18:43,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2023-08-26 18:18:43,457 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2023-08-26 18:18:43,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 22 remaining) [2023-08-26 18:18:43,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 22 remaining) [2023-08-26 18:18:43,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 22 remaining) [2023-08-26 18:18:43,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 22 remaining) [2023-08-26 18:18:43,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (16 of 22 remaining) [2023-08-26 18:18:43,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 22 remaining) [2023-08-26 18:18:43,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 22 remaining) [2023-08-26 18:18:43,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 22 remaining) [2023-08-26 18:18:43,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err4ASSERT_VIOLATIONASSERT (12 of 22 remaining) [2023-08-26 18:18:43,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 22 remaining) [2023-08-26 18:18:43,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 22 remaining) [2023-08-26 18:18:43,458 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 22 remaining) [2023-08-26 18:18:43,458 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 22 remaining) [2023-08-26 18:18:43,458 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 22 remaining) [2023-08-26 18:18:43,458 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err4ASSERT_VIOLATIONASSERT (6 of 22 remaining) [2023-08-26 18:18:43,458 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 22 remaining) [2023-08-26 18:18:43,458 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err4ASSERT_VIOLATIONASSERT (4 of 22 remaining) [2023-08-26 18:18:43,458 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 22 remaining) [2023-08-26 18:18:43,458 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 22 remaining) [2023-08-26 18:18:43,458 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 22 remaining) [2023-08-26 18:18:43,458 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 22 remaining) [2023-08-26 18:18:43,458 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:43,458 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-08-26 18:18:43,459 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-26 18:18:43,459 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:18:43,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:18:43 BasicIcfg [2023-08-26 18:18:43,461 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:18:43,462 INFO L158 Benchmark]: Toolchain (without parser) took 825884.64ms. Allocated memory was 341.8MB in the beginning and 9.8GB in the end (delta: 9.5GB). Free memory was 316.9MB in the beginning and 5.7GB in the end (delta: -5.4GB). Peak memory consumption was 5.2GB. Max. memory is 16.0GB. [2023-08-26 18:18:43,462 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 341.8MB. Free memory is still 317.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:18:43,462 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.47ms. Allocated memory is still 341.8MB. Free memory was 316.9MB in the beginning and 297.1MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-26 18:18:43,462 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.92ms. Allocated memory is still 341.8MB. Free memory was 296.7MB in the beginning and 294.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:18:43,462 INFO L158 Benchmark]: Boogie Preprocessor took 30.24ms. Allocated memory is still 341.8MB. Free memory was 294.6MB in the beginning and 293.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:18:43,462 INFO L158 Benchmark]: RCFGBuilder took 431.48ms. Allocated memory is still 341.8MB. Free memory was 292.9MB in the beginning and 268.2MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 18:18:43,463 INFO L158 Benchmark]: TraceAbstraction took 825021.19ms. Allocated memory was 341.8MB in the beginning and 9.8GB in the end (delta: 9.5GB). Free memory was 267.7MB in the beginning and 5.7GB in the end (delta: -5.5GB). Peak memory consumption was 5.2GB. Max. memory is 16.0GB. [2023-08-26 18:18:43,463 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 341.8MB. Free memory is still 317.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 363.47ms. Allocated memory is still 341.8MB. Free memory was 316.9MB in the beginning and 297.1MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 32.92ms. Allocated memory is still 341.8MB. Free memory was 296.7MB in the beginning and 294.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.24ms. Allocated memory is still 341.8MB. Free memory was 294.6MB in the beginning and 293.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 431.48ms. Allocated memory is still 341.8MB. Free memory was 292.9MB in the beginning and 268.2MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * TraceAbstraction took 825021.19ms. Allocated memory was 341.8MB in the beginning and 9.8GB in the end (delta: 9.5GB). Free memory was 267.7MB in the beginning and 5.7GB in the end (delta: -5.5GB). Peak memory consumption was 5.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 270]: Unsoundness Warning unspecified type, defaulting to int C: short [270] - GenericResultAtLocation [Line: 270]: Unsoundness Warning unspecified type, defaulting to int C: short [270] - GenericResultAtLocation [Line: 705]: Unsoundness Warning unspecified type, defaulting to int C: volatile unsigned [705] - GenericResultAtLocation [Line: 706]: Unsoundness Warning unspecified type, defaulting to int C: volatile unsigned [706] - GenericResultAtLocation [Line: 707]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [707] - GenericResultAtLocation [Line: 713]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [713] - GenericResultAtLocation [Line: 716]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [716] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 84 PlacesBefore, 39 PlacesAfterwards, 88 TransitionsBefore, 40 TransitionsAfterwards, 2450 CoEnabledTransitionPairs, 5 FixpointIterations, 12 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 3 ChoiceCompositions, 66 TotalNumberOfCompositions, 7035 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2521, independent: 2280, independent conditional: 0, independent unconditional: 2280, dependent: 241, dependent conditional: 0, dependent unconditional: 241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1283, independent: 1228, independent conditional: 0, independent unconditional: 1228, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2521, independent: 1052, independent conditional: 0, independent unconditional: 1052, dependent: 186, dependent conditional: 0, dependent unconditional: 186, unknown: 1283, unknown conditional: 0, unknown unconditional: 1283] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 111, Positive conditional cache size: 0, Positive unconditional cache size: 111, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 84 PlacesBefore, 40 PlacesAfterwards, 88 TransitionsBefore, 42 TransitionsAfterwards, 2450 CoEnabledTransitionPairs, 5 FixpointIterations, 12 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 66 TotalNumberOfCompositions, 7511 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2583, independent: 2326, independent conditional: 0, independent unconditional: 2326, dependent: 257, dependent conditional: 0, dependent unconditional: 257, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1265, independent: 1217, independent conditional: 0, independent unconditional: 1217, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2583, independent: 1109, independent conditional: 0, independent unconditional: 1109, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 1265, unknown conditional: 0, unknown unconditional: 1265] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 109 PlacesBefore, 59 PlacesAfterwards, 114 TransitionsBefore, 62 TransitionsAfterwards, 6200 CoEnabledTransitionPairs, 4 FixpointIterations, 12 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 2 ChoiceCompositions, 78 TotalNumberOfCompositions, 18730 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5656, independent: 5334, independent conditional: 0, independent unconditional: 5334, dependent: 322, dependent conditional: 0, dependent unconditional: 322, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2976, independent: 2907, independent conditional: 0, independent unconditional: 2907, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5656, independent: 2427, independent conditional: 0, independent unconditional: 2427, dependent: 253, dependent conditional: 0, dependent unconditional: 253, unknown: 2976, unknown conditional: 0, unknown unconditional: 2976] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 280, Positive conditional cache size: 0, Positive unconditional cache size: 280, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 105 locations, 18 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: 3.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 255 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 255 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 891 IncrementalHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 15 mSDtfsCounter, 891 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=10, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 6/6 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 128 locations, 23 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: 820.4s, OverallIterations: 37, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 811.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.1s, HoareTripleCheckerStatistics: 387 mSolverCounterUnknown, 5603 SdHoareTripleChecker+Valid, 13.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5603 mSDsluCounter, 2325 SdHoareTripleChecker+Invalid, 11.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1644 IncrementalHoareTripleChecker+Unchecked, 2004 mSDsCounter, 1353 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17986 IncrementalHoareTripleChecker+Invalid, 21370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1353 mSolverCounterUnsat, 321 mSDtfsCounter, 17986 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 725 GetRequests, 239 SyntacticMatches, 18 SemanticMatches, 468 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 6881 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99771occurred in iteration=35, InterpolantAutomatonStates: 430, 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.3s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 732 NumberOfCodeBlocks, 728 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 824 ConstructedInterpolants, 57 QuantifiedInterpolants, 8201 SizeOfPredicates, 72 NumberOfNonLiveVariables, 1370 ConjunctsInSsa, 247 ConjunctsInUnsatCore, 51 InterpolantComputations, 30 PerfectInterpolantSequences, 119/205 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 105 locations, 18 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: 1.0s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.9s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 could not prove your program: Timeout Completed graceful shutdown