/usr/bin/java -Xmx8000000000 -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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-word-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 19:01:45,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 19:01:45,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 19:01:45,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 19:01:45,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 19:01:45,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 19:01:45,707 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 19:01:45,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 19:01:45,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 19:01:45,716 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 19:01:45,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 19:01:45,718 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 19:01:45,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 19:01:45,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 19:01:45,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 19:01:45,723 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 19:01:45,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 19:01:45,724 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 19:01:45,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 19:01:45,729 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 19:01:45,730 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 19:01:45,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 19:01:45,731 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 19:01:45,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 19:01:45,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 19:01:45,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 19:01:45,737 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 19:01:45,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 19:01:45,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 19:01:45,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 19:01:45,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 19:01:45,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 19:01:45,740 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 19:01:45,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 19:01:45,741 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 19:01:45,741 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 19:01:45,742 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 19:01:45,742 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 19:01:45,742 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 19:01:45,742 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 19:01:45,743 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 19:01:45,743 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-05 19:01:45,779 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 19:01:45,779 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 19:01:45,780 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 19:01:45,780 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 19:01:45,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 19:01:45,781 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 19:01:45,781 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 19:01:45,781 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 19:01:45,782 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 19:01:45,782 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 19:01:45,782 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 19:01:45,782 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 19:01:45,782 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 19:01:45,782 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 19:01:45,783 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 19:01:45,783 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 19:01:45,783 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 19:01:45,783 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 19:01:45,783 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 19:01:45,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 19:01:45,783 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 19:01:45,783 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 19:01:45,783 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 19:01:45,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 19:01:45,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 19:01:45,784 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 19:01:45,784 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 19:01:45,784 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 19:01:45,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 19:01:45,784 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-05 19:01:45,784 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 19:01:45,784 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-05 19:01:46,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 19:01:46,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 19:01:46,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 19:01:46,072 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 19:01:46,072 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 19:01:46,073 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-word-trans.wvr.c [2022-12-05 19:01:47,030 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 19:01:47,197 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 19:01:47,198 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-trans.wvr.c [2022-12-05 19:01:47,203 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a6af5bee/f78c09e88ae642f5a11a27c85c9c8e9f/FLAG6af451a85 [2022-12-05 19:01:47,213 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a6af5bee/f78c09e88ae642f5a11a27c85c9c8e9f [2022-12-05 19:01:47,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 19:01:47,215 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 19:01:47,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 19:01:47,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 19:01:47,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 19:01:47,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 07:01:47" (1/1) ... [2022-12-05 19:01:47,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@492c8750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:01:47, skipping insertion in model container [2022-12-05 19:01:47,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 07:01:47" (1/1) ... [2022-12-05 19:01:47,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 19:01:47,243 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 19:01:47,372 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-trans.wvr.c[3292,3305] [2022-12-05 19:01:47,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 19:01:47,385 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 19:01:47,401 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-trans.wvr.c[3292,3305] [2022-12-05 19:01:47,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 19:01:47,426 INFO L208 MainTranslator]: Completed translation [2022-12-05 19:01:47,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:01:47 WrapperNode [2022-12-05 19:01:47,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 19:01:47,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 19:01:47,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 19:01:47,427 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 19:01:47,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:01:47" (1/1) ... [2022-12-05 19:01:47,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:01:47" (1/1) ... [2022-12-05 19:01:47,463 INFO L138 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 172 [2022-12-05 19:01:47,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 19:01:47,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 19:01:47,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 19:01:47,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 19:01:47,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:01:47" (1/1) ... [2022-12-05 19:01:47,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:01:47" (1/1) ... [2022-12-05 19:01:47,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:01:47" (1/1) ... [2022-12-05 19:01:47,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:01:47" (1/1) ... [2022-12-05 19:01:47,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:01:47" (1/1) ... [2022-12-05 19:01:47,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:01:47" (1/1) ... [2022-12-05 19:01:47,482 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:01:47" (1/1) ... [2022-12-05 19:01:47,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:01:47" (1/1) ... [2022-12-05 19:01:47,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 19:01:47,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 19:01:47,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 19:01:47,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 19:01:47,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:01:47" (1/1) ... [2022-12-05 19:01:47,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 19:01:47,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:01:47,524 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) [2022-12-05 19:01:47,543 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 [2022-12-05 19:01:47,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 19:01:47,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 19:01:47,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 19:01:47,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 19:01:47,567 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-05 19:01:47,567 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-05 19:01:47,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-05 19:01:47,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-05 19:01:47,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-05 19:01:47,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-05 19:01:47,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 19:01:47,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-05 19:01:47,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 19:01:47,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 19:01:47,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 19:01:47,570 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 19:01:47,709 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 19:01:47,723 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 19:01:48,034 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 19:01:48,043 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 19:01:48,043 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-05 19:01:48,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 07:01:48 BoogieIcfgContainer [2022-12-05 19:01:48,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 19:01:48,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 19:01:48,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 19:01:48,053 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 19:01:48,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 07:01:47" (1/3) ... [2022-12-05 19:01:48,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4851350c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 07:01:48, skipping insertion in model container [2022-12-05 19:01:48,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:01:47" (2/3) ... [2022-12-05 19:01:48,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4851350c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 07:01:48, skipping insertion in model container [2022-12-05 19:01:48,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 07:01:48" (3/3) ... [2022-12-05 19:01:48,055 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2022-12-05 19:01:48,067 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 19:01:48,067 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 19:01:48,067 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 19:01:48,158 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-05 19:01:48,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 264 places, 282 transitions, 588 flow [2022-12-05 19:01:48,292 INFO L130 PetriNetUnfolder]: 28/279 cut-off events. [2022-12-05 19:01:48,293 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 19:01:48,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 279 events. 28/279 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 368 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 223. Up to 3 conditions per place. [2022-12-05 19:01:48,303 INFO L82 GeneralOperation]: Start removeDead. Operand has 264 places, 282 transitions, 588 flow [2022-12-05 19:01:48,314 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 251 places, 269 transitions, 556 flow [2022-12-05 19:01:48,324 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 19:01:48,329 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;@24d65a27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 19:01:48,330 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-05 19:01:48,378 INFO L130 PetriNetUnfolder]: 28/268 cut-off events. [2022-12-05 19:01:48,379 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 19:01:48,379 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:01:48,380 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:01:48,380 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:01:48,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:01:48,385 INFO L85 PathProgramCache]: Analyzing trace with hash -733290481, now seen corresponding path program 1 times [2022-12-05 19:01:48,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:01:48,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488519255] [2022-12-05 19:01:48,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:01:48,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:01:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:01:49,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:01:49,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:01:49,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488519255] [2022-12-05 19:01:49,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488519255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:01:49,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:01:49,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:01:49,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948633684] [2022-12-05 19:01:49,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:01:49,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:01:49,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:01:49,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:01:49,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:01:49,574 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 282 [2022-12-05 19:01:49,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 269 transitions, 556 flow. Second operand has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:01:49,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:01:49,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 282 [2022-12-05 19:01:49,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:01:50,191 INFO L130 PetriNetUnfolder]: 644/2464 cut-off events. [2022-12-05 19:01:50,191 INFO L131 PetriNetUnfolder]: For 205/205 co-relation queries the response was YES. [2022-12-05 19:01:50,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3367 conditions, 2464 events. 644/2464 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 20118 event pairs, 214 based on Foata normal form. 145/2207 useless extension candidates. Maximal degree in co-relation 2977. Up to 523 conditions per place. [2022-12-05 19:01:50,213 INFO L137 encePairwiseOnDemand]: 248/282 looper letters, 81 selfloop transitions, 15 changer transitions 14/301 dead transitions. [2022-12-05 19:01:50,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 301 transitions, 867 flow [2022-12-05 19:01:50,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 19:01:50,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 19:01:50,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2366 transitions. [2022-12-05 19:01:50,230 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7627337201805287 [2022-12-05 19:01:50,231 INFO L175 Difference]: Start difference. First operand has 251 places, 269 transitions, 556 flow. Second operand 11 states and 2366 transitions. [2022-12-05 19:01:50,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 301 transitions, 867 flow [2022-12-05 19:01:50,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 301 transitions, 837 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-05 19:01:50,242 INFO L231 Difference]: Finished difference. Result has 260 places, 259 transitions, 590 flow [2022-12-05 19:01:50,244 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=590, PETRI_PLACES=260, PETRI_TRANSITIONS=259} [2022-12-05 19:01:50,250 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 9 predicate places. [2022-12-05 19:01:50,250 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 259 transitions, 590 flow [2022-12-05 19:01:50,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:01:50,251 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:01:50,251 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:01:50,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 19:01:50,252 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:01:50,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:01:50,253 INFO L85 PathProgramCache]: Analyzing trace with hash -940695419, now seen corresponding path program 2 times [2022-12-05 19:01:50,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:01:50,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233357195] [2022-12-05 19:01:50,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:01:50,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:01:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:01:50,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:01:50,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:01:50,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233357195] [2022-12-05 19:01:50,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233357195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:01:50,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:01:50,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:01:50,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127245521] [2022-12-05 19:01:50,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:01:50,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:01:50,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:01:50,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:01:50,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:01:50,733 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 282 [2022-12-05 19:01:50,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 259 transitions, 590 flow. Second operand has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:01:50,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:01:50,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 282 [2022-12-05 19:01:50,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:01:51,219 INFO L130 PetriNetUnfolder]: 753/2758 cut-off events. [2022-12-05 19:01:51,219 INFO L131 PetriNetUnfolder]: For 816/955 co-relation queries the response was YES. [2022-12-05 19:01:51,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4512 conditions, 2758 events. 753/2758 cut-off events. For 816/955 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 23893 event pairs, 356 based on Foata normal form. 8/2392 useless extension candidates. Maximal degree in co-relation 4469. Up to 644 conditions per place. [2022-12-05 19:01:51,239 INFO L137 encePairwiseOnDemand]: 271/282 looper letters, 97 selfloop transitions, 9 changer transitions 6/303 dead transitions. [2022-12-05 19:01:51,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 303 transitions, 978 flow [2022-12-05 19:01:51,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 19:01:51,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 19:01:51,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1723 transitions. [2022-12-05 19:01:51,248 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7637411347517731 [2022-12-05 19:01:51,248 INFO L175 Difference]: Start difference. First operand has 260 places, 259 transitions, 590 flow. Second operand 8 states and 1723 transitions. [2022-12-05 19:01:51,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 303 transitions, 978 flow [2022-12-05 19:01:51,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 303 transitions, 962 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-05 19:01:51,260 INFO L231 Difference]: Finished difference. Result has 257 places, 263 transitions, 649 flow [2022-12-05 19:01:51,261 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=649, PETRI_PLACES=257, PETRI_TRANSITIONS=263} [2022-12-05 19:01:51,261 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 6 predicate places. [2022-12-05 19:01:51,261 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 263 transitions, 649 flow [2022-12-05 19:01:51,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:01:51,262 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:01:51,262 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:01:51,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 19:01:51,262 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:01:51,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:01:51,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1165285589, now seen corresponding path program 3 times [2022-12-05 19:01:51,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:01:51,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764942680] [2022-12-05 19:01:51,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:01:51,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:01:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:01:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:01:51,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:01:51,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764942680] [2022-12-05 19:01:51,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764942680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:01:51,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:01:51,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:01:51,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134823748] [2022-12-05 19:01:51,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:01:51,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:01:51,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:01:51,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:01:51,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:01:51,577 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 282 [2022-12-05 19:01:51,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 263 transitions, 649 flow. Second operand has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:01:51,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:01:51,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 282 [2022-12-05 19:01:51,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:01:52,016 INFO L130 PetriNetUnfolder]: 740/2749 cut-off events. [2022-12-05 19:01:52,016 INFO L131 PetriNetUnfolder]: For 1573/1712 co-relation queries the response was YES. [2022-12-05 19:01:52,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4849 conditions, 2749 events. 740/2749 cut-off events. For 1573/1712 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 24173 event pairs, 298 based on Foata normal form. 7/2398 useless extension candidates. Maximal degree in co-relation 4807. Up to 645 conditions per place. [2022-12-05 19:01:52,035 INFO L137 encePairwiseOnDemand]: 270/282 looper letters, 94 selfloop transitions, 15 changer transitions 4/304 dead transitions. [2022-12-05 19:01:52,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 304 transitions, 1044 flow [2022-12-05 19:01:52,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 19:01:52,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 19:01:52,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1523 transitions. [2022-12-05 19:01:52,038 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7715298885511651 [2022-12-05 19:01:52,038 INFO L175 Difference]: Start difference. First operand has 257 places, 263 transitions, 649 flow. Second operand 7 states and 1523 transitions. [2022-12-05 19:01:52,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 304 transitions, 1044 flow [2022-12-05 19:01:52,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 304 transitions, 1024 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-05 19:01:52,047 INFO L231 Difference]: Finished difference. Result has 262 places, 273 transitions, 781 flow [2022-12-05 19:01:52,047 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=781, PETRI_PLACES=262, PETRI_TRANSITIONS=273} [2022-12-05 19:01:52,048 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 11 predicate places. [2022-12-05 19:01:52,048 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 273 transitions, 781 flow [2022-12-05 19:01:52,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:01:52,049 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:01:52,049 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:01:52,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 19:01:52,049 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:01:52,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:01:52,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1541087517, now seen corresponding path program 4 times [2022-12-05 19:01:52,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:01:52,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046471889] [2022-12-05 19:01:52,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:01:52,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:01:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:01:52,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:01:52,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:01:52,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046471889] [2022-12-05 19:01:52,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046471889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:01:52,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:01:52,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:01:52,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822294289] [2022-12-05 19:01:52,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:01:52,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:01:52,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:01:52,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:01:52,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:01:52,431 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 282 [2022-12-05 19:01:52,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 273 transitions, 781 flow. Second operand has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:01:52,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:01:52,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 282 [2022-12-05 19:01:52,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:01:52,924 INFO L130 PetriNetUnfolder]: 790/3283 cut-off events. [2022-12-05 19:01:52,925 INFO L131 PetriNetUnfolder]: For 3358/3489 co-relation queries the response was YES. [2022-12-05 19:01:52,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6075 conditions, 3283 events. 790/3283 cut-off events. For 3358/3489 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 31404 event pairs, 330 based on Foata normal form. 17/2889 useless extension candidates. Maximal degree in co-relation 6010. Up to 832 conditions per place. [2022-12-05 19:01:52,948 INFO L137 encePairwiseOnDemand]: 270/282 looper letters, 110 selfloop transitions, 12 changer transitions 6/319 dead transitions. [2022-12-05 19:01:52,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 319 transitions, 1282 flow [2022-12-05 19:01:52,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 19:01:52,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 19:01:52,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1925 transitions. [2022-12-05 19:01:52,952 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7584712371946415 [2022-12-05 19:01:52,952 INFO L175 Difference]: Start difference. First operand has 262 places, 273 transitions, 781 flow. Second operand 9 states and 1925 transitions. [2022-12-05 19:01:52,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 319 transitions, 1282 flow [2022-12-05 19:01:52,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 319 transitions, 1252 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-05 19:01:52,968 INFO L231 Difference]: Finished difference. Result has 271 places, 278 transitions, 874 flow [2022-12-05 19:01:52,968 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=874, PETRI_PLACES=271, PETRI_TRANSITIONS=278} [2022-12-05 19:01:52,969 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 20 predicate places. [2022-12-05 19:01:52,969 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 278 transitions, 874 flow [2022-12-05 19:01:52,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:01:52,970 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:01:52,970 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:01:52,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 19:01:52,971 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:01:52,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:01:52,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1434190913, now seen corresponding path program 5 times [2022-12-05 19:01:52,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:01:52,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677292042] [2022-12-05 19:01:52,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:01:52,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:01:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:01:53,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:01:53,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:01:53,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677292042] [2022-12-05 19:01:53,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677292042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:01:53,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:01:53,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:01:53,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86089962] [2022-12-05 19:01:53,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:01:53,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:01:53,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:01:53,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:01:53,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:01:53,363 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 282 [2022-12-05 19:01:53,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 278 transitions, 874 flow. Second operand has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:01:53,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:01:53,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 282 [2022-12-05 19:01:53,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:01:53,866 INFO L130 PetriNetUnfolder]: 807/3341 cut-off events. [2022-12-05 19:01:53,867 INFO L131 PetriNetUnfolder]: For 4359/4536 co-relation queries the response was YES. [2022-12-05 19:01:53,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6445 conditions, 3341 events. 807/3341 cut-off events. For 4359/4536 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 32249 event pairs, 320 based on Foata normal form. 16/2951 useless extension candidates. Maximal degree in co-relation 6371. Up to 833 conditions per place. [2022-12-05 19:01:53,885 INFO L137 encePairwiseOnDemand]: 268/282 looper letters, 109 selfloop transitions, 24 changer transitions 4/328 dead transitions. [2022-12-05 19:01:53,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 328 transitions, 1395 flow [2022-12-05 19:01:53,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 19:01:53,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 19:01:53,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1725 transitions. [2022-12-05 19:01:53,888 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7646276595744681 [2022-12-05 19:01:53,888 INFO L175 Difference]: Start difference. First operand has 271 places, 278 transitions, 874 flow. Second operand 8 states and 1725 transitions. [2022-12-05 19:01:53,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 328 transitions, 1395 flow [2022-12-05 19:01:53,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 328 transitions, 1365 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-05 19:01:53,905 INFO L231 Difference]: Finished difference. Result has 276 places, 290 transitions, 1057 flow [2022-12-05 19:01:53,906 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1057, PETRI_PLACES=276, PETRI_TRANSITIONS=290} [2022-12-05 19:01:53,907 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 25 predicate places. [2022-12-05 19:01:53,907 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 290 transitions, 1057 flow [2022-12-05 19:01:53,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:01:53,908 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:01:53,908 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:01:53,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 19:01:53,909 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:01:53,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:01:53,909 INFO L85 PathProgramCache]: Analyzing trace with hash -788395583, now seen corresponding path program 6 times [2022-12-05 19:01:53,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:01:53,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814858492] [2022-12-05 19:01:53,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:01:53,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:01:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:01:54,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:01:54,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:01:54,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814858492] [2022-12-05 19:01:54,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814858492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:01:54,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:01:54,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:01:54,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065636472] [2022-12-05 19:01:54,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:01:54,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:01:54,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:01:54,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:01:54,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:01:54,255 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 282 [2022-12-05 19:01:54,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 290 transitions, 1057 flow. Second operand has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:01:54,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:01:54,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 282 [2022-12-05 19:01:54,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:01:54,796 INFO L130 PetriNetUnfolder]: 869/3803 cut-off events. [2022-12-05 19:01:54,796 INFO L131 PetriNetUnfolder]: For 6559/6710 co-relation queries the response was YES. [2022-12-05 19:01:54,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7575 conditions, 3803 events. 869/3803 cut-off events. For 6559/6710 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 38188 event pairs, 248 based on Foata normal form. 26/3419 useless extension candidates. Maximal degree in co-relation 7503. Up to 778 conditions per place. [2022-12-05 19:01:54,820 INFO L137 encePairwiseOnDemand]: 268/282 looper letters, 93 selfloop transitions, 47 changer transitions 4/335 dead transitions. [2022-12-05 19:01:54,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 335 transitions, 1595 flow [2022-12-05 19:01:54,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 19:01:54,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 19:01:54,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1725 transitions. [2022-12-05 19:01:54,823 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7646276595744681 [2022-12-05 19:01:54,824 INFO L175 Difference]: Start difference. First operand has 276 places, 290 transitions, 1057 flow. Second operand 8 states and 1725 transitions. [2022-12-05 19:01:54,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 335 transitions, 1595 flow [2022-12-05 19:01:54,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 335 transitions, 1568 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-05 19:01:54,852 INFO L231 Difference]: Finished difference. Result has 282 places, 304 transitions, 1317 flow [2022-12-05 19:01:54,852 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1317, PETRI_PLACES=282, PETRI_TRANSITIONS=304} [2022-12-05 19:01:54,853 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 31 predicate places. [2022-12-05 19:01:54,853 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 304 transitions, 1317 flow [2022-12-05 19:01:54,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:01:54,854 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:01:54,854 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:01:54,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 19:01:54,854 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:01:54,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:01:54,855 INFO L85 PathProgramCache]: Analyzing trace with hash -460812762, now seen corresponding path program 1 times [2022-12-05 19:01:54,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:01:54,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136024496] [2022-12-05 19:01:54,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:01:54,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:01:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:01:54,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:01:54,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:01:54,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136024496] [2022-12-05 19:01:54,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136024496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:01:54,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:01:54,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 19:01:54,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351795004] [2022-12-05 19:01:54,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:01:54,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 19:01:54,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:01:54,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 19:01:54,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 19:01:54,942 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 282 [2022-12-05 19:01:54,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 304 transitions, 1317 flow. Second operand has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:01:54,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:01:54,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 282 [2022-12-05 19:01:54,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:01:55,118 INFO L130 PetriNetUnfolder]: 150/1423 cut-off events. [2022-12-05 19:01:55,118 INFO L131 PetriNetUnfolder]: For 2390/2599 co-relation queries the response was YES. [2022-12-05 19:01:55,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2690 conditions, 1423 events. 150/1423 cut-off events. For 2390/2599 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 11560 event pairs, 12 based on Foata normal form. 4/1299 useless extension candidates. Maximal degree in co-relation 2605. Up to 102 conditions per place. [2022-12-05 19:01:55,130 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 14 selfloop transitions, 2 changer transitions 0/310 dead transitions. [2022-12-05 19:01:55,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 310 transitions, 1366 flow [2022-12-05 19:01:55,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 19:01:55,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 19:01:55,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2022-12-05 19:01:55,132 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9349881796690307 [2022-12-05 19:01:55,132 INFO L175 Difference]: Start difference. First operand has 282 places, 304 transitions, 1317 flow. Second operand 3 states and 791 transitions. [2022-12-05 19:01:55,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 310 transitions, 1366 flow [2022-12-05 19:01:55,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 310 transitions, 1292 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-12-05 19:01:55,145 INFO L231 Difference]: Finished difference. Result has 279 places, 304 transitions, 1251 flow [2022-12-05 19:01:55,145 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1251, PETRI_PLACES=279, PETRI_TRANSITIONS=304} [2022-12-05 19:01:55,146 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 28 predicate places. [2022-12-05 19:01:55,146 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 304 transitions, 1251 flow [2022-12-05 19:01:55,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:01:55,147 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:01:55,147 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:01:55,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 19:01:55,148 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:01:55,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:01:55,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1578606610, now seen corresponding path program 1 times [2022-12-05 19:01:55,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:01:55,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285616460] [2022-12-05 19:01:55,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:01:55,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:01:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:01:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:01:55,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:01:55,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285616460] [2022-12-05 19:01:55,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285616460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:01:55,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:01:55,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 19:01:55,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391610305] [2022-12-05 19:01:55,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:01:55,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 19:01:55,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:01:55,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 19:01:55,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 19:01:55,225 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 282 [2022-12-05 19:01:55,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 304 transitions, 1251 flow. Second operand has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:01:55,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:01:55,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 282 [2022-12-05 19:01:55,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:01:55,442 INFO L130 PetriNetUnfolder]: 250/1931 cut-off events. [2022-12-05 19:01:55,443 INFO L131 PetriNetUnfolder]: For 2595/2699 co-relation queries the response was YES. [2022-12-05 19:01:55,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3529 conditions, 1931 events. 250/1931 cut-off events. For 2595/2699 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 17193 event pairs, 46 based on Foata normal form. 4/1751 useless extension candidates. Maximal degree in co-relation 2945. Up to 131 conditions per place. [2022-12-05 19:01:55,462 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 13 selfloop transitions, 2 changer transitions 0/309 dead transitions. [2022-12-05 19:01:55,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 309 transitions, 1295 flow [2022-12-05 19:01:55,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 19:01:55,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 19:01:55,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 790 transitions. [2022-12-05 19:01:55,464 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.933806146572104 [2022-12-05 19:01:55,464 INFO L175 Difference]: Start difference. First operand has 279 places, 304 transitions, 1251 flow. Second operand 3 states and 790 transitions. [2022-12-05 19:01:55,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 309 transitions, 1295 flow [2022-12-05 19:01:55,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 309 transitions, 1291 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 19:01:55,475 INFO L231 Difference]: Finished difference. Result has 280 places, 304 transitions, 1255 flow [2022-12-05 19:01:55,475 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=1247, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1255, PETRI_PLACES=280, PETRI_TRANSITIONS=304} [2022-12-05 19:01:55,477 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 29 predicate places. [2022-12-05 19:01:55,477 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 304 transitions, 1255 flow [2022-12-05 19:01:55,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:01:55,478 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:01:55,478 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:01:55,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 19:01:55,478 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:01:55,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:01:55,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1138273313, now seen corresponding path program 1 times [2022-12-05 19:01:55,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:01:55,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660395938] [2022-12-05 19:01:55,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:01:55,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:01:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:01:55,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:01:55,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:01:55,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660395938] [2022-12-05 19:01:55,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660395938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:01:55,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:01:55,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:01:55,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777804204] [2022-12-05 19:01:55,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:01:55,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:01:55,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:01:55,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:01:55,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:01:55,754 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-05 19:01:55,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 304 transitions, 1255 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:01:55,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:01:55,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-05 19:01:55,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:01:56,347 INFO L130 PetriNetUnfolder]: 961/4862 cut-off events. [2022-12-05 19:01:56,347 INFO L131 PetriNetUnfolder]: For 10867/11670 co-relation queries the response was YES. [2022-12-05 19:01:56,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10292 conditions, 4862 events. 961/4862 cut-off events. For 10867/11670 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 51676 event pairs, 238 based on Foata normal form. 42/4542 useless extension candidates. Maximal degree in co-relation 9412. Up to 743 conditions per place. [2022-12-05 19:01:56,383 INFO L137 encePairwiseOnDemand]: 270/282 looper letters, 139 selfloop transitions, 12 changer transitions 4/353 dead transitions. [2022-12-05 19:01:56,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 353 transitions, 1945 flow [2022-12-05 19:01:56,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 19:01:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 19:01:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1950 transitions. [2022-12-05 19:01:56,388 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7683215130023641 [2022-12-05 19:01:56,388 INFO L175 Difference]: Start difference. First operand has 280 places, 304 transitions, 1255 flow. Second operand 9 states and 1950 transitions. [2022-12-05 19:01:56,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 353 transitions, 1945 flow [2022-12-05 19:01:56,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 353 transitions, 1941 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 19:01:56,412 INFO L231 Difference]: Finished difference. Result has 291 places, 310 transitions, 1394 flow [2022-12-05 19:01:56,412 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=1251, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1394, PETRI_PLACES=291, PETRI_TRANSITIONS=310} [2022-12-05 19:01:56,413 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 40 predicate places. [2022-12-05 19:01:56,413 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 310 transitions, 1394 flow [2022-12-05 19:01:56,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:01:56,414 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:01:56,414 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:01:56,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 19:01:56,415 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:01:56,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:01:56,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1417108577, now seen corresponding path program 2 times [2022-12-05 19:01:56,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:01:56,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295909466] [2022-12-05 19:01:56,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:01:56,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:01:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:01:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:01:56,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:01:56,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295909466] [2022-12-05 19:01:56,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295909466] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:01:56,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:01:56,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:01:56,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747331565] [2022-12-05 19:01:56,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:01:56,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:01:56,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:01:56,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:01:56,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:01:56,677 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-05 19:01:56,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 310 transitions, 1394 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:01:56,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:01:56,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-05 19:01:56,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:01:57,302 INFO L130 PetriNetUnfolder]: 944/4498 cut-off events. [2022-12-05 19:01:57,302 INFO L131 PetriNetUnfolder]: For 12355/12976 co-relation queries the response was YES. [2022-12-05 19:01:57,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10033 conditions, 4498 events. 944/4498 cut-off events. For 12355/12976 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 46260 event pairs, 428 based on Foata normal form. 57/4133 useless extension candidates. Maximal degree in co-relation 9873. Up to 1019 conditions per place. [2022-12-05 19:01:57,331 INFO L137 encePairwiseOnDemand]: 270/282 looper letters, 127 selfloop transitions, 16 changer transitions 5/346 dead transitions. [2022-12-05 19:01:57,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 346 transitions, 1948 flow [2022-12-05 19:01:57,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 19:01:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 19:01:57,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1947 transitions. [2022-12-05 19:01:57,334 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7671394799054374 [2022-12-05 19:01:57,334 INFO L175 Difference]: Start difference. First operand has 291 places, 310 transitions, 1394 flow. Second operand 9 states and 1947 transitions. [2022-12-05 19:01:57,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 346 transitions, 1948 flow [2022-12-05 19:01:57,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 346 transitions, 1904 flow, removed 17 selfloop flow, removed 5 redundant places. [2022-12-05 19:01:57,363 INFO L231 Difference]: Finished difference. Result has 297 places, 314 transitions, 1487 flow [2022-12-05 19:01:57,364 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=1361, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1487, PETRI_PLACES=297, PETRI_TRANSITIONS=314} [2022-12-05 19:01:57,364 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 46 predicate places. [2022-12-05 19:01:57,364 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 314 transitions, 1487 flow [2022-12-05 19:01:57,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:01:57,365 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:01:57,365 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:01:57,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 19:01:57,365 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:01:57,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:01:57,366 INFO L85 PathProgramCache]: Analyzing trace with hash -698801115, now seen corresponding path program 3 times [2022-12-05 19:01:57,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:01:57,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449865141] [2022-12-05 19:01:57,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:01:57,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:01:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:01:57,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:01:57,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:01:57,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449865141] [2022-12-05 19:01:57,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449865141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:01:57,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:01:57,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-12-05 19:01:57,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349465723] [2022-12-05 19:01:57,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:01:57,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 19:01:57,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:01:57,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 19:01:57,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-12-05 19:01:57,759 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 282 [2022-12-05 19:01:57,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 314 transitions, 1487 flow. Second operand has 17 states, 17 states have (on average 181.64705882352942) internal successors, (3088), 17 states have internal predecessors, (3088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:01:57,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:01:57,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 282 [2022-12-05 19:01:57,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:01:59,516 INFO L130 PetriNetUnfolder]: 2484/10139 cut-off events. [2022-12-05 19:01:59,516 INFO L131 PetriNetUnfolder]: For 17827/18337 co-relation queries the response was YES. [2022-12-05 19:01:59,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20790 conditions, 10139 events. 2484/10139 cut-off events. For 17827/18337 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 118369 event pairs, 579 based on Foata normal form. 90/8869 useless extension candidates. Maximal degree in co-relation 20542. Up to 1412 conditions per place. [2022-12-05 19:01:59,659 INFO L137 encePairwiseOnDemand]: 257/282 looper letters, 191 selfloop transitions, 43 changer transitions 6/444 dead transitions. [2022-12-05 19:01:59,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 444 transitions, 2734 flow [2022-12-05 19:01:59,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-05 19:01:59,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-05 19:01:59,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4271 transitions. [2022-12-05 19:01:59,665 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.658495220474869 [2022-12-05 19:01:59,665 INFO L175 Difference]: Start difference. First operand has 297 places, 314 transitions, 1487 flow. Second operand 23 states and 4271 transitions. [2022-12-05 19:01:59,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 444 transitions, 2734 flow [2022-12-05 19:01:59,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 444 transitions, 2675 flow, removed 23 selfloop flow, removed 5 redundant places. [2022-12-05 19:01:59,720 INFO L231 Difference]: Finished difference. Result has 324 places, 338 transitions, 1755 flow [2022-12-05 19:01:59,720 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1755, PETRI_PLACES=324, PETRI_TRANSITIONS=338} [2022-12-05 19:01:59,721 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 73 predicate places. [2022-12-05 19:01:59,721 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 338 transitions, 1755 flow [2022-12-05 19:01:59,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 181.64705882352942) internal successors, (3088), 17 states have internal predecessors, (3088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:01:59,723 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:01:59,723 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:01:59,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 19:01:59,723 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:01:59,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:01:59,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1841795159, now seen corresponding path program 1 times [2022-12-05 19:01:59,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:01:59,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035199538] [2022-12-05 19:01:59,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:01:59,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:01:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:01:59,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:01:59,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:01:59,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035199538] [2022-12-05 19:01:59,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035199538] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:01:59,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:01:59,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:01:59,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064283640] [2022-12-05 19:01:59,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:01:59,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:01:59,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:01:59,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:01:59,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:01:59,959 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-05 19:01:59,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 338 transitions, 1755 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:01:59,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:01:59,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-05 19:01:59,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:02:01,653 INFO L130 PetriNetUnfolder]: 2140/12279 cut-off events. [2022-12-05 19:02:01,653 INFO L131 PetriNetUnfolder]: For 28590/28714 co-relation queries the response was YES. [2022-12-05 19:02:01,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26017 conditions, 12279 events. 2140/12279 cut-off events. For 28590/28714 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 158213 event pairs, 762 based on Foata normal form. 35/11101 useless extension candidates. Maximal degree in co-relation 25614. Up to 1779 conditions per place. [2022-12-05 19:02:01,736 INFO L137 encePairwiseOnDemand]: 270/282 looper letters, 132 selfloop transitions, 28 changer transitions 10/408 dead transitions. [2022-12-05 19:02:01,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 408 transitions, 2773 flow [2022-12-05 19:02:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 19:02:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 19:02:01,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1947 transitions. [2022-12-05 19:02:01,752 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7671394799054374 [2022-12-05 19:02:01,752 INFO L175 Difference]: Start difference. First operand has 324 places, 338 transitions, 1755 flow. Second operand 9 states and 1947 transitions. [2022-12-05 19:02:01,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 408 transitions, 2773 flow [2022-12-05 19:02:01,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 408 transitions, 2730 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-12-05 19:02:01,843 INFO L231 Difference]: Finished difference. Result has 329 places, 351 transitions, 2008 flow [2022-12-05 19:02:01,844 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=1733, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2008, PETRI_PLACES=329, PETRI_TRANSITIONS=351} [2022-12-05 19:02:01,845 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 78 predicate places. [2022-12-05 19:02:01,845 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 351 transitions, 2008 flow [2022-12-05 19:02:01,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:01,846 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:02:01,846 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:02:01,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 19:02:01,846 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:02:01,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:02:01,846 INFO L85 PathProgramCache]: Analyzing trace with hash -427857877, now seen corresponding path program 2 times [2022-12-05 19:02:01,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:02:01,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758860377] [2022-12-05 19:02:01,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:02:01,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:02:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:02:02,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:02:02,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:02:02,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758860377] [2022-12-05 19:02:02,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758860377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:02:02,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:02:02,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:02:02,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036710786] [2022-12-05 19:02:02,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:02:02,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:02:02,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:02:02,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:02:02,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:02:02,152 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-05 19:02:02,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 351 transitions, 2008 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:02,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:02:02,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-05 19:02:02,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:02:03,418 INFO L130 PetriNetUnfolder]: 1813/9853 cut-off events. [2022-12-05 19:02:03,419 INFO L131 PetriNetUnfolder]: For 33681/34025 co-relation queries the response was YES. [2022-12-05 19:02:03,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23311 conditions, 9853 events. 1813/9853 cut-off events. For 33681/34025 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 121573 event pairs, 343 based on Foata normal form. 28/9196 useless extension candidates. Maximal degree in co-relation 22905. Up to 2001 conditions per place. [2022-12-05 19:02:03,568 INFO L137 encePairwiseOnDemand]: 271/282 looper letters, 119 selfloop transitions, 39 changer transitions 11/405 dead transitions. [2022-12-05 19:02:03,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 405 transitions, 2789 flow [2022-12-05 19:02:03,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 19:02:03,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 19:02:03,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1752 transitions. [2022-12-05 19:02:03,571 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.776595744680851 [2022-12-05 19:02:03,571 INFO L175 Difference]: Start difference. First operand has 329 places, 351 transitions, 2008 flow. Second operand 8 states and 1752 transitions. [2022-12-05 19:02:03,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 405 transitions, 2789 flow [2022-12-05 19:02:03,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 405 transitions, 2753 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-05 19:02:03,661 INFO L231 Difference]: Finished difference. Result has 333 places, 364 transitions, 2273 flow [2022-12-05 19:02:03,661 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=1983, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2273, PETRI_PLACES=333, PETRI_TRANSITIONS=364} [2022-12-05 19:02:03,662 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 82 predicate places. [2022-12-05 19:02:03,662 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 364 transitions, 2273 flow [2022-12-05 19:02:03,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:03,663 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:02:03,663 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:02:03,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 19:02:03,663 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:02:03,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:02:03,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1660677777, now seen corresponding path program 3 times [2022-12-05 19:02:03,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:02:03,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105169433] [2022-12-05 19:02:03,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:02:03,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:02:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:02:03,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:02:03,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:02:03,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105169433] [2022-12-05 19:02:03,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105169433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:02:03,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:02:03,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:02:03,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317626255] [2022-12-05 19:02:03,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:02:03,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:02:03,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:02:03,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:02:03,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:02:03,838 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-05 19:02:03,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 364 transitions, 2273 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:03,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:02:03,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-05 19:02:03,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:02:05,286 INFO L130 PetriNetUnfolder]: 1904/10602 cut-off events. [2022-12-05 19:02:05,286 INFO L131 PetriNetUnfolder]: For 36662/37222 co-relation queries the response was YES. [2022-12-05 19:02:05,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25222 conditions, 10602 events. 1904/10602 cut-off events. For 36662/37222 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 133450 event pairs, 897 based on Foata normal form. 42/9723 useless extension candidates. Maximal degree in co-relation 24824. Up to 2311 conditions per place. [2022-12-05 19:02:05,354 INFO L137 encePairwiseOnDemand]: 273/282 looper letters, 125 selfloop transitions, 32 changer transitions 11/402 dead transitions. [2022-12-05 19:02:05,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 402 transitions, 2878 flow [2022-12-05 19:02:05,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 19:02:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 19:02:05,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1535 transitions. [2022-12-05 19:02:05,356 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7776089159067883 [2022-12-05 19:02:05,356 INFO L175 Difference]: Start difference. First operand has 333 places, 364 transitions, 2273 flow. Second operand 7 states and 1535 transitions. [2022-12-05 19:02:05,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 402 transitions, 2878 flow [2022-12-05 19:02:05,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 402 transitions, 2730 flow, removed 44 selfloop flow, removed 6 redundant places. [2022-12-05 19:02:05,469 INFO L231 Difference]: Finished difference. Result has 333 places, 366 transitions, 2233 flow [2022-12-05 19:02:05,469 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=2151, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2233, PETRI_PLACES=333, PETRI_TRANSITIONS=366} [2022-12-05 19:02:05,470 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 82 predicate places. [2022-12-05 19:02:05,470 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 366 transitions, 2233 flow [2022-12-05 19:02:05,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:05,471 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:02:05,471 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:02:05,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 19:02:05,471 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:02:05,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:02:05,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1169520207, now seen corresponding path program 1 times [2022-12-05 19:02:05,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:02:05,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649762260] [2022-12-05 19:02:05,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:02:05,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:02:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:02:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:02:05,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:02:05,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649762260] [2022-12-05 19:02:05,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649762260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:02:05,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:02:05,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-05 19:02:05,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611864991] [2022-12-05 19:02:05,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:02:05,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 19:02:05,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:02:05,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 19:02:05,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-12-05 19:02:05,702 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 282 [2022-12-05 19:02:05,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 366 transitions, 2233 flow. Second operand has 14 states, 14 states have (on average 185.21428571428572) internal successors, (2593), 14 states have internal predecessors, (2593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:05,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:02:05,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 282 [2022-12-05 19:02:05,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:02:09,460 INFO L130 PetriNetUnfolder]: 5834/25066 cut-off events. [2022-12-05 19:02:09,460 INFO L131 PetriNetUnfolder]: For 70981/72283 co-relation queries the response was YES. [2022-12-05 19:02:09,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55838 conditions, 25066 events. 5834/25066 cut-off events. For 70981/72283 co-relation queries the response was YES. Maximal size of possible extension queue 1099. Compared 345237 event pairs, 1873 based on Foata normal form. 112/21932 useless extension candidates. Maximal degree in co-relation 55195. Up to 3022 conditions per place. [2022-12-05 19:02:09,644 INFO L137 encePairwiseOnDemand]: 261/282 looper letters, 179 selfloop transitions, 66 changer transitions 9/484 dead transitions. [2022-12-05 19:02:09,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 484 transitions, 3626 flow [2022-12-05 19:02:09,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-05 19:02:09,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-05 19:02:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3768 transitions. [2022-12-05 19:02:09,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6680851063829787 [2022-12-05 19:02:09,648 INFO L175 Difference]: Start difference. First operand has 333 places, 366 transitions, 2233 flow. Second operand 20 states and 3768 transitions. [2022-12-05 19:02:09,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 484 transitions, 3626 flow [2022-12-05 19:02:09,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 484 transitions, 3508 flow, removed 31 selfloop flow, removed 5 redundant places. [2022-12-05 19:02:09,872 INFO L231 Difference]: Finished difference. Result has 355 places, 395 transitions, 2678 flow [2022-12-05 19:02:09,873 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=2145, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2678, PETRI_PLACES=355, PETRI_TRANSITIONS=395} [2022-12-05 19:02:09,873 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 104 predicate places. [2022-12-05 19:02:09,873 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 395 transitions, 2678 flow [2022-12-05 19:02:09,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 185.21428571428572) internal successors, (2593), 14 states have internal predecessors, (2593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:09,874 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:02:09,874 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:02:09,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 19:02:09,874 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:02:09,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:02:09,875 INFO L85 PathProgramCache]: Analyzing trace with hash 2146197801, now seen corresponding path program 4 times [2022-12-05 19:02:09,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:02:09,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990886441] [2022-12-05 19:02:09,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:02:09,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:02:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:02:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:02:10,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:02:10,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990886441] [2022-12-05 19:02:10,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990886441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:02:10,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:02:10,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:02:10,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663562067] [2022-12-05 19:02:10,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:02:10,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:02:10,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:02:10,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:02:10,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:02:10,119 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-05 19:02:10,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 395 transitions, 2678 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:10,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:02:10,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-05 19:02:10,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:02:13,227 INFO L130 PetriNetUnfolder]: 3755/20901 cut-off events. [2022-12-05 19:02:13,227 INFO L131 PetriNetUnfolder]: For 75218/76423 co-relation queries the response was YES. [2022-12-05 19:02:13,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50819 conditions, 20901 events. 3755/20901 cut-off events. For 75218/76423 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 298078 event pairs, 1895 based on Foata normal form. 72/19220 useless extension candidates. Maximal degree in co-relation 50189. Up to 4640 conditions per place. [2022-12-05 19:02:13,377 INFO L137 encePairwiseOnDemand]: 274/282 looper letters, 152 selfloop transitions, 23 changer transitions 14/425 dead transitions. [2022-12-05 19:02:13,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 425 transitions, 3231 flow [2022-12-05 19:02:13,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 19:02:13,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 19:02:13,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1736 transitions. [2022-12-05 19:02:13,381 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7695035460992907 [2022-12-05 19:02:13,381 INFO L175 Difference]: Start difference. First operand has 355 places, 395 transitions, 2678 flow. Second operand 8 states and 1736 transitions. [2022-12-05 19:02:13,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 425 transitions, 3231 flow [2022-12-05 19:02:13,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 425 transitions, 3178 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-12-05 19:02:13,710 INFO L231 Difference]: Finished difference. Result has 356 places, 389 transitions, 2571 flow [2022-12-05 19:02:13,710 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=2635, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2571, PETRI_PLACES=356, PETRI_TRANSITIONS=389} [2022-12-05 19:02:13,711 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 105 predicate places. [2022-12-05 19:02:13,711 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 389 transitions, 2571 flow [2022-12-05 19:02:13,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:13,711 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:02:13,711 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:02:13,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-05 19:02:13,712 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:02:13,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:02:13,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2044461285, now seen corresponding path program 5 times [2022-12-05 19:02:13,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:02:13,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470008217] [2022-12-05 19:02:13,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:02:13,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:02:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:02:14,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:02:14,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:02:14,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470008217] [2022-12-05 19:02:14,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470008217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:02:14,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:02:14,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:02:14,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383361091] [2022-12-05 19:02:14,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:02:14,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:02:14,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:02:14,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:02:14,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:02:14,021 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-05 19:02:14,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 389 transitions, 2571 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:14,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:02:14,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-05 19:02:14,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:02:17,039 INFO L130 PetriNetUnfolder]: 3822/21598 cut-off events. [2022-12-05 19:02:17,039 INFO L131 PetriNetUnfolder]: For 73355/74496 co-relation queries the response was YES. [2022-12-05 19:02:17,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50900 conditions, 21598 events. 3822/21598 cut-off events. For 73355/74496 co-relation queries the response was YES. Maximal size of possible extension queue 893. Compared 308493 event pairs, 465 based on Foata normal form. 226/20086 useless extension candidates. Maximal degree in co-relation 50209. Up to 2959 conditions per place. [2022-12-05 19:02:17,207 INFO L137 encePairwiseOnDemand]: 269/282 looper letters, 168 selfloop transitions, 61 changer transitions 16/478 dead transitions. [2022-12-05 19:02:17,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 478 transitions, 4004 flow [2022-12-05 19:02:17,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 19:02:17,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 19:02:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2178 transitions. [2022-12-05 19:02:17,210 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7723404255319148 [2022-12-05 19:02:17,210 INFO L175 Difference]: Start difference. First operand has 356 places, 389 transitions, 2571 flow. Second operand 10 states and 2178 transitions. [2022-12-05 19:02:17,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 478 transitions, 4004 flow [2022-12-05 19:02:17,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 478 transitions, 3888 flow, removed 21 selfloop flow, removed 8 redundant places. [2022-12-05 19:02:17,446 INFO L231 Difference]: Finished difference. Result has 358 places, 411 transitions, 3010 flow [2022-12-05 19:02:17,446 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=2505, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3010, PETRI_PLACES=358, PETRI_TRANSITIONS=411} [2022-12-05 19:02:17,446 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 107 predicate places. [2022-12-05 19:02:17,447 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 411 transitions, 3010 flow [2022-12-05 19:02:17,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:17,447 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:02:17,447 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:02:17,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-05 19:02:17,447 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:02:17,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:02:17,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1491191941, now seen corresponding path program 6 times [2022-12-05 19:02:17,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:02:17,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590995699] [2022-12-05 19:02:17,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:02:17,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:02:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:02:17,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:02:17,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:02:17,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590995699] [2022-12-05 19:02:17,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590995699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:02:17,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:02:17,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:02:17,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288334438] [2022-12-05 19:02:17,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:02:17,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:02:17,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:02:17,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:02:17,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:02:17,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-05 19:02:17,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 411 transitions, 3010 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:17,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:02:17,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-05 19:02:17,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:02:20,667 INFO L130 PetriNetUnfolder]: 3736/21195 cut-off events. [2022-12-05 19:02:20,667 INFO L131 PetriNetUnfolder]: For 82026/83100 co-relation queries the response was YES. [2022-12-05 19:02:20,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50918 conditions, 21195 events. 3736/21195 cut-off events. For 82026/83100 co-relation queries the response was YES. Maximal size of possible extension queue 840. Compared 300173 event pairs, 726 based on Foata normal form. 204/19706 useless extension candidates. Maximal degree in co-relation 50247. Up to 3862 conditions per place. [2022-12-05 19:02:20,812 INFO L137 encePairwiseOnDemand]: 269/282 looper letters, 157 selfloop transitions, 62 changer transitions 12/462 dead transitions. [2022-12-05 19:02:20,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 462 transitions, 3861 flow [2022-12-05 19:02:20,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 19:02:20,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 19:02:20,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1960 transitions. [2022-12-05 19:02:20,814 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7722616233254531 [2022-12-05 19:02:20,814 INFO L175 Difference]: Start difference. First operand has 358 places, 411 transitions, 3010 flow. Second operand 9 states and 1960 transitions. [2022-12-05 19:02:20,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 462 transitions, 3861 flow [2022-12-05 19:02:21,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 462 transitions, 3728 flow, removed 45 selfloop flow, removed 4 redundant places. [2022-12-05 19:02:21,232 INFO L231 Difference]: Finished difference. Result has 362 places, 414 transitions, 3066 flow [2022-12-05 19:02:21,232 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=2911, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3066, PETRI_PLACES=362, PETRI_TRANSITIONS=414} [2022-12-05 19:02:21,232 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 111 predicate places. [2022-12-05 19:02:21,233 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 414 transitions, 3066 flow [2022-12-05 19:02:21,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:21,233 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:02:21,233 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:02:21,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-05 19:02:21,233 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:02:21,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:02:21,234 INFO L85 PathProgramCache]: Analyzing trace with hash -229785313, now seen corresponding path program 1 times [2022-12-05 19:02:21,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:02:21,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842860181] [2022-12-05 19:02:21,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:02:21,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:02:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:02:21,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:02:21,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:02:21,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842860181] [2022-12-05 19:02:21,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842860181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:02:21,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:02:21,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:02:21,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070337461] [2022-12-05 19:02:21,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:02:21,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:02:21,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:02:21,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:02:21,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:02:21,471 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-05 19:02:21,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 414 transitions, 3066 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:21,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:02:21,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-05 19:02:21,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:02:25,554 INFO L130 PetriNetUnfolder]: 5399/27328 cut-off events. [2022-12-05 19:02:25,554 INFO L131 PetriNetUnfolder]: For 105015/107150 co-relation queries the response was YES. [2022-12-05 19:02:25,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68410 conditions, 27328 events. 5399/27328 cut-off events. For 105015/107150 co-relation queries the response was YES. Maximal size of possible extension queue 1157. Compared 397793 event pairs, 847 based on Foata normal form. 318/25899 useless extension candidates. Maximal degree in co-relation 67526. Up to 3009 conditions per place. [2022-12-05 19:02:25,806 INFO L137 encePairwiseOnDemand]: 270/282 looper letters, 248 selfloop transitions, 50 changer transitions 10/549 dead transitions. [2022-12-05 19:02:25,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 549 transitions, 5204 flow [2022-12-05 19:02:25,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 19:02:25,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 19:02:25,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1973 transitions. [2022-12-05 19:02:25,809 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7773837667454688 [2022-12-05 19:02:25,809 INFO L175 Difference]: Start difference. First operand has 362 places, 414 transitions, 3066 flow. Second operand 9 states and 1973 transitions. [2022-12-05 19:02:25,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 549 transitions, 5204 flow [2022-12-05 19:02:26,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 549 transitions, 5031 flow, removed 47 selfloop flow, removed 4 redundant places. [2022-12-05 19:02:26,218 INFO L231 Difference]: Finished difference. Result has 368 places, 437 transitions, 3506 flow [2022-12-05 19:02:26,218 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=2971, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3506, PETRI_PLACES=368, PETRI_TRANSITIONS=437} [2022-12-05 19:02:26,219 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 117 predicate places. [2022-12-05 19:02:26,219 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 437 transitions, 3506 flow [2022-12-05 19:02:26,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:26,219 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:02:26,219 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:02:26,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-05 19:02:26,220 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:02:26,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:02:26,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1176724977, now seen corresponding path program 2 times [2022-12-05 19:02:26,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:02:26,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857107021] [2022-12-05 19:02:26,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:02:26,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:02:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:02:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:02:26,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:02:26,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857107021] [2022-12-05 19:02:26,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857107021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:02:26,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:02:26,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:02:26,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784303588] [2022-12-05 19:02:26,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:02:26,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:02:26,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:02:26,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:02:26,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:02:26,416 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-05 19:02:26,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 437 transitions, 3506 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:26,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:02:26,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-05 19:02:26,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:02:30,355 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([774] thread1EXIT-->L123-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][319], [Black: 629#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 621#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 501#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), Black: 619#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 493#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (or (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 474#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~res1~0 0)), 687#true, Black: 489#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= ~res1~0 0)), Black: 495#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (or (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~res1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))))), Black: 505#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 483#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 509#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), 717#(and (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 491#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 499#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), Black: 390#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 384#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), 734#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), Black: 392#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), 627#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 405#(= thread1Thread1of1ForFork0_~stop~0 0), Black: 409#(= thread2Thread1of1ForFork1_~stop~1 0), Black: 536#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 538#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 277#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 528#(<= ~count1~0 ~count3~0), Black: 269#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 279#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1))), Black: 677#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 675#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0))), 548#true, Black: 665#(<= ~count1~0 ~count3~0), Black: 421#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 423#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), 4#L68-1true, Black: 552#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= ~res1~0 0)), Black: 700#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 697#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), 114#L100true, Black: 435#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 443#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 446#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 576#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0))), Black: 578#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0))), Black: 326#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 324#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 318#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 712#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), Black: 722#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 720#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 711#(<= ~count2~0 ~count1~0), Black: 724#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~count2~0 ~count1~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 338#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), 316#true, 41#L123-2true, 267#true, Black: 369#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 623#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 361#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 599#(<= ~res2~0 0), 413#(<= ~count2~0 ~count1~0), Black: 371#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 617#(and (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), 663#true, Black: 611#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-12-05 19:02:30,355 INFO L382 tUnfolder$Statistics]: this new event has 172 ancestors and is cut-off event [2022-12-05 19:02:30,355 INFO L385 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-12-05 19:02:30,356 INFO L385 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-12-05 19:02:30,356 INFO L385 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-12-05 19:02:30,506 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([774] thread1EXIT-->L123-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][279], [Black: 629#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 621#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 501#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), Black: 619#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 493#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (or (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 474#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~res1~0 0)), 687#true, Black: 489#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= ~res1~0 0)), Black: 495#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (or (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~res1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))))), Black: 505#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 483#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 509#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), 717#(and (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 491#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 499#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), 733#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 390#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 392#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), 627#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 405#(= thread1Thread1of1ForFork0_~stop~0 0), Black: 409#(= thread2Thread1of1ForFork1_~stop~1 0), Black: 536#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 538#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 277#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 528#(<= ~count1~0 ~count3~0), Black: 279#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1))), Black: 677#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 675#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0))), 548#true, Black: 665#(<= ~count1~0 ~count3~0), Black: 421#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 423#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), 4#L68-1true, Black: 552#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= ~res1~0 0)), 123#L88-1true, Black: 700#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 697#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), Black: 435#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 443#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 446#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 576#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0))), Black: 578#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0))), Black: 326#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 324#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 318#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 712#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), Black: 722#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 720#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 711#(<= ~count2~0 ~count1~0), Black: 724#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~count2~0 ~count1~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 338#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), 316#true, 41#L123-2true, 269#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 369#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 623#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 384#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 361#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 599#(<= ~res2~0 0), 413#(<= ~count2~0 ~count1~0), Black: 371#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 617#(and (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), 663#true, Black: 611#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-12-05 19:02:30,507 INFO L382 tUnfolder$Statistics]: this new event has 173 ancestors and is not cut-off event [2022-12-05 19:02:30,507 INFO L385 tUnfolder$Statistics]: existing Event has 173 ancestors and is not cut-off event [2022-12-05 19:02:30,507 INFO L385 tUnfolder$Statistics]: existing Event has 174 ancestors and is not cut-off event [2022-12-05 19:02:30,507 INFO L385 tUnfolder$Statistics]: existing Event has 174 ancestors and is not cut-off event [2022-12-05 19:02:30,844 INFO L130 PetriNetUnfolder]: 6031/29642 cut-off events. [2022-12-05 19:02:30,844 INFO L131 PetriNetUnfolder]: For 139025/141006 co-relation queries the response was YES. [2022-12-05 19:02:31,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80153 conditions, 29642 events. 6031/29642 cut-off events. For 139025/141006 co-relation queries the response was YES. Maximal size of possible extension queue 1286. Compared 437515 event pairs, 1188 based on Foata normal form. 589/28240 useless extension candidates. Maximal degree in co-relation 79234. Up to 4017 conditions per place. [2022-12-05 19:02:31,265 INFO L137 encePairwiseOnDemand]: 270/282 looper letters, 210 selfloop transitions, 85 changer transitions 8/544 dead transitions. [2022-12-05 19:02:31,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 544 transitions, 5215 flow [2022-12-05 19:02:31,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 19:02:31,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 19:02:31,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1972 transitions. [2022-12-05 19:02:31,267 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.77698975571316 [2022-12-05 19:02:31,267 INFO L175 Difference]: Start difference. First operand has 368 places, 437 transitions, 3506 flow. Second operand 9 states and 1972 transitions. [2022-12-05 19:02:31,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 544 transitions, 5215 flow [2022-12-05 19:02:31,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 544 transitions, 5125 flow, removed 44 selfloop flow, removed 3 redundant places. [2022-12-05 19:02:31,957 INFO L231 Difference]: Finished difference. Result has 377 places, 454 transitions, 3932 flow [2022-12-05 19:02:31,958 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=3446, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3932, PETRI_PLACES=377, PETRI_TRANSITIONS=454} [2022-12-05 19:02:31,958 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 126 predicate places. [2022-12-05 19:02:31,958 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 454 transitions, 3932 flow [2022-12-05 19:02:31,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:31,959 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:02:31,959 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:02:31,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-05 19:02:31,959 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:02:31,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:02:31,959 INFO L85 PathProgramCache]: Analyzing trace with hash -421154775, now seen corresponding path program 3 times [2022-12-05 19:02:31,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:02:31,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283908136] [2022-12-05 19:02:31,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:02:31,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:02:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:02:32,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:02:32,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:02:32,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283908136] [2022-12-05 19:02:32,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283908136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:02:32,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:02:32,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:02:32,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326194018] [2022-12-05 19:02:32,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:02:32,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:02:32,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:02:32,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:02:32,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:02:32,156 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-05 19:02:32,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 454 transitions, 3932 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:32,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:02:32,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-05 19:02:32,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:02:37,469 INFO L130 PetriNetUnfolder]: 6188/32380 cut-off events. [2022-12-05 19:02:37,469 INFO L131 PetriNetUnfolder]: For 167350/171105 co-relation queries the response was YES. [2022-12-05 19:02:37,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85849 conditions, 32380 events. 6188/32380 cut-off events. For 167350/171105 co-relation queries the response was YES. Maximal size of possible extension queue 1366. Compared 488274 event pairs, 2284 based on Foata normal form. 495/30290 useless extension candidates. Maximal degree in co-relation 84986. Up to 8020 conditions per place. [2022-12-05 19:02:37,951 INFO L137 encePairwiseOnDemand]: 271/282 looper letters, 187 selfloop transitions, 40 changer transitions 10/475 dead transitions. [2022-12-05 19:02:37,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 475 transitions, 4488 flow [2022-12-05 19:02:37,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 19:02:37,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 19:02:37,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1734 transitions. [2022-12-05 19:02:37,955 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7686170212765957 [2022-12-05 19:02:37,955 INFO L175 Difference]: Start difference. First operand has 377 places, 454 transitions, 3932 flow. Second operand 8 states and 1734 transitions. [2022-12-05 19:02:37,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 475 transitions, 4488 flow [2022-12-05 19:02:38,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 475 transitions, 4438 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-05 19:02:38,776 INFO L231 Difference]: Finished difference. Result has 382 places, 449 transitions, 3908 flow [2022-12-05 19:02:38,776 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=3888, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3908, PETRI_PLACES=382, PETRI_TRANSITIONS=449} [2022-12-05 19:02:38,776 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 131 predicate places. [2022-12-05 19:02:38,777 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 449 transitions, 3908 flow [2022-12-05 19:02:38,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:38,777 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:02:38,777 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:02:38,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-05 19:02:38,777 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:02:38,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:02:38,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1531291925, now seen corresponding path program 4 times [2022-12-05 19:02:38,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:02:38,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503344152] [2022-12-05 19:02:38,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:02:38,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:02:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:02:38,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:02:38,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:02:38,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503344152] [2022-12-05 19:02:38,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503344152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:02:38,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:02:38,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:02:38,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682432056] [2022-12-05 19:02:38,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:02:38,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:02:38,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:02:38,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:02:38,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:02:38,927 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-05 19:02:38,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 449 transitions, 3908 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:38,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:02:38,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-05 19:02:38,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:02:44,068 INFO L130 PetriNetUnfolder]: 6227/32811 cut-off events. [2022-12-05 19:02:44,068 INFO L131 PetriNetUnfolder]: For 165548/168235 co-relation queries the response was YES. [2022-12-05 19:02:44,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85695 conditions, 32811 events. 6227/32811 cut-off events. For 165548/168235 co-relation queries the response was YES. Maximal size of possible extension queue 1365. Compared 495485 event pairs, 1680 based on Foata normal form. 605/30996 useless extension candidates. Maximal degree in co-relation 84890. Up to 6606 conditions per place. [2022-12-05 19:02:44,595 INFO L137 encePairwiseOnDemand]: 273/282 looper letters, 163 selfloop transitions, 72 changer transitions 11/481 dead transitions. [2022-12-05 19:02:44,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 481 transitions, 4623 flow [2022-12-05 19:02:44,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 19:02:44,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 19:02:44,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1529 transitions. [2022-12-05 19:02:44,596 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7745694022289767 [2022-12-05 19:02:44,596 INFO L175 Difference]: Start difference. First operand has 382 places, 449 transitions, 3908 flow. Second operand 7 states and 1529 transitions. [2022-12-05 19:02:44,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 481 transitions, 4623 flow [2022-12-05 19:02:45,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 481 transitions, 4503 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-12-05 19:02:45,373 INFO L231 Difference]: Finished difference. Result has 383 places, 443 transitions, 3851 flow [2022-12-05 19:02:45,374 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=3794, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3851, PETRI_PLACES=383, PETRI_TRANSITIONS=443} [2022-12-05 19:02:45,374 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 132 predicate places. [2022-12-05 19:02:45,374 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 443 transitions, 3851 flow [2022-12-05 19:02:45,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:45,375 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:02:45,375 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:02:45,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-05 19:02:45,375 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:02:45,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:02:45,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1125418890, now seen corresponding path program 1 times [2022-12-05 19:02:45,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:02:45,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541802860] [2022-12-05 19:02:45,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:02:45,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:02:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:02:45,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:02:45,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:02:45,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541802860] [2022-12-05 19:02:45,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541802860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:02:45,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:02:45,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:02:45,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618569080] [2022-12-05 19:02:45,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:02:45,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:02:45,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:02:45,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:02:45,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:02:45,710 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-05 19:02:45,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 443 transitions, 3851 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:45,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:02:45,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-05 19:02:45,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:02:50,942 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([775] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem32#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][407], [Black: 629#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 621#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 763#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), Black: 501#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), Black: 619#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 493#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (or (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 474#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~res1~0 0)), 687#true, Black: 489#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= ~res1~0 0)), Black: 495#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (or (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~res1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))))), Black: 505#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 483#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 509#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), 717#(and (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 491#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 499#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), 733#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), 65#L124-2true, Black: 390#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 392#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 781#(and (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (= ~res3~0 1))), Black: 783#(and (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 785#(and (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 405#(= thread1Thread1of1ForFork0_~stop~0 0), Black: 409#(= thread2Thread1of1ForFork1_~stop~1 0), Black: 536#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 538#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 277#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 528#(<= ~count1~0 ~count3~0), Black: 279#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1))), Black: 677#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 675#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0))), 548#true, Black: 665#(<= ~count1~0 ~count3~0), Black: 421#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 423#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 552#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= ~res1~0 0)), 123#L88-1true, Black: 700#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 697#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), 789#true, Black: 435#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), 773#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 443#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 446#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 576#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0))), Black: 326#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 578#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0))), Black: 324#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 318#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 712#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), Black: 720#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 711#(<= ~count2~0 ~count1~0), Black: 338#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), 316#true, 269#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 734#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), Black: 742#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 731#true, Black: 369#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 361#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), 384#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 623#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 413#(<= ~count2~0 ~count1~0), Black: 599#(<= ~res2~0 0), Black: 627#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 371#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), 663#true, Black: 617#(and (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 611#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-12-05 19:02:50,943 INFO L382 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-12-05 19:02:50,943 INFO L385 tUnfolder$Statistics]: existing Event has 186 ancestors and is cut-off event [2022-12-05 19:02:50,943 INFO L385 tUnfolder$Statistics]: existing Event has 185 ancestors and is cut-off event [2022-12-05 19:02:50,943 INFO L385 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-12-05 19:02:51,018 INFO L130 PetriNetUnfolder]: 5373/32400 cut-off events. [2022-12-05 19:02:51,018 INFO L131 PetriNetUnfolder]: For 168775/172676 co-relation queries the response was YES. [2022-12-05 19:02:51,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83331 conditions, 32400 events. 5373/32400 cut-off events. For 168775/172676 co-relation queries the response was YES. Maximal size of possible extension queue 1347. Compared 503389 event pairs, 1588 based on Foata normal form. 332/30237 useless extension candidates. Maximal degree in co-relation 82345. Up to 6433 conditions per place. [2022-12-05 19:02:51,462 INFO L137 encePairwiseOnDemand]: 270/282 looper letters, 206 selfloop transitions, 29 changer transitions 5/482 dead transitions. [2022-12-05 19:02:51,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 482 transitions, 4652 flow [2022-12-05 19:02:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 19:02:51,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 19:02:51,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1947 transitions. [2022-12-05 19:02:51,464 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7671394799054374 [2022-12-05 19:02:51,464 INFO L175 Difference]: Start difference. First operand has 383 places, 443 transitions, 3851 flow. Second operand 9 states and 1947 transitions. [2022-12-05 19:02:51,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 482 transitions, 4652 flow [2022-12-05 19:02:52,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 482 transitions, 4488 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-05 19:02:52,274 INFO L231 Difference]: Finished difference. Result has 390 places, 447 transitions, 3894 flow [2022-12-05 19:02:52,275 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=3713, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3894, PETRI_PLACES=390, PETRI_TRANSITIONS=447} [2022-12-05 19:02:52,275 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 139 predicate places. [2022-12-05 19:02:52,275 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 447 transitions, 3894 flow [2022-12-05 19:02:52,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:52,276 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:02:52,276 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:02:52,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-05 19:02:52,276 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:02:52,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:02:52,276 INFO L85 PathProgramCache]: Analyzing trace with hash 50428556, now seen corresponding path program 2 times [2022-12-05 19:02:52,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:02:52,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859765954] [2022-12-05 19:02:52,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:02:52,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:02:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:02:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:02:52,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:02:52,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859765954] [2022-12-05 19:02:52,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859765954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:02:52,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:02:52,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:02:52,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354022363] [2022-12-05 19:02:52,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:02:52,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:02:52,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:02:52,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:02:52,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:02:52,434 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-05 19:02:52,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 447 transitions, 3894 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:52,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:02:52,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-05 19:02:52,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:02:57,420 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([775] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem32#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][404], [Black: 629#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 621#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 763#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), Black: 501#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), Black: 619#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 493#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (or (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 474#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~res1~0 0)), 687#true, Black: 489#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= ~res1~0 0)), Black: 495#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (or (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~res1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))))), Black: 505#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 483#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 509#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), 717#(and (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 491#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 499#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), 733#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 390#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), 65#L124-2true, Black: 781#(and (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (= ~res3~0 1))), Black: 392#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 405#(= thread1Thread1of1ForFork0_~stop~0 0), Black: 409#(= thread2Thread1of1ForFork1_~stop~1 0), Black: 536#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 277#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 538#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 528#(<= ~count1~0 ~count3~0), Black: 279#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1))), Black: 791#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 806#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 799#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 804#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 802#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1))), Black: 677#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 675#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0))), 548#true, Black: 665#(<= ~count1~0 ~count3~0), Black: 421#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 423#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 552#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= ~res1~0 0)), 123#L88-1true, Black: 700#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 435#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 697#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), 789#true, Black: 443#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 446#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 576#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0))), Black: 326#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 578#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0))), Black: 324#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 318#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 712#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), Black: 720#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 711#(<= ~count2~0 ~count1~0), Black: 338#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), 316#true, 269#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 734#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), Black: 742#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 731#true, 812#true, Black: 369#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 361#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), 384#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 623#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 413#(<= ~count2~0 ~count1~0), Black: 599#(<= ~res2~0 0), Black: 627#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 371#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 617#(and (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), 663#true, Black: 611#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-12-05 19:02:57,421 INFO L382 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-12-05 19:02:57,421 INFO L385 tUnfolder$Statistics]: existing Event has 186 ancestors and is cut-off event [2022-12-05 19:02:57,421 INFO L385 tUnfolder$Statistics]: existing Event has 185 ancestors and is cut-off event [2022-12-05 19:02:57,421 INFO L385 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-12-05 19:02:57,498 INFO L130 PetriNetUnfolder]: 5271/31440 cut-off events. [2022-12-05 19:02:57,498 INFO L131 PetriNetUnfolder]: For 152758/156635 co-relation queries the response was YES. [2022-12-05 19:02:57,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79665 conditions, 31440 events. 5271/31440 cut-off events. For 152758/156635 co-relation queries the response was YES. Maximal size of possible extension queue 1292. Compared 484512 event pairs, 1480 based on Foata normal form. 268/29351 useless extension candidates. Maximal degree in co-relation 78736. Up to 6435 conditions per place. [2022-12-05 19:02:57,876 INFO L137 encePairwiseOnDemand]: 273/282 looper letters, 197 selfloop transitions, 31 changer transitions 9/476 dead transitions. [2022-12-05 19:02:57,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 476 transitions, 4542 flow [2022-12-05 19:02:57,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 19:02:57,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 19:02:57,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1533 transitions. [2022-12-05 19:02:57,878 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.776595744680851 [2022-12-05 19:02:57,878 INFO L175 Difference]: Start difference. First operand has 390 places, 447 transitions, 3894 flow. Second operand 7 states and 1533 transitions. [2022-12-05 19:02:57,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 476 transitions, 4542 flow [2022-12-05 19:02:58,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 476 transitions, 4506 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-05 19:02:58,704 INFO L231 Difference]: Finished difference. Result has 392 places, 444 transitions, 3912 flow [2022-12-05 19:02:58,704 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=3868, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3912, PETRI_PLACES=392, PETRI_TRANSITIONS=444} [2022-12-05 19:02:58,705 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 141 predicate places. [2022-12-05 19:02:58,705 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 444 transitions, 3912 flow [2022-12-05 19:02:58,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:58,705 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:02:58,705 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:02:58,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-05 19:02:58,706 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:02:58,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:02:58,706 INFO L85 PathProgramCache]: Analyzing trace with hash 884933032, now seen corresponding path program 3 times [2022-12-05 19:02:58,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:02:58,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695211281] [2022-12-05 19:02:58,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:02:58,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:02:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:02:58,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:02:58,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:02:58,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695211281] [2022-12-05 19:02:58,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695211281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:02:58,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:02:58,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:02:58,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384664989] [2022-12-05 19:02:58,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:02:58,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:02:58,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:02:58,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:02:58,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:02:58,914 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-05 19:02:58,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 444 transitions, 3912 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:02:58,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:02:58,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-05 19:02:58,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:03:03,748 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([775] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem32#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][425], [Black: 629#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 621#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 763#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), Black: 501#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), Black: 619#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 493#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (or (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 474#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~res1~0 0)), 687#true, Black: 489#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= ~res1~0 0)), Black: 495#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (or (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~res1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))))), Black: 505#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 483#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 509#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), 717#(and (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 491#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 499#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), 733#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), 65#L124-2true, Black: 390#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 781#(and (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (= ~res3~0 1))), Black: 392#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 405#(= thread1Thread1of1ForFork0_~stop~0 0), Black: 409#(= thread2Thread1of1ForFork1_~stop~1 0), Black: 536#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 277#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 538#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 528#(<= ~count1~0 ~count3~0), 832#(<= ~count3~0 ~count2~0), Black: 279#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1))), Black: 791#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 799#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 802#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1))), Black: 677#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 675#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0))), 548#true, Black: 665#(<= ~count1~0 ~count3~0), Black: 421#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 423#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 552#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= ~res1~0 0)), 123#L88-1true, Black: 826#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 824#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 822#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (= ~res3~0 1))), Black: 700#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 697#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), Black: 435#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 443#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 446#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 576#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0))), Black: 326#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 578#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0))), Black: 324#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 318#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 712#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), Black: 720#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 711#(<= ~count2~0 ~count1~0), Black: 338#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), 316#true, 269#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 734#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), Black: 742#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 731#true, 812#true, Black: 369#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), 384#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 361#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 623#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 413#(<= ~count2~0 ~count1~0), Black: 599#(<= ~res2~0 0), Black: 627#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 371#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), 663#true, Black: 617#(and (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 611#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-12-05 19:03:03,748 INFO L382 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-12-05 19:03:03,748 INFO L385 tUnfolder$Statistics]: existing Event has 186 ancestors and is cut-off event [2022-12-05 19:03:03,748 INFO L385 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-12-05 19:03:03,748 INFO L385 tUnfolder$Statistics]: existing Event has 185 ancestors and is cut-off event [2022-12-05 19:03:03,938 INFO L130 PetriNetUnfolder]: 5412/31813 cut-off events. [2022-12-05 19:03:03,938 INFO L131 PetriNetUnfolder]: For 156325/160326 co-relation queries the response was YES. [2022-12-05 19:03:04,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80642 conditions, 31813 events. 5412/31813 cut-off events. For 156325/160326 co-relation queries the response was YES. Maximal size of possible extension queue 1303. Compared 489476 event pairs, 1375 based on Foata normal form. 368/29751 useless extension candidates. Maximal degree in co-relation 79772. Up to 4115 conditions per place. [2022-12-05 19:03:04,272 INFO L137 encePairwiseOnDemand]: 270/282 looper letters, 219 selfloop transitions, 34 changer transitions 5/497 dead transitions. [2022-12-05 19:03:04,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 497 transitions, 4969 flow [2022-12-05 19:03:04,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 19:03:04,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 19:03:04,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1949 transitions. [2022-12-05 19:03:04,274 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7679275019700552 [2022-12-05 19:03:04,274 INFO L175 Difference]: Start difference. First operand has 392 places, 444 transitions, 3912 flow. Second operand 9 states and 1949 transitions. [2022-12-05 19:03:04,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 497 transitions, 4969 flow [2022-12-05 19:03:04,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 497 transitions, 4881 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-05 19:03:04,947 INFO L231 Difference]: Finished difference. Result has 398 places, 452 transitions, 4135 flow [2022-12-05 19:03:04,947 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=3850, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4135, PETRI_PLACES=398, PETRI_TRANSITIONS=452} [2022-12-05 19:03:04,948 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 147 predicate places. [2022-12-05 19:03:04,948 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 452 transitions, 4135 flow [2022-12-05 19:03:04,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:03:04,948 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:03:04,948 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:03:04,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-05 19:03:04,948 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:03:04,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:03:04,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1561950048, now seen corresponding path program 4 times [2022-12-05 19:03:04,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:03:04,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388619230] [2022-12-05 19:03:04,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:03:04,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:03:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:03:05,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:03:05,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:03:05,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388619230] [2022-12-05 19:03:05,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388619230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:03:05,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:03:05,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:03:05,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585052383] [2022-12-05 19:03:05,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:03:05,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:03:05,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:03:05,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:03:05,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:03:05,083 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-05 19:03:05,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 452 transitions, 4135 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:03:05,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:03:05,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-05 19:03:05,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:03:10,921 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([775] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem32#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][429], [Black: 629#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 621#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 763#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), Black: 619#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 501#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), Black: 493#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (or (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 474#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~res1~0 0)), 687#true, Black: 489#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= ~res1~0 0)), Black: 495#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (or (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~res1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))))), Black: 505#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 483#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 509#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), 717#(and (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 491#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 499#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), 733#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 390#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), 65#L124-2true, Black: 392#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 781#(and (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (= ~res3~0 1))), Black: 405#(= thread1Thread1of1ForFork0_~stop~0 0), Black: 409#(= thread2Thread1of1ForFork1_~stop~1 0), Black: 536#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), 860#(and (<= ~count3~0 ~count2~0) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0))), Black: 538#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 277#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 528#(<= ~count1~0 ~count3~0), 832#(<= ~count3~0 ~count2~0), Black: 279#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1))), Black: 791#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 799#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 802#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1))), Black: 677#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 675#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0))), 548#true, Black: 421#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 665#(<= ~count1~0 ~count3~0), Black: 423#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 552#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= ~res1~0 0)), 123#L88-1true, Black: 822#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (= ~res3~0 1))), Black: 700#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 697#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), Black: 435#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 443#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 446#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 576#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0))), Black: 578#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0))), Black: 326#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 324#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 318#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 847#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count3~0 ~count2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 843#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count3~0 ~count2~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1))), Black: 845#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count3~0 ~count2~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 712#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), Black: 720#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 711#(<= ~count2~0 ~count1~0), Black: 338#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), 316#true, 269#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 734#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), Black: 742#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 731#true, Black: 369#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 361#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 623#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 384#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 599#(<= ~res2~0 0), 413#(<= ~count2~0 ~count1~0), Black: 371#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 627#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 617#(and (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), 663#true, Black: 611#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-12-05 19:03:10,921 INFO L382 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-12-05 19:03:10,921 INFO L385 tUnfolder$Statistics]: existing Event has 185 ancestors and is cut-off event [2022-12-05 19:03:10,921 INFO L385 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-12-05 19:03:10,921 INFO L385 tUnfolder$Statistics]: existing Event has 186 ancestors and is cut-off event [2022-12-05 19:03:11,032 INFO L130 PetriNetUnfolder]: 6033/36852 cut-off events. [2022-12-05 19:03:11,032 INFO L131 PetriNetUnfolder]: For 176256/181278 co-relation queries the response was YES. [2022-12-05 19:03:11,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92687 conditions, 36852 events. 6033/36852 cut-off events. For 176256/181278 co-relation queries the response was YES. Maximal size of possible extension queue 1538. Compared 586221 event pairs, 696 based on Foata normal form. 645/35090 useless extension candidates. Maximal degree in co-relation 91620. Up to 3037 conditions per place. [2022-12-05 19:03:11,630 INFO L137 encePairwiseOnDemand]: 272/282 looper letters, 246 selfloop transitions, 67 changer transitions 11/563 dead transitions. [2022-12-05 19:03:11,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 563 transitions, 5986 flow [2022-12-05 19:03:11,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 19:03:11,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 19:03:11,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1767 transitions. [2022-12-05 19:03:11,633 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7832446808510638 [2022-12-05 19:03:11,633 INFO L175 Difference]: Start difference. First operand has 398 places, 452 transitions, 4135 flow. Second operand 8 states and 1767 transitions. [2022-12-05 19:03:11,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 563 transitions, 5986 flow [2022-12-05 19:03:12,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 563 transitions, 5882 flow, removed 25 selfloop flow, removed 7 redundant places. [2022-12-05 19:03:12,505 INFO L231 Difference]: Finished difference. Result has 403 places, 469 transitions, 4628 flow [2022-12-05 19:03:12,505 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=4059, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4628, PETRI_PLACES=403, PETRI_TRANSITIONS=469} [2022-12-05 19:03:12,506 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 152 predicate places. [2022-12-05 19:03:12,506 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 469 transitions, 4628 flow [2022-12-05 19:03:12,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:03:12,506 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:03:12,506 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:03:12,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-05 19:03:12,506 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:03:12,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:03:12,507 INFO L85 PathProgramCache]: Analyzing trace with hash 617904760, now seen corresponding path program 5 times [2022-12-05 19:03:12,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:03:12,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913873193] [2022-12-05 19:03:12,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:03:12,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:03:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:03:12,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:03:12,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:03:12,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913873193] [2022-12-05 19:03:12,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913873193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:03:12,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:03:12,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:03:12,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765647769] [2022-12-05 19:03:12,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:03:12,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:03:12,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:03:12,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:03:12,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:03:12,647 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-05 19:03:12,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 469 transitions, 4628 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:03:12,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:03:12,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-05 19:03:12,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:03:18,406 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([775] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem32#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][457], [Black: 629#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 621#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 763#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), Black: 619#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 501#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), Black: 493#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (or (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 474#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~res1~0 0)), 687#true, Black: 489#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= ~res1~0 0)), Black: 495#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (or (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~res1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))))), Black: 505#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 483#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), 717#(and (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 509#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 491#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 499#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), 739#(and (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 390#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), 65#L124-2true, Black: 384#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 392#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 781#(and (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (= ~res3~0 1))), Black: 405#(= thread1Thread1of1ForFork0_~stop~0 0), Black: 409#(= thread2Thread1of1ForFork1_~stop~1 0), 860#(and (<= ~count3~0 ~count2~0) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0))), Black: 536#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 277#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 538#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 528#(<= ~count1~0 ~count3~0), 832#(<= ~count3~0 ~count2~0), Black: 269#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 279#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1))), Black: 791#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 802#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1))), Black: 677#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 675#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0))), 548#true, Black: 421#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 665#(<= ~count1~0 ~count3~0), Black: 423#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 552#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= ~res1~0 0)), 12#$Ultimate##0true, Black: 822#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (= ~res3~0 1))), Black: 700#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 435#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 697#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), 878#(or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0)), Black: 443#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 446#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 576#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0))), Black: 326#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 578#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0))), Black: 324#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 318#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 843#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count3~0 ~count2~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1))), Black: 712#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), Black: 720#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 711#(<= ~count2~0 ~count1~0), Black: 863#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0))), Black: 865#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 316#true, Black: 867#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 852#true, Black: 854#(<= ~count3~0 ~count2~0), Black: 855#(or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0)), Black: 734#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), 267#true, Black: 742#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 733#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 731#true, Black: 369#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 361#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 623#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 413#(<= ~count2~0 ~count1~0), Black: 599#(<= ~res2~0 0), Black: 371#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 627#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 617#(and (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), 663#true, Black: 611#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-12-05 19:03:18,407 INFO L382 tUnfolder$Statistics]: this new event has 181 ancestors and is not cut-off event [2022-12-05 19:03:18,407 INFO L385 tUnfolder$Statistics]: existing Event has 181 ancestors and is not cut-off event [2022-12-05 19:03:18,407 INFO L385 tUnfolder$Statistics]: existing Event has 182 ancestors and is not cut-off event [2022-12-05 19:03:18,407 INFO L385 tUnfolder$Statistics]: existing Event has 183 ancestors and is not cut-off event [2022-12-05 19:03:18,407 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([775] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem32#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][457], [Black: 629#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 621#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 763#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), Black: 619#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 501#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), Black: 493#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (or (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 474#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~res1~0 0)), 687#true, Black: 489#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= ~res1~0 0)), Black: 495#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (or (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~res1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))))), Black: 505#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 483#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), 717#(and (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 509#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 491#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 499#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), 739#(and (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 390#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), 65#L124-2true, Black: 384#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 392#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 781#(and (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (= ~res3~0 1))), Black: 405#(= thread1Thread1of1ForFork0_~stop~0 0), Black: 409#(= thread2Thread1of1ForFork1_~stop~1 0), 860#(and (<= ~count3~0 ~count2~0) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0))), Black: 536#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 277#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 538#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 528#(<= ~count1~0 ~count3~0), 832#(<= ~count3~0 ~count2~0), Black: 269#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 279#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1))), Black: 791#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 802#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1))), Black: 677#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 675#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0))), 548#true, Black: 421#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 665#(<= ~count1~0 ~count3~0), Black: 423#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 552#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= ~res1~0 0)), Black: 822#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (= ~res3~0 1))), Black: 700#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), 114#L100true, Black: 435#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 697#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), 878#(or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0)), Black: 443#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 446#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 576#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0))), Black: 326#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 578#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0))), Black: 324#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 318#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 843#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count3~0 ~count2~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1))), Black: 712#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), Black: 720#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 711#(<= ~count2~0 ~count1~0), Black: 863#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0))), Black: 865#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 316#true, Black: 867#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 852#true, Black: 854#(<= ~count3~0 ~count2~0), Black: 855#(or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0)), Black: 734#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), 267#true, Black: 742#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 733#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 731#true, Black: 369#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 361#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 623#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 413#(<= ~count2~0 ~count1~0), Black: 599#(<= ~res2~0 0), Black: 371#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 627#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 617#(and (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), 663#true, Black: 611#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-12-05 19:03:18,407 INFO L382 tUnfolder$Statistics]: this new event has 183 ancestors and is cut-off event [2022-12-05 19:03:18,407 INFO L385 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-12-05 19:03:18,407 INFO L385 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-12-05 19:03:18,407 INFO L385 tUnfolder$Statistics]: existing Event has 185 ancestors and is cut-off event [2022-12-05 19:03:18,443 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([775] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem32#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][493], [Black: 629#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 621#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 763#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), Black: 619#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 501#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), Black: 493#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (or (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 474#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~res1~0 0)), 687#true, Black: 489#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= ~res1~0 0)), Black: 495#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (or (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~res1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))))), Black: 505#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 483#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 509#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), 717#(and (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 491#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 499#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), 739#(and (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), 65#L124-2true, Black: 390#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 392#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 781#(and (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (= ~res3~0 1))), Black: 405#(= thread1Thread1of1ForFork0_~stop~0 0), Black: 409#(= thread2Thread1of1ForFork1_~stop~1 0), Black: 536#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), 860#(and (<= ~count3~0 ~count2~0) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0))), Black: 538#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 277#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), 832#(<= ~count3~0 ~count2~0), Black: 279#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1))), Black: 791#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 802#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1))), Black: 677#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), 548#true, Black: 675#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0))), Black: 421#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 423#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 552#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= ~res1~0 0)), Black: 822#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (= ~res3~0 1))), 883#(and (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0))), Black: 700#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 697#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), Black: 435#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 443#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 446#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 576#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0))), 50#L89true, Black: 578#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0))), Black: 326#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 324#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), 665#(<= ~count1~0 ~count3~0), Black: 318#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 843#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count3~0 ~count2~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1))), Black: 712#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), Black: 720#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 711#(<= ~count2~0 ~count1~0), Black: 863#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0))), Black: 865#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 316#true, Black: 867#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 852#true, Black: 854#(<= ~count3~0 ~count2~0), Black: 855#(or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0)), 269#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 734#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), Black: 742#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 733#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 731#true, 528#(<= ~count1~0 ~count3~0), Black: 369#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), 384#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 361#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 623#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 599#(<= ~res2~0 0), 413#(<= ~count2~0 ~count1~0), Black: 371#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 627#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 617#(and (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 611#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-12-05 19:03:18,443 INFO L382 tUnfolder$Statistics]: this new event has 183 ancestors and is not cut-off event [2022-12-05 19:03:18,443 INFO L385 tUnfolder$Statistics]: existing Event has 183 ancestors and is not cut-off event [2022-12-05 19:03:18,444 INFO L385 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-12-05 19:03:18,444 INFO L385 tUnfolder$Statistics]: existing Event has 185 ancestors and is not cut-off event [2022-12-05 19:03:18,462 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([775] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem32#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][411], [Black: 629#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 621#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 763#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), Black: 501#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), Black: 619#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 493#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (or (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 474#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~res1~0 0)), 687#true, Black: 489#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= ~res1~0 0)), Black: 495#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (or (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~res1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))))), Black: 505#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 483#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 509#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), 717#(and (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 491#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 499#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), 877#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), 733#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), 65#L124-2true, Black: 390#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 392#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 781#(and (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (= ~res3~0 1))), Black: 405#(= thread1Thread1of1ForFork0_~stop~0 0), Black: 409#(= thread2Thread1of1ForFork1_~stop~1 0), Black: 536#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), 860#(and (<= ~count3~0 ~count2~0) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0))), Black: 277#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 538#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 528#(<= ~count1~0 ~count3~0), 832#(<= ~count3~0 ~count2~0), Black: 279#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1))), Black: 791#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 802#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1))), Black: 677#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 675#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0))), 548#true, Black: 421#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 665#(<= ~count1~0 ~count3~0), Black: 423#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 552#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= ~res1~0 0)), 123#L88-1true, Black: 822#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (= ~res3~0 1))), Black: 700#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 697#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), Black: 435#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 443#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 446#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 576#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0))), Black: 326#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 578#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0))), Black: 324#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 318#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 843#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count3~0 ~count2~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1))), Black: 712#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), Black: 720#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 711#(<= ~count2~0 ~count1~0), Black: 863#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0))), Black: 865#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 316#true, Black: 867#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 852#true, Black: 854#(<= ~count3~0 ~count2~0), Black: 855#(or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0)), 269#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 734#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), Black: 742#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 731#true, Black: 369#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 361#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), 384#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 623#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 413#(<= ~count2~0 ~count1~0), Black: 599#(<= ~res2~0 0), Black: 371#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 627#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), 663#true, Black: 617#(and (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 611#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-12-05 19:03:18,463 INFO L382 tUnfolder$Statistics]: this new event has 184 ancestors and is not cut-off event [2022-12-05 19:03:18,463 INFO L385 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-12-05 19:03:18,463 INFO L385 tUnfolder$Statistics]: existing Event has 185 ancestors and is not cut-off event [2022-12-05 19:03:18,463 INFO L385 tUnfolder$Statistics]: existing Event has 186 ancestors and is not cut-off event [2022-12-05 19:03:18,511 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([775] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem32#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][412], [Black: 629#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 621#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 763#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), Black: 501#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), Black: 619#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 493#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (or (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 474#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~res1~0 0)), 687#true, Black: 489#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= ~res1~0 0)), Black: 495#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (or (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~res1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))))), Black: 505#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 483#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 509#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 491#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 499#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), 65#L124-2true, Black: 390#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 384#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 392#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 781#(and (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (= ~res3~0 1))), Black: 405#(= thread1Thread1of1ForFork0_~stop~0 0), Black: 409#(= thread2Thread1of1ForFork1_~stop~1 0), Black: 536#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 538#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 277#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 269#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), 832#(<= ~count3~0 ~count2~0), Black: 279#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1))), Black: 791#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 802#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1))), Black: 677#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), 548#true, Black: 675#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0))), Black: 421#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 423#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 552#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= ~res1~0 0)), 123#L88-1true, 711#(<= ~count2~0 ~count1~0), Black: 822#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (= ~res3~0 1))), Black: 700#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 697#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), Black: 435#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 443#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 446#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 576#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0))), Black: 326#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 578#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0))), Black: 324#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), 665#(<= ~count1~0 ~count3~0), Black: 318#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 843#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count3~0 ~count2~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1))), Black: 712#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), Black: 720#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 717#(and (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 863#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0))), Black: 865#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 316#true, Black: 867#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 852#true, Black: 855#(or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0)), Black: 860#(and (<= ~count3~0 ~count2~0) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0))), Black: 734#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), 267#true, Black: 742#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 733#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), 731#true, 528#(<= ~count1~0 ~count3~0), Black: 369#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 361#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 623#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 413#(<= ~count2~0 ~count1~0), Black: 599#(<= ~res2~0 0), Black: 627#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), 854#(<= ~count3~0 ~count2~0), Black: 371#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 617#(and (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), 875#true, Black: 611#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-12-05 19:03:18,511 INFO L382 tUnfolder$Statistics]: this new event has 187 ancestors and is not cut-off event [2022-12-05 19:03:18,511 INFO L385 tUnfolder$Statistics]: existing Event has 188 ancestors and is not cut-off event [2022-12-05 19:03:18,511 INFO L385 tUnfolder$Statistics]: existing Event has 187 ancestors and is not cut-off event [2022-12-05 19:03:18,511 INFO L385 tUnfolder$Statistics]: existing Event has 189 ancestors and is not cut-off event [2022-12-05 19:03:18,540 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([775] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem32#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][412], [Black: 629#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 621#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 763#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), Black: 501#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), Black: 619#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 493#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (or (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 474#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~res1~0 0)), 687#true, Black: 489#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= ~res1~0 0)), Black: 495#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (or (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~res1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))))), Black: 505#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 483#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 509#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 491#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 499#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), 65#L124-2true, Black: 390#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 384#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 392#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 781#(and (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (= ~res3~0 1))), Black: 405#(= thread1Thread1of1ForFork0_~stop~0 0), Black: 409#(= thread2Thread1of1ForFork1_~stop~1 0), Black: 536#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 538#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 277#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 269#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), 832#(<= ~count3~0 ~count2~0), Black: 279#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1))), Black: 791#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 802#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1))), Black: 677#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), 548#true, Black: 675#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0))), Black: 421#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 423#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 552#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= ~res1~0 0)), 711#(<= ~count2~0 ~count1~0), Black: 822#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (= ~res3~0 1))), Black: 700#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 697#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), Black: 435#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), 20#L91-3true, Black: 443#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 446#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 576#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0))), Black: 326#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 578#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0))), Black: 324#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), 665#(<= ~count1~0 ~count3~0), Black: 318#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 843#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count3~0 ~count2~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1))), Black: 712#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), Black: 720#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 717#(and (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 863#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0))), Black: 865#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 316#true, Black: 867#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 852#true, Black: 855#(or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0)), Black: 860#(and (<= ~count3~0 ~count2~0) (or (<= 1 ~res3~0) (<= ~count1~0 ~count2~0))), Black: 734#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), 267#true, Black: 742#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 733#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), 731#true, 528#(<= ~count1~0 ~count3~0), Black: 369#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 361#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 623#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 413#(<= ~count2~0 ~count1~0), Black: 599#(<= ~res2~0 0), Black: 627#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), 854#(<= ~count3~0 ~count2~0), Black: 371#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 617#(and (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), 875#true, Black: 611#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-12-05 19:03:18,540 INFO L382 tUnfolder$Statistics]: this new event has 193 ancestors and is not cut-off event [2022-12-05 19:03:18,540 INFO L385 tUnfolder$Statistics]: existing Event has 193 ancestors and is not cut-off event [2022-12-05 19:03:18,540 INFO L385 tUnfolder$Statistics]: existing Event has 195 ancestors and is not cut-off event [2022-12-05 19:03:18,540 INFO L385 tUnfolder$Statistics]: existing Event has 194 ancestors and is not cut-off event [2022-12-05 19:03:18,550 INFO L130 PetriNetUnfolder]: 6121/34929 cut-off events. [2022-12-05 19:03:18,550 INFO L131 PetriNetUnfolder]: For 210638/214415 co-relation queries the response was YES. [2022-12-05 19:03:18,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96913 conditions, 34929 events. 6121/34929 cut-off events. For 210638/214415 co-relation queries the response was YES. Maximal size of possible extension queue 1513. Compared 548196 event pairs, 1080 based on Foata normal form. 602/33342 useless extension candidates. Maximal degree in co-relation 95904. Up to 4800 conditions per place. [2022-12-05 19:03:18,959 INFO L137 encePairwiseOnDemand]: 272/282 looper letters, 206 selfloop transitions, 96 changer transitions 8/549 dead transitions. [2022-12-05 19:03:18,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 549 transitions, 6008 flow [2022-12-05 19:03:18,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 19:03:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 19:03:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1763 transitions. [2022-12-05 19:03:18,960 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7814716312056738 [2022-12-05 19:03:18,960 INFO L175 Difference]: Start difference. First operand has 403 places, 469 transitions, 4628 flow. Second operand 8 states and 1763 transitions. [2022-12-05 19:03:18,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 549 transitions, 6008 flow [2022-12-05 19:03:19,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 549 transitions, 5913 flow, removed 19 selfloop flow, removed 4 redundant places. [2022-12-05 19:03:20,000 INFO L231 Difference]: Finished difference. Result has 407 places, 467 transitions, 4691 flow [2022-12-05 19:03:20,000 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=4547, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4691, PETRI_PLACES=407, PETRI_TRANSITIONS=467} [2022-12-05 19:03:20,000 INFO L294 CegarLoopForPetriNet]: 251 programPoint places, 156 predicate places. [2022-12-05 19:03:20,001 INFO L495 AbstractCegarLoop]: Abstraction has has 407 places, 467 transitions, 4691 flow [2022-12-05 19:03:20,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:03:20,001 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:03:20,001 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:03:20,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-05 19:03:20,001 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:03:20,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:03:20,002 INFO L85 PathProgramCache]: Analyzing trace with hash 503689128, now seen corresponding path program 6 times [2022-12-05 19:03:20,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:03:20,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921432903] [2022-12-05 19:03:20,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:03:20,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:03:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:03:20,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:03:20,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:03:20,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921432903] [2022-12-05 19:03:20,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921432903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:03:20,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:03:20,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:03:20,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785610114] [2022-12-05 19:03:20,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:03:20,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:03:20,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:03:20,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:03:20,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:03:20,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-05 19:03:20,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 467 transitions, 4691 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:03:20,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:03:20,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-05 19:03:20,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand