/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/40_barrier_vf.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 17:59:47,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 17:59:47,178 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 17:59:47,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 17:59:47,183 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 17:59:47,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 17:59:47,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 17:59:47,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 17:59:47,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 17:59:47,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 17:59:47,227 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 17:59:47,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 17:59:47,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 17:59:47,229 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 17:59:47,229 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 17:59:47,229 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 17:59:47,230 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 17:59:47,230 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 17:59:47,230 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 17:59:47,230 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 17:59:47,230 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 17:59:47,231 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 17:59:47,231 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 17:59:47,232 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 17:59:47,232 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 17:59:47,232 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 17:59:47,233 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 17:59:47,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 17:59:47,233 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 17:59:47,233 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 17:59:47,234 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 17:59:47,234 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 17:59:47,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 17:59:47,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 17:59:47,235 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 17:59:47,235 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 17:59:47,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 17:59:47,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 17:59:47,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 17:59:47,555 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 17:59:47,556 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 17:59:47,557 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/40_barrier_vf.i [2023-08-26 17:59:48,645 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 17:59:48,875 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 17:59:48,875 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/40_barrier_vf.i [2023-08-26 17:59:48,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa24ff0b/38d5a31319074a37b0d0d5f54e87baf4/FLAGb13478965 [2023-08-26 17:59:48,907 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa24ff0b/38d5a31319074a37b0d0d5f54e87baf4 [2023-08-26 17:59:48,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 17:59:48,912 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 17:59:48,912 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 17:59:48,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 17:59:48,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 17:59:48,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 05:59:48" (1/1) ... [2023-08-26 17:59:48,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b1a691f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:59:48, skipping insertion in model container [2023-08-26 17:59:48,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 05:59:48" (1/1) ... [2023-08-26 17:59:48,971 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 17:59:49,153 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-26 17:59:49,297 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 17:59:49,310 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 17:59:49,330 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-26 17:59:49,340 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [269] [2023-08-26 17:59:49,342 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [269] [2023-08-26 17:59:49,360 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 17:59:49,392 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 17:59:49,393 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 17:59:49,393 WARN L669 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 17:59:49,399 INFO L206 MainTranslator]: Completed translation [2023-08-26 17:59:49,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:59:49 WrapperNode [2023-08-26 17:59:49,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 17:59:49,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 17:59:49,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 17:59:49,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 17:59:49,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:59:49" (1/1) ... [2023-08-26 17:59:49,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:59:49" (1/1) ... [2023-08-26 17:59:49,458 INFO L138 Inliner]: procedures = 174, calls = 26, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 81 [2023-08-26 17:59:49,458 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 17:59:49,459 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 17:59:49,460 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 17:59:49,460 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 17:59:49,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:59:49" (1/1) ... [2023-08-26 17:59:49,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:59:49" (1/1) ... [2023-08-26 17:59:49,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:59:49" (1/1) ... [2023-08-26 17:59:49,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:59:49" (1/1) ... [2023-08-26 17:59:49,488 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:59:49" (1/1) ... [2023-08-26 17:59:49,490 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:59:49" (1/1) ... [2023-08-26 17:59:49,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:59:49" (1/1) ... [2023-08-26 17:59:49,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:59:49" (1/1) ... [2023-08-26 17:59:49,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 17:59:49,495 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 17:59:49,495 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 17:59:49,495 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 17:59:49,495 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:59:49" (1/1) ... [2023-08-26 17:59:49,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 17:59:49,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 17:59:49,526 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 17:59:49,542 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 17:59:49,574 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-26 17:59:49,574 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-26 17:59:49,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 17:59:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 17:59:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 17:59:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 17:59:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 17:59:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 17:59:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 17:59:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 17:59:49,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 17:59:49,578 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 17:59:49,697 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 17:59:49,698 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 17:59:49,887 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 17:59:49,966 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 17:59:49,966 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-26 17:59:49,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 05:59:49 BoogieIcfgContainer [2023-08-26 17:59:49,968 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 17:59:49,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 17:59:49,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 17:59:49,978 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 17:59:49,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 05:59:48" (1/3) ... [2023-08-26 17:59:49,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81b57c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 05:59:49, skipping insertion in model container [2023-08-26 17:59:49,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:59:49" (2/3) ... [2023-08-26 17:59:49,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81b57c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 05:59:49, skipping insertion in model container [2023-08-26 17:59:49,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 05:59:49" (3/3) ... [2023-08-26 17:59:49,981 INFO L112 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf.i [2023-08-26 17:59:49,996 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 17:59:49,997 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-08-26 17:59:49,998 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 17:59:50,053 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 17:59:50,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 55 transitions, 115 flow [2023-08-26 17:59:50,120 INFO L124 PetriNetUnfolderBase]: 5/67 cut-off events. [2023-08-26 17:59:50,121 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 17:59:50,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 67 events. 5/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 87 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 40. Up to 4 conditions per place. [2023-08-26 17:59:50,125 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 55 transitions, 115 flow [2023-08-26 17:59:50,132 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 55 transitions, 115 flow [2023-08-26 17:59:50,136 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 17:59:50,146 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 55 transitions, 115 flow [2023-08-26 17:59:50,148 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 55 transitions, 115 flow [2023-08-26 17:59:50,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 55 transitions, 115 flow [2023-08-26 17:59:50,161 INFO L124 PetriNetUnfolderBase]: 5/67 cut-off events. [2023-08-26 17:59:50,161 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 17:59:50,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 67 events. 5/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 87 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 40. Up to 4 conditions per place. [2023-08-26 17:59:50,162 INFO L119 LiptonReduction]: Number of co-enabled transitions 780 [2023-08-26 17:59:52,355 INFO L134 LiptonReduction]: Checked pairs total: 716 [2023-08-26 17:59:52,356 INFO L136 LiptonReduction]: Total number of compositions: 59 [2023-08-26 17:59:52,387 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 17:59:52,392 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;@3c256261, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 17:59:52,392 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-26 17:59:52,395 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 17:59:52,395 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-26 17:59:52,395 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 17:59:52,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:59:52,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 17:59:52,396 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE] === [2023-08-26 17:59:52,400 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:59:52,400 INFO L85 PathProgramCache]: Analyzing trace with hash 10716, now seen corresponding path program 1 times [2023-08-26 17:59:52,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:59:52,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024224331] [2023-08-26 17:59:52,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:59:52,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:59:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:59:52,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:59:52,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:59:52,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024224331] [2023-08-26 17:59:52,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024224331] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:59:52,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:59:52,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 17:59:52,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582285880] [2023-08-26 17:59:52,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:59:52,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:59:52,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:59:52,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:59:52,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:59:52,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 114 [2023-08-26 17:59:52,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 13 places, 10 transitions, 25 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:52,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:59:52,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 114 [2023-08-26 17:59:52,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:59:52,676 INFO L124 PetriNetUnfolderBase]: 3/15 cut-off events. [2023-08-26 17:59:52,676 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 17:59:52,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 15 events. 3/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 20 event pairs, 3 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 20. Up to 14 conditions per place. [2023-08-26 17:59:52,677 INFO L140 encePairwiseOnDemand]: 110/114 looper letters, 5 selfloop transitions, 1 changer transitions 0/7 dead transitions. [2023-08-26 17:59:52,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 12 places, 7 transitions, 31 flow [2023-08-26 17:59:52,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:59:52,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:59:52,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2023-08-26 17:59:52,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3157894736842105 [2023-08-26 17:59:52,694 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 108 transitions. [2023-08-26 17:59:52,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 108 transitions. [2023-08-26 17:59:52,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:59:52,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 108 transitions. [2023-08-26 17:59:52,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:52,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:52,706 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:52,708 INFO L175 Difference]: Start difference. First operand has 13 places, 10 transitions, 25 flow. Second operand 3 states and 108 transitions. [2023-08-26 17:59:52,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 12 places, 7 transitions, 31 flow [2023-08-26 17:59:52,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 12 places, 7 transitions, 31 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 17:59:52,711 INFO L231 Difference]: Finished difference. Result has 12 places, 7 transitions, 21 flow [2023-08-26 17:59:52,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=19, PETRI_DIFFERENCE_MINUEND_PLACES=10, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=21, PETRI_PLACES=12, PETRI_TRANSITIONS=7} [2023-08-26 17:59:52,718 INFO L281 CegarLoopForPetriNet]: 13 programPoint places, -1 predicate places. [2023-08-26 17:59:52,719 INFO L495 AbstractCegarLoop]: Abstraction has has 12 places, 7 transitions, 21 flow [2023-08-26 17:59:52,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:52,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:59:52,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 17:59:52,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 17:59:52,720 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE] === [2023-08-26 17:59:52,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:59:52,728 INFO L85 PathProgramCache]: Analyzing trace with hash 10717, now seen corresponding path program 1 times [2023-08-26 17:59:52,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:59:52,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498499101] [2023-08-26 17:59:52,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:59:52,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:59:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:59:52,824 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 17:59:52,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:59:52,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498499101] [2023-08-26 17:59:52,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498499101] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:59:52,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:59:52,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 17:59:52,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314187703] [2023-08-26 17:59:52,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:59:52,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:59:52,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:59:52,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:59:52,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:59:52,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 114 [2023-08-26 17:59:52,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 12 places, 7 transitions, 21 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:52,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:59:52,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 114 [2023-08-26 17:59:52,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:59:52,836 INFO L124 PetriNetUnfolderBase]: 2/11 cut-off events. [2023-08-26 17:59:52,836 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 17:59:52,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 11 events. 2/11 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 2 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 22. Up to 10 conditions per place. [2023-08-26 17:59:52,837 INFO L140 encePairwiseOnDemand]: 112/114 looper letters, 4 selfloop transitions, 1 changer transitions 0/6 dead transitions. [2023-08-26 17:59:52,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 13 places, 6 transitions, 29 flow [2023-08-26 17:59:52,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:59:52,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:59:52,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2023-08-26 17:59:52,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3157894736842105 [2023-08-26 17:59:52,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 108 transitions. [2023-08-26 17:59:52,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 108 transitions. [2023-08-26 17:59:52,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:59:52,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 108 transitions. [2023-08-26 17:59:52,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:52,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:52,844 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:52,844 INFO L175 Difference]: Start difference. First operand has 12 places, 7 transitions, 21 flow. Second operand 3 states and 108 transitions. [2023-08-26 17:59:52,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 13 places, 6 transitions, 29 flow [2023-08-26 17:59:52,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 12 places, 6 transitions, 28 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 17:59:52,844 INFO L231 Difference]: Finished difference. Result has 12 places, 6 transitions, 20 flow [2023-08-26 17:59:52,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=18, PETRI_DIFFERENCE_MINUEND_PLACES=10, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=5, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=20, PETRI_PLACES=12, PETRI_TRANSITIONS=6} [2023-08-26 17:59:52,845 INFO L281 CegarLoopForPetriNet]: 13 programPoint places, -1 predicate places. [2023-08-26 17:59:52,845 INFO L495 AbstractCegarLoop]: Abstraction has has 12 places, 6 transitions, 20 flow [2023-08-26 17:59:52,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:52,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:59:52,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 17:59:52,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 17:59:52,846 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE] === [2023-08-26 17:59:52,847 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:59:52,847 INFO L85 PathProgramCache]: Analyzing trace with hash 10305237, now seen corresponding path program 1 times [2023-08-26 17:59:52,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:59:52,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648044544] [2023-08-26 17:59:52,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:59:52,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:59:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:59:52,973 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 17:59:52,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:59:52,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648044544] [2023-08-26 17:59:52,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648044544] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:59:52,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:59:52,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 17:59:52,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172374510] [2023-08-26 17:59:52,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:59:52,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:59:52,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:59:52,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:59:52,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:59:52,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 114 [2023-08-26 17:59:52,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 12 places, 6 transitions, 20 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:52,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:59:52,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 114 [2023-08-26 17:59:52,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:59:52,982 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-26 17:59:52,982 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 17:59:52,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20 conditions, 6 events. 0/6 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 3/9 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2023-08-26 17:59:52,982 INFO L140 encePairwiseOnDemand]: 112/114 looper letters, 0 selfloop transitions, 0 changer transitions 5/5 dead transitions. [2023-08-26 17:59:52,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 13 places, 5 transitions, 26 flow [2023-08-26 17:59:52,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:59:52,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:59:52,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2023-08-26 17:59:52,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3128654970760234 [2023-08-26 17:59:52,984 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 107 transitions. [2023-08-26 17:59:52,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 107 transitions. [2023-08-26 17:59:52,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:59:52,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 107 transitions. [2023-08-26 17:59:52,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:52,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:52,986 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:52,987 INFO L175 Difference]: Start difference. First operand has 12 places, 6 transitions, 20 flow. Second operand 3 states and 107 transitions. [2023-08-26 17:59:52,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 13 places, 5 transitions, 26 flow [2023-08-26 17:59:52,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 12 places, 5 transitions, 25 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 17:59:52,987 INFO L231 Difference]: Finished difference. Result has 12 places, 0 transitions, 0 flow [2023-08-26 17:59:52,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=10, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=5, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=12, PETRI_TRANSITIONS=0} [2023-08-26 17:59:52,988 INFO L281 CegarLoopForPetriNet]: 13 programPoint places, -1 predicate places. [2023-08-26 17:59:52,988 INFO L495 AbstractCegarLoop]: Abstraction has has 12 places, 0 transitions, 0 flow [2023-08-26 17:59:52,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:52,990 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 4 remaining) [2023-08-26 17:59:52,991 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONASSERT (2 of 4 remaining) [2023-08-26 17:59:52,991 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONASSERT (1 of 4 remaining) [2023-08-26 17:59:52,991 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 4 remaining) [2023-08-26 17:59:52,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 17:59:52,992 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-26 17:59:52,993 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-26 17:59:52,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 55 transitions, 115 flow [2023-08-26 17:59:53,007 INFO L124 PetriNetUnfolderBase]: 5/67 cut-off events. [2023-08-26 17:59:53,007 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 17:59:53,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 67 events. 5/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 87 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 40. Up to 4 conditions per place. [2023-08-26 17:59:53,007 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 55 transitions, 115 flow [2023-08-26 17:59:53,008 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 55 transitions, 115 flow [2023-08-26 17:59:53,008 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 17:59:53,008 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 55 transitions, 115 flow [2023-08-26 17:59:53,009 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 55 transitions, 115 flow [2023-08-26 17:59:53,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 55 transitions, 115 flow [2023-08-26 17:59:53,018 INFO L124 PetriNetUnfolderBase]: 5/67 cut-off events. [2023-08-26 17:59:53,018 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 17:59:53,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 67 events. 5/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 87 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 40. Up to 4 conditions per place. [2023-08-26 17:59:53,019 INFO L119 LiptonReduction]: Number of co-enabled transitions 780 [2023-08-26 17:59:54,816 INFO L134 LiptonReduction]: Checked pairs total: 716 [2023-08-26 17:59:54,817 INFO L136 LiptonReduction]: Total number of compositions: 59 [2023-08-26 17:59:54,825 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-26 17:59:54,827 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;@3c256261, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 17:59:54,828 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-26 17:59:54,835 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 17:59:54,835 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-08-26 17:59:54,835 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 17:59:54,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:59:54,835 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-26 17:59:54,835 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 17:59:54,836 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:59:54,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1181607696, now seen corresponding path program 1 times [2023-08-26 17:59:54,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:59:54,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312744910] [2023-08-26 17:59:54,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:59:54,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:59:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 17:59:54,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 17:59:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 17:59:54,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 17:59:54,891 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 17:59:54,891 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-26 17:59:54,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 17:59:54,892 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-26 17:59:54,892 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-26 17:59:54,893 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-26 17:59:54,893 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-26 17:59:54,908 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 17:59:54,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 82 transitions, 176 flow [2023-08-26 17:59:54,935 INFO L124 PetriNetUnfolderBase]: 9/108 cut-off events. [2023-08-26 17:59:54,935 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 17:59:54,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 9/108 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 240 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 68. Up to 6 conditions per place. [2023-08-26 17:59:54,936 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 82 transitions, 176 flow [2023-08-26 17:59:54,937 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 82 transitions, 176 flow [2023-08-26 17:59:54,937 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 17:59:54,938 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 82 transitions, 176 flow [2023-08-26 17:59:54,938 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 82 transitions, 176 flow [2023-08-26 17:59:54,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 82 transitions, 176 flow [2023-08-26 17:59:54,948 INFO L124 PetriNetUnfolderBase]: 9/108 cut-off events. [2023-08-26 17:59:54,948 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 17:59:54,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 9/108 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 240 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 68. Up to 6 conditions per place. [2023-08-26 17:59:54,951 INFO L119 LiptonReduction]: Number of co-enabled transitions 2964 [2023-08-26 17:59:55,871 INFO L134 LiptonReduction]: Checked pairs total: 10123 [2023-08-26 17:59:55,871 INFO L136 LiptonReduction]: Total number of compositions: 67 [2023-08-26 17:59:55,873 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 17:59:55,874 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;@3c256261, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 17:59:55,874 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-26 17:59:55,875 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 17:59:55,875 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 17:59:55,875 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 17:59:55,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:59:55,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 17:59:55,876 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 1 more)] === [2023-08-26 17:59:55,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:59:55,876 INFO L85 PathProgramCache]: Analyzing trace with hash 18392, now seen corresponding path program 1 times [2023-08-26 17:59:55,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:59:55,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124412192] [2023-08-26 17:59:55,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:59:55,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:59:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:59:55,924 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 17:59:55,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:59:55,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124412192] [2023-08-26 17:59:55,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124412192] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:59:55,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:59:55,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 17:59:55,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393663303] [2023-08-26 17:59:55,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:59:55,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:59:55,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:59:55,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:59:55,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:59:55,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 149 [2023-08-26 17:59:55,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:55,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:59:55,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 149 [2023-08-26 17:59:55,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:59:56,038 INFO L124 PetriNetUnfolderBase]: 402/791 cut-off events. [2023-08-26 17:59:56,038 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-08-26 17:59:56,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1488 conditions, 791 events. 402/791 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4798 event pairs, 345 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 601. Up to 657 conditions per place. [2023-08-26 17:59:56,045 INFO L140 encePairwiseOnDemand]: 144/149 looper letters, 20 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-08-26 17:59:56,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 34 transitions, 122 flow [2023-08-26 17:59:56,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:59:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:59:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 178 transitions. [2023-08-26 17:59:56,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3982102908277405 [2023-08-26 17:59:56,048 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 178 transitions. [2023-08-26 17:59:56,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 178 transitions. [2023-08-26 17:59:56,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:59:56,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 178 transitions. [2023-08-26 17:59:56,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:56,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:56,051 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:56,051 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 88 flow. Second operand 3 states and 178 transitions. [2023-08-26 17:59:56,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 34 transitions, 122 flow [2023-08-26 17:59:56,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 120 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-26 17:59:56,052 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 80 flow [2023-08-26 17:59:56,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2023-08-26 17:59:56,053 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-08-26 17:59:56,054 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 80 flow [2023-08-26 17:59:56,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:56,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:59:56,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 17:59:56,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 17:59:56,054 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 1 more)] === [2023-08-26 17:59:56,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:59:56,055 INFO L85 PathProgramCache]: Analyzing trace with hash 18391, now seen corresponding path program 1 times [2023-08-26 17:59:56,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:59:56,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502635337] [2023-08-26 17:59:56,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:59:56,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:59:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:59:56,076 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 17:59:56,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:59:56,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502635337] [2023-08-26 17:59:56,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502635337] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:59:56,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:59:56,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 17:59:56,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169290560] [2023-08-26 17:59:56,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:59:56,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:59:56,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:59:56,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:59:56,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:59:56,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 149 [2023-08-26 17:59:56,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:56,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:59:56,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 149 [2023-08-26 17:59:56,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:59:56,134 INFO L124 PetriNetUnfolderBase]: 243/508 cut-off events. [2023-08-26 17:59:56,134 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-08-26 17:59:56,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 508 events. 243/508 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2821 event pairs, 205 based on Foata normal form. 0/449 useless extension candidates. Maximal degree in co-relation 950. Up to 413 conditions per place. [2023-08-26 17:59:56,138 INFO L140 encePairwiseOnDemand]: 147/149 looper letters, 19 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-08-26 17:59:56,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 118 flow [2023-08-26 17:59:56,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:59:56,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:59:56,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2023-08-26 17:59:56,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3825503355704698 [2023-08-26 17:59:56,139 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 171 transitions. [2023-08-26 17:59:56,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 171 transitions. [2023-08-26 17:59:56,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:59:56,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 171 transitions. [2023-08-26 17:59:56,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:56,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:56,142 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:56,142 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 80 flow. Second operand 3 states and 171 transitions. [2023-08-26 17:59:56,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 118 flow [2023-08-26 17:59:56,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 117 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 17:59:56,144 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 79 flow [2023-08-26 17:59:56,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2023-08-26 17:59:56,144 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-08-26 17:59:56,145 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 79 flow [2023-08-26 17:59:56,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:56,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:59:56,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:59:56,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 17:59:56,145 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [thr1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 1 more)] === [2023-08-26 17:59:56,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:59:56,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1731706077, now seen corresponding path program 1 times [2023-08-26 17:59:56,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:59:56,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242598741] [2023-08-26 17:59:56,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:59:56,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:59:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:59:56,249 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 17:59:56,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:59:56,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242598741] [2023-08-26 17:59:56,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242598741] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:59:56,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:59:56,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 17:59:56,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109565786] [2023-08-26 17:59:56,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:59:56,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 17:59:56,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:59:56,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 17:59:56,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 17:59:56,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 149 [2023-08-26 17:59:56,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 79 flow. Second operand has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:56,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:59:56,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 149 [2023-08-26 17:59:56,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:59:56,494 INFO L124 PetriNetUnfolderBase]: 689/1293 cut-off events. [2023-08-26 17:59:56,495 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-08-26 17:59:56,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2533 conditions, 1293 events. 689/1293 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 8310 event pairs, 99 based on Foata normal form. 0/1226 useless extension candidates. Maximal degree in co-relation 2524. Up to 457 conditions per place. [2023-08-26 17:59:56,505 INFO L140 encePairwiseOnDemand]: 140/149 looper letters, 77 selfloop transitions, 18 changer transitions 0/102 dead transitions. [2023-08-26 17:59:56,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 102 transitions, 422 flow [2023-08-26 17:59:56,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 17:59:56,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 17:59:56,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 430 transitions. [2023-08-26 17:59:56,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41227229146692235 [2023-08-26 17:59:56,511 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 430 transitions. [2023-08-26 17:59:56,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 430 transitions. [2023-08-26 17:59:56,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:59:56,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 430 transitions. [2023-08-26 17:59:56,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 61.42857142857143) internal successors, (430), 7 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 17:59:56,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:56,517 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:56,517 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 79 flow. Second operand 7 states and 430 transitions. [2023-08-26 17:59:56,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 102 transitions, 422 flow [2023-08-26 17:59:56,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 102 transitions, 421 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 17:59:56,520 INFO L231 Difference]: Finished difference. Result has 50 places, 50 transitions, 210 flow [2023-08-26 17:59:56,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=210, PETRI_PLACES=50, PETRI_TRANSITIONS=50} [2023-08-26 17:59:56,522 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2023-08-26 17:59:56,522 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 50 transitions, 210 flow [2023-08-26 17:59:56,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:56,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:59:56,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:59:56,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 17:59:56,523 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [thr1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 1 more)] === [2023-08-26 17:59:56,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:59:56,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1100155002, now seen corresponding path program 1 times [2023-08-26 17:59:56,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:59:56,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565609784] [2023-08-26 17:59:56,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:59:56,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:59:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:59:56,637 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 17:59:56,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:59:56,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565609784] [2023-08-26 17:59:56,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565609784] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:59:56,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:59:56,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 17:59:56,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410049033] [2023-08-26 17:59:56,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:59:56,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:59:56,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:59:56,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:59:56,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:59:56,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 149 [2023-08-26 17:59:56,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 50 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:56,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:59:56,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 149 [2023-08-26 17:59:56,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:59:56,766 INFO L124 PetriNetUnfolderBase]: 416/837 cut-off events. [2023-08-26 17:59:56,766 INFO L125 PetriNetUnfolderBase]: For 436/464 co-relation queries the response was YES. [2023-08-26 17:59:56,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1988 conditions, 837 events. 416/837 cut-off events. For 436/464 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5087 event pairs, 177 based on Foata normal form. 59/858 useless extension candidates. Maximal degree in co-relation 1972. Up to 395 conditions per place. [2023-08-26 17:59:56,770 INFO L140 encePairwiseOnDemand]: 142/149 looper letters, 41 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2023-08-26 17:59:56,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 67 transitions, 364 flow [2023-08-26 17:59:56,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:59:56,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:59:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 205 transitions. [2023-08-26 17:59:56,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45861297539149887 [2023-08-26 17:59:56,772 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 205 transitions. [2023-08-26 17:59:56,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 205 transitions. [2023-08-26 17:59:56,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:59:56,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 205 transitions. [2023-08-26 17:59:56,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:56,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:56,774 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:56,774 INFO L175 Difference]: Start difference. First operand has 50 places, 50 transitions, 210 flow. Second operand 3 states and 205 transitions. [2023-08-26 17:59:56,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 67 transitions, 364 flow [2023-08-26 17:59:56,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 364 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 17:59:56,782 INFO L231 Difference]: Finished difference. Result has 53 places, 52 transitions, 237 flow [2023-08-26 17:59:56,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=53, PETRI_TRANSITIONS=52} [2023-08-26 17:59:56,783 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2023-08-26 17:59:56,783 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 52 transitions, 237 flow [2023-08-26 17:59:56,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:56,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:59:56,784 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:59:56,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 17:59:56,784 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [thr1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 1 more)] === [2023-08-26 17:59:56,784 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:59:56,785 INFO L85 PathProgramCache]: Analyzing trace with hash -2115545360, now seen corresponding path program 1 times [2023-08-26 17:59:56,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:59:56,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575633732] [2023-08-26 17:59:56,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:59:56,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:59:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:59:56,860 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 17:59:56,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:59:56,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575633732] [2023-08-26 17:59:56,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575633732] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:59:56,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:59:56,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 17:59:56,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994356296] [2023-08-26 17:59:56,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:59:56,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 17:59:56,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:59:56,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 17:59:56,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 17:59:56,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 149 [2023-08-26 17:59:56,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 52 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:56,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:59:56,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 149 [2023-08-26 17:59:56,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:59:57,018 INFO L124 PetriNetUnfolderBase]: 348/671 cut-off events. [2023-08-26 17:59:57,019 INFO L125 PetriNetUnfolderBase]: For 416/424 co-relation queries the response was YES. [2023-08-26 17:59:57,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1763 conditions, 671 events. 348/671 cut-off events. For 416/424 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3663 event pairs, 105 based on Foata normal form. 18/674 useless extension candidates. Maximal degree in co-relation 1744. Up to 291 conditions per place. [2023-08-26 17:59:57,023 INFO L140 encePairwiseOnDemand]: 140/149 looper letters, 59 selfloop transitions, 14 changer transitions 12/94 dead transitions. [2023-08-26 17:59:57,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 94 transitions, 544 flow [2023-08-26 17:59:57,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 17:59:57,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 17:59:57,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 406 transitions. [2023-08-26 17:59:57,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38926174496644295 [2023-08-26 17:59:57,025 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 406 transitions. [2023-08-26 17:59:57,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 406 transitions. [2023-08-26 17:59:57,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:59:57,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 406 transitions. [2023-08-26 17:59:57,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 58.0) internal successors, (406), 7 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:57,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:57,029 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:57,029 INFO L175 Difference]: Start difference. First operand has 53 places, 52 transitions, 237 flow. Second operand 7 states and 406 transitions. [2023-08-26 17:59:57,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 94 transitions, 544 flow [2023-08-26 17:59:57,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 94 transitions, 539 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 17:59:57,033 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 292 flow [2023-08-26 17:59:57,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=292, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2023-08-26 17:59:57,037 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2023-08-26 17:59:57,037 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 292 flow [2023-08-26 17:59:57,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:57,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:59:57,038 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 17:59:57,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 17:59:57,038 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [thr1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 1 more)] === [2023-08-26 17:59:57,039 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:59:57,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1166938374, now seen corresponding path program 1 times [2023-08-26 17:59:57,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:59:57,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376459859] [2023-08-26 17:59:57,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:59:57,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:59:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:59:57,157 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 17:59:57,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:59:57,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376459859] [2023-08-26 17:59:57,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376459859] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 17:59:57,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188831335] [2023-08-26 17:59:57,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:59:57,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:59:57,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 17:59:57,165 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 17:59:57,172 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 17:59:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:59:57,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-26 17:59:57,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 17:59:57,269 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 17:59:57,269 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 17:59:57,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188831335] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:59:57,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 17:59:57,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2023-08-26 17:59:57,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248951662] [2023-08-26 17:59:57,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:59:57,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:59:57,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:59:57,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:59:57,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-26 17:59:57,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 149 [2023-08-26 17:59:57,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:57,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:59:57,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 149 [2023-08-26 17:59:57,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:59:57,335 INFO L124 PetriNetUnfolderBase]: 59/173 cut-off events. [2023-08-26 17:59:57,335 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2023-08-26 17:59:57,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 173 events. 59/173 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 668 event pairs, 21 based on Foata normal form. 12/180 useless extension candidates. Maximal degree in co-relation 436. Up to 74 conditions per place. [2023-08-26 17:59:57,336 INFO L140 encePairwiseOnDemand]: 141/149 looper letters, 18 selfloop transitions, 8 changer transitions 2/45 dead transitions. [2023-08-26 17:59:57,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 45 transitions, 268 flow [2023-08-26 17:59:57,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:59:57,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:59:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 207 transitions. [2023-08-26 17:59:57,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46308724832214765 [2023-08-26 17:59:57,338 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 207 transitions. [2023-08-26 17:59:57,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 207 transitions. [2023-08-26 17:59:57,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:59:57,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 207 transitions. [2023-08-26 17:59:57,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:57,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:57,340 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:57,340 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 292 flow. Second operand 3 states and 207 transitions. [2023-08-26 17:59:57,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 45 transitions, 268 flow [2023-08-26 17:59:57,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 45 transitions, 234 flow, removed 9 selfloop flow, removed 7 redundant places. [2023-08-26 17:59:57,342 INFO L231 Difference]: Finished difference. Result has 55 places, 37 transitions, 165 flow [2023-08-26 17:59:57,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=55, PETRI_TRANSITIONS=37} [2023-08-26 17:59:57,343 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2023-08-26 17:59:57,343 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 37 transitions, 165 flow [2023-08-26 17:59:57,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:57,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:59:57,344 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:59:57,359 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 17:59:57,555 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,SelfDestructingSolverStorable9 [2023-08-26 17:59:57,556 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [thr1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 1 more)] === [2023-08-26 17:59:57,556 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:59:57,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1457455067, now seen corresponding path program 1 times [2023-08-26 17:59:57,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:59:57,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788372682] [2023-08-26 17:59:57,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:59:57,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:59:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:59:57,664 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 17:59:57,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:59:57,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788372682] [2023-08-26 17:59:57,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788372682] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 17:59:57,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004419783] [2023-08-26 17:59:57,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:59:57,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:59:57,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 17:59:57,666 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 17:59:57,688 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 17:59:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:59:57,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-26 17:59:57,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 17:59:57,822 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 17:59:57,822 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 17:59:57,903 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 17:59:57,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004419783] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 17:59:57,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 17:59:57,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-26 17:59:57,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432193589] [2023-08-26 17:59:57,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 17:59:57,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 17:59:57,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:59:57,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 17:59:57,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-08-26 17:59:57,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 149 [2023-08-26 17:59:57,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 37 transitions, 165 flow. Second operand has 13 states, 13 states have (on average 47.38461538461539) internal successors, (616), 13 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 17:59:57,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:59:57,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 149 [2023-08-26 17:59:57,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:59:58,118 INFO L124 PetriNetUnfolderBase]: 52/140 cut-off events. [2023-08-26 17:59:58,119 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2023-08-26 17:59:58,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 140 events. 52/140 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 501 event pairs, 22 based on Foata normal form. 2/140 useless extension candidates. Maximal degree in co-relation 386. Up to 64 conditions per place. [2023-08-26 17:59:58,120 INFO L140 encePairwiseOnDemand]: 139/149 looper letters, 19 selfloop transitions, 7 changer transitions 16/47 dead transitions. [2023-08-26 17:59:58,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 47 transitions, 276 flow [2023-08-26 17:59:58,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 17:59:58,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 17:59:58,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 583 transitions. [2023-08-26 17:59:58,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32606263982102907 [2023-08-26 17:59:58,122 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 583 transitions. [2023-08-26 17:59:58,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 583 transitions. [2023-08-26 17:59:58,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:59:58,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 583 transitions. [2023-08-26 17:59:58,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 48.583333333333336) internal successors, (583), 12 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:58,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 149.0) internal successors, (1937), 13 states have internal predecessors, (1937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:58,127 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 149.0) internal successors, (1937), 13 states have internal predecessors, (1937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:58,127 INFO L175 Difference]: Start difference. First operand has 55 places, 37 transitions, 165 flow. Second operand 12 states and 583 transitions. [2023-08-26 17:59:58,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 47 transitions, 276 flow [2023-08-26 17:59:58,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 47 transitions, 254 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-26 17:59:58,129 INFO L231 Difference]: Finished difference. Result has 57 places, 25 transitions, 107 flow [2023-08-26 17:59:58,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=107, PETRI_PLACES=57, PETRI_TRANSITIONS=25} [2023-08-26 17:59:58,130 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-08-26 17:59:58,130 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 25 transitions, 107 flow [2023-08-26 17:59:58,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 47.38461538461539) internal successors, (616), 13 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 17:59:58,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:59:58,131 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:59:58,139 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 17:59:58,336 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,SelfDestructingSolverStorable10 [2023-08-26 17:59:58,337 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [thr1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 1 more)] === [2023-08-26 17:59:58,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:59:58,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1100442402, now seen corresponding path program 1 times [2023-08-26 17:59:58,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:59:58,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786833578] [2023-08-26 17:59:58,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:59:58,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:59:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:59:58,430 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 17:59:58,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:59:58,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786833578] [2023-08-26 17:59:58,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786833578] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:59:58,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:59:58,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 17:59:58,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083969127] [2023-08-26 17:59:58,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:59:58,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 17:59:58,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:59:58,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 17:59:58,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 17:59:58,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 149 [2023-08-26 17:59:58,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 25 transitions, 107 flow. Second operand has 7 states, 7 states have (on average 47.285714285714285) internal successors, (331), 7 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 17:59:58,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:59:58,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 149 [2023-08-26 17:59:58,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:59:58,503 INFO L124 PetriNetUnfolderBase]: 11/45 cut-off events. [2023-08-26 17:59:58,503 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-26 17:59:58,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 45 events. 11/45 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 103 event pairs, 4 based on Foata normal form. 2/45 useless extension candidates. Maximal degree in co-relation 117. Up to 16 conditions per place. [2023-08-26 17:59:58,504 INFO L140 encePairwiseOnDemand]: 142/149 looper letters, 0 selfloop transitions, 0 changer transitions 21/21 dead transitions. [2023-08-26 17:59:58,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 21 transitions, 119 flow [2023-08-26 17:59:58,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 17:59:58,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 17:59:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 379 transitions. [2023-08-26 17:59:58,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3179530201342282 [2023-08-26 17:59:58,506 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 379 transitions. [2023-08-26 17:59:58,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 379 transitions. [2023-08-26 17:59:58,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:59:58,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 379 transitions. [2023-08-26 17:59:58,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 47.375) internal successors, (379), 8 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:58,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 149.0) internal successors, (1341), 9 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:58,509 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 149.0) internal successors, (1341), 9 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:59:58,509 INFO L175 Difference]: Start difference. First operand has 57 places, 25 transitions, 107 flow. Second operand 8 states and 379 transitions. [2023-08-26 17:59:58,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 21 transitions, 119 flow [2023-08-26 17:59:58,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 21 transitions, 98 flow, removed 0 selfloop flow, removed 11 redundant places. [2023-08-26 17:59:58,510 INFO L231 Difference]: Finished difference. Result has 32 places, 0 transitions, 0 flow [2023-08-26 17:59:58,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=32, PETRI_TRANSITIONS=0} [2023-08-26 17:59:58,511 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -9 predicate places. [2023-08-26 17:59:58,511 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 0 transitions, 0 flow [2023-08-26 17:59:58,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 47.285714285714285) internal successors, (331), 7 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 17:59:58,512 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONASSERT (4 of 5 remaining) [2023-08-26 17:59:58,512 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-08-26 17:59:58,512 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONASSERT (2 of 5 remaining) [2023-08-26 17:59:58,512 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONASSERT (1 of 5 remaining) [2023-08-26 17:59:58,512 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-08-26 17:59:58,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 17:59:58,512 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:59:58,513 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-26 17:59:58,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 82 transitions, 176 flow [2023-08-26 17:59:58,521 INFO L124 PetriNetUnfolderBase]: 9/108 cut-off events. [2023-08-26 17:59:58,521 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 17:59:58,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 9/108 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 240 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 68. Up to 6 conditions per place. [2023-08-26 17:59:58,522 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 82 transitions, 176 flow [2023-08-26 17:59:58,523 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 82 transitions, 176 flow [2023-08-26 17:59:58,523 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 17:59:58,523 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 82 transitions, 176 flow [2023-08-26 17:59:58,523 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 82 transitions, 176 flow [2023-08-26 17:59:58,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 82 transitions, 176 flow [2023-08-26 17:59:58,530 INFO L124 PetriNetUnfolderBase]: 9/108 cut-off events. [2023-08-26 17:59:58,530 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 17:59:58,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 9/108 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 240 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 68. Up to 6 conditions per place. [2023-08-26 17:59:58,532 INFO L119 LiptonReduction]: Number of co-enabled transitions 2964 [2023-08-26 17:59:59,383 INFO L134 LiptonReduction]: Checked pairs total: 10123 [2023-08-26 17:59:59,383 INFO L136 LiptonReduction]: Total number of compositions: 67 [2023-08-26 17:59:59,384 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-26 17:59:59,385 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;@3c256261, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 17:59:59,385 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-26 17:59:59,388 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 17:59:59,388 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2023-08-26 17:59:59,388 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 17:59:59,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:59:59,388 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-26 17:59:59,388 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 17:59:59,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:59:59,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1013253203, now seen corresponding path program 1 times [2023-08-26 17:59:59,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:59:59,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844224356] [2023-08-26 17:59:59,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:59:59,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:59:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 17:59:59,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 17:59:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 17:59:59,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 17:59:59,405 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 17:59:59,405 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-26 17:59:59,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 17:59:59,405 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-26 17:59:59,406 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-26 17:59:59,406 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-26 17:59:59,406 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-26 17:59:59,422 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 17:59:59,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 109 transitions, 239 flow [2023-08-26 17:59:59,433 INFO L124 PetriNetUnfolderBase]: 13/149 cut-off events. [2023-08-26 17:59:59,434 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-26 17:59:59,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 149 events. 13/149 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 389 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 112. Up to 8 conditions per place. [2023-08-26 17:59:59,434 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 109 transitions, 239 flow [2023-08-26 17:59:59,435 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 109 transitions, 239 flow [2023-08-26 17:59:59,435 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 17:59:59,436 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 109 transitions, 239 flow [2023-08-26 17:59:59,436 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 109 transitions, 239 flow [2023-08-26 17:59:59,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 109 transitions, 239 flow [2023-08-26 17:59:59,446 INFO L124 PetriNetUnfolderBase]: 13/149 cut-off events. [2023-08-26 17:59:59,446 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-26 17:59:59,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 149 events. 13/149 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 389 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 112. Up to 8 conditions per place. [2023-08-26 17:59:59,450 INFO L119 LiptonReduction]: Number of co-enabled transitions 6552 [2023-08-26 18:00:00,405 INFO L134 LiptonReduction]: Checked pairs total: 24454 [2023-08-26 18:00:00,406 INFO L136 LiptonReduction]: Total number of compositions: 86 [2023-08-26 18:00:00,407 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:00:00,407 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;@3c256261, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:00:00,407 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-26 18:00:00,408 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:00:00,408 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 18:00:00,408 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:00:00,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:00:00,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 18:00:00,408 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 2 more)] === [2023-08-26 18:00:00,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:00:00,409 INFO L85 PathProgramCache]: Analyzing trace with hash 27634, now seen corresponding path program 1 times [2023-08-26 18:00:00,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:00:00,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020696265] [2023-08-26 18:00:00,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:00:00,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:00:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:00:00,430 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:00:00,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:00:00,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020696265] [2023-08-26 18:00:00,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020696265] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:00:00,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:00:00,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:00:00,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401084643] [2023-08-26 18:00:00,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:00:00,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:00:00,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:00:00,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:00:00,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:00:00,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 195 [2023-08-26 18:00:00,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 127 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:00:00,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:00:00,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 195 [2023-08-26 18:00:00,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:00:01,038 INFO L124 PetriNetUnfolderBase]: 5221/8413 cut-off events. [2023-08-26 18:00:01,038 INFO L125 PetriNetUnfolderBase]: For 529/529 co-relation queries the response was YES. [2023-08-26 18:00:01,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16090 conditions, 8413 events. 5221/8413 cut-off events. For 529/529 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 61691 event pairs, 4507 based on Foata normal form. 0/7063 useless extension candidates. Maximal degree in co-relation 1340. Up to 7258 conditions per place. [2023-08-26 18:00:01,095 INFO L140 encePairwiseOnDemand]: 189/195 looper letters, 28 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2023-08-26 18:00:01,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 48 transitions, 175 flow [2023-08-26 18:00:01,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:00:01,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:00:01,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2023-08-26 18:00:01,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4017094017094017 [2023-08-26 18:00:01,097 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 235 transitions. [2023-08-26 18:00:01,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 235 transitions. [2023-08-26 18:00:01,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:00:01,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 235 transitions. [2023-08-26 18:00:01,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:01,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:01,099 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:01,099 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 127 flow. Second operand 3 states and 235 transitions. [2023-08-26 18:00:01,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 48 transitions, 175 flow [2023-08-26 18:00:01,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 48 transitions, 169 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-26 18:00:01,103 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 113 flow [2023-08-26 18:00:01,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2023-08-26 18:00:01,104 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2023-08-26 18:00:01,104 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 113 flow [2023-08-26 18:00:01,104 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:00:01,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:00:01,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 18:00:01,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 18:00:01,104 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 2 more)] === [2023-08-26 18:00:01,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:00:01,105 INFO L85 PathProgramCache]: Analyzing trace with hash 27635, now seen corresponding path program 1 times [2023-08-26 18:00:01,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:00:01,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264015007] [2023-08-26 18:00:01,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:00:01,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:00:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:00:01,131 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:00:01,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:00:01,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264015007] [2023-08-26 18:00:01,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264015007] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:00:01,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:00:01,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:00:01,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507545681] [2023-08-26 18:00:01,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:00:01,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:00:01,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:00:01,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:00:01,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:00:01,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 195 [2023-08-26 18:00:01,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:01,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:00:01,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 195 [2023-08-26 18:00:01,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:00:01,561 INFO L124 PetriNetUnfolderBase]: 3280/5452 cut-off events. [2023-08-26 18:00:01,561 INFO L125 PetriNetUnfolderBase]: For 213/213 co-relation queries the response was YES. [2023-08-26 18:00:01,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10364 conditions, 5452 events. 3280/5452 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 38403 event pairs, 2804 based on Foata normal form. 0/4974 useless extension candidates. Maximal degree in co-relation 10355. Up to 4638 conditions per place. [2023-08-26 18:00:01,598 INFO L140 encePairwiseOnDemand]: 193/195 looper letters, 27 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2023-08-26 18:00:01,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 47 transitions, 167 flow [2023-08-26 18:00:01,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:00:01,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:00:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2023-08-26 18:00:01,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39829059829059826 [2023-08-26 18:00:01,599 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 233 transitions. [2023-08-26 18:00:01,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 233 transitions. [2023-08-26 18:00:01,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:00:01,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 233 transitions. [2023-08-26 18:00:01,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:01,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:01,602 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:01,602 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 113 flow. Second operand 3 states and 233 transitions. [2023-08-26 18:00:01,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 47 transitions, 167 flow [2023-08-26 18:00:01,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 47 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:00:01,603 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 112 flow [2023-08-26 18:00:01,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2023-08-26 18:00:01,605 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2023-08-26 18:00:01,605 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 112 flow [2023-08-26 18:00:01,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:01,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:00:01,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:00:01,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 18:00:01,605 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 2 more)] === [2023-08-26 18:00:01,605 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:00:01,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1366204488, now seen corresponding path program 1 times [2023-08-26 18:00:01,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:00:01,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908268948] [2023-08-26 18:00:01,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:00:01,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:00:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:00:01,668 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:00:01,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:00:01,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908268948] [2023-08-26 18:00:01,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908268948] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:00:01,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:00:01,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:00:01,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943109594] [2023-08-26 18:00:01,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:00:01,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:00:01,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:00:01,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:00:01,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:00:01,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 195 [2023-08-26 18:00:01,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:01,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:00:01,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 195 [2023-08-26 18:00:01,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:00:03,564 INFO L124 PetriNetUnfolderBase]: 15991/24374 cut-off events. [2023-08-26 18:00:03,564 INFO L125 PetriNetUnfolderBase]: For 756/756 co-relation queries the response was YES. [2023-08-26 18:00:03,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48138 conditions, 24374 events. 15991/24374 cut-off events. For 756/756 co-relation queries the response was YES. Maximal size of possible extension queue 1408. Compared 186046 event pairs, 2849 based on Foata normal form. 0/23213 useless extension candidates. Maximal degree in co-relation 48128. Up to 9503 conditions per place. [2023-08-26 18:00:03,710 INFO L140 encePairwiseOnDemand]: 183/195 looper letters, 148 selfloop transitions, 26 changer transitions 0/183 dead transitions. [2023-08-26 18:00:03,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 183 transitions, 772 flow [2023-08-26 18:00:03,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:00:03,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:00:03,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 598 transitions. [2023-08-26 18:00:03,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2023-08-26 18:00:03,713 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 598 transitions. [2023-08-26 18:00:03,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 598 transitions. [2023-08-26 18:00:03,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:00:03,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 598 transitions. [2023-08-26 18:00:03,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 85.42857142857143) internal successors, (598), 7 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:03,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:03,717 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:03,718 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 112 flow. Second operand 7 states and 598 transitions. [2023-08-26 18:00:03,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 183 transitions, 772 flow [2023-08-26 18:00:03,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 183 transitions, 771 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:00:03,722 INFO L231 Difference]: Finished difference. Result has 65 places, 77 transitions, 325 flow [2023-08-26 18:00:03,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=325, PETRI_PLACES=65, PETRI_TRANSITIONS=77} [2023-08-26 18:00:03,723 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 8 predicate places. [2023-08-26 18:00:03,723 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 77 transitions, 325 flow [2023-08-26 18:00:03,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:03,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:00:03,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:00:03,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 18:00:03,724 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 2 more)] === [2023-08-26 18:00:03,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:00:03,724 INFO L85 PathProgramCache]: Analyzing trace with hash -420464949, now seen corresponding path program 1 times [2023-08-26 18:00:03,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:00:03,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294687822] [2023-08-26 18:00:03,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:00:03,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:00:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:00:03,809 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:00:03,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:00:03,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294687822] [2023-08-26 18:00:03,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294687822] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:00:03,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:00:03,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:00:03,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70716510] [2023-08-26 18:00:03,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:00:03,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:00:03,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:00:03,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:00:03,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:00:03,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 195 [2023-08-26 18:00:03,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 77 transitions, 325 flow. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:03,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:00:03,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 195 [2023-08-26 18:00:03,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:00:04,963 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L719-1-->L724: Formula: (not (= (mod v_~count~0_156 4294967296) 3)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 8#L725true, Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 9#L733-5true, Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 117#true, thr1Thread3of3ForFork0InUse, 97#L724true, 10#L724-5true, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 135#(= ~COND~0 (* 256 (div ~COND~0 256))), Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:04,963 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-26 18:00:04,963 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-26 18:00:04,964 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-26 18:00:04,964 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-26 18:00:04,968 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([765] L719-1-->L721: Formula: (= (mod v_~count~0_154 4294967296) 3) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 8#L725true, Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 9#L733-5true, Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 117#true, thr1Thread3of3ForFork0InUse, 10#L724-5true, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 135#(= ~COND~0 (* 256 (div ~COND~0 256))), 45#L721true, Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:04,968 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-26 18:00:04,968 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-26 18:00:04,968 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-26 18:00:04,968 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-26 18:00:04,991 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([763] L719-1-->L721: Formula: (= (mod v_~count~0_150 4294967296) 3) InVars {~count~0=v_~count~0_150} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_11|, ~count~0=v_~count~0_150} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 9#L733-5true, Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 117#true, 10#L724-5true, 38#L725true, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 135#(= ~COND~0 (* 256 (div ~COND~0 256))), 48#L721true, Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:04,991 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-26 18:00:04,992 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-26 18:00:04,992 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-26 18:00:04,992 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-26 18:00:04,992 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([764] L719-1-->L724: Formula: (not (= (mod v_~count~0_152 4294967296) 3)) InVars {~count~0=v_~count~0_152} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_152} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 9#L733-5true, Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, 41#L724true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 117#true, 10#L724-5true, 38#L725true, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 135#(= ~COND~0 (* 256 (div ~COND~0 256))), Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:04,992 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-26 18:00:04,992 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-26 18:00:04,992 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-26 18:00:04,992 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-26 18:00:05,064 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L719-1-->L724: Formula: (not (= (mod v_~count~0_156 4294967296) 3)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 9#L733-5true, Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, 47#thr1Err0ASSERT_VIOLATIONASSERTtrue, thr1Thread2of3ForFork0InUse, 117#true, thr1Thread3of3ForFork0InUse, 97#L724true, 10#L724-5true, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 135#(= ~COND~0 (* 256 (div ~COND~0 256))), Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:05,064 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,064 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,064 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,064 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,069 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([765] L719-1-->L721: Formula: (= (mod v_~count~0_154 4294967296) 3) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 9#L733-5true, Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, 47#thr1Err0ASSERT_VIOLATIONASSERTtrue, thr1Thread2of3ForFork0InUse, 117#true, thr1Thread3of3ForFork0InUse, 10#L724-5true, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 135#(= ~COND~0 (* 256 (div ~COND~0 256))), 45#L721true, Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:05,069 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,069 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,069 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,069 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,094 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([763] L719-1-->L721: Formula: (= (mod v_~count~0_150 4294967296) 3) InVars {~count~0=v_~count~0_150} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_11|, ~count~0=v_~count~0_150} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 9#L733-5true, Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 117#true, 81#thr1Err0ASSERT_VIOLATIONASSERTtrue, 10#L724-5true, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 135#(= ~COND~0 (* 256 (div ~COND~0 256))), 48#L721true, Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:05,094 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,094 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,094 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,094 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,094 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([764] L719-1-->L724: Formula: (not (= (mod v_~count~0_152 4294967296) 3)) InVars {~count~0=v_~count~0_152} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_152} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 9#L733-5true, Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, 41#L724true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 117#true, 81#thr1Err0ASSERT_VIOLATIONASSERTtrue, 10#L724-5true, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 135#(= ~COND~0 (* 256 (div ~COND~0 256))), Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:05,095 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,095 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,095 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,095 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,102 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([766] L719-1-->L724: Formula: (not (= (mod v_~count~0_156 4294967296) 3)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 9#L733-5true, Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 47#thr1Err0ASSERT_VIOLATIONASSERTtrue, 117#true, thr1Thread3of3ForFork0InUse, 97#L724true, 10#L724-5true, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 135#(= ~COND~0 (* 256 (div ~COND~0 256))), Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:05,102 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,102 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,102 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,102 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,102 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,103 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([765] L719-1-->L721: Formula: (= (mod v_~count~0_154 4294967296) 3) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 9#L733-5true, Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 47#thr1Err0ASSERT_VIOLATIONASSERTtrue, thr1Thread3of3ForFork0InUse, 117#true, 10#L724-5true, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 135#(= ~COND~0 (* 256 (div ~COND~0 256))), 45#L721true, Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:05,103 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,103 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,103 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,103 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,103 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-26 18:00:05,157 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L719-1-->L724: Formula: (not (= (mod v_~count~0_156 4294967296) 3)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 8#L725true, Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 117#true, 97#L724true, 10#L724-5true, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 21#L733-4true, 135#(= ~COND~0 (* 256 (div ~COND~0 256))), Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:05,157 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-26 18:00:05,157 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 18:00:05,158 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 18:00:05,158 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 18:00:05,158 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([765] L719-1-->L721: Formula: (= (mod v_~count~0_154 4294967296) 3) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 8#L725true, Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 117#true, 10#L724-5true, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 21#L733-4true, 135#(= ~COND~0 (* 256 (div ~COND~0 256))), 45#L721true, Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:05,158 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-26 18:00:05,158 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 18:00:05,158 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 18:00:05,158 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 18:00:05,270 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L719-1-->L724: Formula: (not (= (mod v_~count~0_156 4294967296) 3)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 9#L733-5true, Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 47#thr1Err0ASSERT_VIOLATIONASSERTtrue, thr1Thread3of3ForFork0InUse, 117#true, 97#L724true, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 135#(= ~COND~0 (* 256 (div ~COND~0 256))), 68#L725true, Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:05,270 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-26 18:00:05,271 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-26 18:00:05,271 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-26 18:00:05,271 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-26 18:00:05,271 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([765] L719-1-->L721: Formula: (= (mod v_~count~0_154 4294967296) 3) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 9#L733-5true, Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 47#thr1Err0ASSERT_VIOLATIONASSERTtrue, thr1Thread3of3ForFork0InUse, 117#true, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 135#(= ~COND~0 (* 256 (div ~COND~0 256))), 45#L721true, 68#L725true, Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:05,271 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-26 18:00:05,271 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-26 18:00:05,271 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-26 18:00:05,271 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-26 18:00:05,314 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([763] L719-1-->L721: Formula: (= (mod v_~count~0_150 4294967296) 3) InVars {~count~0=v_~count~0_150} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_11|, ~count~0=v_~count~0_150} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 117#true, 10#L724-5true, 38#L725true, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 21#L733-4true, 135#(= ~COND~0 (* 256 (div ~COND~0 256))), 48#L721true, Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:05,314 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-26 18:00:05,314 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 18:00:05,314 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 18:00:05,314 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 18:00:05,314 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([764] L719-1-->L724: Formula: (not (= (mod v_~count~0_152 4294967296) 3)) InVars {~count~0=v_~count~0_152} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_152} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, 41#L724true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 117#true, 10#L724-5true, 38#L725true, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 21#L733-4true, 135#(= ~COND~0 (* 256 (div ~COND~0 256))), Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:05,314 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-26 18:00:05,315 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 18:00:05,315 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 18:00:05,315 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 18:00:05,323 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L719-1-->L724: Formula: (not (= (mod v_~count~0_156 4294967296) 3)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 47#thr1Err0ASSERT_VIOLATIONASSERTtrue, thr1Thread3of3ForFork0InUse, 117#true, 97#L724true, 10#L724-5true, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 21#L733-4true, 135#(= ~COND~0 (* 256 (div ~COND~0 256))), Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:05,323 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,323 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,323 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,323 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,323 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([765] L719-1-->L721: Formula: (= (mod v_~count~0_154 4294967296) 3) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 47#thr1Err0ASSERT_VIOLATIONASSERTtrue, thr1Thread3of3ForFork0InUse, 117#true, 10#L724-5true, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 21#L733-4true, 135#(= ~COND~0 (* 256 (div ~COND~0 256))), 45#L721true, Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:05,324 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,324 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,324 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,324 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,357 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L719-1-->L724: Formula: (not (= (mod v_~count~0_156 4294967296) 3)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 9#L733-5true, Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 47#thr1Err0ASSERT_VIOLATIONASSERTtrue, thr1Thread3of3ForFork0InUse, 117#true, 97#L724true, 65#thr1Err0ASSERT_VIOLATIONASSERTtrue, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 135#(= ~COND~0 (* 256 (div ~COND~0 256))), Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:05,357 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-26 18:00:05,357 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 18:00:05,357 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 18:00:05,357 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 18:00:05,357 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([765] L719-1-->L721: Formula: (= (mod v_~count~0_154 4294967296) 3) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 9#L733-5true, Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 47#thr1Err0ASSERT_VIOLATIONASSERTtrue, thr1Thread3of3ForFork0InUse, 117#true, 65#thr1Err0ASSERT_VIOLATIONASSERTtrue, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 135#(= ~COND~0 (* 256 (div ~COND~0 256))), 45#L721true, Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:05,357 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-26 18:00:05,358 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 18:00:05,358 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 18:00:05,358 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 18:00:05,411 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([763] L719-1-->L721: Formula: (= (mod v_~count~0_150 4294967296) 3) InVars {~count~0=v_~count~0_150} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_11|, ~count~0=v_~count~0_150} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 117#true, 81#thr1Err0ASSERT_VIOLATIONASSERTtrue, 10#L724-5true, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 21#L733-4true, 135#(= ~COND~0 (* 256 (div ~COND~0 256))), 48#L721true, Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:05,412 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,412 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,412 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,412 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,412 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([764] L719-1-->L724: Formula: (not (= (mod v_~count~0_152 4294967296) 3)) InVars {~count~0=v_~count~0_152} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_152} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, 41#L724true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 117#true, 81#thr1Err0ASSERT_VIOLATIONASSERTtrue, 10#L724-5true, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 21#L733-4true, 135#(= ~COND~0 (* 256 (div ~COND~0 256))), Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:05,412 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,412 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,412 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,412 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,420 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([766] L719-1-->L724: Formula: (not (= (mod v_~count~0_156 4294967296) 3)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 47#thr1Err0ASSERT_VIOLATIONASSERTtrue, thr1Thread3of3ForFork0InUse, 117#true, 97#L724true, 10#L724-5true, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 135#(= ~COND~0 (* 256 (div ~COND~0 256))), 21#L733-4true, Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:05,420 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,420 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,420 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,421 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,421 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,421 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([765] L719-1-->L721: Formula: (= (mod v_~count~0_154 4294967296) 3) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 47#thr1Err0ASSERT_VIOLATIONASSERTtrue, thr1Thread3of3ForFork0InUse, 117#true, 10#L724-5true, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 21#L733-4true, 135#(= ~COND~0 (* 256 (div ~COND~0 256))), 45#L721true, Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:05,421 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,421 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,421 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,421 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,421 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 18:00:05,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L719-1-->L724: Formula: (not (= (mod v_~count~0_156 4294967296) 3)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 47#thr1Err0ASSERT_VIOLATIONASSERTtrue, thr1Thread3of3ForFork0InUse, 117#true, 97#L724true, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 21#L733-4true, 135#(= ~COND~0 (* 256 (div ~COND~0 256))), 68#L725true, Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:05,487 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-26 18:00:05,487 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 18:00:05,487 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 18:00:05,487 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 18:00:05,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([765] L719-1-->L721: Formula: (= (mod v_~count~0_154 4294967296) 3) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 47#thr1Err0ASSERT_VIOLATIONASSERTtrue, thr1Thread3of3ForFork0InUse, 117#true, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 135#(= ~COND~0 (* 256 (div ~COND~0 256))), 21#L733-4true, 45#L721true, 68#L725true, Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:05,488 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-26 18:00:05,488 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 18:00:05,488 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 18:00:05,488 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 18:00:05,598 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L719-1-->L724: Formula: (not (= (mod v_~count~0_156 4294967296) 3)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 47#thr1Err0ASSERT_VIOLATIONASSERTtrue, thr1Thread3of3ForFork0InUse, 117#true, 97#L724true, 65#thr1Err0ASSERT_VIOLATIONASSERTtrue, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 135#(= ~COND~0 (* 256 (div ~COND~0 256))), 21#L733-4true, Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:05,598 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-26 18:00:05,598 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 18:00:05,598 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 18:00:05,598 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 18:00:05,598 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([765] L719-1-->L721: Formula: (= (mod v_~count~0_154 4294967296) 3) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [Black: 123#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 125#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 121#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 119#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 47#thr1Err0ASSERT_VIOLATIONASSERTtrue, thr1Thread3of3ForFork0InUse, 117#true, 65#thr1Err0ASSERT_VIOLATIONASSERTtrue, 115#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 135#(= ~COND~0 (* 256 (div ~COND~0 256))), 21#L733-4true, 45#L721true, Black: 120#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|))]) [2023-08-26 18:00:05,599 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-26 18:00:05,599 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 18:00:05,599 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 18:00:05,599 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 18:00:05,634 INFO L124 PetriNetUnfolderBase]: 13844/21481 cut-off events. [2023-08-26 18:00:05,634 INFO L125 PetriNetUnfolderBase]: For 13055/14508 co-relation queries the response was YES. [2023-08-26 18:00:05,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50646 conditions, 21481 events. 13844/21481 cut-off events. For 13055/14508 co-relation queries the response was YES. Maximal size of possible extension queue 1401. Compared 168229 event pairs, 5116 based on Foata normal form. 1145/21859 useless extension candidates. Maximal degree in co-relation 50629. Up to 9908 conditions per place. [2023-08-26 18:00:05,779 INFO L140 encePairwiseOnDemand]: 185/195 looper letters, 75 selfloop transitions, 7 changer transitions 0/115 dead transitions. [2023-08-26 18:00:05,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 115 transitions, 626 flow [2023-08-26 18:00:05,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:00:05,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:00:05,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2023-08-26 18:00:05,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4700854700854701 [2023-08-26 18:00:05,782 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 275 transitions. [2023-08-26 18:00:05,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 275 transitions. [2023-08-26 18:00:05,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:00:05,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 275 transitions. [2023-08-26 18:00:05,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:05,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:05,785 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:05,785 INFO L175 Difference]: Start difference. First operand has 65 places, 77 transitions, 325 flow. Second operand 3 states and 275 transitions. [2023-08-26 18:00:05,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 115 transitions, 626 flow [2023-08-26 18:00:05,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 115 transitions, 626 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:00:05,811 INFO L231 Difference]: Finished difference. Result has 69 places, 83 transitions, 383 flow [2023-08-26 18:00:05,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=69, PETRI_TRANSITIONS=83} [2023-08-26 18:00:05,812 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places. [2023-08-26 18:00:05,812 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 83 transitions, 383 flow [2023-08-26 18:00:05,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:05,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:00:05,812 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:00:05,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 18:00:05,812 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 2 more)] === [2023-08-26 18:00:05,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:00:05,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1618417253, now seen corresponding path program 1 times [2023-08-26 18:00:05,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:00:05,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852382986] [2023-08-26 18:00:05,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:00:05,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:00:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:00:05,889 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:00:05,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:00:05,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852382986] [2023-08-26 18:00:05,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852382986] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:00:05,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:00:05,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:00:05,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740793112] [2023-08-26 18:00:05,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:00:05,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:00:05,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:00:05,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:00:05,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:00:05,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 195 [2023-08-26 18:00:05,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 83 transitions, 383 flow. Second operand has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:05,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:00:05,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 195 [2023-08-26 18:00:05,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:00:08,062 INFO L124 PetriNetUnfolderBase]: 18083/28244 cut-off events. [2023-08-26 18:00:08,063 INFO L125 PetriNetUnfolderBase]: For 20419/20663 co-relation queries the response was YES. [2023-08-26 18:00:08,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72938 conditions, 28244 events. 18083/28244 cut-off events. For 20419/20663 co-relation queries the response was YES. Maximal size of possible extension queue 1661. Compared 227807 event pairs, 4533 based on Foata normal form. 542/28319 useless extension candidates. Maximal degree in co-relation 72917. Up to 11838 conditions per place. [2023-08-26 18:00:08,290 INFO L140 encePairwiseOnDemand]: 184/195 looper letters, 149 selfloop transitions, 39 changer transitions 0/203 dead transitions. [2023-08-26 18:00:08,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 203 transitions, 1190 flow [2023-08-26 18:00:08,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:00:08,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:00:08,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 504 transitions. [2023-08-26 18:00:08,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4307692307692308 [2023-08-26 18:00:08,293 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 504 transitions. [2023-08-26 18:00:08,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 504 transitions. [2023-08-26 18:00:08,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:00:08,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 504 transitions. [2023-08-26 18:00:08,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:08,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:08,297 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:08,297 INFO L175 Difference]: Start difference. First operand has 69 places, 83 transitions, 383 flow. Second operand 6 states and 504 transitions. [2023-08-26 18:00:08,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 203 transitions, 1190 flow [2023-08-26 18:00:08,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 203 transitions, 1176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:00:08,375 INFO L231 Difference]: Finished difference. Result has 75 places, 106 transitions, 643 flow [2023-08-26 18:00:08,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=643, PETRI_PLACES=75, PETRI_TRANSITIONS=106} [2023-08-26 18:00:08,375 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 18 predicate places. [2023-08-26 18:00:08,376 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 106 transitions, 643 flow [2023-08-26 18:00:08,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:08,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:00:08,376 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:00:08,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 18:00:08,377 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 2 more)] === [2023-08-26 18:00:08,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:00:08,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1628851779, now seen corresponding path program 1 times [2023-08-26 18:00:08,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:00:08,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628957489] [2023-08-26 18:00:08,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:00:08,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:00:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:00:08,477 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:00:08,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:00:08,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628957489] [2023-08-26 18:00:08,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628957489] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:00:08,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142858642] [2023-08-26 18:00:08,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:00:08,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:00:08,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:00:08,479 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:00:08,482 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:00:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:00:08,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-26 18:00:08,553 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:00:08,566 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:00:08,567 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 18:00:08,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142858642] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:00:08,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 18:00:08,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2023-08-26 18:00:08,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640895734] [2023-08-26 18:00:08,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:00:08,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:00:08,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:00:08,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:00:08,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:00:08,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 195 [2023-08-26 18:00:08,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 106 transitions, 643 flow. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:08,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:00:08,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 195 [2023-08-26 18:00:08,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:00:08,976 INFO L124 PetriNetUnfolderBase]: 2059/4191 cut-off events. [2023-08-26 18:00:08,976 INFO L125 PetriNetUnfolderBase]: For 2163/2171 co-relation queries the response was YES. [2023-08-26 18:00:08,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9795 conditions, 4191 events. 2059/4191 cut-off events. For 2163/2171 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 33597 event pairs, 831 based on Foata normal form. 354/4478 useless extension candidates. Maximal degree in co-relation 9771. Up to 1784 conditions per place. [2023-08-26 18:00:09,004 INFO L140 encePairwiseOnDemand]: 183/195 looper letters, 28 selfloop transitions, 12 changer transitions 0/72 dead transitions. [2023-08-26 18:00:09,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 72 transitions, 417 flow [2023-08-26 18:00:09,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:00:09,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:00:09,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2023-08-26 18:00:09,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46324786324786327 [2023-08-26 18:00:09,006 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 271 transitions. [2023-08-26 18:00:09,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 271 transitions. [2023-08-26 18:00:09,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:00:09,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 271 transitions. [2023-08-26 18:00:09,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:09,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:09,009 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:09,009 INFO L175 Difference]: Start difference. First operand has 75 places, 106 transitions, 643 flow. Second operand 3 states and 271 transitions. [2023-08-26 18:00:09,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 72 transitions, 417 flow [2023-08-26 18:00:09,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 72 transitions, 362 flow, removed 17 selfloop flow, removed 6 redundant places. [2023-08-26 18:00:09,018 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 272 flow [2023-08-26 18:00:09,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2023-08-26 18:00:09,019 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places. [2023-08-26 18:00:09,019 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 272 flow [2023-08-26 18:00:09,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:09,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:00:09,019 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:00:09,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-26 18:00:09,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:00:09,225 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 2 more)] === [2023-08-26 18:00:09,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:00:09,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1842178883, now seen corresponding path program 1 times [2023-08-26 18:00:09,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:00:09,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941625432] [2023-08-26 18:00:09,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:00:09,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:00:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:00:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-26 18:00:09,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:00:09,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941625432] [2023-08-26 18:00:09,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941625432] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:00:09,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:00:09,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:00:09,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129114107] [2023-08-26 18:00:09,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:00:09,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:00:09,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:00:09,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:00:09,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:00:09,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 195 [2023-08-26 18:00:09,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 272 flow. Second operand has 5 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:09,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:00:09,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 195 [2023-08-26 18:00:09,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:00:09,784 INFO L124 PetriNetUnfolderBase]: 1891/3540 cut-off events. [2023-08-26 18:00:09,784 INFO L125 PetriNetUnfolderBase]: For 1353/1381 co-relation queries the response was YES. [2023-08-26 18:00:09,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9053 conditions, 3540 events. 1891/3540 cut-off events. For 1353/1381 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 25844 event pairs, 671 based on Foata normal form. 4/3523 useless extension candidates. Maximal degree in co-relation 9034. Up to 1381 conditions per place. [2023-08-26 18:00:09,806 INFO L140 encePairwiseOnDemand]: 185/195 looper letters, 87 selfloop transitions, 11 changer transitions 0/110 dead transitions. [2023-08-26 18:00:09,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 110 transitions, 632 flow [2023-08-26 18:00:09,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:00:09,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:00:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 448 transitions. [2023-08-26 18:00:09,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38290598290598293 [2023-08-26 18:00:09,808 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 448 transitions. [2023-08-26 18:00:09,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 448 transitions. [2023-08-26 18:00:09,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:00:09,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 448 transitions. [2023-08-26 18:00:09,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:09,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:09,812 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:09,812 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 272 flow. Second operand 6 states and 448 transitions. [2023-08-26 18:00:09,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 110 transitions, 632 flow [2023-08-26 18:00:09,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 110 transitions, 602 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:00:09,818 INFO L231 Difference]: Finished difference. Result has 76 places, 64 transitions, 306 flow [2023-08-26 18:00:09,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=76, PETRI_TRANSITIONS=64} [2023-08-26 18:00:09,819 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2023-08-26 18:00:09,819 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 64 transitions, 306 flow [2023-08-26 18:00:09,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:09,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:00:09,819 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:00:09,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 18:00:09,819 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 2 more)] === [2023-08-26 18:00:09,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:00:09,820 INFO L85 PathProgramCache]: Analyzing trace with hash 941738174, now seen corresponding path program 1 times [2023-08-26 18:00:09,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:00:09,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747926187] [2023-08-26 18:00:09,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:00:09,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:00:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:00:09,918 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:00:09,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:00:09,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747926187] [2023-08-26 18:00:09,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747926187] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:00:09,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660826600] [2023-08-26 18:00:09,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:00:09,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:00:09,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:00:10,089 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:00:10,092 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:00:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:00:10,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-26 18:00:10,164 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:00:10,224 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:00:10,224 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:00:10,300 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:00:10,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660826600] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:00:10,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:00:10,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-26 18:00:10,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402650288] [2023-08-26 18:00:10,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:00:10,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 18:00:10,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:00:10,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 18:00:10,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-08-26 18:00:10,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 195 [2023-08-26 18:00:10,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 64 transitions, 306 flow. Second operand has 13 states, 13 states have (on average 59.38461538461539) internal successors, (772), 13 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:10,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:00:10,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 195 [2023-08-26 18:00:10,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:00:10,969 INFO L124 PetriNetUnfolderBase]: 1692/3147 cut-off events. [2023-08-26 18:00:10,970 INFO L125 PetriNetUnfolderBase]: For 1636/1648 co-relation queries the response was YES. [2023-08-26 18:00:10,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7971 conditions, 3147 events. 1692/3147 cut-off events. For 1636/1648 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 22483 event pairs, 524 based on Foata normal form. 8/3136 useless extension candidates. Maximal degree in co-relation 7947. Up to 1088 conditions per place. [2023-08-26 18:00:10,987 INFO L140 encePairwiseOnDemand]: 180/195 looper letters, 101 selfloop transitions, 28 changer transitions 0/141 dead transitions. [2023-08-26 18:00:10,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 141 transitions, 840 flow [2023-08-26 18:00:10,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 18:00:10,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 18:00:10,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 752 transitions. [2023-08-26 18:00:10,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35058275058275057 [2023-08-26 18:00:10,990 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 752 transitions. [2023-08-26 18:00:10,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 752 transitions. [2023-08-26 18:00:10,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:00:10,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 752 transitions. [2023-08-26 18:00:10,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 68.36363636363636) internal successors, (752), 11 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:10,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 195.0) internal successors, (2340), 12 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:10,996 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 195.0) internal successors, (2340), 12 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:10,996 INFO L175 Difference]: Start difference. First operand has 76 places, 64 transitions, 306 flow. Second operand 11 states and 752 transitions. [2023-08-26 18:00:10,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 141 transitions, 840 flow [2023-08-26 18:00:11,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 141 transitions, 826 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-26 18:00:11,002 INFO L231 Difference]: Finished difference. Result has 87 places, 67 transitions, 385 flow [2023-08-26 18:00:11,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=385, PETRI_PLACES=87, PETRI_TRANSITIONS=67} [2023-08-26 18:00:11,003 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 30 predicate places. [2023-08-26 18:00:11,003 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 67 transitions, 385 flow [2023-08-26 18:00:11,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 59.38461538461539) internal successors, (772), 13 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:11,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:00:11,004 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:00:11,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-26 18:00:11,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:00:11,212 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 2 more)] === [2023-08-26 18:00:11,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:00:11,212 INFO L85 PathProgramCache]: Analyzing trace with hash 485588254, now seen corresponding path program 1 times [2023-08-26 18:00:11,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:00:11,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967688281] [2023-08-26 18:00:11,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:00:11,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:00:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:00:11,307 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:00:11,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:00:11,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967688281] [2023-08-26 18:00:11,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967688281] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:00:11,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:00:11,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:00:11,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888040329] [2023-08-26 18:00:11,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:00:11,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:00:11,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:00:11,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:00:11,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:00:11,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 195 [2023-08-26 18:00:11,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 67 transitions, 385 flow. Second operand has 7 states, 7 states have (on average 59.285714285714285) internal successors, (415), 7 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:11,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:00:11,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 195 [2023-08-26 18:00:11,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:00:11,741 INFO L124 PetriNetUnfolderBase]: 1378/2604 cut-off events. [2023-08-26 18:00:11,741 INFO L125 PetriNetUnfolderBase]: For 1714/1730 co-relation queries the response was YES. [2023-08-26 18:00:11,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6832 conditions, 2604 events. 1378/2604 cut-off events. For 1714/1730 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 17974 event pairs, 477 based on Foata normal form. 10/2599 useless extension candidates. Maximal degree in co-relation 6805. Up to 971 conditions per place. [2023-08-26 18:00:11,762 INFO L140 encePairwiseOnDemand]: 184/195 looper letters, 96 selfloop transitions, 13 changer transitions 0/121 dead transitions. [2023-08-26 18:00:11,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 121 transitions, 795 flow [2023-08-26 18:00:11,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:00:11,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:00:11,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 558 transitions. [2023-08-26 18:00:11,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3576923076923077 [2023-08-26 18:00:11,767 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 558 transitions. [2023-08-26 18:00:11,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 558 transitions. [2023-08-26 18:00:11,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:00:11,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 558 transitions. [2023-08-26 18:00:11,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 69.75) internal successors, (558), 8 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:11,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:11,772 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:11,773 INFO L175 Difference]: Start difference. First operand has 87 places, 67 transitions, 385 flow. Second operand 8 states and 558 transitions. [2023-08-26 18:00:11,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 121 transitions, 795 flow [2023-08-26 18:00:11,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 121 transitions, 736 flow, removed 10 selfloop flow, removed 9 redundant places. [2023-08-26 18:00:11,779 INFO L231 Difference]: Finished difference. Result has 87 places, 69 transitions, 374 flow [2023-08-26 18:00:11,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=374, PETRI_PLACES=87, PETRI_TRANSITIONS=69} [2023-08-26 18:00:11,780 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 30 predicate places. [2023-08-26 18:00:11,780 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 69 transitions, 374 flow [2023-08-26 18:00:11,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 59.285714285714285) internal successors, (415), 7 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:11,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:00:11,784 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:00:11,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 18:00:11,785 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 2 more)] === [2023-08-26 18:00:11,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:00:11,785 INFO L85 PathProgramCache]: Analyzing trace with hash 61551368, now seen corresponding path program 1 times [2023-08-26 18:00:11,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:00:11,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134881216] [2023-08-26 18:00:11,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:00:11,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:00:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:00:11,892 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 18:00:11,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:00:11,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134881216] [2023-08-26 18:00:11,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134881216] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:00:11,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797434768] [2023-08-26 18:00:11,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:00:11,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:00:11,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:00:11,897 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:00:11,900 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:00:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:00:11,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-26 18:00:11,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:00:12,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 18:00:12,039 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:00:12,128 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 18:00:12,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797434768] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:00:12,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:00:12,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-26 18:00:12,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346324880] [2023-08-26 18:00:12,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:00:12,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 18:00:12,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:00:12,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 18:00:12,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-08-26 18:00:12,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 195 [2023-08-26 18:00:12,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 69 transitions, 374 flow. Second operand has 13 states, 13 states have (on average 59.69230769230769) internal successors, (776), 13 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:12,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:00:12,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 195 [2023-08-26 18:00:12,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:00:12,778 INFO L124 PetriNetUnfolderBase]: 1199/2273 cut-off events. [2023-08-26 18:00:12,778 INFO L125 PetriNetUnfolderBase]: For 1134/1150 co-relation queries the response was YES. [2023-08-26 18:00:12,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5866 conditions, 2273 events. 1199/2273 cut-off events. For 1134/1150 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 15375 event pairs, 412 based on Foata normal form. 6/2258 useless extension candidates. Maximal degree in co-relation 5839. Up to 880 conditions per place. [2023-08-26 18:00:12,793 INFO L140 encePairwiseOnDemand]: 180/195 looper letters, 91 selfloop transitions, 32 changer transitions 0/135 dead transitions. [2023-08-26 18:00:12,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 135 transitions, 852 flow [2023-08-26 18:00:12,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 18:00:12,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 18:00:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 857 transitions. [2023-08-26 18:00:12,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3380670611439842 [2023-08-26 18:00:12,796 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 857 transitions. [2023-08-26 18:00:12,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 857 transitions. [2023-08-26 18:00:12,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:00:12,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 857 transitions. [2023-08-26 18:00:12,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 65.92307692307692) internal successors, (857), 13 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:12,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 195.0) internal successors, (2730), 14 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:12,802 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 195.0) internal successors, (2730), 14 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:12,802 INFO L175 Difference]: Start difference. First operand has 87 places, 69 transitions, 374 flow. Second operand 13 states and 857 transitions. [2023-08-26 18:00:12,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 135 transitions, 852 flow [2023-08-26 18:00:12,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 135 transitions, 828 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-26 18:00:12,807 INFO L231 Difference]: Finished difference. Result has 96 places, 72 transitions, 437 flow [2023-08-26 18:00:12,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=437, PETRI_PLACES=96, PETRI_TRANSITIONS=72} [2023-08-26 18:00:12,807 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 39 predicate places. [2023-08-26 18:00:12,807 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 72 transitions, 437 flow [2023-08-26 18:00:12,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 59.69230769230769) internal successors, (776), 13 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:12,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:00:12,808 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:00:12,819 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:00:13,013 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,SelfDestructingSolverStorable22 [2023-08-26 18:00:13,014 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 2 more)] === [2023-08-26 18:00:13,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:00:13,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1650500398, now seen corresponding path program 1 times [2023-08-26 18:00:13,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:00:13,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621284570] [2023-08-26 18:00:13,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:00:13,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:00:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:00:13,130 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:00:13,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:00:13,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621284570] [2023-08-26 18:00:13,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621284570] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:00:13,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668266044] [2023-08-26 18:00:13,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:00:13,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:00:13,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:00:13,132 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:00:13,153 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:00:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:00:13,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-26 18:00:13,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:00:13,272 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:00:13,272 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:00:13,352 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 18:00:13,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668266044] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:00:13,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:00:13,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-26 18:00:13,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366110001] [2023-08-26 18:00:13,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:00:13,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 18:00:13,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:00:13,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 18:00:13,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-08-26 18:00:13,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 195 [2023-08-26 18:00:13,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 72 transitions, 437 flow. Second operand has 13 states, 13 states have (on average 59.53846153846154) internal successors, (774), 13 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:13,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:00:13,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 195 [2023-08-26 18:00:13,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:00:13,837 INFO L124 PetriNetUnfolderBase]: 1032/1974 cut-off events. [2023-08-26 18:00:13,837 INFO L125 PetriNetUnfolderBase]: For 1100/1116 co-relation queries the response was YES. [2023-08-26 18:00:13,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5233 conditions, 1974 events. 1032/1974 cut-off events. For 1100/1116 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12980 event pairs, 392 based on Foata normal form. 6/1961 useless extension candidates. Maximal degree in co-relation 5205. Up to 828 conditions per place. [2023-08-26 18:00:13,848 INFO L140 encePairwiseOnDemand]: 180/195 looper letters, 82 selfloop transitions, 33 changer transitions 1/128 dead transitions. [2023-08-26 18:00:13,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 128 transitions, 873 flow [2023-08-26 18:00:13,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 18:00:13,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 18:00:13,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 789 transitions. [2023-08-26 18:00:13,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3371794871794872 [2023-08-26 18:00:13,851 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 789 transitions. [2023-08-26 18:00:13,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 789 transitions. [2023-08-26 18:00:13,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:00:13,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 789 transitions. [2023-08-26 18:00:13,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 65.75) internal successors, (789), 12 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:13,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 195.0) internal successors, (2535), 13 states have internal predecessors, (2535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:13,861 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 195.0) internal successors, (2535), 13 states have internal predecessors, (2535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:13,861 INFO L175 Difference]: Start difference. First operand has 96 places, 72 transitions, 437 flow. Second operand 12 states and 789 transitions. [2023-08-26 18:00:13,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 128 transitions, 873 flow [2023-08-26 18:00:13,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 128 transitions, 838 flow, removed 6 selfloop flow, removed 7 redundant places. [2023-08-26 18:00:13,868 INFO L231 Difference]: Finished difference. Result has 102 places, 75 transitions, 522 flow [2023-08-26 18:00:13,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=522, PETRI_PLACES=102, PETRI_TRANSITIONS=75} [2023-08-26 18:00:13,869 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 45 predicate places. [2023-08-26 18:00:13,869 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 75 transitions, 522 flow [2023-08-26 18:00:13,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 59.53846153846154) internal successors, (774), 13 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:13,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:00:13,870 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:00:13,878 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:00:14,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:00:14,075 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 2 more)] === [2023-08-26 18:00:14,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:00:14,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1386023487, now seen corresponding path program 1 times [2023-08-26 18:00:14,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:00:14,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737116922] [2023-08-26 18:00:14,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:00:14,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:00:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:00:14,177 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-26 18:00:14,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:00:14,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737116922] [2023-08-26 18:00:14,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737116922] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:00:14,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:00:14,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:00:14,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114867088] [2023-08-26 18:00:14,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:00:14,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:00:14,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:00:14,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:00:14,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:00:14,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 195 [2023-08-26 18:00:14,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 75 transitions, 522 flow. Second operand has 7 states, 7 states have (on average 59.42857142857143) internal successors, (416), 7 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:14,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:00:14,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 195 [2023-08-26 18:00:14,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:00:14,452 INFO L124 PetriNetUnfolderBase]: 755/1490 cut-off events. [2023-08-26 18:00:14,452 INFO L125 PetriNetUnfolderBase]: For 1328/1336 co-relation queries the response was YES. [2023-08-26 18:00:14,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4137 conditions, 1490 events. 755/1490 cut-off events. For 1328/1336 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9242 event pairs, 349 based on Foata normal form. 4/1477 useless extension candidates. Maximal degree in co-relation 4107. Up to 747 conditions per place. [2023-08-26 18:00:14,458 INFO L140 encePairwiseOnDemand]: 184/195 looper letters, 79 selfloop transitions, 13 changer transitions 1/105 dead transitions. [2023-08-26 18:00:14,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 105 transitions, 816 flow [2023-08-26 18:00:14,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:00:14,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:00:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 535 transitions. [2023-08-26 18:00:14,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34294871794871795 [2023-08-26 18:00:14,459 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 535 transitions. [2023-08-26 18:00:14,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 535 transitions. [2023-08-26 18:00:14,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:00:14,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 535 transitions. [2023-08-26 18:00:14,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 66.875) internal successors, (535), 8 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:14,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:14,463 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:14,463 INFO L175 Difference]: Start difference. First operand has 102 places, 75 transitions, 522 flow. Second operand 8 states and 535 transitions. [2023-08-26 18:00:14,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 105 transitions, 816 flow [2023-08-26 18:00:14,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 105 transitions, 791 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-26 18:00:14,468 INFO L231 Difference]: Finished difference. Result has 106 places, 76 transitions, 538 flow [2023-08-26 18:00:14,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=538, PETRI_PLACES=106, PETRI_TRANSITIONS=76} [2023-08-26 18:00:14,469 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 49 predicate places. [2023-08-26 18:00:14,469 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 76 transitions, 538 flow [2023-08-26 18:00:14,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 59.42857142857143) internal successors, (416), 7 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:14,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:00:14,469 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:00:14,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-26 18:00:14,469 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 2 more)] === [2023-08-26 18:00:14,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:00:14,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1070547635, now seen corresponding path program 1 times [2023-08-26 18:00:14,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:00:14,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528205866] [2023-08-26 18:00:14,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:00:14,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:00:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:00:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-26 18:00:14,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:00:14,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528205866] [2023-08-26 18:00:14,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528205866] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:00:14,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:00:14,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:00:14,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242298760] [2023-08-26 18:00:14,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:00:14,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:00:14,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:00:14,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:00:14,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:00:14,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 195 [2023-08-26 18:00:14,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 76 transitions, 538 flow. Second operand has 7 states, 7 states have (on average 59.42857142857143) internal successors, (416), 7 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:14,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:00:14,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 195 [2023-08-26 18:00:14,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:00:14,810 INFO L124 PetriNetUnfolderBase]: 489/992 cut-off events. [2023-08-26 18:00:14,810 INFO L125 PetriNetUnfolderBase]: For 966/978 co-relation queries the response was YES. [2023-08-26 18:00:14,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2862 conditions, 992 events. 489/992 cut-off events. For 966/978 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5526 event pairs, 251 based on Foata normal form. 6/987 useless extension candidates. Maximal degree in co-relation 2829. Up to 627 conditions per place. [2023-08-26 18:00:14,816 INFO L140 encePairwiseOnDemand]: 183/195 looper letters, 72 selfloop transitions, 14 changer transitions 1/99 dead transitions. [2023-08-26 18:00:14,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 99 transitions, 802 flow [2023-08-26 18:00:14,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:00:14,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:00:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 586 transitions. [2023-08-26 18:00:14,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3339031339031339 [2023-08-26 18:00:14,818 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 586 transitions. [2023-08-26 18:00:14,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 586 transitions. [2023-08-26 18:00:14,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:00:14,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 586 transitions. [2023-08-26 18:00:14,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 65.11111111111111) internal successors, (586), 9 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:14,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:14,821 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:14,821 INFO L175 Difference]: Start difference. First operand has 106 places, 76 transitions, 538 flow. Second operand 9 states and 586 transitions. [2023-08-26 18:00:14,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 99 transitions, 802 flow [2023-08-26 18:00:14,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 99 transitions, 774 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-26 18:00:14,827 INFO L231 Difference]: Finished difference. Result has 111 places, 77 transitions, 553 flow [2023-08-26 18:00:14,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=553, PETRI_PLACES=111, PETRI_TRANSITIONS=77} [2023-08-26 18:00:14,828 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 54 predicate places. [2023-08-26 18:00:14,828 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 77 transitions, 553 flow [2023-08-26 18:00:14,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 59.42857142857143) internal successors, (416), 7 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:00:14,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:00:14,828 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:00:14,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-26 18:00:14,828 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 2 more)] === [2023-08-26 18:00:14,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:00:14,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2105638839, now seen corresponding path program 1 times [2023-08-26 18:00:14,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:00:14,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167707952] [2023-08-26 18:00:14,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:00:14,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:00:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:00:14,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:00:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:00:14,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:00:14,882 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:00:14,883 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONASSERT (5 of 6 remaining) [2023-08-26 18:00:14,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 6 remaining) [2023-08-26 18:00:14,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONASSERT (3 of 6 remaining) [2023-08-26 18:00:14,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONASSERT (2 of 6 remaining) [2023-08-26 18:00:14,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONASSERT (1 of 6 remaining) [2023-08-26 18:00:14,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 6 remaining) [2023-08-26 18:00:14,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-26 18:00:14,883 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:00:14,884 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-26 18:00:14,886 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2023-08-26 18:00:14,886 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:00:14,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:00:14 BasicIcfg [2023-08-26 18:00:14,942 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:00:14,943 INFO L158 Benchmark]: Toolchain (without parser) took 26031.20ms. Allocated memory was 385.9MB in the beginning and 6.9GB in the end (delta: 6.5GB). Free memory was 341.9MB in the beginning and 6.0GB in the end (delta: -5.6GB). Peak memory consumption was 880.6MB. Max. memory is 16.0GB. [2023-08-26 18:00:14,943 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 385.9MB. Free memory was 363.3MB in the beginning and 363.1MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:00:14,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.49ms. Allocated memory is still 385.9MB. Free memory was 341.9MB in the beginning and 322.0MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-26 18:00:14,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.32ms. Allocated memory is still 385.9MB. Free memory was 322.0MB in the beginning and 319.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:00:14,944 INFO L158 Benchmark]: Boogie Preprocessor took 34.91ms. Allocated memory is still 385.9MB. Free memory was 319.9MB in the beginning and 318.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:00:14,944 INFO L158 Benchmark]: RCFGBuilder took 478.07ms. Allocated memory is still 385.9MB. Free memory was 318.9MB in the beginning and 301.1MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-08-26 18:00:14,945 INFO L158 Benchmark]: TraceAbstraction took 24967.51ms. Allocated memory was 385.9MB in the beginning and 6.9GB in the end (delta: 6.5GB). Free memory was 300.0MB in the beginning and 6.0GB in the end (delta: -5.7GB). Peak memory consumption was 838.7MB. Max. memory is 16.0GB. [2023-08-26 18:00:14,946 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 385.9MB. Free memory was 363.3MB in the beginning and 363.1MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 487.49ms. Allocated memory is still 385.9MB. Free memory was 341.9MB in the beginning and 322.0MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.32ms. Allocated memory is still 385.9MB. Free memory was 322.0MB in the beginning and 319.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.91ms. Allocated memory is still 385.9MB. Free memory was 319.9MB in the beginning and 318.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 478.07ms. Allocated memory is still 385.9MB. Free memory was 318.9MB in the beginning and 301.1MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 24967.51ms. Allocated memory was 385.9MB in the beginning and 6.9GB in the end (delta: 6.5GB). Free memory was 300.0MB in the beginning and 6.0GB in the end (delta: -5.7GB). Peak memory consumption was 838.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 269]: Unsoundness Warning unspecified type, defaulting to int C: short [269] - GenericResultAtLocation [Line: 269]: Unsoundness Warning unspecified type, defaulting to int C: short [269] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 54 PlacesBefore, 13 PlacesAfterwards, 55 TransitionsBefore, 10 TransitionsAfterwards, 780 CoEnabledTransitionPairs, 6 FixpointIterations, 12 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 4 ChoiceCompositions, 59 TotalNumberOfCompositions, 716 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 716, independent: 716, independent conditional: 0, independent unconditional: 716, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 426, independent: 426, independent conditional: 0, independent unconditional: 426, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 716, independent: 290, independent conditional: 0, independent unconditional: 290, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 426, unknown conditional: 0, unknown unconditional: 426] , Statistics on independence cache: Total cache size (in pairs): 2, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 54 PlacesBefore, 13 PlacesAfterwards, 55 TransitionsBefore, 10 TransitionsAfterwards, 780 CoEnabledTransitionPairs, 6 FixpointIterations, 12 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 4 ChoiceCompositions, 59 TotalNumberOfCompositions, 716 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 716, independent: 716, independent conditional: 0, independent unconditional: 716, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 426, independent: 426, independent conditional: 0, independent unconditional: 426, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 716, independent: 290, independent conditional: 0, independent unconditional: 290, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 426, unknown conditional: 0, unknown unconditional: 426] , Statistics on independence cache: Total cache size (in pairs): 2, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 80 PlacesBefore, 41 PlacesAfterwards, 82 TransitionsBefore, 38 TransitionsAfterwards, 2964 CoEnabledTransitionPairs, 5 FixpointIterations, 12 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 5 ChoiceCompositions, 67 TotalNumberOfCompositions, 10123 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5494, independent: 5226, independent conditional: 0, independent unconditional: 5226, dependent: 268, dependent conditional: 0, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1608, independent: 1581, independent conditional: 0, independent unconditional: 1581, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5494, independent: 3645, independent conditional: 0, independent unconditional: 3645, dependent: 241, dependent conditional: 0, dependent unconditional: 241, unknown: 1608, unknown conditional: 0, unknown unconditional: 1608] , Statistics on independence cache: Total cache size (in pairs): 247, Positive cache size: 227, Positive conditional cache size: 0, Positive unconditional cache size: 227, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 80 PlacesBefore, 41 PlacesAfterwards, 82 TransitionsBefore, 38 TransitionsAfterwards, 2964 CoEnabledTransitionPairs, 5 FixpointIterations, 12 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 5 ChoiceCompositions, 67 TotalNumberOfCompositions, 10123 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5123, independent: 4855, independent conditional: 0, independent unconditional: 4855, dependent: 268, dependent conditional: 0, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1594, independent: 1561, independent conditional: 0, independent unconditional: 1561, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5123, independent: 3294, independent conditional: 0, independent unconditional: 3294, dependent: 235, dependent conditional: 0, dependent unconditional: 235, unknown: 1594, unknown conditional: 0, unknown unconditional: 1594] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 219, Positive conditional cache size: 0, Positive unconditional cache size: 219, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 106 PlacesBefore, 57 PlacesAfterwards, 109 TransitionsBefore, 53 TransitionsAfterwards, 6552 CoEnabledTransitionPairs, 5 FixpointIterations, 12 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 19 ConcurrentYvCompositions, 7 ChoiceCompositions, 86 TotalNumberOfCompositions, 24454 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8326, independent: 7921, independent conditional: 0, independent unconditional: 7921, dependent: 405, dependent conditional: 0, dependent unconditional: 405, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3125, independent: 3074, independent conditional: 0, independent unconditional: 3074, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8326, independent: 4847, independent conditional: 0, independent unconditional: 4847, dependent: 354, dependent conditional: 0, dependent unconditional: 354, unknown: 3125, unknown conditional: 0, unknown unconditional: 3125] , Statistics on independence cache: Total cache size (in pairs): 259, Positive cache size: 219, Positive conditional cache size: 0, Positive unconditional cache size: 219, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 16]: assertion can be violated assertion can be violated We found a FailurePath: [L704] 0 volatile unsigned int count = 0; [L705] 0 _Bool MTX = 0; [L706] 0 _Bool COND = 0; [L732] 0 pthread_t t; VAL [COND=0, MTX=0, count=0, t={3:0}] [L733] COND TRUE 0 1 [L733] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, MTX=0, count=0, pthread_create(&t, 0, thr1, 0)=-3, t={3:0}] [L733] COND TRUE 0 1 [L727] CALL 1 Barrier2() [L718] CALL 1 __VERIFIER_atomic_acquire() [L709] CALL 1 assume_abort_if_not(MTX==0) [L3] COND FALSE 1 !(!cond) [L709] RET 1 assume_abort_if_not(MTX==0) [L710] 1 MTX = 1 [L718] RET 1 __VERIFIER_atomic_acquire() [L719] 1 count++ VAL [COND=0, MTX=1, count++=0, count=0] [L733] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, MTX=1, count=0, pthread_create(&t, 0, thr1, 0)=-2, t={3:0}] [L733] COND TRUE 0 1 [L733] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, MTX=1, count=0, pthread_create(&t, 0, thr1, 0)=-1, t={3:0}] [L719] 1 count++ [L720] COND FALSE 1 !(count == 3) VAL [COND=0, MTX=1, count=1] [L724] CALL 1 __VERIFIER_atomic_release() [L714] CALL 1 assume_abort_if_not(MTX==1) [L3] COND FALSE 1 !(!cond) [L714] RET 1 assume_abort_if_not(MTX==1) [L715] 1 MTX = 0 [L724] RET 1 __VERIFIER_atomic_release() [L727] CALL 2 Barrier2() [L718] CALL 2 __VERIFIER_atomic_acquire() [L709] CALL 2 assume_abort_if_not(MTX==0) [L3] COND FALSE 2 !(!cond) [L709] RET 2 assume_abort_if_not(MTX==0) [L710] 2 MTX = 1 [L718] RET 2 __VERIFIER_atomic_acquire() [L719] 2 count++ VAL [COND=0, MTX=1, count=2] [L720] COND FALSE 2 !(count == 3) VAL [COND=0, MTX=1, count=2] [L724] CALL 2 __VERIFIER_atomic_release() [L714] CALL 2 assume_abort_if_not(MTX==1) [L3] COND FALSE 2 !(!cond) [L714] RET 2 assume_abort_if_not(MTX==1) [L715] 2 MTX = 0 [L724] RET 2 __VERIFIER_atomic_release() [L727] CALL 3 Barrier2() [L718] CALL 3 __VERIFIER_atomic_acquire() [L709] CALL 3 assume_abort_if_not(MTX==0) [L3] COND FALSE 3 !(!cond) [L709] RET 3 assume_abort_if_not(MTX==0) [L710] 3 MTX = 1 [L718] RET 3 __VERIFIER_atomic_acquire() [L719] 3 count++ [L720] COND TRUE 3 count == 3 VAL [COND=0, MTX=1, count=3] [L721] 3 COND = 1 VAL [COND=1, MTX=1, count=3] [L722] 3 count = 0 VAL [COND=1, MTX=1, count=0] [L725] CALL 3 __VERIFIER_atomic_release() [L714] CALL 3 assume_abort_if_not(MTX==1) [L3] COND FALSE 3 !(!cond) [L714] RET 3 assume_abort_if_not(MTX==1) [L715] 3 MTX = 0 [L725] RET 3 __VERIFIER_atomic_release() [L727] RET 3 Barrier2() [L728] CALL 3 reach_error() [L16] COND FALSE 3 !(0) [L16] 3 __assert_fail ("0", "40_barrier_vf.c", 7, __extension__ __PRETTY_FUNCTION__) VAL [COND=1, MTX=0, count=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 76 locations, 5 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: 2.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15 IncrementalHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 15 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 9, 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, 0.3s InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 35 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 100 locations, 6 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: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 263 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 263 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 664 IncrementalHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 20 mSDtfsCounter, 664 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=292occurred in iteration=5, InterpolantAutomatonStates: 46, 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, 0.8s InterpolantComputationTime, 139 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 553 SizeOfPredicates, 5 NumberOfNonLiveVariables, 256 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 10/14 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 3 thread instances CFG has 5 procedures, 124 locations, 7 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: 15.5s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1009 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1009 mSDsluCounter, 210 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 122 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3027 IncrementalHoareTripleChecker+Invalid, 3129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 88 mSDtfsCounter, 3027 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 136 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=643occurred in iteration=5, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 350 ConstructedInterpolants, 0 QuantifiedInterpolants, 2033 SizeOfPredicates, 13 NumberOfNonLiveVariables, 564 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 58/86 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, 76 locations, 5 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.9s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.8s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 100 locations, 6 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: 0.9s, OverallIterations: 1, TraceHistogramMax: 3, 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=88occurred 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, 11 NumberOfCodeBlocks, 11 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 proved your program to be incorrect! [2023-08-26 18:00:14,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...