./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 91d7b70e505e7aef19ce206c76dac3b8838d1608e22286f0e4e4335d9f63c057 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:32:32,840 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:32:32,875 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:32:32,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:32:32,878 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:32:32,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:32:32,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:32:32,893 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:32:32,894 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:32:32,894 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:32:32,894 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:32:32,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:32:32,895 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:32:32,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:32:32,895 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:32:32,896 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:32:32,896 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:32:32,896 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:32:32,896 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:32:32,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:32:32,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:32:32,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:32:32,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:32:32,898 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:32:32,898 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:32:32,898 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:32:32,899 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:32:32,899 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:32:32,899 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:32:32,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:32:32,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:32:32,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:32:32,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:32:32,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:32:32,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:32:32,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:32:32,901 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:32:32,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:32:32,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:32:32,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:32:32,902 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:32:32,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:32:32,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:32:32,903 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 91d7b70e505e7aef19ce206c76dac3b8838d1608e22286f0e4e4335d9f63c057 [2024-06-27 17:32:33,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:32:33,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:32:33,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:32:33,194 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:32:33,194 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:32:33,195 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c [2024-06-27 17:32:34,341 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:32:34,517 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:32:34,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c [2024-06-27 17:32:34,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1723e753c/aad3349f487a4ff3985c1c4eb94a7afc/FLAG8516c1f6e [2024-06-27 17:32:34,545 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1723e753c/aad3349f487a4ff3985c1c4eb94a7afc [2024-06-27 17:32:34,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:32:34,549 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:32:34,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:32:34,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:32:34,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:32:34,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:32:34" (1/1) ... [2024-06-27 17:32:34,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@200675b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:34, skipping insertion in model container [2024-06-27 17:32:34,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:32:34" (1/1) ... [2024-06-27 17:32:34,581 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:32:34,762 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c[2800,2813] [2024-06-27 17:32:34,779 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:32:34,788 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:32:34,819 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c[2800,2813] [2024-06-27 17:32:34,825 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:32:34,841 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:32:34,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:34 WrapperNode [2024-06-27 17:32:34,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:32:34,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:32:34,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:32:34,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:32:34,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:34" (1/1) ... [2024-06-27 17:32:34,862 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:34" (1/1) ... [2024-06-27 17:32:34,893 INFO L138 Inliner]: procedures = 24, calls = 36, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 194 [2024-06-27 17:32:34,894 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:32:34,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:32:34,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:32:34,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:32:34,903 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:34" (1/1) ... [2024-06-27 17:32:34,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:34" (1/1) ... [2024-06-27 17:32:34,918 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:34" (1/1) ... [2024-06-27 17:32:34,937 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-06-27 17:32:34,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:34" (1/1) ... [2024-06-27 17:32:34,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:34" (1/1) ... [2024-06-27 17:32:34,951 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:34" (1/1) ... [2024-06-27 17:32:34,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:34" (1/1) ... [2024-06-27 17:32:34,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:34" (1/1) ... [2024-06-27 17:32:34,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:34" (1/1) ... [2024-06-27 17:32:34,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:32:34,975 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:32:34,976 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:32:34,976 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:32:34,976 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:34" (1/1) ... [2024-06-27 17:32:34,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:32:34,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:32:35,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 17:32:35,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 17:32:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:32:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 17:32:35,077 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 17:32:35,077 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 17:32:35,077 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 17:32:35,077 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-27 17:32:35,077 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-27 17:32:35,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:32:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 17:32:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 17:32:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 17:32:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 17:32:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 17:32:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 17:32:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:32:35,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:32:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 17:32:35,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 17:32:35,082 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:32:35,189 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:32:35,190 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:32:35,458 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:32:35,458 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:32:35,724 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:32:35,725 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-27 17:32:35,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:32:35 BoogieIcfgContainer [2024-06-27 17:32:35,725 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:32:35,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:32:35,727 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:32:35,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:32:35,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:32:34" (1/3) ... [2024-06-27 17:32:35,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c5056f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:32:35, skipping insertion in model container [2024-06-27 17:32:35,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:34" (2/3) ... [2024-06-27 17:32:35,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c5056f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:32:35, skipping insertion in model container [2024-06-27 17:32:35,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:32:35" (3/3) ... [2024-06-27 17:32:35,731 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt.wvr.c [2024-06-27 17:32:35,737 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:32:35,745 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:32:35,745 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 17:32:35,745 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:32:35,793 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-06-27 17:32:35,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 93 flow [2024-06-27 17:32:35,855 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2024-06-27 17:32:35,855 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 17:32:35,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 33 events. 4/33 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2024-06-27 17:32:35,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 36 transitions, 93 flow [2024-06-27 17:32:35,862 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 32 transitions, 82 flow [2024-06-27 17:32:35,876 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:32:35,891 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@2fdbc818, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:32:35,891 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-27 17:32:35,900 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:32:35,900 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2024-06-27 17:32:35,900 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 17:32:35,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:32:35,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:32:35,901 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)] === [2024-06-27 17:32:35,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:32:35,905 INFO L85 PathProgramCache]: Analyzing trace with hash 869360933, now seen corresponding path program 1 times [2024-06-27 17:32:35,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:32:35,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313365628] [2024-06-27 17:32:35,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:32:35,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:32:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:32:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:32:36,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:32:36,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313365628] [2024-06-27 17:32:36,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313365628] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:32:36,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:32:36,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:32:36,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282014332] [2024-06-27 17:32:36,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:32:36,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:32:36,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:32:36,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:32:36,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:32:36,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 17:32:36,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:36,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:32:36,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 17:32:36,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:32:36,920 INFO L124 PetriNetUnfolderBase]: 1210/1831 cut-off events. [2024-06-27 17:32:36,920 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2024-06-27 17:32:36,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3724 conditions, 1831 events. 1210/1831 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8548 event pairs, 308 based on Foata normal form. 1/1823 useless extension candidates. Maximal degree in co-relation 3364. Up to 1239 conditions per place. [2024-06-27 17:32:36,937 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 43 selfloop transitions, 6 changer transitions 1/54 dead transitions. [2024-06-27 17:32:36,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 241 flow [2024-06-27 17:32:36,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:32:36,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:32:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2024-06-27 17:32:36,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5486111111111112 [2024-06-27 17:32:36,952 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 82 flow. Second operand 4 states and 79 transitions. [2024-06-27 17:32:36,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 241 flow [2024-06-27 17:32:36,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 54 transitions, 219 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 17:32:36,960 INFO L231 Difference]: Finished difference. Result has 37 places, 37 transitions, 112 flow [2024-06-27 17:32:36,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=37, PETRI_TRANSITIONS=37} [2024-06-27 17:32:36,965 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2024-06-27 17:32:36,966 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 37 transitions, 112 flow [2024-06-27 17:32:36,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:36,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:32:36,966 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] [2024-06-27 17:32:36,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:32:36,967 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)] === [2024-06-27 17:32:36,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:32:36,968 INFO L85 PathProgramCache]: Analyzing trace with hash -84376906, now seen corresponding path program 1 times [2024-06-27 17:32:36,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:32:36,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744059110] [2024-06-27 17:32:36,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:32:36,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:32:36,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:32:37,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:32:37,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:32:37,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744059110] [2024-06-27 17:32:37,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744059110] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:32:37,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:32:37,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:32:37,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325677348] [2024-06-27 17:32:37,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:32:37,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:32:37,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:32:37,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:32:37,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:32:37,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 17:32:37,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:37,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:32:37,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 17:32:37,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:32:37,379 INFO L124 PetriNetUnfolderBase]: 1772/2859 cut-off events. [2024-06-27 17:32:37,379 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-06-27 17:32:37,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5720 conditions, 2859 events. 1772/2859 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 15902 event pairs, 1073 based on Foata normal form. 0/2717 useless extension candidates. Maximal degree in co-relation 3817. Up to 1631 conditions per place. [2024-06-27 17:32:37,401 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 56 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2024-06-27 17:32:37,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 70 transitions, 310 flow [2024-06-27 17:32:37,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:32:37,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:32:37,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-06-27 17:32:37,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5944444444444444 [2024-06-27 17:32:37,404 INFO L175 Difference]: Start difference. First operand has 37 places, 37 transitions, 112 flow. Second operand 5 states and 107 transitions. [2024-06-27 17:32:37,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 70 transitions, 310 flow [2024-06-27 17:32:37,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 70 transitions, 304 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 17:32:37,407 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 131 flow [2024-06-27 17:32:37,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2024-06-27 17:32:37,408 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2024-06-27 17:32:37,408 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 131 flow [2024-06-27 17:32:37,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:37,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:32:37,409 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] [2024-06-27 17:32:37,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:32:37,409 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)] === [2024-06-27 17:32:37,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:32:37,410 INFO L85 PathProgramCache]: Analyzing trace with hash 2067289702, now seen corresponding path program 1 times [2024-06-27 17:32:37,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:32:37,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652482954] [2024-06-27 17:32:37,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:32:37,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:32:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:32:37,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:32:37,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:32:37,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652482954] [2024-06-27 17:32:37,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652482954] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:32:37,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:32:37,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:32:37,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182934687] [2024-06-27 17:32:37,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:32:37,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:32:37,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:32:37,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:32:37,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:32:37,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 17:32:37,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:37,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:32:37,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 17:32:37,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:32:37,737 INFO L124 PetriNetUnfolderBase]: 1478/2414 cut-off events. [2024-06-27 17:32:37,737 INFO L125 PetriNetUnfolderBase]: For 554/658 co-relation queries the response was YES. [2024-06-27 17:32:37,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5200 conditions, 2414 events. 1478/2414 cut-off events. For 554/658 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12930 event pairs, 1040 based on Foata normal form. 0/2290 useless extension candidates. Maximal degree in co-relation 3971. Up to 1623 conditions per place. [2024-06-27 17:32:37,750 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 51 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2024-06-27 17:32:37,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 65 transitions, 313 flow [2024-06-27 17:32:37,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:32:37,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:32:37,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2024-06-27 17:32:37,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2024-06-27 17:32:37,752 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 131 flow. Second operand 5 states and 102 transitions. [2024-06-27 17:32:37,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 65 transitions, 313 flow [2024-06-27 17:32:37,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 65 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:32:37,754 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 151 flow [2024-06-27 17:32:37,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2024-06-27 17:32:37,755 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2024-06-27 17:32:37,755 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 151 flow [2024-06-27 17:32:37,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:37,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:32:37,756 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] [2024-06-27 17:32:37,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:32:37,756 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)] === [2024-06-27 17:32:37,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:32:37,757 INFO L85 PathProgramCache]: Analyzing trace with hash -677159742, now seen corresponding path program 1 times [2024-06-27 17:32:37,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:32:37,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138500384] [2024-06-27 17:32:37,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:32:37,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:32:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:32:37,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:32:37,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:32:37,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138500384] [2024-06-27 17:32:37,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138500384] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:32:37,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:32:37,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:32:37,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339475434] [2024-06-27 17:32:37,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:32:37,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:32:37,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:32:37,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:32:37,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:32:37,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 17:32:37,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:37,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:32:37,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 17:32:37,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:32:38,021 INFO L124 PetriNetUnfolderBase]: 1274/1967 cut-off events. [2024-06-27 17:32:38,021 INFO L125 PetriNetUnfolderBase]: For 753/955 co-relation queries the response was YES. [2024-06-27 17:32:38,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4658 conditions, 1967 events. 1274/1967 cut-off events. For 753/955 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9562 event pairs, 936 based on Foata normal form. 0/1839 useless extension candidates. Maximal degree in co-relation 3980. Up to 1604 conditions per place. [2024-06-27 17:32:38,032 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 25 selfloop transitions, 2 changer transitions 23/59 dead transitions. [2024-06-27 17:32:38,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 311 flow [2024-06-27 17:32:38,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:32:38,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:32:38,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-06-27 17:32:38,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-06-27 17:32:38,034 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 151 flow. Second operand 5 states and 96 transitions. [2024-06-27 17:32:38,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 311 flow [2024-06-27 17:32:38,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 306 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:32:38,037 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 122 flow [2024-06-27 17:32:38,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2024-06-27 17:32:38,037 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2024-06-27 17:32:38,038 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 122 flow [2024-06-27 17:32:38,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:38,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:32:38,038 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] [2024-06-27 17:32:38,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 17:32:38,039 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)] === [2024-06-27 17:32:38,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:32:38,039 INFO L85 PathProgramCache]: Analyzing trace with hash 864869867, now seen corresponding path program 1 times [2024-06-27 17:32:38,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:32:38,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618958916] [2024-06-27 17:32:38,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:32:38,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:32:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:32:38,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:38,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:32:38,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618958916] [2024-06-27 17:32:38,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618958916] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:32:38,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888091801] [2024-06-27 17:32:38,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:32:38,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:32:38,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:32:38,141 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) [2024-06-27 17:32:38,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-27 17:32:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:32:38,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 17:32:38,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:32:38,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:38,323 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:32:38,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:38,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888091801] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 17:32:38,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:32:38,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2024-06-27 17:32:38,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853814862] [2024-06-27 17:32:38,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:32:38,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 17:32:38,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:32:38,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 17:32:38,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-06-27 17:32:38,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-06-27 17:32:38,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 122 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:38,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:32:38,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-06-27 17:32:38,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:32:38,731 INFO L124 PetriNetUnfolderBase]: 1963/3045 cut-off events. [2024-06-27 17:32:38,732 INFO L125 PetriNetUnfolderBase]: For 839/1009 co-relation queries the response was YES. [2024-06-27 17:32:38,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7397 conditions, 3045 events. 1963/3045 cut-off events. For 839/1009 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 16526 event pairs, 387 based on Foata normal form. 0/2702 useless extension candidates. Maximal degree in co-relation 7378. Up to 773 conditions per place. [2024-06-27 17:32:38,752 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 76 selfloop transitions, 15 changer transitions 0/99 dead transitions. [2024-06-27 17:32:38,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 99 transitions, 491 flow [2024-06-27 17:32:38,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 17:32:38,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 17:32:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-27 17:32:38,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061728395061729 [2024-06-27 17:32:38,754 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 122 flow. Second operand 9 states and 164 transitions. [2024-06-27 17:32:38,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 99 transitions, 491 flow [2024-06-27 17:32:38,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 99 transitions, 421 flow, removed 33 selfloop flow, removed 8 redundant places. [2024-06-27 17:32:38,765 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 184 flow [2024-06-27 17:32:38,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=184, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2024-06-27 17:32:38,811 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2024-06-27 17:32:38,811 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 184 flow [2024-06-27 17:32:38,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:38,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:32:38,811 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] [2024-06-27 17:32:38,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-27 17:32:39,020 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 [2024-06-27 17:32:39,021 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)] === [2024-06-27 17:32:39,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:32:39,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1843011933, now seen corresponding path program 2 times [2024-06-27 17:32:39,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:32:39,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433699906] [2024-06-27 17:32:39,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:32:39,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:32:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:32:39,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:39,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:32:39,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433699906] [2024-06-27 17:32:39,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433699906] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:32:39,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80791318] [2024-06-27 17:32:39,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:32:39,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:32:39,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:32:39,114 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) [2024-06-27 17:32:39,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-06-27 17:32:39,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:32:39,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:32:39,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 17:32:39,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:32:39,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:39,272 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:32:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:39,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80791318] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 17:32:39,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:32:39,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2024-06-27 17:32:39,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485711507] [2024-06-27 17:32:39,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:32:39,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 17:32:39,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:32:39,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 17:32:39,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-06-27 17:32:39,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-06-27 17:32:39,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 184 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:39,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:32:39,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-06-27 17:32:39,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:32:39,756 INFO L124 PetriNetUnfolderBase]: 2336/3602 cut-off events. [2024-06-27 17:32:39,756 INFO L125 PetriNetUnfolderBase]: For 1874/1874 co-relation queries the response was YES. [2024-06-27 17:32:39,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9108 conditions, 3602 events. 2336/3602 cut-off events. For 1874/1874 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 19232 event pairs, 364 based on Foata normal form. 16/3589 useless extension candidates. Maximal degree in co-relation 9085. Up to 879 conditions per place. [2024-06-27 17:32:39,776 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 76 selfloop transitions, 28 changer transitions 0/112 dead transitions. [2024-06-27 17:32:39,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 112 transitions, 605 flow [2024-06-27 17:32:39,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 17:32:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 17:32:39,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-27 17:32:39,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845679012345679 [2024-06-27 17:32:39,777 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 184 flow. Second operand 9 states and 157 transitions. [2024-06-27 17:32:39,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 112 transitions, 605 flow [2024-06-27 17:32:39,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 112 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:32:39,792 INFO L231 Difference]: Finished difference. Result has 60 places, 65 transitions, 391 flow [2024-06-27 17:32:39,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=391, PETRI_PLACES=60, PETRI_TRANSITIONS=65} [2024-06-27 17:32:39,795 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 22 predicate places. [2024-06-27 17:32:39,795 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 65 transitions, 391 flow [2024-06-27 17:32:39,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:39,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:32:39,795 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] [2024-06-27 17:32:39,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-06-27 17:32:40,007 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 [2024-06-27 17:32:40,007 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)] === [2024-06-27 17:32:40,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:32:40,008 INFO L85 PathProgramCache]: Analyzing trace with hash 67970723, now seen corresponding path program 3 times [2024-06-27 17:32:40,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:32:40,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108597850] [2024-06-27 17:32:40,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:32:40,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:32:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:32:40,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:40,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:32:40,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108597850] [2024-06-27 17:32:40,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108597850] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:32:40,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909152246] [2024-06-27 17:32:40,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 17:32:40,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:32:40,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:32:40,108 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) [2024-06-27 17:32:40,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-06-27 17:32:40,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 17:32:40,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:32:40,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 17:32:40,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:32:40,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:40,256 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:32:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:40,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909152246] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 17:32:40,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:32:40,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2024-06-27 17:32:40,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930920617] [2024-06-27 17:32:40,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:32:40,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 17:32:40,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:32:40,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 17:32:40,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-06-27 17:32:40,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-06-27 17:32:40,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 65 transitions, 391 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:40,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:32:40,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-06-27 17:32:40,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:32:40,798 INFO L124 PetriNetUnfolderBase]: 2959/4563 cut-off events. [2024-06-27 17:32:40,798 INFO L125 PetriNetUnfolderBase]: For 7927/7931 co-relation queries the response was YES. [2024-06-27 17:32:40,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14799 conditions, 4563 events. 2959/4563 cut-off events. For 7927/7931 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 25378 event pairs, 636 based on Foata normal form. 18/4551 useless extension candidates. Maximal degree in co-relation 14769. Up to 1384 conditions per place. [2024-06-27 17:32:40,825 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 86 selfloop transitions, 46 changer transitions 0/140 dead transitions. [2024-06-27 17:32:40,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 140 transitions, 994 flow [2024-06-27 17:32:40,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 17:32:40,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 17:32:40,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-27 17:32:40,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-06-27 17:32:40,827 INFO L175 Difference]: Start difference. First operand has 60 places, 65 transitions, 391 flow. Second operand 9 states and 171 transitions. [2024-06-27 17:32:40,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 140 transitions, 994 flow [2024-06-27 17:32:40,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 140 transitions, 969 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-06-27 17:32:40,888 INFO L231 Difference]: Finished difference. Result has 71 places, 85 transitions, 720 flow [2024-06-27 17:32:40,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=720, PETRI_PLACES=71, PETRI_TRANSITIONS=85} [2024-06-27 17:32:40,889 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 33 predicate places. [2024-06-27 17:32:40,889 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 85 transitions, 720 flow [2024-06-27 17:32:40,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:40,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:32:40,889 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] [2024-06-27 17:32:40,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-06-27 17:32:41,101 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 [2024-06-27 17:32:41,102 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)] === [2024-06-27 17:32:41,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:32:41,102 INFO L85 PathProgramCache]: Analyzing trace with hash -285916323, now seen corresponding path program 4 times [2024-06-27 17:32:41,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:32:41,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612349041] [2024-06-27 17:32:41,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:32:41,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:32:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:32:41,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:41,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:32:41,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612349041] [2024-06-27 17:32:41,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612349041] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:32:41,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42202400] [2024-06-27 17:32:41,196 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 17:32:41,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:32:41,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:32:41,198 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) [2024-06-27 17:32:41,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-06-27 17:32:41,284 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 17:32:41,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:32:41,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:32:41,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:32:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:41,343 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:32:41,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:41,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42202400] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:32:41,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:32:41,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-06-27 17:32:41,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695503410] [2024-06-27 17:32:41,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:32:41,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-27 17:32:41,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:32:41,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-27 17:32:41,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-06-27 17:32:41,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 17:32:41,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 85 transitions, 720 flow. Second operand has 14 states, 14 states have (on average 9.571428571428571) internal successors, (134), 14 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:41,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:32:41,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 17:32:41,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:32:42,667 INFO L124 PetriNetUnfolderBase]: 5055/7768 cut-off events. [2024-06-27 17:32:42,667 INFO L125 PetriNetUnfolderBase]: For 27395/27466 co-relation queries the response was YES. [2024-06-27 17:32:42,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28229 conditions, 7768 events. 5055/7768 cut-off events. For 27395/27466 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 45328 event pairs, 343 based on Foata normal form. 38/7317 useless extension candidates. Maximal degree in co-relation 28193. Up to 1046 conditions per place. [2024-06-27 17:32:42,719 INFO L140 encePairwiseOnDemand]: 22/36 looper letters, 180 selfloop transitions, 149 changer transitions 0/336 dead transitions. [2024-06-27 17:32:42,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 336 transitions, 3041 flow [2024-06-27 17:32:42,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-06-27 17:32:42,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-06-27 17:32:42,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 425 transitions. [2024-06-27 17:32:42,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45405982905982906 [2024-06-27 17:32:42,721 INFO L175 Difference]: Start difference. First operand has 71 places, 85 transitions, 720 flow. Second operand 26 states and 425 transitions. [2024-06-27 17:32:42,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 336 transitions, 3041 flow [2024-06-27 17:32:42,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 336 transitions, 2896 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-06-27 17:32:42,861 INFO L231 Difference]: Finished difference. Result has 100 places, 193 transitions, 2076 flow [2024-06-27 17:32:42,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2076, PETRI_PLACES=100, PETRI_TRANSITIONS=193} [2024-06-27 17:32:42,862 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 62 predicate places. [2024-06-27 17:32:42,862 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 193 transitions, 2076 flow [2024-06-27 17:32:42,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.571428571428571) internal successors, (134), 14 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:42,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:32:42,862 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] [2024-06-27 17:32:42,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-06-27 17:32:43,075 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 [2024-06-27 17:32:43,076 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)] === [2024-06-27 17:32:43,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:32:43,076 INFO L85 PathProgramCache]: Analyzing trace with hash -463948317, now seen corresponding path program 5 times [2024-06-27 17:32:43,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:32:43,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176013948] [2024-06-27 17:32:43,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:32:43,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:32:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:32:43,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:43,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:32:43,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176013948] [2024-06-27 17:32:43,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176013948] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:32:43,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894100900] [2024-06-27 17:32:43,174 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 17:32:43,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:32:43,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:32:43,175 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) [2024-06-27 17:32:43,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-06-27 17:32:43,270 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:32:43,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:32:43,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:32:43,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:32:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:43,333 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:32:43,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:43,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894100900] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:32:43,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:32:43,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-06-27 17:32:43,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045518734] [2024-06-27 17:32:43,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:32:43,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-06-27 17:32:43,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:32:43,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-06-27 17:32:43,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-06-27 17:32:43,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 17:32:43,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 193 transitions, 2076 flow. Second operand has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 15 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:43,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:32:43,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 17:32:43,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:32:45,069 INFO L124 PetriNetUnfolderBase]: 6044/9231 cut-off events. [2024-06-27 17:32:45,069 INFO L125 PetriNetUnfolderBase]: For 41406/41544 co-relation queries the response was YES. [2024-06-27 17:32:45,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37801 conditions, 9231 events. 6044/9231 cut-off events. For 41406/41544 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 54973 event pairs, 595 based on Foata normal form. 126/9234 useless extension candidates. Maximal degree in co-relation 37755. Up to 1352 conditions per place. [2024-06-27 17:32:45,138 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 174 selfloop transitions, 225 changer transitions 0/406 dead transitions. [2024-06-27 17:32:45,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 406 transitions, 4206 flow [2024-06-27 17:32:45,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-06-27 17:32:45,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-06-27 17:32:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 369 transitions. [2024-06-27 17:32:45,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2024-06-27 17:32:45,141 INFO L175 Difference]: Start difference. First operand has 100 places, 193 transitions, 2076 flow. Second operand 22 states and 369 transitions. [2024-06-27 17:32:45,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 406 transitions, 4206 flow [2024-06-27 17:32:45,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 406 transitions, 4085 flow, removed 38 selfloop flow, removed 3 redundant places. [2024-06-27 17:32:45,474 INFO L231 Difference]: Finished difference. Result has 130 places, 308 transitions, 3759 flow [2024-06-27 17:32:45,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1973, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3759, PETRI_PLACES=130, PETRI_TRANSITIONS=308} [2024-06-27 17:32:45,476 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 92 predicate places. [2024-06-27 17:32:45,476 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 308 transitions, 3759 flow [2024-06-27 17:32:45,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 15 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:45,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:32:45,477 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] [2024-06-27 17:32:45,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-06-27 17:32:45,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:32:45,689 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)] === [2024-06-27 17:32:45,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:32:45,689 INFO L85 PathProgramCache]: Analyzing trace with hash -115958229, now seen corresponding path program 6 times [2024-06-27 17:32:45,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:32:45,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095685506] [2024-06-27 17:32:45,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:32:45,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:32:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:32:45,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:45,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:32:45,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095685506] [2024-06-27 17:32:45,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095685506] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:32:45,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189506147] [2024-06-27 17:32:45,803 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 17:32:45,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:32:45,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:32:45,804 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) [2024-06-27 17:32:45,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-06-27 17:32:45,874 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-06-27 17:32:45,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:32:45,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 17:32:45,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:32:45,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:45,932 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:32:45,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:45,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189506147] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 17:32:45,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:32:45,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 15 [2024-06-27 17:32:45,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894326327] [2024-06-27 17:32:45,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:32:45,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 17:32:45,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:32:45,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 17:32:45,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-06-27 17:32:46,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-06-27 17:32:46,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 308 transitions, 3759 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:46,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:32:46,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-06-27 17:32:46,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:32:47,066 INFO L124 PetriNetUnfolderBase]: 4996/7645 cut-off events. [2024-06-27 17:32:47,066 INFO L125 PetriNetUnfolderBase]: For 48906/49074 co-relation queries the response was YES. [2024-06-27 17:32:47,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35033 conditions, 7645 events. 4996/7645 cut-off events. For 48906/49074 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 45579 event pairs, 545 based on Foata normal form. 109/7633 useless extension candidates. Maximal degree in co-relation 34974. Up to 2394 conditions per place. [2024-06-27 17:32:47,295 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 185 selfloop transitions, 148 changer transitions 0/341 dead transitions. [2024-06-27 17:32:47,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 341 transitions, 4532 flow [2024-06-27 17:32:47,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 17:32:47,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 17:32:47,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-27 17:32:47,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2024-06-27 17:32:47,297 INFO L175 Difference]: Start difference. First operand has 130 places, 308 transitions, 3759 flow. Second operand 8 states and 145 transitions. [2024-06-27 17:32:47,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 341 transitions, 4532 flow [2024-06-27 17:32:47,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 341 transitions, 4365 flow, removed 68 selfloop flow, removed 4 redundant places. [2024-06-27 17:32:47,662 INFO L231 Difference]: Finished difference. Result has 134 places, 308 transitions, 3942 flow [2024-06-27 17:32:47,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3560, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3942, PETRI_PLACES=134, PETRI_TRANSITIONS=308} [2024-06-27 17:32:47,663 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 96 predicate places. [2024-06-27 17:32:47,663 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 308 transitions, 3942 flow [2024-06-27 17:32:47,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:47,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:32:47,664 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] [2024-06-27 17:32:47,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-06-27 17:32:47,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:32:47,878 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)] === [2024-06-27 17:32:47,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:32:47,878 INFO L85 PathProgramCache]: Analyzing trace with hash 76190665, now seen corresponding path program 1 times [2024-06-27 17:32:47,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:32:47,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840729553] [2024-06-27 17:32:47,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:32:47,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:32:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:32:47,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:47,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:32:47,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840729553] [2024-06-27 17:32:47,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840729553] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:32:47,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545028909] [2024-06-27 17:32:47,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:32:47,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:32:47,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:32:47,966 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) [2024-06-27 17:32:48,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-06-27 17:32:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:32:48,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:32:48,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:32:48,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:48,073 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:32:48,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:48,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545028909] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 17:32:48,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:32:48,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-06-27 17:32:48,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242191157] [2024-06-27 17:32:48,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:32:48,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:32:48,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:32:48,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:32:48,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:32:48,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 17:32:48,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 308 transitions, 3942 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:48,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:32:48,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 17:32:48,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:32:48,625 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L66-->L60-6: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_10| (+ |v_thread2Thread1of1ForFork0_~i~1#1_9| 1)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|} OutVars{thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_5|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_10|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post6#1][180], [Black: 566#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 564#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), 397#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 744#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 758#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 568#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 766#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 233#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 740#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 954#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 760#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 956#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 785#(<= 1 ~N~0), Black: 635#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 768#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 950#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 960#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 948#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 946#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 966#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 962#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 958#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 952#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 399#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1293#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 246#(<= 1 ~N~0), Black: 401#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 1138#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 8#L98-4true, 36#L48true, Black: 235#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 937#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 231#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 229#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 237#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 25#L60-6true, Black: 50#(and (= ~res2~0 ~res1~0) (or (= ~res1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0))) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 48#(= ~res2~0 ~res1~0), 35#L74true, 750#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 572#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 414#(<= 1 ~N~0)]) [2024-06-27 17:32:48,625 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-06-27 17:32:48,625 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-27 17:32:48,626 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-27 17:32:48,626 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 17:32:48,626 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([579] L79-->L73-6: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_10| (+ |v_thread3Thread1of1ForFork1_~i~2#1_9| 1)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_9|} OutVars{thread3Thread1of1ForFork1_#t~post9#1=|v_thread3Thread1of1ForFork1_#t~post9#1_1|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_5|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_10|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post9#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_~i~2#1][182], [Black: 566#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 395#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 744#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 758#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 766#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 740#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 750#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 954#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 760#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 956#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 785#(<= 1 ~N~0), Black: 635#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 768#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 950#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 960#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 948#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 733#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 946#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 966#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 962#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 937#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 958#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 952#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 397#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 399#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1293#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 246#(<= 1 ~N~0), Black: 401#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 944#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), 8#L98-4true, 16#L73-6true, 36#L48true, 1136#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 235#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 564#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 231#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 237#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 50#(and (= ~res2~0 ~res1~0) (or (= ~res1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0))) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 48#(= ~res2~0 ~res1~0), Black: 1138#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 28#L61true, Black: 572#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 414#(<= 1 ~N~0), Black: 568#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))]) [2024-06-27 17:32:48,627 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-06-27 17:32:48,627 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 17:32:48,627 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-27 17:32:48,627 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-27 17:32:48,786 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L66-->L60-6: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_10| (+ |v_thread2Thread1of1ForFork0_~i~1#1_9| 1)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|} OutVars{thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_5|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_10|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post6#1][180], [Black: 566#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 564#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), 397#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 744#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 758#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 568#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 766#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 233#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 740#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 954#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 760#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 956#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 785#(<= 1 ~N~0), Black: 635#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 768#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 950#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 960#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 948#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 946#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 966#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 962#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 958#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 952#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 399#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1293#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 246#(<= 1 ~N~0), Black: 401#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 1138#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 8#L98-4true, Black: 235#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 937#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 231#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 229#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 237#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 25#L60-6true, Black: 50#(and (= ~res2~0 ~res1~0) (or (= ~res1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0))) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 48#(= ~res2~0 ~res1~0), 35#L74true, 12#L50true, 750#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 572#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 414#(<= 1 ~N~0)]) [2024-06-27 17:32:48,787 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-06-27 17:32:48,787 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-27 17:32:48,787 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 17:32:48,787 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 17:32:48,788 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([579] L79-->L73-6: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_10| (+ |v_thread3Thread1of1ForFork1_~i~2#1_9| 1)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_9|} OutVars{thread3Thread1of1ForFork1_#t~post9#1=|v_thread3Thread1of1ForFork1_#t~post9#1_1|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_5|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_10|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post9#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_~i~2#1][182], [Black: 566#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 395#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 744#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 758#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 766#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 740#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 750#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 954#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 760#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 956#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 785#(<= 1 ~N~0), Black: 635#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 768#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 950#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 960#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 948#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 733#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 946#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 966#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 962#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 937#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 958#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 952#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 397#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 399#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1293#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 246#(<= 1 ~N~0), Black: 401#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 944#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), 8#L98-4true, 16#L73-6true, 1136#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 235#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 564#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 231#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 237#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 50#(and (= ~res2~0 ~res1~0) (or (= ~res1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0))) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 48#(= ~res2~0 ~res1~0), Black: 1138#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 12#L50true, 28#L61true, Black: 572#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 414#(<= 1 ~N~0), Black: 568#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))]) [2024-06-27 17:32:48,788 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-06-27 17:32:48,788 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 17:32:48,788 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-27 17:32:48,788 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 17:32:48,790 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L66-->L60-6: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_10| (+ |v_thread2Thread1of1ForFork0_~i~1#1_9| 1)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|} OutVars{thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_5|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_10|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post6#1][180], [Black: 566#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 564#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), 397#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 744#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 758#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 568#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 766#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 233#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 740#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 954#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 760#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 956#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 785#(<= 1 ~N~0), Black: 635#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 768#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 950#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 960#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 948#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 946#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 966#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 962#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 958#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 952#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 399#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1293#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 246#(<= 1 ~N~0), Black: 401#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 1138#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 36#L48true, Black: 235#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 937#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 231#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 229#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), 5#L99true, Black: 237#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 25#L60-6true, Black: 50#(and (= ~res2~0 ~res1~0) (or (= ~res1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0))) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 48#(= ~res2~0 ~res1~0), 35#L74true, 750#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 572#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 414#(<= 1 ~N~0)]) [2024-06-27 17:32:48,790 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-06-27 17:32:48,790 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 17:32:48,790 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 17:32:48,790 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-27 17:32:48,791 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([579] L79-->L73-6: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_10| (+ |v_thread3Thread1of1ForFork1_~i~2#1_9| 1)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_9|} OutVars{thread3Thread1of1ForFork1_#t~post9#1=|v_thread3Thread1of1ForFork1_#t~post9#1_1|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_5|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_10|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post9#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_~i~2#1][182], [Black: 566#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 395#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 744#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 758#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 766#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 740#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 750#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 954#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 760#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 956#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 785#(<= 1 ~N~0), Black: 635#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 768#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 950#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 960#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 948#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 733#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 946#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 966#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 962#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 937#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 958#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 952#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 397#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 399#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1293#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 246#(<= 1 ~N~0), Black: 401#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 944#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), 16#L73-6true, 36#L48true, 1136#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 235#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 564#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 231#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), 5#L99true, Black: 237#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 50#(and (= ~res2~0 ~res1~0) (or (= ~res1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0))) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 48#(= ~res2~0 ~res1~0), Black: 1138#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 28#L61true, Black: 572#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 414#(<= 1 ~N~0), Black: 568#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))]) [2024-06-27 17:32:48,791 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-06-27 17:32:48,791 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-27 17:32:48,791 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 17:32:48,791 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 17:32:48,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L66-->L60-6: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_10| (+ |v_thread2Thread1of1ForFork0_~i~1#1_9| 1)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|} OutVars{thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_5|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_10|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post6#1][180], [Black: 566#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 564#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), 397#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 744#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 568#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 758#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 766#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 233#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 740#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 954#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 760#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 956#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 785#(<= 1 ~N~0), Black: 635#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 768#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 950#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 960#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 948#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 946#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 966#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 962#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 958#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 952#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 399#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1293#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 246#(<= 1 ~N~0), Black: 401#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 1138#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 235#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 937#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 231#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 229#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), 5#L99true, Black: 237#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 25#L60-6true, Black: 50#(and (= ~res2~0 ~res1~0) (or (= ~res1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0))) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 48#(= ~res2~0 ~res1~0), 35#L74true, 12#L50true, 750#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 572#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 414#(<= 1 ~N~0)]) [2024-06-27 17:32:48,859 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-27 17:32:48,859 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 17:32:48,859 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 17:32:48,859 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 17:32:48,860 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([579] L79-->L73-6: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_10| (+ |v_thread3Thread1of1ForFork1_~i~2#1_9| 1)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_9|} OutVars{thread3Thread1of1ForFork1_#t~post9#1=|v_thread3Thread1of1ForFork1_#t~post9#1_1|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_5|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_10|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post9#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_~i~2#1][182], [Black: 566#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 395#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 744#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 758#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 766#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 740#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 750#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 954#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 760#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 956#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 785#(<= 1 ~N~0), Black: 635#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 768#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 950#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 960#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 948#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 733#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 946#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 966#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 962#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 937#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 958#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 952#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 397#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 399#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1293#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 246#(<= 1 ~N~0), Black: 401#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 944#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), 16#L73-6true, 1136#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 235#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 564#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 231#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), 5#L99true, Black: 237#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 50#(and (= ~res2~0 ~res1~0) (or (= ~res1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0))) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 48#(= ~res2~0 ~res1~0), Black: 1138#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 12#L50true, 28#L61true, Black: 572#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 414#(<= 1 ~N~0), Black: 568#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))]) [2024-06-27 17:32:48,860 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-27 17:32:48,860 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 17:32:48,860 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 17:32:48,860 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 17:32:49,198 INFO L124 PetriNetUnfolderBase]: 5543/8627 cut-off events. [2024-06-27 17:32:49,199 INFO L125 PetriNetUnfolderBase]: For 74820/75234 co-relation queries the response was YES. [2024-06-27 17:32:49,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41238 conditions, 8627 events. 5543/8627 cut-off events. For 74820/75234 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 53265 event pairs, 1534 based on Foata normal form. 577/8783 useless extension candidates. Maximal degree in co-relation 41179. Up to 3893 conditions per place. [2024-06-27 17:32:49,261 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 273 selfloop transitions, 43 changer transitions 0/387 dead transitions. [2024-06-27 17:32:49,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 387 transitions, 5734 flow [2024-06-27 17:32:49,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:32:49,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:32:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2024-06-27 17:32:49,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2024-06-27 17:32:49,262 INFO L175 Difference]: Start difference. First operand has 134 places, 308 transitions, 3942 flow. Second operand 5 states and 87 transitions. [2024-06-27 17:32:49,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 387 transitions, 5734 flow [2024-06-27 17:32:49,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 387 transitions, 5588 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 17:32:49,537 INFO L231 Difference]: Finished difference. Result has 136 places, 309 transitions, 4083 flow [2024-06-27 17:32:49,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3832, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4083, PETRI_PLACES=136, PETRI_TRANSITIONS=309} [2024-06-27 17:32:49,538 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 98 predicate places. [2024-06-27 17:32:49,538 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 309 transitions, 4083 flow [2024-06-27 17:32:49,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:49,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:32:49,539 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] [2024-06-27 17:32:49,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-06-27 17:32:49,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:32:49,751 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)] === [2024-06-27 17:32:49,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:32:49,752 INFO L85 PathProgramCache]: Analyzing trace with hash 418642818, now seen corresponding path program 1 times [2024-06-27 17:32:49,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:32:49,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056099509] [2024-06-27 17:32:49,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:32:49,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:32:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:32:50,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:32:50,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:32:50,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056099509] [2024-06-27 17:32:50,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056099509] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:32:50,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474482566] [2024-06-27 17:32:50,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:32:50,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:32:50,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:32:50,325 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) [2024-06-27 17:32:50,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-06-27 17:32:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:32:50,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 38 conjunts are in the unsatisfiable core [2024-06-27 17:32:50,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:32:50,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-06-27 17:32:50,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-06-27 17:32:50,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:32:50,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:32:51,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2024-06-27 17:32:51,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:32:51,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 62 [2024-06-27 17:32:51,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:32:51,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474482566] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:32:51,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:32:51,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2024-06-27 17:32:51,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338858958] [2024-06-27 17:32:51,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:32:51,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-06-27 17:32:51,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:32:51,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-06-27 17:32:51,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2024-06-27 17:32:51,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2024-06-27 17:32:51,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 309 transitions, 4083 flow. Second operand has 29 states, 29 states have (on average 8.068965517241379) internal successors, (234), 29 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:51,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:32:51,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2024-06-27 17:32:51,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:32:54,890 INFO L124 PetriNetUnfolderBase]: 11970/17369 cut-off events. [2024-06-27 17:32:54,891 INFO L125 PetriNetUnfolderBase]: For 103869/104137 co-relation queries the response was YES. [2024-06-27 17:32:54,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78482 conditions, 17369 events. 11970/17369 cut-off events. For 103869/104137 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 103287 event pairs, 1241 based on Foata normal form. 224/17573 useless extension candidates. Maximal degree in co-relation 76918. Up to 10186 conditions per place. [2024-06-27 17:32:55,006 INFO L140 encePairwiseOnDemand]: 21/36 looper letters, 826 selfloop transitions, 188 changer transitions 2/1047 dead transitions. [2024-06-27 17:32:55,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 1047 transitions, 14669 flow [2024-06-27 17:32:55,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-06-27 17:32:55,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-06-27 17:32:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 393 transitions. [2024-06-27 17:32:55,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4962121212121212 [2024-06-27 17:32:55,008 INFO L175 Difference]: Start difference. First operand has 136 places, 309 transitions, 4083 flow. Second operand 22 states and 393 transitions. [2024-06-27 17:32:55,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 1047 transitions, 14669 flow [2024-06-27 17:32:56,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 1047 transitions, 14572 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 17:32:56,091 INFO L231 Difference]: Finished difference. Result has 166 places, 496 transitions, 7131 flow [2024-06-27 17:32:56,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4039, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=7131, PETRI_PLACES=166, PETRI_TRANSITIONS=496} [2024-06-27 17:32:56,092 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 128 predicate places. [2024-06-27 17:32:56,093 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 496 transitions, 7131 flow [2024-06-27 17:32:56,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.068965517241379) internal successors, (234), 29 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:56,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:32:56,093 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] [2024-06-27 17:32:56,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-06-27 17:32:56,304 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,SelfDestructingSolverStorable11 [2024-06-27 17:32:56,304 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)] === [2024-06-27 17:32:56,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:32:56,305 INFO L85 PathProgramCache]: Analyzing trace with hash -280092252, now seen corresponding path program 2 times [2024-06-27 17:32:56,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:32:56,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637760562] [2024-06-27 17:32:56,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:32:56,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:32:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:32:56,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:32:56,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:32:56,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637760562] [2024-06-27 17:32:56,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637760562] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:32:56,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726003672] [2024-06-27 17:32:56,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:32:56,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:32:56,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:32:56,689 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) [2024-06-27 17:32:56,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-06-27 17:32:56,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:32:56,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:32:56,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 41 conjunts are in the unsatisfiable core [2024-06-27 17:32:56,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:32:56,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-06-27 17:32:57,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:32:57,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-06-27 17:32:57,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:32:57,178 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:32:57,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2024-06-27 17:32:57,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:32:57,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 62 [2024-06-27 17:32:57,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:32:57,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726003672] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:32:57,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:32:57,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 36 [2024-06-27 17:32:57,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461969391] [2024-06-27 17:32:57,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:32:57,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-06-27 17:32:57,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:32:57,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-06-27 17:32:57,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1169, Unknown=0, NotChecked=0, Total=1332 [2024-06-27 17:32:57,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2024-06-27 17:32:57,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 496 transitions, 7131 flow. Second operand has 37 states, 37 states have (on average 5.972972972972973) internal successors, (221), 37 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:57,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:32:57,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2024-06-27 17:32:57,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:33:07,597 INFO L124 PetriNetUnfolderBase]: 29791/41992 cut-off events. [2024-06-27 17:33:07,598 INFO L125 PetriNetUnfolderBase]: For 291722/291722 co-relation queries the response was YES. [2024-06-27 17:33:07,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213882 conditions, 41992 events. 29791/41992 cut-off events. For 291722/291722 co-relation queries the response was YES. Maximal size of possible extension queue 1237. Compared 253499 event pairs, 2488 based on Foata normal form. 3/41995 useless extension candidates. Maximal degree in co-relation 212141. Up to 19092 conditions per place. [2024-06-27 17:33:08,085 INFO L140 encePairwiseOnDemand]: 19/36 looper letters, 1282 selfloop transitions, 636 changer transitions 8/1927 dead transitions. [2024-06-27 17:33:08,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 1927 transitions, 28364 flow [2024-06-27 17:33:08,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-06-27 17:33:08,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2024-06-27 17:33:08,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 895 transitions. [2024-06-27 17:33:08,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3603059581320451 [2024-06-27 17:33:08,097 INFO L175 Difference]: Start difference. First operand has 166 places, 496 transitions, 7131 flow. Second operand 69 states and 895 transitions. [2024-06-27 17:33:08,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 1927 transitions, 28364 flow [2024-06-27 17:33:13,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 1927 transitions, 28132 flow, removed 115 selfloop flow, removed 1 redundant places. [2024-06-27 17:33:13,625 INFO L231 Difference]: Finished difference. Result has 282 places, 1064 transitions, 17927 flow [2024-06-27 17:33:13,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=7045, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=69, PETRI_FLOW=17927, PETRI_PLACES=282, PETRI_TRANSITIONS=1064} [2024-06-27 17:33:13,627 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 244 predicate places. [2024-06-27 17:33:13,627 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 1064 transitions, 17927 flow [2024-06-27 17:33:13,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 5.972972972972973) internal successors, (221), 37 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:33:13,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:33:13,627 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] [2024-06-27 17:33:13,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-06-27 17:33:13,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-06-27 17:33:13,838 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)] === [2024-06-27 17:33:13,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:33:13,838 INFO L85 PathProgramCache]: Analyzing trace with hash 2136989806, now seen corresponding path program 1 times [2024-06-27 17:33:13,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:33:13,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860015072] [2024-06-27 17:33:13,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:33:13,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:33:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:33:14,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:33:14,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:33:14,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860015072] [2024-06-27 17:33:14,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860015072] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:33:14,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192954244] [2024-06-27 17:33:14,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:33:14,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:33:14,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:33:14,140 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:33:14,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-06-27 17:33:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:33:14,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 21 conjunts are in the unsatisfiable core [2024-06-27 17:33:14,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:33:14,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-06-27 17:33:14,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:33:14,341 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:33:14,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:33:14,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2024-06-27 17:33:14,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:33:14,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192954244] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:33:14,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:33:14,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 20 [2024-06-27 17:33:14,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080555869] [2024-06-27 17:33:14,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:33:14,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-06-27 17:33:14,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:33:14,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-06-27 17:33:14,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2024-06-27 17:33:14,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 17:33:14,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 1064 transitions, 17927 flow. Second operand has 21 states, 21 states have (on average 9.619047619047619) internal successors, (202), 21 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:33:14,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:33:14,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 17:33:14,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:33:24,961 INFO L124 PetriNetUnfolderBase]: 29013/42657 cut-off events. [2024-06-27 17:33:24,961 INFO L125 PetriNetUnfolderBase]: For 613497/614409 co-relation queries the response was YES. [2024-06-27 17:33:25,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278359 conditions, 42657 events. 29013/42657 cut-off events. For 613497/614409 co-relation queries the response was YES. Maximal size of possible extension queue 1836. Compared 298020 event pairs, 3628 based on Foata normal form. 307/42492 useless extension candidates. Maximal degree in co-relation 278038. Up to 28734 conditions per place. [2024-06-27 17:33:25,920 INFO L140 encePairwiseOnDemand]: 22/36 looper letters, 1202 selfloop transitions, 579 changer transitions 1/1934 dead transitions. [2024-06-27 17:33:25,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 1934 transitions, 33492 flow [2024-06-27 17:33:25,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-06-27 17:33:25,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-06-27 17:33:25,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 370 transitions. [2024-06-27 17:33:25,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4894179894179894 [2024-06-27 17:33:25,922 INFO L175 Difference]: Start difference. First operand has 282 places, 1064 transitions, 17927 flow. Second operand 21 states and 370 transitions. [2024-06-27 17:33:25,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 1934 transitions, 33492 flow [2024-06-27 17:33:36,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 1934 transitions, 32488 flow, removed 420 selfloop flow, removed 5 redundant places. [2024-06-27 17:33:36,361 INFO L231 Difference]: Finished difference. Result has 310 places, 1441 transitions, 24050 flow [2024-06-27 17:33:36,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=17206, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1064, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=260, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=24050, PETRI_PLACES=310, PETRI_TRANSITIONS=1441} [2024-06-27 17:33:36,362 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 272 predicate places. [2024-06-27 17:33:36,363 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 1441 transitions, 24050 flow [2024-06-27 17:33:36,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.619047619047619) internal successors, (202), 21 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:33:36,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:33:36,363 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] [2024-06-27 17:33:36,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-06-27 17:33:36,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-06-27 17:33:36,566 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)] === [2024-06-27 17:33:36,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:33:36,567 INFO L85 PathProgramCache]: Analyzing trace with hash 694191452, now seen corresponding path program 3 times [2024-06-27 17:33:36,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:33:36,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314000541] [2024-06-27 17:33:36,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:33:36,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:33:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:33:37,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:33:37,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:33:37,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314000541] [2024-06-27 17:33:37,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314000541] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:33:37,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817364976] [2024-06-27 17:33:37,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 17:33:37,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:33:37,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:33:37,069 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:33:37,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-06-27 17:33:37,153 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-06-27 17:33:37,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:33:37,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 41 conjunts are in the unsatisfiable core [2024-06-27 17:33:37,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:33:37,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-06-27 17:33:37,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:33:37,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-06-27 17:33:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:33:37,521 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:33:37,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2024-06-27 17:33:37,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:33:37,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 62 [2024-06-27 17:33:38,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:33:38,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817364976] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:33:38,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:33:38,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 36 [2024-06-27 17:33:38,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791469947] [2024-06-27 17:33:38,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:33:38,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-06-27 17:33:38,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:33:38,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-06-27 17:33:38,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1175, Unknown=0, NotChecked=0, Total=1332 [2024-06-27 17:33:38,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2024-06-27 17:33:38,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 1441 transitions, 24050 flow. Second operand has 37 states, 37 states have (on average 5.972972972972973) internal successors, (221), 37 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:33:38,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:33:38,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2024-06-27 17:33:38,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand