/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-array-int-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-3902331-m [2022-09-20 22:41:41,715 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 22:41:41,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 22:41:41,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 22:41:41,751 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 22:41:41,754 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 22:41:41,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 22:41:41,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 22:41:41,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 22:41:41,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 22:41:41,764 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 22:41:41,765 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 22:41:41,765 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 22:41:41,766 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 22:41:41,767 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 22:41:41,770 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 22:41:41,770 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 22:41:41,771 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 22:41:41,772 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 22:41:41,775 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 22:41:41,776 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 22:41:41,778 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 22:41:41,779 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 22:41:41,779 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 22:41:41,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 22:41:41,781 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 22:41:41,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 22:41:41,782 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 22:41:41,782 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 22:41:41,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 22:41:41,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 22:41:41,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 22:41:41,785 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 22:41:41,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 22:41:41,786 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 22:41:41,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 22:41:41,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 22:41:41,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 22:41:41,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 22:41:41,787 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 22:41:41,788 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 22:41:41,788 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-09-20 22:41:41,812 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 22:41:41,812 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 22:41:41,813 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 22:41:41,813 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 22:41:41,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 22:41:41,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 22:41:41,813 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 22:41:41,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 22:41:41,813 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 22:41:41,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 22:41:41,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 22:41:41,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 22:41:41,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 22:41:41,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 22:41:41,814 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 22:41:41,815 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 22:41:41,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 22:41:41,815 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 22:41:41,815 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 22:41:41,815 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 22:41:41,815 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 22:41:41,815 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 22:41:41,815 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 22:41:41,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:41:41,815 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 22:41:41,816 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 22:41:41,816 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 22:41:41,816 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 22:41:41,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 22:41:41,817 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 22:41:41,817 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 22:41:41,817 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-09-20 22:41:41,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 22:41:41,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 22:41:41,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 22:41:41,992 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 22:41:41,993 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 22:41:41,994 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c [2022-09-20 22:41:42,041 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92d5d9187/e4107babaf1f48cf8a7a8cb5068b1f11/FLAG54f769dbb [2022-09-20 22:41:42,377 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 22:41:42,378 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c [2022-09-20 22:41:42,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92d5d9187/e4107babaf1f48cf8a7a8cb5068b1f11/FLAG54f769dbb [2022-09-20 22:41:42,390 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92d5d9187/e4107babaf1f48cf8a7a8cb5068b1f11 [2022-09-20 22:41:42,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 22:41:42,392 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 22:41:42,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 22:41:42,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 22:41:42,395 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 22:41:42,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:41:42" (1/1) ... [2022-09-20 22:41:42,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@636a30aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:41:42, skipping insertion in model container [2022-09-20 22:41:42,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:41:42" (1/1) ... [2022-09-20 22:41:42,400 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 22:41:42,411 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 22:41:42,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c[2728,2741] [2022-09-20 22:41:42,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:41:42,574 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 22:41:42,588 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c[2728,2741] [2022-09-20 22:41:42,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:41:42,599 INFO L208 MainTranslator]: Completed translation [2022-09-20 22:41:42,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:41:42 WrapperNode [2022-09-20 22:41:42,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 22:41:42,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 22:41:42,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 22:41:42,600 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 22:41:42,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:41:42" (1/1) ... [2022-09-20 22:41:42,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:41:42" (1/1) ... [2022-09-20 22:41:42,652 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 13, calls inlined = 21, statements flattened = 277 [2022-09-20 22:41:42,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 22:41:42,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 22:41:42,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 22:41:42,653 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 22:41:42,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:41:42" (1/1) ... [2022-09-20 22:41:42,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:41:42" (1/1) ... [2022-09-20 22:41:42,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:41:42" (1/1) ... [2022-09-20 22:41:42,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:41:42" (1/1) ... [2022-09-20 22:41:42,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:41:42" (1/1) ... [2022-09-20 22:41:42,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:41:42" (1/1) ... [2022-09-20 22:41:42,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:41:42" (1/1) ... [2022-09-20 22:41:42,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 22:41:42,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 22:41:42,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 22:41:42,683 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 22:41:42,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:41:42" (1/1) ... [2022-09-20 22:41:42,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:41:42,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:41:42,711 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-09-20 22:41:42,716 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-09-20 22:41:42,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 22:41:42,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 22:41:42,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 22:41:42,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-20 22:41:42,733 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-09-20 22:41:42,733 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-09-20 22:41:42,733 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-09-20 22:41:42,734 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-09-20 22:41:42,734 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-09-20 22:41:42,734 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-09-20 22:41:42,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 22:41:42,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-09-20 22:41:42,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 22:41:42,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 22:41:42,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 22:41:42,735 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 22:41:42,834 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 22:41:42,835 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 22:41:43,134 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 22:41:43,149 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 22:41:43,149 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-09-20 22:41:43,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:41:43 BoogieIcfgContainer [2022-09-20 22:41:43,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 22:41:43,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 22:41:43,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 22:41:43,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 22:41:43,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 10:41:42" (1/3) ... [2022-09-20 22:41:43,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@895a42f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:41:43, skipping insertion in model container [2022-09-20 22:41:43,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:41:42" (2/3) ... [2022-09-20 22:41:43,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@895a42f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:41:43, skipping insertion in model container [2022-09-20 22:41:43,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:41:43" (3/3) ... [2022-09-20 22:41:43,157 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-array-int-trans.wvr.c [2022-09-20 22:41:43,168 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 22:41:43,168 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-20 22:41:43,168 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 22:41:43,230 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-09-20 22:41:43,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 332 places, 350 transitions, 724 flow [2022-09-20 22:41:43,362 INFO L130 PetriNetUnfolder]: 28/347 cut-off events. [2022-09-20 22:41:43,362 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-09-20 22:41:43,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 347 events. 28/347 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 584 event pairs, 0 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 269. Up to 3 conditions per place. [2022-09-20 22:41:43,369 INFO L82 GeneralOperation]: Start removeDead. Operand has 332 places, 350 transitions, 724 flow [2022-09-20 22:41:43,380 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 318 places, 336 transitions, 690 flow [2022-09-20 22:41:43,390 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 22:41:43,394 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;@30b25666, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 22:41:43,394 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-09-20 22:41:43,462 INFO L130 PetriNetUnfolder]: 27/332 cut-off events. [2022-09-20 22:41:43,462 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-09-20 22:41:43,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:41:43,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:41:43,464 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-09-20 22:41:43,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:41:43,467 INFO L85 PathProgramCache]: Analyzing trace with hash 975738456, now seen corresponding path program 1 times [2022-09-20 22:41:43,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:41:43,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49649720] [2022-09-20 22:41:43,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:41:43,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:41:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:41:43,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:41:43,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:41:43,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49649720] [2022-09-20 22:41:43,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49649720] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:41:43,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:41:43,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 22:41:43,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510236402] [2022-09-20 22:41:43,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:41:43,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-20 22:41:43,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:41:43,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-20 22:41:43,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-20 22:41:43,712 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 350 [2022-09-20 22:41:43,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 336 transitions, 690 flow. Second operand has 2 states, 2 states have (on average 329.5) internal successors, (659), 2 states have internal predecessors, (659), 0 states have call successors, (0), 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-09-20 22:41:43,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:41:43,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 350 [2022-09-20 22:41:43,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:41:43,767 INFO L130 PetriNetUnfolder]: 9/317 cut-off events. [2022-09-20 22:41:43,767 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-09-20 22:41:43,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 317 events. 9/317 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 562 event pairs, 0 based on Foata normal form. 25/320 useless extension candidates. Maximal degree in co-relation 256. Up to 7 conditions per place. [2022-09-20 22:41:43,772 INFO L137 encePairwiseOnDemand]: 331/350 looper letters, 6 selfloop transitions, 0 changer transitions 7/317 dead transitions. [2022-09-20 22:41:43,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 317 transitions, 664 flow [2022-09-20 22:41:43,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-20 22:41:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-09-20 22:41:43,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 673 transitions. [2022-09-20 22:41:43,785 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9614285714285714 [2022-09-20 22:41:43,786 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 673 transitions. [2022-09-20 22:41:43,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 673 transitions. [2022-09-20 22:41:43,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:41:43,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 673 transitions. [2022-09-20 22:41:43,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 336.5) internal successors, (673), 2 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:41:43,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 350.0) internal successors, (1050), 3 states have internal predecessors, (1050), 0 states have call successors, (0), 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-09-20 22:41:43,801 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 350.0) internal successors, (1050), 3 states have internal predecessors, (1050), 0 states have call successors, (0), 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-09-20 22:41:43,802 INFO L175 Difference]: Start difference. First operand has 318 places, 336 transitions, 690 flow. Second operand 2 states and 673 transitions. [2022-09-20 22:41:43,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 317 transitions, 664 flow [2022-09-20 22:41:43,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 317 transitions, 652 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-09-20 22:41:43,812 INFO L231 Difference]: Finished difference. Result has 313 places, 310 transitions, 626 flow [2022-09-20 22:41:43,814 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=626, PETRI_PLACES=313, PETRI_TRANSITIONS=310} [2022-09-20 22:41:43,819 INFO L287 CegarLoopForPetriNet]: 318 programPoint places, -5 predicate places. [2022-09-20 22:41:43,819 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 310 transitions, 626 flow [2022-09-20 22:41:43,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 329.5) internal successors, (659), 2 states have internal predecessors, (659), 0 states have call successors, (0), 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-09-20 22:41:43,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:41:43,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:41:43,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 22:41:43,821 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-09-20 22:41:43,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:41:43,822 INFO L85 PathProgramCache]: Analyzing trace with hash -979144953, now seen corresponding path program 1 times [2022-09-20 22:41:43,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:41:43,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088124021] [2022-09-20 22:41:43,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:41:43,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:41:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:41:44,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:41:44,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:41:44,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088124021] [2022-09-20 22:41:44,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088124021] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:41:44,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:41:44,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:41:44,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825664821] [2022-09-20 22:41:44,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:41:44,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:41:44,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:41:44,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:41:44,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:41:44,065 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 350 [2022-09-20 22:41:44,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 310 transitions, 626 flow. Second operand has 7 states, 7 states have (on average 272.42857142857144) internal successors, (1907), 7 states have internal predecessors, (1907), 0 states have call successors, (0), 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-09-20 22:41:44,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:41:44,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 350 [2022-09-20 22:41:44,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:41:44,795 INFO L130 PetriNetUnfolder]: 555/4165 cut-off events. [2022-09-20 22:41:44,795 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2022-09-20 22:41:44,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4991 conditions, 4165 events. 555/4165 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 38908 event pairs, 114 based on Foata normal form. 1/3654 useless extension candidates. Maximal degree in co-relation 4988. Up to 282 conditions per place. [2022-09-20 22:41:44,815 INFO L137 encePairwiseOnDemand]: 341/350 looper letters, 92 selfloop transitions, 9 changer transitions 4/357 dead transitions. [2022-09-20 22:41:44,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 357 transitions, 939 flow [2022-09-20 22:41:44,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 22:41:44,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 22:41:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1961 transitions. [2022-09-20 22:41:44,819 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8004081632653062 [2022-09-20 22:41:44,819 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1961 transitions. [2022-09-20 22:41:44,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1961 transitions. [2022-09-20 22:41:44,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:41:44,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1961 transitions. [2022-09-20 22:41:44,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 280.14285714285717) internal successors, (1961), 7 states have internal predecessors, (1961), 0 states have call successors, (0), 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-09-20 22:41:44,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 350.0) internal successors, (2800), 8 states have internal predecessors, (2800), 0 states have call successors, (0), 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-09-20 22:41:44,827 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 350.0) internal successors, (2800), 8 states have internal predecessors, (2800), 0 states have call successors, (0), 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-09-20 22:41:44,827 INFO L175 Difference]: Start difference. First operand has 313 places, 310 transitions, 626 flow. Second operand 7 states and 1961 transitions. [2022-09-20 22:41:44,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 357 transitions, 939 flow [2022-09-20 22:41:44,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 357 transitions, 939 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-09-20 22:41:44,832 INFO L231 Difference]: Finished difference. Result has 317 places, 317 transitions, 688 flow [2022-09-20 22:41:44,832 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=688, PETRI_PLACES=317, PETRI_TRANSITIONS=317} [2022-09-20 22:41:44,833 INFO L287 CegarLoopForPetriNet]: 318 programPoint places, -1 predicate places. [2022-09-20 22:41:44,833 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 317 transitions, 688 flow [2022-09-20 22:41:44,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 272.42857142857144) internal successors, (1907), 7 states have internal predecessors, (1907), 0 states have call successors, (0), 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-09-20 22:41:44,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:41:44,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:41:44,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 22:41:44,834 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-09-20 22:41:44,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:41:44,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1836303683, now seen corresponding path program 2 times [2022-09-20 22:41:44,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:41:44,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981313839] [2022-09-20 22:41:44,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:41:44,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:41:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:41:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:41:44,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:41:44,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981313839] [2022-09-20 22:41:44,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981313839] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:41:44,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:41:44,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:41:44,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330839478] [2022-09-20 22:41:44,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:41:44,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:41:44,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:41:44,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:41:44,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:41:44,956 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 350 [2022-09-20 22:41:44,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 317 transitions, 688 flow. Second operand has 7 states, 7 states have (on average 272.42857142857144) internal successors, (1907), 7 states have internal predecessors, (1907), 0 states have call successors, (0), 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-09-20 22:41:44,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:41:44,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 350 [2022-09-20 22:41:44,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:41:45,819 INFO L130 PetriNetUnfolder]: 840/6387 cut-off events. [2022-09-20 22:41:45,819 INFO L131 PetriNetUnfolder]: For 881/1096 co-relation queries the response was YES. [2022-09-20 22:41:45,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8293 conditions, 6387 events. 840/6387 cut-off events. For 881/1096 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 68048 event pairs, 187 based on Foata normal form. 25/5612 useless extension candidates. Maximal degree in co-relation 8284. Up to 503 conditions per place. [2022-09-20 22:41:45,859 INFO L137 encePairwiseOnDemand]: 339/350 looper letters, 95 selfloop transitions, 16 changer transitions 4/367 dead transitions. [2022-09-20 22:41:45,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 367 transitions, 1077 flow [2022-09-20 22:41:45,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-20 22:41:45,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-09-20 22:41:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2229 transitions. [2022-09-20 22:41:45,863 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7960714285714285 [2022-09-20 22:41:45,863 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2229 transitions. [2022-09-20 22:41:45,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2229 transitions. [2022-09-20 22:41:45,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:41:45,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2229 transitions. [2022-09-20 22:41:45,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 278.625) internal successors, (2229), 8 states have internal predecessors, (2229), 0 states have call successors, (0), 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-09-20 22:41:45,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 350.0) internal successors, (3150), 9 states have internal predecessors, (3150), 0 states have call successors, (0), 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-09-20 22:41:45,872 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 350.0) internal successors, (3150), 9 states have internal predecessors, (3150), 0 states have call successors, (0), 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-09-20 22:41:45,872 INFO L175 Difference]: Start difference. First operand has 317 places, 317 transitions, 688 flow. Second operand 8 states and 2229 transitions. [2022-09-20 22:41:45,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 367 transitions, 1077 flow [2022-09-20 22:41:45,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 367 transitions, 1054 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-09-20 22:41:45,879 INFO L231 Difference]: Finished difference. Result has 324 places, 324 transitions, 781 flow [2022-09-20 22:41:45,879 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=781, PETRI_PLACES=324, PETRI_TRANSITIONS=324} [2022-09-20 22:41:45,880 INFO L287 CegarLoopForPetriNet]: 318 programPoint places, 6 predicate places. [2022-09-20 22:41:45,880 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 324 transitions, 781 flow [2022-09-20 22:41:45,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 272.42857142857144) internal successors, (1907), 7 states have internal predecessors, (1907), 0 states have call successors, (0), 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-09-20 22:41:45,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:41:45,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:41:45,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 22:41:45,882 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-09-20 22:41:45,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:41:45,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1716503459, now seen corresponding path program 3 times [2022-09-20 22:41:45,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:41:45,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705544080] [2022-09-20 22:41:45,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:41:45,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:41:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:41:46,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:41:46,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:41:46,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705544080] [2022-09-20 22:41:46,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705544080] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:41:46,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:41:46,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-09-20 22:41:46,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29661530] [2022-09-20 22:41:46,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:41:46,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-09-20 22:41:46,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:41:46,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-09-20 22:41:46,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-09-20 22:41:46,134 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 350 [2022-09-20 22:41:46,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 324 transitions, 781 flow. Second operand has 14 states, 14 states have (on average 248.5) internal successors, (3479), 14 states have internal predecessors, (3479), 0 states have call successors, (0), 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-09-20 22:41:46,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:41:46,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 350 [2022-09-20 22:41:46,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:41:47,866 INFO L130 PetriNetUnfolder]: 1399/12163 cut-off events. [2022-09-20 22:41:47,866 INFO L131 PetriNetUnfolder]: For 3062/3538 co-relation queries the response was YES. [2022-09-20 22:41:47,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16043 conditions, 12163 events. 1399/12163 cut-off events. For 3062/3538 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 153568 event pairs, 694 based on Foata normal form. 26/10787 useless extension candidates. Maximal degree in co-relation 16031. Up to 817 conditions per place. [2022-09-20 22:41:47,944 INFO L137 encePairwiseOnDemand]: 328/350 looper letters, 147 selfloop transitions, 26 changer transitions 5/415 dead transitions. [2022-09-20 22:41:47,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 415 transitions, 1437 flow [2022-09-20 22:41:47,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-20 22:41:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-09-20 22:41:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 5043 transitions. [2022-09-20 22:41:47,952 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7204285714285714 [2022-09-20 22:41:47,952 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 5043 transitions. [2022-09-20 22:41:47,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 5043 transitions. [2022-09-20 22:41:47,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:41:47,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 5043 transitions. [2022-09-20 22:41:47,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 252.15) internal successors, (5043), 20 states have internal predecessors, (5043), 0 states have call successors, (0), 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-09-20 22:41:48,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 350.0) internal successors, (7350), 21 states have internal predecessors, (7350), 0 states have call successors, (0), 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-09-20 22:41:48,035 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 350.0) internal successors, (7350), 21 states have internal predecessors, (7350), 0 states have call successors, (0), 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-09-20 22:41:48,035 INFO L175 Difference]: Start difference. First operand has 324 places, 324 transitions, 781 flow. Second operand 20 states and 5043 transitions. [2022-09-20 22:41:48,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 415 transitions, 1437 flow [2022-09-20 22:41:48,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 415 transitions, 1395 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-09-20 22:41:48,045 INFO L231 Difference]: Finished difference. Result has 348 places, 341 transitions, 944 flow [2022-09-20 22:41:48,045 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=944, PETRI_PLACES=348, PETRI_TRANSITIONS=341} [2022-09-20 22:41:48,046 INFO L287 CegarLoopForPetriNet]: 318 programPoint places, 30 predicate places. [2022-09-20 22:41:48,046 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 341 transitions, 944 flow [2022-09-20 22:41:48,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 248.5) internal successors, (3479), 14 states have internal predecessors, (3479), 0 states have call successors, (0), 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-09-20 22:41:48,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:41:48,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:41:48,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 22:41:48,048 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-09-20 22:41:48,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:41:48,048 INFO L85 PathProgramCache]: Analyzing trace with hash 426613791, now seen corresponding path program 1 times [2022-09-20 22:41:48,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:41:48,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286522178] [2022-09-20 22:41:48,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:41:48,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:41:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:41:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:41:48,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:41:48,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286522178] [2022-09-20 22:41:48,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286522178] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 22:41:48,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972528612] [2022-09-20 22:41:48,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:41:48,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:41:48,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:41:48,239 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-20 22:41:48,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-09-20 22:41:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:41:48,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 14 conjunts are in the unsatisfiable core [2022-09-20 22:41:48,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 22:41:48,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:41:48,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 22:41:49,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:41:49,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972528612] provided 1 perfect and 1 imperfect interpolant sequences [2022-09-20 22:41:49,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-09-20 22:41:49,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15, 13] total 26 [2022-09-20 22:41:49,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053643054] [2022-09-20 22:41:49,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:41:49,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-09-20 22:41:49,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:41:49,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-09-20 22:41:49,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2022-09-20 22:41:49,006 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 350 [2022-09-20 22:41:49,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 341 transitions, 944 flow. Second operand has 13 states, 13 states have (on average 249.15384615384616) internal successors, (3239), 13 states have internal predecessors, (3239), 0 states have call successors, (0), 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-09-20 22:41:49,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:41:49,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 350 [2022-09-20 22:41:49,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:41:51,649 INFO L130 PetriNetUnfolder]: 2188/19241 cut-off events. [2022-09-20 22:41:51,650 INFO L131 PetriNetUnfolder]: For 4248/4412 co-relation queries the response was YES. [2022-09-20 22:41:51,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24948 conditions, 19241 events. 2188/19241 cut-off events. For 4248/4412 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 259475 event pairs, 1194 based on Foata normal form. 26/17064 useless extension candidates. Maximal degree in co-relation 24927. Up to 954 conditions per place. [2022-09-20 22:41:51,788 INFO L137 encePairwiseOnDemand]: 328/350 looper letters, 159 selfloop transitions, 30 changer transitions 4/436 dead transitions. [2022-09-20 22:41:51,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 436 transitions, 1673 flow [2022-09-20 22:41:51,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-09-20 22:41:51,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-09-20 22:41:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 4320 transitions. [2022-09-20 22:41:51,795 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7260504201680672 [2022-09-20 22:41:51,795 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 4320 transitions. [2022-09-20 22:41:51,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 4320 transitions. [2022-09-20 22:41:51,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:41:51,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 4320 transitions. [2022-09-20 22:41:51,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 254.11764705882354) internal successors, (4320), 17 states have internal predecessors, (4320), 0 states have call successors, (0), 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-09-20 22:41:51,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 350.0) internal successors, (6300), 18 states have internal predecessors, (6300), 0 states have call successors, (0), 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-09-20 22:41:51,957 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 350.0) internal successors, (6300), 18 states have internal predecessors, (6300), 0 states have call successors, (0), 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-09-20 22:41:51,957 INFO L175 Difference]: Start difference. First operand has 348 places, 341 transitions, 944 flow. Second operand 17 states and 4320 transitions. [2022-09-20 22:41:51,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 436 transitions, 1673 flow [2022-09-20 22:41:51,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 436 transitions, 1642 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-09-20 22:41:51,967 INFO L231 Difference]: Finished difference. Result has 364 places, 358 transitions, 1105 flow [2022-09-20 22:41:51,968 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1105, PETRI_PLACES=364, PETRI_TRANSITIONS=358} [2022-09-20 22:41:51,968 INFO L287 CegarLoopForPetriNet]: 318 programPoint places, 46 predicate places. [2022-09-20 22:41:51,968 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 358 transitions, 1105 flow [2022-09-20 22:41:51,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 249.15384615384616) internal successors, (3239), 13 states have internal predecessors, (3239), 0 states have call successors, (0), 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-09-20 22:41:51,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:41:51,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:41:51,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-09-20 22:41:52,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:41:52,176 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-09-20 22:41:52,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:41:52,176 INFO L85 PathProgramCache]: Analyzing trace with hash 831999536, now seen corresponding path program 1 times [2022-09-20 22:41:52,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:41:52,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816913218] [2022-09-20 22:41:52,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:41:52,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:41:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:41:52,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:41:52,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:41:52,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816913218] [2022-09-20 22:41:52,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816913218] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 22:41:52,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905277071] [2022-09-20 22:41:52,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:41:52,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:41:52,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:41:52,327 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-20 22:41:52,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-09-20 22:41:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:41:52,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 10 conjunts are in the unsatisfiable core [2022-09-20 22:41:52,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 22:41:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:41:52,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 22:41:53,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:41:53,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905277071] provided 1 perfect and 1 imperfect interpolant sequences [2022-09-20 22:41:53,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-09-20 22:41:53,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 11] total 23 [2022-09-20 22:41:53,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344052496] [2022-09-20 22:41:53,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:41:53,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 22:41:53,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:41:53,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 22:41:53,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-09-20 22:41:53,038 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 350 [2022-09-20 22:41:53,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 358 transitions, 1105 flow. Second operand has 11 states, 11 states have (on average 272.45454545454544) internal successors, (2997), 11 states have internal predecessors, (2997), 0 states have call successors, (0), 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-09-20 22:41:53,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:41:53,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 350 [2022-09-20 22:41:53,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:41:56,713 INFO L130 PetriNetUnfolder]: 4626/24811 cut-off events. [2022-09-20 22:41:56,713 INFO L131 PetriNetUnfolder]: For 7622/7699 co-relation queries the response was YES. [2022-09-20 22:41:56,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36035 conditions, 24811 events. 4626/24811 cut-off events. For 7622/7699 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 329094 event pairs, 1585 based on Foata normal form. 27/21620 useless extension candidates. Maximal degree in co-relation 36010. Up to 1756 conditions per place. [2022-09-20 22:41:56,882 INFO L137 encePairwiseOnDemand]: 332/350 looper letters, 158 selfloop transitions, 25 changer transitions 1/453 dead transitions. [2022-09-20 22:41:56,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 453 transitions, 1834 flow [2022-09-20 22:41:56,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-20 22:41:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-09-20 22:41:56,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4987 transitions. [2022-09-20 22:41:56,890 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7915873015873016 [2022-09-20 22:41:56,890 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 4987 transitions. [2022-09-20 22:41:56,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 4987 transitions. [2022-09-20 22:41:56,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:41:56,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 4987 transitions. [2022-09-20 22:41:56,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 277.05555555555554) internal successors, (4987), 18 states have internal predecessors, (4987), 0 states have call successors, (0), 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-09-20 22:41:56,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 350.0) internal successors, (6650), 19 states have internal predecessors, (6650), 0 states have call successors, (0), 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-09-20 22:41:56,904 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 350.0) internal successors, (6650), 19 states have internal predecessors, (6650), 0 states have call successors, (0), 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-09-20 22:41:56,904 INFO L175 Difference]: Start difference. First operand has 364 places, 358 transitions, 1105 flow. Second operand 18 states and 4987 transitions. [2022-09-20 22:41:56,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 453 transitions, 1834 flow [2022-09-20 22:41:56,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 453 transitions, 1817 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-09-20 22:41:56,923 INFO L231 Difference]: Finished difference. Result has 374 places, 364 transitions, 1163 flow [2022-09-20 22:41:56,923 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1163, PETRI_PLACES=374, PETRI_TRANSITIONS=364} [2022-09-20 22:41:56,924 INFO L287 CegarLoopForPetriNet]: 318 programPoint places, 56 predicate places. [2022-09-20 22:41:56,924 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 364 transitions, 1163 flow [2022-09-20 22:41:56,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 272.45454545454544) internal successors, (2997), 11 states have internal predecessors, (2997), 0 states have call successors, (0), 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-09-20 22:41:56,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:41:56,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:41:56,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-09-20 22:41:57,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-09-20 22:41:57,138 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-09-20 22:41:57,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:41:57,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1544366601, now seen corresponding path program 1 times [2022-09-20 22:41:57,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:41:57,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768857589] [2022-09-20 22:41:57,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:41:57,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:41:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:41:57,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 22:41:57,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:41:57,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768857589] [2022-09-20 22:41:57,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768857589] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 22:41:57,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794745882] [2022-09-20 22:41:57,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:41:57,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:41:57,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:41:57,304 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-20 22:41:57,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-09-20 22:41:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:41:57,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 14 conjunts are in the unsatisfiable core [2022-09-20 22:41:57,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 22:41:57,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 22:41:57,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 22:41:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 22:41:57,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794745882] provided 1 perfect and 1 imperfect interpolant sequences [2022-09-20 22:41:57,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-09-20 22:41:57,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15, 13] total 29 [2022-09-20 22:41:57,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076808248] [2022-09-20 22:41:57,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:41:57,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-09-20 22:41:57,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:41:57,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-09-20 22:41:57,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2022-09-20 22:41:58,001 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 350 [2022-09-20 22:41:58,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 364 transitions, 1163 flow. Second operand has 13 states, 13 states have (on average 249.53846153846155) internal successors, (3244), 13 states have internal predecessors, (3244), 0 states have call successors, (0), 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-09-20 22:41:58,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:41:58,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 350 [2022-09-20 22:41:58,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:42:04,519 INFO L130 PetriNetUnfolder]: 5302/44856 cut-off events. [2022-09-20 22:42:04,519 INFO L131 PetriNetUnfolder]: For 16490/17170 co-relation queries the response was YES. [2022-09-20 22:42:04,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62574 conditions, 44856 events. 5302/44856 cut-off events. For 16490/17170 co-relation queries the response was YES. Maximal size of possible extension queue 1062. Compared 706551 event pairs, 2386 based on Foata normal form. 56/40282 useless extension candidates. Maximal degree in co-relation 62549. Up to 2685 conditions per place. [2022-09-20 22:42:04,957 INFO L137 encePairwiseOnDemand]: 325/350 looper letters, 196 selfloop transitions, 56 changer transitions 4/506 dead transitions. [2022-09-20 22:42:04,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 506 transitions, 2428 flow [2022-09-20 22:42:04,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-20 22:42:04,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-09-20 22:42:04,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 5783 transitions. [2022-09-20 22:42:04,965 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7183850931677018 [2022-09-20 22:42:04,965 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 5783 transitions. [2022-09-20 22:42:04,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 5783 transitions. [2022-09-20 22:42:04,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:42:04,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 5783 transitions. [2022-09-20 22:42:04,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 251.43478260869566) internal successors, (5783), 23 states have internal predecessors, (5783), 0 states have call successors, (0), 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-09-20 22:42:04,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 350.0) internal successors, (8400), 24 states have internal predecessors, (8400), 0 states have call successors, (0), 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-09-20 22:42:04,983 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 350.0) internal successors, (8400), 24 states have internal predecessors, (8400), 0 states have call successors, (0), 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-09-20 22:42:04,983 INFO L175 Difference]: Start difference. First operand has 374 places, 364 transitions, 1163 flow. Second operand 23 states and 5783 transitions. [2022-09-20 22:42:04,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 506 transitions, 2428 flow [2022-09-20 22:42:05,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 506 transitions, 2375 flow, removed 4 selfloop flow, removed 9 redundant places. [2022-09-20 22:42:05,015 INFO L231 Difference]: Finished difference. Result has 395 places, 395 transitions, 1516 flow [2022-09-20 22:42:05,016 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1516, PETRI_PLACES=395, PETRI_TRANSITIONS=395} [2022-09-20 22:42:05,017 INFO L287 CegarLoopForPetriNet]: 318 programPoint places, 77 predicate places. [2022-09-20 22:42:05,017 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 395 transitions, 1516 flow [2022-09-20 22:42:05,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 249.53846153846155) internal successors, (3244), 13 states have internal predecessors, (3244), 0 states have call successors, (0), 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-09-20 22:42:05,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:42:05,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:42:05,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-09-20 22:42:05,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:42:05,225 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-09-20 22:42:05,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:42:05,226 INFO L85 PathProgramCache]: Analyzing trace with hash 983787429, now seen corresponding path program 1 times [2022-09-20 22:42:05,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:42:05,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402231065] [2022-09-20 22:42:05,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:42:05,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:42:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:42:05,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 22:42:05,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:42:05,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402231065] [2022-09-20 22:42:05,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402231065] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 22:42:05,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329327222] [2022-09-20 22:42:05,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:42:05,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:42:05,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:42:05,364 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-20 22:42:05,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-09-20 22:42:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:42:05,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 10 conjunts are in the unsatisfiable core [2022-09-20 22:42:05,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 22:42:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 22:42:05,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 22:42:06,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 22:42:06,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329327222] provided 1 perfect and 1 imperfect interpolant sequences [2022-09-20 22:42:06,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-09-20 22:42:06,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 11] total 23 [2022-09-20 22:42:06,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581492857] [2022-09-20 22:42:06,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:42:06,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 22:42:06,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:42:06,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 22:42:06,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-09-20 22:42:06,194 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 350 [2022-09-20 22:42:06,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 395 transitions, 1516 flow. Second operand has 11 states, 11 states have (on average 272.90909090909093) internal successors, (3002), 11 states have internal predecessors, (3002), 0 states have call successors, (0), 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-09-20 22:42:06,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:42:06,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 350 [2022-09-20 22:42:06,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:42:17,821 INFO L130 PetriNetUnfolder]: 10575/77440 cut-off events. [2022-09-20 22:42:17,821 INFO L131 PetriNetUnfolder]: For 28731/29284 co-relation queries the response was YES. [2022-09-20 22:42:18,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110607 conditions, 77440 events. 10575/77440 cut-off events. For 28731/29284 co-relation queries the response was YES. Maximal size of possible extension queue 1813. Compared 1306217 event pairs, 4486 based on Foata normal form. 132/70011 useless extension candidates. Maximal degree in co-relation 110575. Up to 3285 conditions per place. [2022-09-20 22:42:18,801 INFO L137 encePairwiseOnDemand]: 332/350 looper letters, 219 selfloop transitions, 30 changer transitions 1/526 dead transitions. [2022-09-20 22:42:18,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 526 transitions, 2680 flow [2022-09-20 22:42:18,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-20 22:42:18,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-09-20 22:42:18,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 5273 transitions. [2022-09-20 22:42:18,809 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7929323308270677 [2022-09-20 22:42:18,809 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 5273 transitions. [2022-09-20 22:42:18,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 5273 transitions. [2022-09-20 22:42:18,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:42:18,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 5273 transitions. [2022-09-20 22:42:18,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 277.5263157894737) internal successors, (5273), 19 states have internal predecessors, (5273), 0 states have call successors, (0), 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-09-20 22:42:18,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 350.0) internal successors, (7000), 20 states have internal predecessors, (7000), 0 states have call successors, (0), 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-09-20 22:42:18,823 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 350.0) internal successors, (7000), 20 states have internal predecessors, (7000), 0 states have call successors, (0), 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-09-20 22:42:18,823 INFO L175 Difference]: Start difference. First operand has 395 places, 395 transitions, 1516 flow. Second operand 19 states and 5273 transitions. [2022-09-20 22:42:18,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 526 transitions, 2680 flow [2022-09-20 22:42:19,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 526 transitions, 2665 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-09-20 22:42:19,072 INFO L231 Difference]: Finished difference. Result has 408 places, 402 transitions, 1595 flow [2022-09-20 22:42:19,073 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=1501, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1595, PETRI_PLACES=408, PETRI_TRANSITIONS=402} [2022-09-20 22:42:19,075 INFO L287 CegarLoopForPetriNet]: 318 programPoint places, 90 predicate places. [2022-09-20 22:42:19,075 INFO L495 AbstractCegarLoop]: Abstraction has has 408 places, 402 transitions, 1595 flow [2022-09-20 22:42:19,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 272.90909090909093) internal successors, (3002), 11 states have internal predecessors, (3002), 0 states have call successors, (0), 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-09-20 22:42:19,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:42:19,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:42:19,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-09-20 22:42:19,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:42:19,292 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-09-20 22:42:19,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:42:19,292 INFO L85 PathProgramCache]: Analyzing trace with hash 694879106, now seen corresponding path program 1 times [2022-09-20 22:42:19,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:42:19,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739407237] [2022-09-20 22:42:19,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:42:19,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:42:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:42:19,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:42:19,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:42:19,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739407237] [2022-09-20 22:42:19,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739407237] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:42:19,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:42:19,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:42:19,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065219965] [2022-09-20 22:42:19,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:42:19,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:42:19,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:42:19,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:42:19,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:42:19,369 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 350 [2022-09-20 22:42:19,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 402 transitions, 1595 flow. Second operand has 7 states, 7 states have (on average 278.85714285714283) internal successors, (1952), 7 states have internal predecessors, (1952), 0 states have call successors, (0), 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-09-20 22:42:19,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:42:19,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 350 [2022-09-20 22:42:19,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:42:23,060 INFO L130 PetriNetUnfolder]: 2293/24505 cut-off events. [2022-09-20 22:42:23,061 INFO L131 PetriNetUnfolder]: For 10021/10351 co-relation queries the response was YES. [2022-09-20 22:42:23,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35148 conditions, 24505 events. 2293/24505 cut-off events. For 10021/10351 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 349367 event pairs, 1245 based on Foata normal form. 120/22651 useless extension candidates. Maximal degree in co-relation 35115. Up to 2672 conditions per place. [2022-09-20 22:42:23,387 INFO L137 encePairwiseOnDemand]: 339/350 looper letters, 76 selfloop transitions, 8 changer transitions 57/422 dead transitions. [2022-09-20 22:42:23,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 422 transitions, 1906 flow [2022-09-20 22:42:23,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 22:42:23,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 22:42:23,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2834 transitions. [2022-09-20 22:42:23,390 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8097142857142857 [2022-09-20 22:42:23,391 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2834 transitions. [2022-09-20 22:42:23,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2834 transitions. [2022-09-20 22:42:23,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:42:23,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2834 transitions. [2022-09-20 22:42:23,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 283.4) internal successors, (2834), 10 states have internal predecessors, (2834), 0 states have call successors, (0), 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-09-20 22:42:23,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 350.0) internal successors, (3850), 11 states have internal predecessors, (3850), 0 states have call successors, (0), 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-09-20 22:42:23,397 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 350.0) internal successors, (3850), 11 states have internal predecessors, (3850), 0 states have call successors, (0), 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-09-20 22:42:23,397 INFO L175 Difference]: Start difference. First operand has 408 places, 402 transitions, 1595 flow. Second operand 10 states and 2834 transitions. [2022-09-20 22:42:23,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 422 transitions, 1906 flow [2022-09-20 22:42:23,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 422 transitions, 1855 flow, removed 7 selfloop flow, removed 11 redundant places. [2022-09-20 22:42:23,421 INFO L231 Difference]: Finished difference. Result has 405 places, 363 transitions, 1295 flow [2022-09-20 22:42:23,421 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1295, PETRI_PLACES=405, PETRI_TRANSITIONS=363} [2022-09-20 22:42:23,422 INFO L287 CegarLoopForPetriNet]: 318 programPoint places, 87 predicate places. [2022-09-20 22:42:23,422 INFO L495 AbstractCegarLoop]: Abstraction has has 405 places, 363 transitions, 1295 flow [2022-09-20 22:42:23,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 278.85714285714283) internal successors, (1952), 7 states have internal predecessors, (1952), 0 states have call successors, (0), 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-09-20 22:42:23,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:42:23,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:42:23,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-20 22:42:23,423 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-09-20 22:42:23,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:42:23,423 INFO L85 PathProgramCache]: Analyzing trace with hash 647253940, now seen corresponding path program 1 times [2022-09-20 22:42:23,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:42:23,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049445316] [2022-09-20 22:42:23,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:42:23,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:42:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:42:23,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-09-20 22:42:23,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:42:23,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049445316] [2022-09-20 22:42:23,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049445316] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 22:42:23,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678477418] [2022-09-20 22:42:23,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:42:23,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:42:23,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:42:23,550 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-20 22:42:23,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-09-20 22:42:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:42:23,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 10 conjunts are in the unsatisfiable core [2022-09-20 22:42:23,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 22:42:23,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-09-20 22:42:23,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 22:42:24,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-09-20 22:42:24,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678477418] provided 1 perfect and 1 imperfect interpolant sequences [2022-09-20 22:42:24,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-09-20 22:42:24,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 11] total 23 [2022-09-20 22:42:24,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534209120] [2022-09-20 22:42:24,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:42:24,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 22:42:24,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:42:24,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 22:42:24,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-09-20 22:42:24,170 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 350 [2022-09-20 22:42:24,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 363 transitions, 1295 flow. Second operand has 11 states, 11 states have (on average 273.0) internal successors, (3003), 11 states have internal predecessors, (3003), 0 states have call successors, (0), 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-09-20 22:42:24,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:42:24,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 350 [2022-09-20 22:42:24,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:42:30,954 INFO L130 PetriNetUnfolder]: 7217/46920 cut-off events. [2022-09-20 22:42:30,954 INFO L131 PetriNetUnfolder]: For 20732/21073 co-relation queries the response was YES. [2022-09-20 22:42:31,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71330 conditions, 46920 events. 7217/46920 cut-off events. For 20732/21073 co-relation queries the response was YES. Maximal size of possible extension queue 1166. Compared 720242 event pairs, 2768 based on Foata normal form. 249/43131 useless extension candidates. Maximal degree in co-relation 71297. Up to 3019 conditions per place. [2022-09-20 22:42:31,437 INFO L137 encePairwiseOnDemand]: 333/350 looper letters, 168 selfloop transitions, 24 changer transitions 0/462 dead transitions. [2022-09-20 22:42:31,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 462 transitions, 2153 flow [2022-09-20 22:42:31,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-20 22:42:31,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-09-20 22:42:31,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 5246 transitions. [2022-09-20 22:42:31,441 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7888721804511278 [2022-09-20 22:42:31,441 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 5246 transitions. [2022-09-20 22:42:31,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 5246 transitions. [2022-09-20 22:42:31,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:42:31,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 5246 transitions. [2022-09-20 22:42:31,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 276.10526315789474) internal successors, (5246), 19 states have internal predecessors, (5246), 0 states have call successors, (0), 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-09-20 22:42:31,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 350.0) internal successors, (7000), 20 states have internal predecessors, (7000), 0 states have call successors, (0), 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-09-20 22:42:31,452 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 350.0) internal successors, (7000), 20 states have internal predecessors, (7000), 0 states have call successors, (0), 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-09-20 22:42:31,452 INFO L175 Difference]: Start difference. First operand has 405 places, 363 transitions, 1295 flow. Second operand 19 states and 5246 transitions. [2022-09-20 22:42:31,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 462 transitions, 2153 flow [2022-09-20 22:42:31,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 462 transitions, 2034 flow, removed 5 selfloop flow, removed 27 redundant places. [2022-09-20 22:42:31,489 INFO L231 Difference]: Finished difference. Result has 384 places, 369 transitions, 1269 flow [2022-09-20 22:42:31,490 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=1196, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1269, PETRI_PLACES=384, PETRI_TRANSITIONS=369} [2022-09-20 22:42:31,491 INFO L287 CegarLoopForPetriNet]: 318 programPoint places, 66 predicate places. [2022-09-20 22:42:31,491 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 369 transitions, 1269 flow [2022-09-20 22:42:31,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 273.0) internal successors, (3003), 11 states have internal predecessors, (3003), 0 states have call successors, (0), 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-09-20 22:42:31,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:42:31,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:42:31,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-09-20 22:42:31,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-09-20 22:42:31,708 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-09-20 22:42:31,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:42:31,708 INFO L85 PathProgramCache]: Analyzing trace with hash -140102180, now seen corresponding path program 1 times [2022-09-20 22:42:31,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:42:31,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746380922] [2022-09-20 22:42:31,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:42:31,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:42:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:42:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 22:42:31,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:42:31,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746380922] [2022-09-20 22:42:31,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746380922] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:42:31,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:42:31,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:42:31,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098729477] [2022-09-20 22:42:31,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:42:31,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:42:31,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:42:31,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:42:31,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:42:31,776 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 350 [2022-09-20 22:42:31,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 369 transitions, 1269 flow. Second operand has 7 states, 7 states have (on average 279.42857142857144) internal successors, (1956), 7 states have internal predecessors, (1956), 0 states have call successors, (0), 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-09-20 22:42:31,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:42:31,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 350 [2022-09-20 22:42:31,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:42:33,723 INFO L130 PetriNetUnfolder]: 2195/13739 cut-off events. [2022-09-20 22:42:33,724 INFO L131 PetriNetUnfolder]: For 7280/7430 co-relation queries the response was YES. [2022-09-20 22:42:33,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22022 conditions, 13739 events. 2195/13739 cut-off events. For 7280/7430 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 170127 event pairs, 1382 based on Foata normal form. 173/12646 useless extension candidates. Maximal degree in co-relation 21998. Up to 2673 conditions per place. [2022-09-20 22:42:33,901 INFO L137 encePairwiseOnDemand]: 341/350 looper letters, 73 selfloop transitions, 10 changer transitions 31/388 dead transitions. [2022-09-20 22:42:33,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 388 transitions, 1575 flow [2022-09-20 22:42:33,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-20 22:42:33,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-09-20 22:42:33,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2264 transitions. [2022-09-20 22:42:33,904 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8085714285714286 [2022-09-20 22:42:33,904 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2264 transitions. [2022-09-20 22:42:33,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2264 transitions. [2022-09-20 22:42:33,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:42:33,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2264 transitions. [2022-09-20 22:42:33,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 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-09-20 22:42:33,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 350.0) internal successors, (3150), 9 states have internal predecessors, (3150), 0 states have call successors, (0), 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-09-20 22:42:33,908 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 350.0) internal successors, (3150), 9 states have internal predecessors, (3150), 0 states have call successors, (0), 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-09-20 22:42:33,908 INFO L175 Difference]: Start difference. First operand has 384 places, 369 transitions, 1269 flow. Second operand 8 states and 2264 transitions. [2022-09-20 22:42:33,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 388 transitions, 1575 flow [2022-09-20 22:42:33,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 388 transitions, 1526 flow, removed 6 selfloop flow, removed 14 redundant places. [2022-09-20 22:42:33,923 INFO L231 Difference]: Finished difference. Result has 377 places, 355 transitions, 1136 flow [2022-09-20 22:42:33,924 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=1174, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1136, PETRI_PLACES=377, PETRI_TRANSITIONS=355} [2022-09-20 22:42:33,924 INFO L287 CegarLoopForPetriNet]: 318 programPoint places, 59 predicate places. [2022-09-20 22:42:33,924 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 355 transitions, 1136 flow [2022-09-20 22:42:33,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 279.42857142857144) internal successors, (1956), 7 states have internal predecessors, (1956), 0 states have call successors, (0), 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-09-20 22:42:33,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:42:33,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:42:33,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-20 22:42:33,925 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-09-20 22:42:33,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:42:33,925 INFO L85 PathProgramCache]: Analyzing trace with hash 725059007, now seen corresponding path program 1 times [2022-09-20 22:42:33,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:42:33,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295347597] [2022-09-20 22:42:33,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:42:33,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:42:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:42:34,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-09-20 22:42:34,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:42:34,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295347597] [2022-09-20 22:42:34,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295347597] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 22:42:34,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227728441] [2022-09-20 22:42:34,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:42:34,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:42:34,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:42:34,089 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-20 22:42:34,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-09-20 22:42:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:42:34,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 16 conjunts are in the unsatisfiable core [2022-09-20 22:42:34,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 22:42:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-09-20 22:42:34,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 22:42:34,859 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-09-20 22:42:34,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227728441] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 22:42:34,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 22:42:34,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 36 [2022-09-20 22:42:34,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122997712] [2022-09-20 22:42:34,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 22:42:34,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-09-20 22:42:34,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:42:34,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-09-20 22:42:34,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1131, Unknown=0, NotChecked=0, Total=1260 [2022-09-20 22:42:34,863 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 350 [2022-09-20 22:42:34,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 355 transitions, 1136 flow. Second operand has 36 states, 36 states have (on average 242.52777777777777) internal successors, (8731), 36 states have internal predecessors, (8731), 0 states have call successors, (0), 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-09-20 22:42:34,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:42:34,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 350 [2022-09-20 22:42:34,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:42:45,481 INFO L130 PetriNetUnfolder]: 7289/49990 cut-off events. [2022-09-20 22:42:45,481 INFO L131 PetriNetUnfolder]: For 31160/34184 co-relation queries the response was YES. [2022-09-20 22:42:45,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81037 conditions, 49990 events. 7289/49990 cut-off events. For 31160/34184 co-relation queries the response was YES. Maximal size of possible extension queue 1223. Compared 775891 event pairs, 2072 based on Foata normal form. 839/46590 useless extension candidates. Maximal degree in co-relation 81014. Up to 1982 conditions per place. [2022-09-20 22:42:45,976 INFO L137 encePairwiseOnDemand]: 311/350 looper letters, 515 selfloop transitions, 174 changer transitions 51/971 dead transitions. [2022-09-20 22:42:45,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 971 transitions, 5790 flow [2022-09-20 22:42:45,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-09-20 22:42:45,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2022-09-20 22:42:45,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 29024 transitions. [2022-09-20 22:42:46,000 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.691047619047619 [2022-09-20 22:42:46,001 INFO L72 ComplementDD]: Start complementDD. Operand 120 states and 29024 transitions. [2022-09-20 22:42:46,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 29024 transitions. [2022-09-20 22:42:46,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:42:46,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 120 states and 29024 transitions. [2022-09-20 22:42:46,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 121 states, 120 states have (on average 241.86666666666667) internal successors, (29024), 120 states have internal predecessors, (29024), 0 states have call successors, (0), 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-09-20 22:42:46,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 121 states, 121 states have (on average 350.0) internal successors, (42350), 121 states have internal predecessors, (42350), 0 states have call successors, (0), 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-09-20 22:42:46,076 INFO L81 ComplementDD]: Finished complementDD. Result has 121 states, 121 states have (on average 350.0) internal successors, (42350), 121 states have internal predecessors, (42350), 0 states have call successors, (0), 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-09-20 22:42:46,076 INFO L175 Difference]: Start difference. First operand has 377 places, 355 transitions, 1136 flow. Second operand 120 states and 29024 transitions. [2022-09-20 22:42:46,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 490 places, 971 transitions, 5790 flow [2022-09-20 22:42:46,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 971 transitions, 5573 flow, removed 57 selfloop flow, removed 8 redundant places. [2022-09-20 22:42:46,127 INFO L231 Difference]: Finished difference. Result has 536 places, 512 transitions, 2933 flow [2022-09-20 22:42:46,128 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=1097, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=120, PETRI_FLOW=2933, PETRI_PLACES=536, PETRI_TRANSITIONS=512} [2022-09-20 22:42:46,128 INFO L287 CegarLoopForPetriNet]: 318 programPoint places, 218 predicate places. [2022-09-20 22:42:46,128 INFO L495 AbstractCegarLoop]: Abstraction has has 536 places, 512 transitions, 2933 flow [2022-09-20 22:42:46,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 242.52777777777777) internal successors, (8731), 36 states have internal predecessors, (8731), 0 states have call successors, (0), 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-09-20 22:42:46,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:42:46,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:42:46,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-09-20 22:42:46,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:42:46,332 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-09-20 22:42:46,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:42:46,332 INFO L85 PathProgramCache]: Analyzing trace with hash 188101230, now seen corresponding path program 1 times [2022-09-20 22:42:46,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:42:46,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704749088] [2022-09-20 22:42:46,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:42:46,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:42:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:42:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-09-20 22:42:46,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:42:46,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704749088] [2022-09-20 22:42:46,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704749088] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:42:46,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:42:46,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:42:46,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156361548] [2022-09-20 22:42:46,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:42:46,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:42:46,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:42:46,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:42:46,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:42:46,386 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 350 [2022-09-20 22:42:46,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 512 transitions, 2933 flow. Second operand has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 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-09-20 22:42:46,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:42:46,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 350 [2022-09-20 22:42:46,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:42:52,347 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([913] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork2_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork2_#t~ret11#1=|v_thread2Thread1of1ForFork2_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork2_#t~ret11#1=|v_thread2Thread1of1ForFork2_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][460], [Black: 5039#(and (<= 1 ~n2~0) (<= 1 ~n3~0)), Black: 3817#(and (<= 1 ~n1~0) (<= 1 ~n2~0)), 2614#(and (<= 1 ~n1~0) (<= 1 ~n3~0) (< |thread3Thread1of1ForFork0_~i~2#1| ~n1~0) (< |thread3Thread1of1ForFork0_~i~2#1| ~n3~0)), Black: 7801#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 46#L102-4true, Black: 7807#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7813#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7684#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~res1~0 0)), Black: 7761#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), 7887#true, Black: 6296#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 7799#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7767#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), 5006#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (< |thread1Thread1of1ForFork1_~i~0#1| ~n1~0) (< |thread1Thread1of1ForFork1_~i~0#1| ~n2~0)), Black: 7753#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7821#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7741#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7709#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7717#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) ~n2~0) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7829#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7757#(and (<= ~res2~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~res1~0 0)), Black: 7773#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7775#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7831#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7650#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) (+ ~n2~0 1)) (= |ULTIMATE.start_create_fresh_int_array_#t~post35#1| 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7652#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7723#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 1493#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), Black: 7731#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) ~n2~0) (<= ~n1~0 1) (or (<= ~n2~0 1) (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 7803#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7739#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post35#1| 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 7644#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) ~n2~0) (<= ~res2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) (+ ~n2~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7771#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 404#(and (<= ~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: 7805#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7747#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= ~res2~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 7719#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= ~res2~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0)), Black: 7733#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7759#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= ~res2~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 7783#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 335#true, Black: 7797#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7670#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 238#L66-9true, Black: 7789#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7614#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= ~n2~0 1) (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~res2~0 0) (<= ~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: 7763#(and (<= ~res2~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1)))), Black: 7823#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7811#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7725#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post35#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7668#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post35#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 3408#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))), Black: 7765#(and (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~res1~0 0)), Black: 7686#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 7642#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) (+ ~n2~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7809#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~res1~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7817#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7827#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7791#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= ~res2~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0)), Black: 7640#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7825#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7815#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~res1~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7779#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7819#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7618#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post35#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res1~0 0)), Black: 3786#(and (<= ~res2~0 0) (< ~n2~0 (+ ~n3~0 1)) (< ~n2~0 2)), Black: 3760#(and (<= ~res2~0 0) (or (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 2))), Black: 3211#(<= ~res2~0 0), 120#L80-9true, Black: 346#(and (<= (+ ~res1~0 ~n2~0) (+ ~res3~0 ~n3~0)) (<= ~n1~0 (+ ~res3~0 ~n3~0))), 6282#(and (<= 1 ~n2~0) (<= 1 ~n3~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~n3~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~n2~0)), Black: 348#(and (<= (+ ~res1~0 ~n2~0) (+ ~res3~0 ~n3~0)) (<= ~n1~0 (+ ~res3~0 ~n3~0)) (<= (+ ~res2~0 ~res1~0) ~res3~0)), 110#L52-9true, Black: 340#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 7787#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0)), Black: 370#(and (or (<= ~res2~0 0) (not (<= ~res3~0 0)) (<= ~res1~0 0)) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res1~0 ~n2~0) ~n1~0)), Black: 361#(<= (+ ~res1~0 ~n2~0) ~n1~0), Black: 367#(and (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res1~0 ~n2~0) ~n1~0))]) [2022-09-20 22:42:52,347 INFO L383 tUnfolder$Statistics]: this new event has 257 ancestors and is not cut-off event [2022-09-20 22:42:52,347 INFO L386 tUnfolder$Statistics]: existing Event has 257 ancestors and is not cut-off event [2022-09-20 22:42:52,348 INFO L386 tUnfolder$Statistics]: existing Event has 257 ancestors and is not cut-off event [2022-09-20 22:42:52,348 INFO L386 tUnfolder$Statistics]: existing Event has 257 ancestors and is not cut-off event [2022-09-20 22:42:52,375 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([913] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork2_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork2_#t~ret11#1=|v_thread2Thread1of1ForFork2_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork2_#t~ret11#1=|v_thread2Thread1of1ForFork2_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][460], [Black: 5039#(and (<= 1 ~n2~0) (<= 1 ~n3~0)), Black: 3817#(and (<= 1 ~n1~0) (<= 1 ~n2~0)), 2614#(and (<= 1 ~n1~0) (<= 1 ~n3~0) (< |thread3Thread1of1ForFork0_~i~2#1| ~n1~0) (< |thread3Thread1of1ForFork0_~i~2#1| ~n3~0)), Black: 7801#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 46#L102-4true, Black: 7807#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7813#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7684#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~res1~0 0)), Black: 7761#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 6296#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 7799#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 7887#true, Black: 7767#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), 5006#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (< |thread1Thread1of1ForFork1_~i~0#1| ~n1~0) (< |thread1Thread1of1ForFork1_~i~0#1| ~n2~0)), Black: 7753#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7821#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7741#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7709#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7717#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) ~n2~0) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7829#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7757#(and (<= ~res2~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~res1~0 0)), Black: 7773#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7775#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7831#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7650#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) (+ ~n2~0 1)) (= |ULTIMATE.start_create_fresh_int_array_#t~post35#1| 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7652#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7723#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 1493#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), Black: 7731#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) ~n2~0) (<= ~n1~0 1) (or (<= ~n2~0 1) (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 7803#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7739#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post35#1| 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 7644#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) ~n2~0) (<= ~res2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) (+ ~n2~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7771#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 404#(and (<= ~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: 7805#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7747#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= ~res2~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 7719#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= ~res2~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0)), Black: 7733#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7759#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= ~res2~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 7783#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 335#true, Black: 7797#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7670#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 238#L66-9true, Black: 7789#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7614#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= ~n2~0 1) (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~res2~0 0) (<= ~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: 7763#(and (<= ~res2~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1)))), Black: 7823#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7811#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7725#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post35#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 3408#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))), Black: 7668#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post35#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7765#(and (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~res1~0 0)), Black: 7686#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 7642#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) (+ ~n2~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7809#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~res1~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7817#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7827#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7791#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= ~res2~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0)), Black: 7640#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7825#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7815#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~res1~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7779#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7819#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7618#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post35#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res1~0 0)), Black: 3786#(and (<= ~res2~0 0) (< ~n2~0 (+ ~n3~0 1)) (< ~n2~0 2)), Black: 3760#(and (<= ~res2~0 0) (or (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 2))), Black: 3211#(<= ~res2~0 0), 120#L80-9true, 6282#(and (<= 1 ~n2~0) (<= 1 ~n3~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~n3~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~n2~0)), Black: 346#(and (<= (+ ~res1~0 ~n2~0) (+ ~res3~0 ~n3~0)) (<= ~n1~0 (+ ~res3~0 ~n3~0))), Black: 348#(and (<= (+ ~res1~0 ~n2~0) (+ ~res3~0 ~n3~0)) (<= ~n1~0 (+ ~res3~0 ~n3~0)) (<= (+ ~res2~0 ~res1~0) ~res3~0)), Black: 340#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 110#L52-9true, Black: 370#(and (or (<= ~res2~0 0) (not (<= ~res3~0 0)) (<= ~res1~0 0)) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res1~0 ~n2~0) ~n1~0)), Black: 361#(<= (+ ~res1~0 ~n2~0) ~n1~0), Black: 367#(and (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res1~0 ~n2~0) ~n1~0)), 7795#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0))]) [2022-09-20 22:42:52,375 INFO L383 tUnfolder$Statistics]: this new event has 264 ancestors and is not cut-off event [2022-09-20 22:42:52,375 INFO L386 tUnfolder$Statistics]: existing Event has 264 ancestors and is not cut-off event [2022-09-20 22:42:52,375 INFO L386 tUnfolder$Statistics]: existing Event has 264 ancestors and is not cut-off event [2022-09-20 22:42:52,375 INFO L386 tUnfolder$Statistics]: existing Event has 264 ancestors and is not cut-off event [2022-09-20 22:42:52,410 INFO L130 PetriNetUnfolder]: 3881/27068 cut-off events. [2022-09-20 22:42:52,411 INFO L131 PetriNetUnfolder]: For 32323/33121 co-relation queries the response was YES. [2022-09-20 22:42:52,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47460 conditions, 27068 events. 3881/27068 cut-off events. For 32323/33121 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 377147 event pairs, 2366 based on Foata normal form. 332/24985 useless extension candidates. Maximal degree in co-relation 47386. Up to 5698 conditions per place. [2022-09-20 22:42:52,835 INFO L137 encePairwiseOnDemand]: 339/350 looper letters, 124 selfloop transitions, 18 changer transitions 56/520 dead transitions. [2022-09-20 22:42:52,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 520 transitions, 3249 flow [2022-09-20 22:42:52,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 22:42:52,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 22:42:52,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2822 transitions. [2022-09-20 22:42:52,838 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8062857142857143 [2022-09-20 22:42:52,838 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2822 transitions. [2022-09-20 22:42:52,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2822 transitions. [2022-09-20 22:42:52,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:42:52,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2822 transitions. [2022-09-20 22:42:52,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 282.2) internal successors, (2822), 10 states have internal predecessors, (2822), 0 states have call successors, (0), 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-09-20 22:42:52,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 350.0) internal successors, (3850), 11 states have internal predecessors, (3850), 0 states have call successors, (0), 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-09-20 22:42:52,842 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 350.0) internal successors, (3850), 11 states have internal predecessors, (3850), 0 states have call successors, (0), 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-09-20 22:42:52,843 INFO L175 Difference]: Start difference. First operand has 536 places, 512 transitions, 2933 flow. Second operand 10 states and 2822 transitions. [2022-09-20 22:42:52,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 520 transitions, 3249 flow [2022-09-20 22:42:52,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 489 places, 520 transitions, 3073 flow, removed 63 selfloop flow, removed 34 redundant places. [2022-09-20 22:42:52,967 INFO L231 Difference]: Finished difference. Result has 489 places, 463 transitions, 2359 flow [2022-09-20 22:42:52,968 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=2571, PETRI_DIFFERENCE_MINUEND_PLACES=480, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2359, PETRI_PLACES=489, PETRI_TRANSITIONS=463} [2022-09-20 22:42:52,968 INFO L287 CegarLoopForPetriNet]: 318 programPoint places, 171 predicate places. [2022-09-20 22:42:52,968 INFO L495 AbstractCegarLoop]: Abstraction has has 489 places, 463 transitions, 2359 flow [2022-09-20 22:42:52,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 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-09-20 22:42:52,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:42:52,969 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:42:52,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-09-20 22:42:52,969 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-09-20 22:42:52,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:42:52,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1820159107, now seen corresponding path program 2 times [2022-09-20 22:42:52,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:42:52,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034156253] [2022-09-20 22:42:52,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:42:52,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:42:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:42:53,307 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-09-20 22:42:53,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:42:53,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034156253] [2022-09-20 22:42:53,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034156253] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 22:42:53,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305787239] [2022-09-20 22:42:53,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-20 22:42:53,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:42:53,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:42:53,309 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-20 22:42:53,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-09-20 22:42:53,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-20 22:42:53,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 22:42:53,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 8 conjunts are in the unsatisfiable core [2022-09-20 22:42:53,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 22:42:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-09-20 22:42:53,523 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-20 22:42:53,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305787239] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:42:53,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-20 22:42:53,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 22 [2022-09-20 22:42:53,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016368215] [2022-09-20 22:42:53,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:42:53,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:42:53,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:42:53,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:42:53,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-09-20 22:42:53,525 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 350 [2022-09-20 22:42:53,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 489 places, 463 transitions, 2359 flow. Second operand has 7 states, 7 states have (on average 272.85714285714283) internal successors, (1910), 7 states have internal predecessors, (1910), 0 states have call successors, (0), 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-09-20 22:42:53,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:42:53,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 350 [2022-09-20 22:42:53,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:43:00,628 INFO L130 PetriNetUnfolder]: 5953/39360 cut-off events. [2022-09-20 22:43:00,628 INFO L131 PetriNetUnfolder]: For 47192/51327 co-relation queries the response was YES. [2022-09-20 22:43:01,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67569 conditions, 39360 events. 5953/39360 cut-off events. For 47192/51327 co-relation queries the response was YES. Maximal size of possible extension queue 1047. Compared 586387 event pairs, 1485 based on Foata normal form. 825/36629 useless extension candidates. Maximal degree in co-relation 67515. Up to 3994 conditions per place. [2022-09-20 22:43:01,118 INFO L137 encePairwiseOnDemand]: 341/350 looper letters, 147 selfloop transitions, 83 changer transitions 4/546 dead transitions. [2022-09-20 22:43:01,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 546 transitions, 3473 flow [2022-09-20 22:43:01,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 22:43:01,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 22:43:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1963 transitions. [2022-09-20 22:43:01,120 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8012244897959183 [2022-09-20 22:43:01,120 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1963 transitions. [2022-09-20 22:43:01,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1963 transitions. [2022-09-20 22:43:01,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:43:01,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1963 transitions. [2022-09-20 22:43:01,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 280.42857142857144) internal successors, (1963), 7 states have internal predecessors, (1963), 0 states have call successors, (0), 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-09-20 22:43:01,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 350.0) internal successors, (2800), 8 states have internal predecessors, (2800), 0 states have call successors, (0), 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-09-20 22:43:01,123 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 350.0) internal successors, (2800), 8 states have internal predecessors, (2800), 0 states have call successors, (0), 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-09-20 22:43:01,123 INFO L175 Difference]: Start difference. First operand has 489 places, 463 transitions, 2359 flow. Second operand 7 states and 1963 transitions. [2022-09-20 22:43:01,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 546 transitions, 3473 flow [2022-09-20 22:43:01,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 546 transitions, 3227 flow, removed 7 selfloop flow, removed 18 redundant places. [2022-09-20 22:43:01,230 INFO L231 Difference]: Finished difference. Result has 463 places, 492 transitions, 2712 flow [2022-09-20 22:43:01,230 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=2128, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2712, PETRI_PLACES=463, PETRI_TRANSITIONS=492} [2022-09-20 22:43:01,231 INFO L287 CegarLoopForPetriNet]: 318 programPoint places, 145 predicate places. [2022-09-20 22:43:01,231 INFO L495 AbstractCegarLoop]: Abstraction has has 463 places, 492 transitions, 2712 flow [2022-09-20 22:43:01,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 272.85714285714283) internal successors, (1910), 7 states have internal predecessors, (1910), 0 states have call successors, (0), 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-09-20 22:43:01,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:43:01,232 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:43:01,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-09-20 22:43:01,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:43:01,447 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-09-20 22:43:01,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:43:01,448 INFO L85 PathProgramCache]: Analyzing trace with hash 235191159, now seen corresponding path program 3 times [2022-09-20 22:43:01,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:43:01,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838312212] [2022-09-20 22:43:01,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:43:01,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:43:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:43:01,623 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 22:43:01,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:43:01,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838312212] [2022-09-20 22:43:01,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838312212] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 22:43:01,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515722755] [2022-09-20 22:43:01,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-20 22:43:01,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:43:01,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:43:01,624 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-20 22:43:01,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-09-20 22:43:01,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-09-20 22:43:01,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 22:43:01,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 8 conjunts are in the unsatisfiable core [2022-09-20 22:43:01,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 22:43:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-09-20 22:43:02,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 22:43:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-09-20 22:43:02,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515722755] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 22:43:02,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 22:43:02,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 7] total 25 [2022-09-20 22:43:02,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911524381] [2022-09-20 22:43:02,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 22:43:02,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-09-20 22:43:02,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:43:02,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-09-20 22:43:02,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2022-09-20 22:43:02,262 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 350 [2022-09-20 22:43:02,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 492 transitions, 2712 flow. Second operand has 25 states, 25 states have (on average 235.12) internal successors, (5878), 25 states have internal predecessors, (5878), 0 states have call successors, (0), 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-09-20 22:43:02,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:43:02,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 350 [2022-09-20 22:43:02,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:43:20,737 INFO L130 PetriNetUnfolder]: 15791/84913 cut-off events. [2022-09-20 22:43:20,738 INFO L131 PetriNetUnfolder]: For 124677/140336 co-relation queries the response was YES. [2022-09-20 22:43:21,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154753 conditions, 84913 events. 15791/84913 cut-off events. For 124677/140336 co-relation queries the response was YES. Maximal size of possible extension queue 2346. Compared 1404237 event pairs, 1737 based on Foata normal form. 1975/79246 useless extension candidates. Maximal degree in co-relation 154700. Up to 3780 conditions per place. [2022-09-20 22:43:22,223 INFO L137 encePairwiseOnDemand]: 310/350 looper letters, 734 selfloop transitions, 264 changer transitions 34/1246 dead transitions. [2022-09-20 22:43:22,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 527 places, 1246 transitions, 9756 flow [2022-09-20 22:43:22,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-09-20 22:43:22,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2022-09-20 22:43:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 15900 transitions. [2022-09-20 22:43:22,231 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6780383795309168 [2022-09-20 22:43:22,231 INFO L72 ComplementDD]: Start complementDD. Operand 67 states and 15900 transitions. [2022-09-20 22:43:22,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 15900 transitions. [2022-09-20 22:43:22,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:43:22,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 67 states and 15900 transitions. [2022-09-20 22:43:22,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 68 states, 67 states have (on average 237.3134328358209) internal successors, (15900), 67 states have internal predecessors, (15900), 0 states have call successors, (0), 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-09-20 22:43:22,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 68 states, 68 states have (on average 350.0) internal successors, (23800), 68 states have internal predecessors, (23800), 0 states have call successors, (0), 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-09-20 22:43:22,255 INFO L81 ComplementDD]: Finished complementDD. Result has 68 states, 68 states have (on average 350.0) internal successors, (23800), 68 states have internal predecessors, (23800), 0 states have call successors, (0), 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-09-20 22:43:22,255 INFO L175 Difference]: Start difference. First operand has 463 places, 492 transitions, 2712 flow. Second operand 67 states and 15900 transitions. [2022-09-20 22:43:22,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 527 places, 1246 transitions, 9756 flow [2022-09-20 22:43:23,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 1246 transitions, 9584 flow, removed 86 selfloop flow, removed 2 redundant places. [2022-09-20 22:43:23,196 INFO L231 Difference]: Finished difference. Result has 556 places, 687 transitions, 5877 flow [2022-09-20 22:43:23,196 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=2654, PETRI_DIFFERENCE_MINUEND_PLACES=459, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=5877, PETRI_PLACES=556, PETRI_TRANSITIONS=687} [2022-09-20 22:43:23,196 INFO L287 CegarLoopForPetriNet]: 318 programPoint places, 238 predicate places. [2022-09-20 22:43:23,196 INFO L495 AbstractCegarLoop]: Abstraction has has 556 places, 687 transitions, 5877 flow [2022-09-20 22:43:23,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 235.12) internal successors, (5878), 25 states have internal predecessors, (5878), 0 states have call successors, (0), 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-09-20 22:43:23,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:43:23,197 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:43:23,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-09-20 22:43:23,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-09-20 22:43:23,407 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-09-20 22:43:23,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:43:23,408 INFO L85 PathProgramCache]: Analyzing trace with hash 612387998, now seen corresponding path program 4 times [2022-09-20 22:43:23,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:43:23,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201720763] [2022-09-20 22:43:23,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:43:23,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:43:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:43:23,594 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-09-20 22:43:23,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:43:23,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201720763] [2022-09-20 22:43:23,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201720763] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 22:43:23,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346204229] [2022-09-20 22:43:23,594 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-09-20 22:43:23,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 22:43:23,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:43:23,596 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-20 22:43:23,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-09-20 22:43:23,711 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-09-20 22:43:23,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 22:43:23,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 18 conjunts are in the unsatisfiable core [2022-09-20 22:43:23,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 22:43:24,081 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-09-20 22:43:24,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 22:43:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-09-20 22:43:24,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346204229] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 22:43:24,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 22:43:24,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 37 [2022-09-20 22:43:24,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050938549] [2022-09-20 22:43:24,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 22:43:24,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-09-20 22:43:24,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:43:24,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-09-20 22:43:24,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1151, Unknown=0, NotChecked=0, Total=1332 [2022-09-20 22:43:24,469 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 350 [2022-09-20 22:43:24,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 687 transitions, 5877 flow. Second operand has 37 states, 37 states have (on average 241.43243243243242) internal successors, (8933), 37 states have internal predecessors, (8933), 0 states have call successors, (0), 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-09-20 22:43:24,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:43:24,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 350 [2022-09-20 22:43:24,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:43:39,964 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([821] L50-2-->L51: Formula: (and (< |v_thread1Thread1of1ForFork1_~i~0#1_5| v_~n1~0_3) (< |v_thread1Thread1of1ForFork1_~i~0#1_5| v_~n2~0_3)) InVars {~n2~0=v_~n2~0_3, ~n1~0=v_~n1~0_3, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|} OutVars{~n2~0=v_~n2~0_3, ~n1~0=v_~n1~0_3, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|} AuxVars[] AssignedVars[][563], [Black: 10029#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= 2 ~n1~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10056#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10038#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n1~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0)), Black: 10102#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res2~0 ~res1~0) ~res3~0) (<= 2 ~n1~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 10064#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n1~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (= |thread1Thread1of1ForFork1_#t~post6#1| 0) (<= 2 ~n1~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), 32#L78-3true, Black: 10098#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res2~0 ~res1~0) ~res3~0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10013#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) (<= 2 ~n1~0)), Black: 10049#(and (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res2~0 ~res1~0) ~res3~0) (<= (+ ~res2~0 ~n3~0) ~n2~0)), Black: 10082#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res2~0 ~res1~0) ~res3~0) (<= 2 ~n1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10094#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n1~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res2~0 ~res1~0) ~res3~0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10058#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= 2 ~n1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10100#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res2~0 ~res1~0) ~res3~0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 10034#(and (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0)), Black: 10096#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10078#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (= |thread1Thread1of1ForFork1_#t~post6#1| 0) (<= 2 ~n1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10084#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n1~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (= |thread1Thread1of1ForFork1_#t~post6#1| 0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10053#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n1~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res2~0 ~res1~0) ~res3~0) (<= (+ ~res2~0 ~n3~0) ~n2~0)), Black: 10088#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n1~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 9111#(<= (+ ~res2~0 ~n3~0) ~n2~0), Black: 10062#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= 2 ~n1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10041#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= 2 ~n1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10043#(and (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), 46#L102-4true, Black: 7684#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~res1~0 0)), Black: 7761#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 8424#(<= (+ ~res1~0 ~n2~0) ~n1~0), Black: 6296#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 5006#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (< |thread1Thread1of1ForFork1_~i~0#1| ~n1~0) (< |thread1Thread1of1ForFork1_~i~0#1| ~n2~0)), Black: 7767#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 8600#(and (<= (+ ~res1~0 ~n2~0) (+ ~res3~0 ~n3~0)) (<= (+ ~res1~0 ~n2~0) ~n1~0) (<= (+ ~res2~0 ~res1~0) ~res3~0)), Black: 7753#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7741#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7717#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) ~n2~0) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7757#(and (<= ~res2~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~res1~0 0)), Black: 7773#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7775#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7650#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) (+ ~n2~0 1)) (= |ULTIMATE.start_create_fresh_int_array_#t~post35#1| 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7652#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7723#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7731#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) ~n2~0) (<= ~n1~0 1) (or (<= ~n2~0 1) (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), 1493#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), Black: 7739#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post35#1| 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 7644#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) ~n2~0) (<= ~res2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) (+ ~n2~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7747#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= ~res2~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 7719#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= ~res2~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0)), Black: 7733#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7759#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= ~res2~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 7783#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 2614#(and (<= 1 ~n1~0) (<= 1 ~n3~0) (< |thread3Thread1of1ForFork0_~i~2#1| ~n1~0) (< |thread3Thread1of1ForFork0_~i~2#1| ~n3~0)), 335#true, 198#L51true, Black: 7670#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 238#L66-9true, Black: 7789#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7614#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= ~n2~0 1) (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~res2~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), 340#(<= ~n1~0 (+ ~res3~0 ~n3~0)), Black: 7763#(and (<= ~res2~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1)))), Black: 7725#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post35#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 3408#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))), Black: 7668#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post35#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7765#(and (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~res1~0 0)), Black: 7686#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), 361#(<= (+ ~res1~0 ~n2~0) ~n1~0), Black: 7642#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) (+ ~n2~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7791#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= ~res2~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0)), 1523#(and (<= 1 ~n1~0) (<= 1 ~n3~0)), Black: 7640#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7779#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7618#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post35#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res1~0 0)), 10069#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n1~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= 2 ~n1~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), 11615#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~res3~0) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2 ~n1~0) (<= ~n3~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 346#(and (<= (+ ~res1~0 ~n2~0) (+ ~res3~0 ~n3~0)) (<= ~n1~0 (+ ~res3~0 ~n3~0))), 6282#(and (<= 1 ~n2~0) (<= 1 ~n3~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~n3~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~n2~0)), Black: 348#(and (<= (+ ~res1~0 ~n2~0) (+ ~res3~0 ~n3~0)) (<= ~n1~0 (+ ~res3~0 ~n3~0)) (<= (+ ~res2~0 ~res1~0) ~res3~0)), 8598#(and (<= (+ ~res1~0 ~n2~0) (+ ~res3~0 ~n3~0)) (<= (+ ~res1~0 ~n2~0) ~n1~0)), 7228#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))), Black: 370#(and (or (<= ~res2~0 0) (not (<= ~res3~0 0)) (<= ~res1~0 0)) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res1~0 ~n2~0) ~n1~0)), Black: 10051#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n1~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10080#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n1~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (= |thread1Thread1of1ForFork1_#t~post6#1| 0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10086#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n1~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 367#(and (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res1~0 ~n2~0) ~n1~0)), Black: 10092#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n1~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (= |thread1Thread1of1ForFork1_#t~post6#1| 0) (<= (+ ~res2~0 ~res1~0) ~res3~0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10067#(and (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res2~0 ~res1~0) ~res3~0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10090#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (= |thread1Thread1of1ForFork1_#t~post6#1| 0) (<= (+ ~res2~0 ~res1~0) ~res3~0) (<= 2 ~n1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10074#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n1~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res2~0 ~res1~0) ~res3~0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10045#(and (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0)))]) [2022-09-20 22:43:39,964 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-09-20 22:43:39,964 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-09-20 22:43:39,964 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-09-20 22:43:39,964 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-09-20 22:43:41,413 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([821] L50-2-->L51: Formula: (and (< |v_thread1Thread1of1ForFork1_~i~0#1_5| v_~n1~0_3) (< |v_thread1Thread1of1ForFork1_~i~0#1_5| v_~n2~0_3)) InVars {~n2~0=v_~n2~0_3, ~n1~0=v_~n1~0_3, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|} OutVars{~n2~0=v_~n2~0_3, ~n1~0=v_~n1~0_3, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|} AuxVars[] AssignedVars[][515], [Black: 10029#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= 2 ~n1~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10056#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10038#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n1~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0)), Black: 10102#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res2~0 ~res1~0) ~res3~0) (<= 2 ~n1~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 10064#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n1~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (= |thread1Thread1of1ForFork1_#t~post6#1| 0) (<= 2 ~n1~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), 32#L78-3true, Black: 10098#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res2~0 ~res1~0) ~res3~0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10013#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) (<= 2 ~n1~0)), Black: 10049#(and (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res2~0 ~res1~0) ~res3~0) (<= (+ ~res2~0 ~n3~0) ~n2~0)), Black: 10082#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res2~0 ~res1~0) ~res3~0) (<= 2 ~n1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10094#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n1~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res2~0 ~res1~0) ~res3~0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10058#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= 2 ~n1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10100#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res2~0 ~res1~0) ~res3~0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 10034#(and (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0)), Black: 10096#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10078#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (= |thread1Thread1of1ForFork1_#t~post6#1| 0) (<= 2 ~n1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10084#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n1~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (= |thread1Thread1of1ForFork1_#t~post6#1| 0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10053#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n1~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res2~0 ~res1~0) ~res3~0) (<= (+ ~res2~0 ~n3~0) ~n2~0)), Black: 10088#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n1~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 9111#(<= (+ ~res2~0 ~n3~0) ~n2~0), Black: 10062#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= 2 ~n1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10041#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= 2 ~n1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10043#(and (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), 46#L102-4true, Black: 7684#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~res1~0 0)), Black: 7761#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 6296#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 8424#(<= (+ ~res1~0 ~n2~0) ~n1~0), Black: 7767#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), 5006#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (< |thread1Thread1of1ForFork1_~i~0#1| ~n1~0) (< |thread1Thread1of1ForFork1_~i~0#1| ~n2~0)), Black: 8600#(and (<= (+ ~res1~0 ~n2~0) (+ ~res3~0 ~n3~0)) (<= (+ ~res1~0 ~n2~0) ~n1~0) (<= (+ ~res2~0 ~res1~0) ~res3~0)), Black: 7753#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7741#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7717#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) ~n2~0) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7757#(and (<= ~res2~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~res1~0 0)), Black: 7773#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7775#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7650#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) (+ ~n2~0 1)) (= |ULTIMATE.start_create_fresh_int_array_#t~post35#1| 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7652#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7723#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 1493#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), Black: 7731#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) ~n2~0) (<= ~n1~0 1) (or (<= ~n2~0 1) (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 7739#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post35#1| 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 7644#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) ~n2~0) (<= ~res2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) (+ ~n2~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7747#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= ~res2~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 7719#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~n1~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7781#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= ~res2~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0)), Black: 7733#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7759#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= ~res2~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 7783#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 2614#(and (<= 1 ~n1~0) (<= 1 ~n3~0) (< |thread3Thread1of1ForFork0_~i~2#1| ~n1~0) (< |thread3Thread1of1ForFork0_~i~2#1| ~n3~0)), 335#true, Black: 7670#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 198#L51true, Black: 7789#(and (<= 1 ~n3~0) (<= ~n2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 238#L66-9true, 340#(<= ~n1~0 (+ ~res3~0 ~n3~0)), Black: 7614#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= ~n2~0 1) (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~res2~0 0) (<= ~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: 7763#(and (<= ~res2~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1)))), Black: 7725#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post35#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 3408#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))), Black: 7668#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post35#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7765#(and (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~res1~0 0)), Black: 7686#(and (<= ~n2~0 1) (<= ~res2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), 361#(<= (+ ~res1~0 ~n2~0) ~n1~0), Black: 7642#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= ~res2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) (+ ~n2~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7791#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 1) (<= ~res2~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))) (<= ~n1~0 ~n2~0)), 1523#(and (<= 1 ~n1~0) (<= 1 ~n3~0)), Black: 7640#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7779#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 ~n3~0) (<= ~n2~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (+ ~n2~0 1)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), Black: 7618#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post35#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res1~0 0)), 10069#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n1~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= 2 ~n1~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), 11611#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2 ~n1~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 346#(and (<= (+ ~res1~0 ~n2~0) (+ ~res3~0 ~n3~0)) (<= ~n1~0 (+ ~res3~0 ~n3~0))), 6282#(and (<= 1 ~n2~0) (<= 1 ~n3~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~n3~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~n2~0)), Black: 348#(and (<= (+ ~res1~0 ~n2~0) (+ ~res3~0 ~n3~0)) (<= ~n1~0 (+ ~res3~0 ~n3~0)) (<= (+ ~res2~0 ~res1~0) ~res3~0)), 8598#(and (<= (+ ~res1~0 ~n2~0) (+ ~res3~0 ~n3~0)) (<= (+ ~res1~0 ~n2~0) ~n1~0)), 7228#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))), Black: 10051#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n1~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 370#(and (or (<= ~res2~0 0) (not (<= ~res3~0 0)) (<= ~res1~0 0)) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res1~0 ~n2~0) ~n1~0)), Black: 10080#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n1~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (= |thread1Thread1of1ForFork1_#t~post6#1| 0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10086#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n1~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 367#(and (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res1~0 ~n2~0) ~n1~0)), Black: 10092#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n1~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (= |thread1Thread1of1ForFork1_#t~post6#1| 0) (<= (+ ~res2~0 ~res1~0) ~res3~0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10067#(and (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res2~0 ~res1~0) ~res3~0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10090#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0)) (<= 2 ~n2~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (= |thread1Thread1of1ForFork1_#t~post6#1| 0) (<= (+ ~res2~0 ~res1~0) ~res3~0) (<= 2 ~n1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10074#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~n1~0) (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= (+ ~res2~0 ~res1~0) ~res3~0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0))), Black: 10045#(and (<= (+ ~res2~0 ~res1~0 ~n3~0) ~n1~0) (<= 2 ~n1~0) (<= (+ ~res2~0 ~n3~0) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n1~0)))]) [2022-09-20 22:43:41,414 INFO L383 tUnfolder$Statistics]: this new event has 229 ancestors and is cut-off event [2022-09-20 22:43:41,414 INFO L386 tUnfolder$Statistics]: existing Event has 229 ancestors and is cut-off event [2022-09-20 22:43:41,414 INFO L386 tUnfolder$Statistics]: existing Event has 229 ancestors and is cut-off event [2022-09-20 22:43:41,414 INFO L386 tUnfolder$Statistics]: existing Event has 229 ancestors and is cut-off event