./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/triangular-longest-1.i --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 448d4d75 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/pthread/triangular-longest-1.i -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 81809963fcaff21fd6241cde97e522447f695a8b323a0a16c5a31b7f82b0f683 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-448d4d7-m [2024-02-20 11:24:05,357 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 11:24:05,437 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-20 11:24:05,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 11:24:05,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 11:24:05,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 11:24:05,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 11:24:05,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 11:24:05,486 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 11:24:05,490 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 11:24:05,490 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 11:24:05,490 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 11:24:05,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 11:24:05,492 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 11:24:05,492 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 11:24:05,493 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 11:24:05,493 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 11:24:05,493 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 11:24:05,493 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-20 11:24:05,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 11:24:05,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 11:24:05,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 11:24:05,494 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 11:24:05,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 11:24:05,495 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 11:24:05,495 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 11:24:05,496 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 11:24:05,496 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 11:24:05,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 11:24:05,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 11:24:05,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 11:24:05,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 11:24:05,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:24:05,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 11:24:05,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 11:24:05,499 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 11:24:05,499 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-20 11:24:05,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-20 11:24:05,499 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 11:24:05,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 11:24:05,500 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 11:24:05,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 11:24:05,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 11:24:05,501 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 -> 81809963fcaff21fd6241cde97e522447f695a8b323a0a16c5a31b7f82b0f683 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-20 11:24:05,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 11:24:05,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 11:24:05,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 11:24:05,787 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 11:24:05,787 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 11:24:05,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longest-1.i [2024-02-20 11:24:06,910 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 11:24:07,148 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 11:24:07,152 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-1.i [2024-02-20 11:24:07,172 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80373877d/ae78e35902cf4bb58b89453b62d66248/FLAGf7b006117 [2024-02-20 11:24:07,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80373877d/ae78e35902cf4bb58b89453b62d66248 [2024-02-20 11:24:07,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 11:24:07,193 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 11:24:07,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 11:24:07,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 11:24:07,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 11:24:07,208 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:24:07" (1/1) ... [2024-02-20 11:24:07,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b0dabb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:07, skipping insertion in model container [2024-02-20 11:24:07,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:24:07" (1/1) ... [2024-02-20 11:24:07,252 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 11:24:07,542 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-1.i[30962,30975] [2024-02-20 11:24:07,547 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:24:07,556 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 11:24:07,605 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-1.i[30962,30975] [2024-02-20 11:24:07,606 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:24:07,639 INFO L206 MainTranslator]: Completed translation [2024-02-20 11:24:07,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:07 WrapperNode [2024-02-20 11:24:07,640 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 11:24:07,641 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 11:24:07,641 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 11:24:07,641 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 11:24:07,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:07" (1/1) ... [2024-02-20 11:24:07,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:07" (1/1) ... [2024-02-20 11:24:07,694 INFO L138 Inliner]: procedures = 169, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 45 [2024-02-20 11:24:07,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 11:24:07,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 11:24:07,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 11:24:07,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 11:24:07,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:07" (1/1) ... [2024-02-20 11:24:07,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:07" (1/1) ... [2024-02-20 11:24:07,709 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:07" (1/1) ... [2024-02-20 11:24:07,732 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-02-20 11:24:07,732 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:07" (1/1) ... [2024-02-20 11:24:07,733 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:07" (1/1) ... [2024-02-20 11:24:07,748 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:07" (1/1) ... [2024-02-20 11:24:07,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:07" (1/1) ... [2024-02-20 11:24:07,756 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:07" (1/1) ... [2024-02-20 11:24:07,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:07" (1/1) ... [2024-02-20 11:24:07,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 11:24:07,764 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 11:24:07,765 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 11:24:07,765 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 11:24:07,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:07" (1/1) ... [2024-02-20 11:24:07,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:24:07,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:24:07,797 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-02-20 11:24:07,828 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-02-20 11:24:07,855 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-02-20 11:24:07,855 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-02-20 11:24:07,855 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-02-20 11:24:07,855 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-02-20 11:24:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-20 11:24:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-20 11:24:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-20 11:24:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-20 11:24:07,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 11:24:07,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 11:24:07,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 11:24:07,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-20 11:24:07,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-20 11:24:07,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-20 11:24:07,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-20 11:24:07,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 11:24:07,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 11:24:07,861 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-20 11:24:07,988 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 11:24:07,989 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 11:24:08,102 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 11:24:08,102 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 11:24:08,194 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 11:24:08,196 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-20 11:24:08,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:24:08 BoogieIcfgContainer [2024-02-20 11:24:08,196 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 11:24:08,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 11:24:08,199 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 11:24:08,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 11:24:08,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:24:07" (1/3) ... [2024-02-20 11:24:08,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b23698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:24:08, skipping insertion in model container [2024-02-20 11:24:08,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:07" (2/3) ... [2024-02-20 11:24:08,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b23698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:24:08, skipping insertion in model container [2024-02-20 11:24:08,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:24:08" (3/3) ... [2024-02-20 11:24:08,208 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longest-1.i [2024-02-20 11:24:08,221 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 11:24:08,221 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-20 11:24:08,221 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 11:24:08,254 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-20 11:24:08,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 56 flow [2024-02-20 11:24:08,314 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2024-02-20 11:24:08,314 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-20 11:24:08,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 22 events. 3/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2024-02-20 11:24:08,317 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 56 flow [2024-02-20 11:24:08,319 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 22 transitions, 50 flow [2024-02-20 11:24:08,328 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 11:24:08,338 INFO L369 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=All, 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;@5f744e47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 11:24:08,338 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-20 11:24:08,352 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 11:24:08,360 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2024-02-20 11:24:08,360 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-20 11:24:08,360 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:24:08,361 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:24:08,362 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:24:08,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:24:08,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1796875976, now seen corresponding path program 1 times [2024-02-20 11:24:08,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:24:08,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729427172] [2024-02-20 11:24:08,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:24:08,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:24:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:24:08,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:24:08,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:24:08,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729427172] [2024-02-20 11:24:08,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729427172] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:24:08,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:24:08,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:24:08,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961989963] [2024-02-20 11:24:08,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:24:08,885 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 11:24:08,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:24:08,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 11:24:08,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-20 11:24:08,934 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:24:08,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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-02-20 11:24:08,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:24:08,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:24:08,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:24:09,216 INFO L124 PetriNetUnfolderBase]: 321/543 cut-off events. [2024-02-20 11:24:09,216 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-20 11:24:09,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 543 events. 321/543 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2180 event pairs, 62 based on Foata normal form. 12/542 useless extension candidates. Maximal degree in co-relation 1045. Up to 221 conditions per place. [2024-02-20 11:24:09,223 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 25 selfloop transitions, 4 changer transitions 22/54 dead transitions. [2024-02-20 11:24:09,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 54 transitions, 216 flow [2024-02-20 11:24:09,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-20 11:24:09,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-20 11:24:09,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2024-02-20 11:24:09,235 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-02-20 11:24:09,238 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2024-02-20 11:24:09,239 INFO L507 AbstractCegarLoop]: Abstraction has has 31 places, 54 transitions, 216 flow [2024-02-20 11:24:09,239 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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-02-20 11:24:09,239 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:24:09,239 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:24:09,240 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-20 11:24:09,240 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:24:09,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:24:09,241 INFO L85 PathProgramCache]: Analyzing trace with hash 676521124, now seen corresponding path program 1 times [2024-02-20 11:24:09,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:24:09,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989498251] [2024-02-20 11:24:09,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:24:09,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:24:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:24:09,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:24:09,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:24:09,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989498251] [2024-02-20 11:24:09,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989498251] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:24:09,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:24:09,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 11:24:09,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210185314] [2024-02-20 11:24:09,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:24:09,397 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-20 11:24:09,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:24:09,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-20 11:24:09,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-02-20 11:24:09,429 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:24:09,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 54 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 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-02-20 11:24:09,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:24:09,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:24:09,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:24:09,705 INFO L124 PetriNetUnfolderBase]: 697/1161 cut-off events. [2024-02-20 11:24:09,705 INFO L125 PetriNetUnfolderBase]: For 82/90 co-relation queries the response was YES. [2024-02-20 11:24:09,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3320 conditions, 1161 events. 697/1161 cut-off events. For 82/90 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5196 event pairs, 50 based on Foata normal form. 0/1121 useless extension candidates. Maximal degree in co-relation 3307. Up to 547 conditions per place. [2024-02-20 11:24:09,712 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 58 selfloop transitions, 11 changer transitions 111/183 dead transitions. [2024-02-20 11:24:09,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 183 transitions, 1095 flow [2024-02-20 11:24:09,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-02-20 11:24:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-02-20 11:24:09,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2024-02-20 11:24:09,715 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5875 [2024-02-20 11:24:09,715 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 14 predicate places. [2024-02-20 11:24:09,716 INFO L507 AbstractCegarLoop]: Abstraction has has 40 places, 183 transitions, 1095 flow [2024-02-20 11:24:09,716 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 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-02-20 11:24:09,716 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:24:09,716 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:24:09,717 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-20 11:24:09,717 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:24:09,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:24:09,717 INFO L85 PathProgramCache]: Analyzing trace with hash 299733066, now seen corresponding path program 2 times [2024-02-20 11:24:09,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:24:09,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628016211] [2024-02-20 11:24:09,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:24:09,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:24:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:24:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:24:09,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:24:09,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628016211] [2024-02-20 11:24:09,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628016211] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:24:09,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:24:09,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 11:24:09,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657461262] [2024-02-20 11:24:09,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:24:09,841 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-20 11:24:09,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:24:09,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-20 11:24:09,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-02-20 11:24:09,851 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:24:09,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 183 transitions, 1095 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 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-02-20 11:24:09,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:24:09,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:24:09,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:24:10,101 INFO L124 PetriNetUnfolderBase]: 787/1314 cut-off events. [2024-02-20 11:24:10,101 INFO L125 PetriNetUnfolderBase]: For 317/327 co-relation queries the response was YES. [2024-02-20 11:24:10,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4949 conditions, 1314 events. 787/1314 cut-off events. For 317/327 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6043 event pairs, 44 based on Foata normal form. 6/1310 useless extension candidates. Maximal degree in co-relation 4933. Up to 541 conditions per place. [2024-02-20 11:24:10,107 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 57 selfloop transitions, 11 changer transitions 183/254 dead transitions. [2024-02-20 11:24:10,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 254 transitions, 2023 flow [2024-02-20 11:24:10,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-20 11:24:10,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-20 11:24:10,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-02-20 11:24:10,110 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5885416666666666 [2024-02-20 11:24:10,111 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 21 predicate places. [2024-02-20 11:24:10,111 INFO L507 AbstractCegarLoop]: Abstraction has has 47 places, 254 transitions, 2023 flow [2024-02-20 11:24:10,112 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 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-02-20 11:24:10,112 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:24:10,112 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:24:10,112 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-20 11:24:10,112 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:24:10,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:24:10,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1146810191, now seen corresponding path program 1 times [2024-02-20 11:24:10,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:24:10,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908943542] [2024-02-20 11:24:10,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:24:10,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:24:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:24:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:24:10,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:24:10,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908943542] [2024-02-20 11:24:10,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908943542] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:24:10,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:24:10,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-20 11:24:10,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109347829] [2024-02-20 11:24:10,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:24:10,298 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-20 11:24:10,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:24:10,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-20 11:24:10,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-02-20 11:24:10,312 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:24:10,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 254 transitions, 2023 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 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-02-20 11:24:10,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:24:10,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:24:10,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:24:10,649 INFO L124 PetriNetUnfolderBase]: 1174/1950 cut-off events. [2024-02-20 11:24:10,650 INFO L125 PetriNetUnfolderBase]: For 881/905 co-relation queries the response was YES. [2024-02-20 11:24:10,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9131 conditions, 1950 events. 1174/1950 cut-off events. For 881/905 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9568 event pairs, 50 based on Foata normal form. 0/1910 useless extension candidates. Maximal degree in co-relation 9112. Up to 945 conditions per place. [2024-02-20 11:24:10,660 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 76 selfloop transitions, 20 changer transitions 260/359 dead transitions. [2024-02-20 11:24:10,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 359 transitions, 3575 flow [2024-02-20 11:24:10,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-20 11:24:10,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-20 11:24:10,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 180 transitions. [2024-02-20 11:24:10,662 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2024-02-20 11:24:10,663 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 33 predicate places. [2024-02-20 11:24:10,663 INFO L507 AbstractCegarLoop]: Abstraction has has 59 places, 359 transitions, 3575 flow [2024-02-20 11:24:10,663 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 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-02-20 11:24:10,663 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:24:10,663 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:24:10,664 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-20 11:24:10,664 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:24:10,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:24:10,664 INFO L85 PathProgramCache]: Analyzing trace with hash 397265521, now seen corresponding path program 2 times [2024-02-20 11:24:10,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:24:10,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067799057] [2024-02-20 11:24:10,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:24:10,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:24:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:24:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:24:10,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:24:10,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067799057] [2024-02-20 11:24:10,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067799057] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:24:10,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:24:10,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-20 11:24:10,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991209296] [2024-02-20 11:24:10,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:24:10,766 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-20 11:24:10,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:24:10,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-20 11:24:10,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-02-20 11:24:10,781 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:24:10,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 359 transitions, 3575 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 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-02-20 11:24:10,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:24:10,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:24:10,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:24:11,149 INFO L124 PetriNetUnfolderBase]: 1237/2051 cut-off events. [2024-02-20 11:24:11,149 INFO L125 PetriNetUnfolderBase]: For 1574/1606 co-relation queries the response was YES. [2024-02-20 11:24:11,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11518 conditions, 2051 events. 1237/2051 cut-off events. For 1574/1606 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10190 event pairs, 44 based on Foata normal form. 0/2038 useless extension candidates. Maximal degree in co-relation 11496. Up to 1008 conditions per place. [2024-02-20 11:24:11,160 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 73 selfloop transitions, 22 changer transitions 312/410 dead transitions. [2024-02-20 11:24:11,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 410 transitions, 4899 flow [2024-02-20 11:24:11,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-20 11:24:11,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-20 11:24:11,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2024-02-20 11:24:11,162 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5590277777777778 [2024-02-20 11:24:11,162 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 44 predicate places. [2024-02-20 11:24:11,162 INFO L507 AbstractCegarLoop]: Abstraction has has 70 places, 410 transitions, 4899 flow [2024-02-20 11:24:11,163 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 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-02-20 11:24:11,163 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:24:11,163 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:24:11,163 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-20 11:24:11,163 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:24:11,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:24:11,164 INFO L85 PathProgramCache]: Analyzing trace with hash 610647167, now seen corresponding path program 1 times [2024-02-20 11:24:11,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:24:11,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795778696] [2024-02-20 11:24:11,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:24:11,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:24:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:24:11,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:24:11,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:24:11,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795778696] [2024-02-20 11:24:11,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795778696] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:24:11,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913681956] [2024-02-20 11:24:11,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:24:11,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:24:11,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:24:11,308 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-02-20 11:24:11,330 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-02-20 11:24:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:24:11,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-20 11:24:11,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:24:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:24:11,501 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:24:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:24:11,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913681956] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:24:11,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:24:11,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-02-20 11:24:11,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813491559] [2024-02-20 11:24:11,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:24:11,694 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-02-20 11:24:11,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:24:11,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-02-20 11:24:11,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-02-20 11:24:11,721 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:24:11,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 410 transitions, 4899 flow. Second operand has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 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-02-20 11:24:11,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:24:11,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:24:11,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:24:12,488 INFO L124 PetriNetUnfolderBase]: 1921/3197 cut-off events. [2024-02-20 11:24:12,489 INFO L125 PetriNetUnfolderBase]: For 4024/4064 co-relation queries the response was YES. [2024-02-20 11:24:12,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20764 conditions, 3197 events. 1921/3197 cut-off events. For 4024/4064 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 15576 event pairs, 44 based on Foata normal form. 0/3184 useless extension candidates. Maximal degree in co-relation 20739. Up to 1602 conditions per place. [2024-02-20 11:24:12,505 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 102 selfloop transitions, 17 changer transitions 559/681 dead transitions. [2024-02-20 11:24:12,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 681 transitions, 9507 flow [2024-02-20 11:24:12,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-02-20 11:24:12,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-02-20 11:24:12,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 309 transitions. [2024-02-20 11:24:12,507 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5597826086956522 [2024-02-20 11:24:12,508 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 66 predicate places. [2024-02-20 11:24:12,508 INFO L507 AbstractCegarLoop]: Abstraction has has 92 places, 681 transitions, 9507 flow [2024-02-20 11:24:12,509 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 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-02-20 11:24:12,509 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:24:12,509 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:24:12,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-02-20 11:24:12,724 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-02-20 11:24:12,725 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:24:12,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:24:12,726 INFO L85 PathProgramCache]: Analyzing trace with hash 712768905, now seen corresponding path program 2 times [2024-02-20 11:24:12,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:24:12,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439976877] [2024-02-20 11:24:12,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:24:12,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:24:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:24:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:24:12,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:24:12,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439976877] [2024-02-20 11:24:12,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439976877] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:24:12,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525865000] [2024-02-20 11:24:12,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 11:24:12,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:24:12,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:24:12,838 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-02-20 11:24:12,857 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-02-20 11:24:12,908 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-20 11:24:12,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:24:12,910 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-20 11:24:12,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:24:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:24:12,947 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:24:13,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:24:13,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525865000] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:24:13,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:24:13,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-02-20 11:24:13,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671746233] [2024-02-20 11:24:13,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:24:13,054 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-02-20 11:24:13,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:24:13,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-02-20 11:24:13,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-02-20 11:24:13,075 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:24:13,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 681 transitions, 9507 flow. Second operand has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 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-02-20 11:24:13,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:24:13,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:24:13,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:24:14,245 INFO L124 PetriNetUnfolderBase]: 2947/4923 cut-off events. [2024-02-20 11:24:14,245 INFO L125 PetriNetUnfolderBase]: For 8804/8852 co-relation queries the response was YES. [2024-02-20 11:24:14,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36377 conditions, 4923 events. 2947/4923 cut-off events. For 8804/8852 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 26342 event pairs, 44 based on Foata normal form. 0/4883 useless extension candidates. Maximal degree in co-relation 36349. Up to 2781 conditions per place. [2024-02-20 11:24:14,274 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 144 selfloop transitions, 47 changer transitions 817/1011 dead transitions. [2024-02-20 11:24:14,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 1011 transitions, 16143 flow [2024-02-20 11:24:14,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-02-20 11:24:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-02-20 11:24:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 420 transitions. [2024-02-20 11:24:14,277 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.546875 [2024-02-20 11:24:14,278 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 97 predicate places. [2024-02-20 11:24:14,278 INFO L507 AbstractCegarLoop]: Abstraction has has 123 places, 1011 transitions, 16143 flow [2024-02-20 11:24:14,279 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 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-02-20 11:24:14,279 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:24:14,279 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:24:14,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-02-20 11:24:14,496 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-02-20 11:24:14,497 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:24:14,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:24:14,498 INFO L85 PathProgramCache]: Analyzing trace with hash -892597602, now seen corresponding path program 1 times [2024-02-20 11:24:14,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:24:14,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258094630] [2024-02-20 11:24:14,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:24:14,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:24:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:24:14,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:24:14,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:24:14,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258094630] [2024-02-20 11:24:14,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258094630] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:24:14,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583007326] [2024-02-20 11:24:14,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:24:14,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:24:14,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:24:14,673 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-02-20 11:24:14,704 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-02-20 11:24:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:24:14,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-20 11:24:14,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:24:14,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:24:14,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:24:14,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:24:14,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583007326] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:24:14,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:24:14,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-02-20 11:24:14,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223510053] [2024-02-20 11:24:14,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:24:14,932 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-20 11:24:14,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:24:14,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-20 11:24:14,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-02-20 11:24:14,955 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:24:14,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 1011 transitions, 16143 flow. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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-02-20 11:24:14,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:24:14,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:24:14,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:24:16,811 INFO L124 PetriNetUnfolderBase]: 4603/7703 cut-off events. [2024-02-20 11:24:16,812 INFO L125 PetriNetUnfolderBase]: For 18512/18568 co-relation queries the response was YES. [2024-02-20 11:24:16,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63952 conditions, 7703 events. 4603/7703 cut-off events. For 18512/18568 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 45741 event pairs, 44 based on Foata normal form. 0/7663 useless extension candidates. Maximal degree in co-relation 63921. Up to 4581 conditions per place. [2024-02-20 11:24:16,940 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 202 selfloop transitions, 66 changer transitions 1390/1661 dead transitions. [2024-02-20 11:24:16,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 1661 transitions, 29859 flow [2024-02-20 11:24:16,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-02-20 11:24:16,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2024-02-20 11:24:16,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 440 transitions. [2024-02-20 11:24:16,945 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5392156862745098 [2024-02-20 11:24:16,947 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 130 predicate places. [2024-02-20 11:24:16,947 INFO L507 AbstractCegarLoop]: Abstraction has has 156 places, 1661 transitions, 29859 flow [2024-02-20 11:24:16,949 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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-02-20 11:24:16,949 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:24:16,949 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:24:16,966 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-02-20 11:24:17,164 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:24:17,165 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:24:17,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:24:17,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1469535250, now seen corresponding path program 2 times [2024-02-20 11:24:17,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:24:17,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649262823] [2024-02-20 11:24:17,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:24:17,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:24:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:24:17,324 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:24:17,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:24:17,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649262823] [2024-02-20 11:24:17,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649262823] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:24:17,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184888252] [2024-02-20 11:24:17,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 11:24:17,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:24:17,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:24:17,326 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-02-20 11:24:17,346 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-02-20 11:24:17,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-20 11:24:17,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:24:17,391 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-20 11:24:17,392 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:24:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:24:17,441 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:24:17,539 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:24:17,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184888252] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:24:17,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:24:17,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-02-20 11:24:17,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341557034] [2024-02-20 11:24:17,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:24:17,542 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-20 11:24:17,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:24:17,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-20 11:24:17,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-02-20 11:24:17,570 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:24:17,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 1661 transitions, 29859 flow. Second operand has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 17 states have internal predecessors, (121), 0 states have call successors, (0), 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-02-20 11:24:17,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:24:17,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:24:17,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:24:20,970 INFO L124 PetriNetUnfolderBase]: 7330/12306 cut-off events. [2024-02-20 11:24:20,970 INFO L125 PetriNetUnfolderBase]: For 39497/39519 co-relation queries the response was YES. [2024-02-20 11:24:20,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113168 conditions, 12306 events. 7330/12306 cut-off events. For 39497/39519 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 77293 event pairs, 50 based on Foata normal form. 6/12302 useless extension candidates. Maximal degree in co-relation 113134. Up to 7524 conditions per place. [2024-02-20 11:24:21,132 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 296 selfloop transitions, 106 changer transitions 2304/2709 dead transitions. [2024-02-20 11:24:21,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 2709 transitions, 54135 flow [2024-02-20 11:24:21,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-02-20 11:24:21,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2024-02-20 11:24:21,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 520 transitions. [2024-02-20 11:24:21,136 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-02-20 11:24:21,137 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 169 predicate places. [2024-02-20 11:24:21,137 INFO L507 AbstractCegarLoop]: Abstraction has has 195 places, 2709 transitions, 54135 flow [2024-02-20 11:24:21,138 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 17 states have internal predecessors, (121), 0 states have call successors, (0), 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-02-20 11:24:21,138 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:24:21,138 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:24:21,156 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-02-20 11:24:21,353 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:24:21,353 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:24:21,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:24:21,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1135380243, now seen corresponding path program 3 times [2024-02-20 11:24:21,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:24:21,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877133966] [2024-02-20 11:24:21,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:24:21,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:24:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:24:21,581 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:24:21,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:24:21,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877133966] [2024-02-20 11:24:21,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877133966] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:24:21,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673076722] [2024-02-20 11:24:21,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-20 11:24:21,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:24:21,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:24:21,584 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-02-20 11:24:21,590 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-02-20 11:24:21,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-02-20 11:24:21,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:24:21,651 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-20 11:24:21,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:24:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:24:21,719 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:24:21,857 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:24:21,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673076722] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:24:21,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:24:21,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2024-02-20 11:24:21,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95738974] [2024-02-20 11:24:21,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:24:21,859 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-02-20 11:24:21,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:24:21,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-02-20 11:24:21,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2024-02-20 11:24:21,910 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:24:21,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 2709 transitions, 54135 flow. Second operand has 21 states, 21 states have (on average 7.285714285714286) internal successors, (153), 21 states have internal predecessors, (153), 0 states have call successors, (0), 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-02-20 11:24:21,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:24:21,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:24:21,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:24:29,637 INFO L124 PetriNetUnfolderBase]: 12793/21522 cut-off events. [2024-02-20 11:24:29,637 INFO L125 PetriNetUnfolderBase]: For 89870/89942 co-relation queries the response was YES. [2024-02-20 11:24:29,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216749 conditions, 21522 events. 12793/21522 cut-off events. For 89870/89942 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 144759 event pairs, 44 based on Foata normal form. 0/21509 useless extension candidates. Maximal degree in co-relation 216712. Up to 13482 conditions per place. [2024-02-20 11:24:29,759 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 503 selfloop transitions, 190 changer transitions 3941/4637 dead transitions. [2024-02-20 11:24:29,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 4637 transitions, 101963 flow [2024-02-20 11:24:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-02-20 11:24:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2024-02-20 11:24:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 585 transitions. [2024-02-20 11:24:29,762 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-02-20 11:24:29,763 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 213 predicate places. [2024-02-20 11:24:29,763 INFO L507 AbstractCegarLoop]: Abstraction has has 239 places, 4637 transitions, 101963 flow [2024-02-20 11:24:29,763 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.285714285714286) internal successors, (153), 21 states have internal predecessors, (153), 0 states have call successors, (0), 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-02-20 11:24:29,763 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:24:29,763 INFO L234 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:24:29,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-02-20 11:24:29,976 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-02-20 11:24:29,976 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:24:29,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:24:29,977 INFO L85 PathProgramCache]: Analyzing trace with hash 444954594, now seen corresponding path program 4 times [2024-02-20 11:24:29,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:24:29,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545638597] [2024-02-20 11:24:29,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:24:29,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:24:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:24:30,299 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:24:30,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:24:30,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545638597] [2024-02-20 11:24:30,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545638597] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:24:30,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011551899] [2024-02-20 11:24:30,300 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-20 11:24:30,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:24:30,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:24:30,301 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-02-20 11:24:30,323 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-02-20 11:24:30,383 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-20 11:24:30,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:24:30,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 19 conjunts are in the unsatisfiable core [2024-02-20 11:24:30,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:24:30,508 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:24:30,508 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:24:30,934 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:24:30,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011551899] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:24:30,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:24:30,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2024-02-20 11:24:30,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449388662] [2024-02-20 11:24:30,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:24:30,938 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-02-20 11:24:30,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:24:30,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-02-20 11:24:30,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=801, Unknown=0, NotChecked=0, Total=1056 [2024-02-20 11:24:30,975 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:24:30,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 4637 transitions, 101963 flow. Second operand has 33 states, 33 states have (on average 7.181818181818182) internal successors, (237), 33 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:24:30,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:24:30,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:24:30,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:24:48,428 INFO L124 PetriNetUnfolderBase]: 16330/27474 cut-off events. [2024-02-20 11:24:48,428 INFO L125 PetriNetUnfolderBase]: For 141685/141711 co-relation queries the response was YES. [2024-02-20 11:24:48,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301325 conditions, 27474 events. 16330/27474 cut-off events. For 141685/141711 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 179174 event pairs, 44 based on Foata normal form. 6/27470 useless extension candidates. Maximal degree in co-relation 301285. Up to 16866 conditions per place. [2024-02-20 11:24:48,572 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 753 selfloop transitions, 45 changer transitions 5249/6050 dead transitions. [2024-02-20 11:24:48,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 6050 transitions, 145143 flow [2024-02-20 11:24:48,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-02-20 11:24:48,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2024-02-20 11:24:48,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 839 transitions. [2024-02-20 11:24:48,576 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5548941798941799 [2024-02-20 11:24:48,576 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 275 predicate places. [2024-02-20 11:24:48,576 INFO L507 AbstractCegarLoop]: Abstraction has has 301 places, 6050 transitions, 145143 flow [2024-02-20 11:24:48,577 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.181818181818182) internal successors, (237), 33 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:24:48,577 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:24:48,577 INFO L234 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:24:48,599 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-02-20 11:24:48,796 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:24:48,797 INFO L432 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:24:48,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:24:48,798 INFO L85 PathProgramCache]: Analyzing trace with hash -2086251098, now seen corresponding path program 5 times [2024-02-20 11:24:48,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:24:48,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684211750] [2024-02-20 11:24:48,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:24:48,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:24:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:24:49,292 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:24:49,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:24:49,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684211750] [2024-02-20 11:24:49,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684211750] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:24:49,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077404586] [2024-02-20 11:24:49,292 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-20 11:24:49,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:24:49,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:24:49,294 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-02-20 11:24:49,295 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-02-20 11:24:49,385 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-02-20 11:24:49,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:24:49,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 19 conjunts are in the unsatisfiable core [2024-02-20 11:24:49,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:24:49,507 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:24:49,507 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:24:49,892 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:24:49,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077404586] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:24:49,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:24:49,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2024-02-20 11:24:49,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661710129] [2024-02-20 11:24:49,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:24:49,893 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-02-20 11:24:49,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:24:49,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-02-20 11:24:49,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=834, Unknown=0, NotChecked=0, Total=1056 [2024-02-20 11:24:49,938 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:24:49,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 6050 transitions, 145143 flow. Second operand has 33 states, 33 states have (on average 7.181818181818182) internal successors, (237), 33 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:24:49,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:24:49,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:24:49,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:25:23,018 INFO L124 PetriNetUnfolderBase]: 22855/38471 cut-off events. [2024-02-20 11:25:23,018 INFO L125 PetriNetUnfolderBase]: For 241234/241262 co-relation queries the response was YES. [2024-02-20 11:25:23,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456232 conditions, 38471 events. 22855/38471 cut-off events. For 241234/241262 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 263214 event pairs, 44 based on Foata normal form. 6/38467 useless extension candidates. Maximal degree in co-relation 456189. Up to 23652 conditions per place. [2024-02-20 11:25:23,223 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 876 selfloop transitions, 148 changer transitions 7633/8660 dead transitions. [2024-02-20 11:25:23,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 8660 transitions, 225097 flow [2024-02-20 11:25:23,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-02-20 11:25:23,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2024-02-20 11:25:23,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 936 transitions. [2024-02-20 11:25:23,231 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-02-20 11:25:23,232 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 346 predicate places. [2024-02-20 11:25:23,232 INFO L507 AbstractCegarLoop]: Abstraction has has 372 places, 8660 transitions, 225097 flow [2024-02-20 11:25:23,233 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.181818181818182) internal successors, (237), 33 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:25:23,233 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:25:23,233 INFO L234 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:25:23,254 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-02-20 11:25:23,454 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:25:23,455 INFO L432 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:25:23,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:25:23,455 INFO L85 PathProgramCache]: Analyzing trace with hash -241166040, now seen corresponding path program 6 times [2024-02-20 11:25:23,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:25:23,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682304326] [2024-02-20 11:25:23,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:25:23,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:25:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:25:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:25:23,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:25:23,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682304326] [2024-02-20 11:25:23,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682304326] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:25:23,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040000194] [2024-02-20 11:25:23,739 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-20 11:25:23,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:25:23,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:25:23,742 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-02-20 11:25:23,744 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-02-20 11:25:23,867 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-02-20 11:25:23,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:25:23,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 19 conjunts are in the unsatisfiable core [2024-02-20 11:25:23,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:25:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:25:24,006 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:25:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:25:24,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040000194] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:25:24,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:25:24,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2024-02-20 11:25:24,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261935134] [2024-02-20 11:25:24,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:25:24,354 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-02-20 11:25:24,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:25:24,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-02-20 11:25:24,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=930, Unknown=0, NotChecked=0, Total=1122 [2024-02-20 11:25:24,413 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:25:24,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 8660 transitions, 225097 flow. Second operand has 34 states, 34 states have (on average 7.205882352941177) internal successors, (245), 34 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:25:24,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:25:24,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:25:24,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:26:58,286 INFO L124 PetriNetUnfolderBase]: 33178/55884 cut-off events. [2024-02-20 11:26:58,287 INFO L125 PetriNetUnfolderBase]: For 415511/415607 co-relation queries the response was YES. [2024-02-20 11:26:58,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713090 conditions, 55884 events. 33178/55884 cut-off events. For 415511/415607 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 406144 event pairs, 52 based on Foata normal form. 0/55871 useless extension candidates. Maximal degree in co-relation 713044. Up to 34722 conditions per place. [2024-02-20 11:26:58,634 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 1077 selfloop transitions, 378 changer transitions 11203/12661 dead transitions. [2024-02-20 11:26:58,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 12661 transitions, 354439 flow [2024-02-20 11:26:58,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-02-20 11:26:58,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2024-02-20 11:26:58,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 1004 transitions. [2024-02-20 11:26:58,638 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5363247863247863 [2024-02-20 11:26:58,639 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 423 predicate places. [2024-02-20 11:26:58,639 INFO L507 AbstractCegarLoop]: Abstraction has has 449 places, 12661 transitions, 354439 flow [2024-02-20 11:26:58,639 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.205882352941177) internal successors, (245), 34 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:26:58,639 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:26:58,639 INFO L234 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:26:58,660 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-02-20 11:26:58,856 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-02-20 11:26:58,856 INFO L432 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:26:58,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:26:58,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1961289992, now seen corresponding path program 7 times [2024-02-20 11:26:58,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:26:58,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418800671] [2024-02-20 11:26:58,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:26:58,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:26:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:26:59,295 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:26:59,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:26:59,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418800671] [2024-02-20 11:26:59,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418800671] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:26:59,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975263359] [2024-02-20 11:26:59,296 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-02-20 11:26:59,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:26:59,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:26:59,297 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-02-20 11:26:59,297 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-02-20 11:26:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:26:59,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 19 conjunts are in the unsatisfiable core [2024-02-20 11:26:59,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:26:59,466 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:26:59,466 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:26:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:26:59,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975263359] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:26:59,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:26:59,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2024-02-20 11:26:59,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606814798] [2024-02-20 11:26:59,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:26:59,712 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-02-20 11:26:59,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:26:59,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-02-20 11:26:59,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=819, Unknown=0, NotChecked=0, Total=1056 [2024-02-20 11:26:59,737 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:26:59,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 12661 transitions, 354439 flow. Second operand has 33 states, 33 states have (on average 7.181818181818182) internal successors, (237), 33 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:26:59,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:26:59,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:26:59,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:29:47,826 INFO L124 PetriNetUnfolderBase]: 38551/65252 cut-off events. [2024-02-20 11:29:47,826 INFO L125 PetriNetUnfolderBase]: For 569027/569059 co-relation queries the response was YES. [2024-02-20 11:29:47,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 891199 conditions, 65252 events. 38551/65252 cut-off events. For 569027/569059 co-relation queries the response was YES. Maximal size of possible extension queue 863. Compared 487659 event pairs, 36 based on Foata normal form. 6/65221 useless extension candidates. Maximal degree in co-relation 891150. Up to 41229 conditions per place. [2024-02-20 11:29:48,258 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 1267 selfloop transitions, 471 changer transitions 12958/14699 dead transitions. [2024-02-20 11:29:48,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 14699 transitions, 440895 flow [2024-02-20 11:29:48,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-02-20 11:29:48,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2024-02-20 11:29:48,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 1190 transitions. [2024-02-20 11:29:48,262 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5389492753623188 [2024-02-20 11:29:48,262 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 514 predicate places. [2024-02-20 11:29:48,262 INFO L507 AbstractCegarLoop]: Abstraction has has 540 places, 14699 transitions, 440895 flow [2024-02-20 11:29:48,262 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.181818181818182) internal successors, (237), 33 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:29:48,262 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:29:48,263 INFO L234 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:29:48,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-02-20 11:29:48,476 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-02-20 11:29:48,477 INFO L432 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:29:48,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:29:48,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2001385123, now seen corresponding path program 8 times [2024-02-20 11:29:48,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:29:48,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407509158] [2024-02-20 11:29:48,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:29:48,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:29:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:29:48,925 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:29:48,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:29:48,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407509158] [2024-02-20 11:29:48,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407509158] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:29:48,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822151267] [2024-02-20 11:29:48,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 11:29:48,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:29:48,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:29:48,928 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-02-20 11:29:48,935 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-02-20 11:29:49,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-20 11:29:49,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:29:49,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 28 conjunts are in the unsatisfiable core [2024-02-20 11:29:49,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:29:49,143 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:29:49,143 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:29:49,676 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:29:49,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822151267] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:29:49,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:29:49,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 46 [2024-02-20 11:29:49,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501320279] [2024-02-20 11:29:49,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:29:49,680 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-02-20 11:29:49,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:29:49,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-02-20 11:29:49,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=1661, Unknown=0, NotChecked=0, Total=2162 [2024-02-20 11:29:49,763 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:29:49,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 14699 transitions, 440895 flow. Second operand has 47 states, 47 states have (on average 7.1063829787234045) internal successors, (334), 47 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:29:49,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:29:49,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:29:49,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:34:47,561 INFO L124 PetriNetUnfolderBase]: 52132/88284 cut-off events. [2024-02-20 11:34:47,561 INFO L125 PetriNetUnfolderBase]: For 900485/900597 co-relation queries the response was YES. [2024-02-20 11:34:47,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1283861 conditions, 88284 events. 52132/88284 cut-off events. For 900485/900597 co-relation queries the response was YES. Maximal size of possible extension queue 890. Compared 653457 event pairs, 50 based on Foata normal form. 0/88271 useless extension candidates. Maximal degree in co-relation 1283809. Up to 55728 conditions per place. [2024-02-20 11:34:48,193 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 1591 selfloop transitions, 595 changer transitions 17691/19880 dead transitions. [2024-02-20 11:34:48,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 19880 transitions, 636079 flow [2024-02-20 11:34:48,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-02-20 11:34:48,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2024-02-20 11:34:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 1647 transitions. [2024-02-20 11:34:48,196 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5361328125 [2024-02-20 11:34:48,196 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 641 predicate places. [2024-02-20 11:34:48,196 INFO L507 AbstractCegarLoop]: Abstraction has has 667 places, 19880 transitions, 636079 flow [2024-02-20 11:34:48,196 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 7.1063829787234045) internal successors, (334), 47 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:34:48,197 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:34:48,197 INFO L234 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:34:48,208 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-02-20 11:34:48,397 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-02-20 11:34:48,397 INFO L432 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:34:48,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:34:48,398 INFO L85 PathProgramCache]: Analyzing trace with hash -36742098, now seen corresponding path program 9 times [2024-02-20 11:34:48,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:34:48,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732284496] [2024-02-20 11:34:48,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:34:48,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:34:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:34:49,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 1102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:34:49,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:34:49,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732284496] [2024-02-20 11:34:49,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732284496] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:34:49,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039434567] [2024-02-20 11:34:49,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-20 11:34:49,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:34:49,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:34:49,670 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-02-20 11:34:49,671 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-02-20 11:34:49,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2024-02-20 11:34:49,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:34:49,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 46 conjunts are in the unsatisfiable core [2024-02-20 11:34:49,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:34:49,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 1102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:34:49,952 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:34:50,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 1102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:34:50,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039434567] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:34:50,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:34:50,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2024-02-20 11:34:50,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680528240] [2024-02-20 11:34:50,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:34:50,967 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2024-02-20 11:34:50,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:34:50,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2024-02-20 11:34:50,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1747, Invalid=5909, Unknown=0, NotChecked=0, Total=7656 [2024-02-20 11:34:51,011 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:34:51,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 667 places, 19880 transitions, 636079 flow. Second operand has 88 states, 88 states have (on average 7.011363636363637) internal successors, (617), 88 states have internal predecessors, (617), 0 states have call successors, (0), 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-02-20 11:34:51,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:34:51,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:34:51,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15