./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c --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/weaver/bench-exp3x3-opt.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4c1c24b29e2a448aa58292c6eb9ff7da7a6479c4a0ee37fcfe55a998096eea30 --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:38:34,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 11:38:34,442 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-20 11:38:34,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 11:38:34,448 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 11:38:34,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 11:38:34,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 11:38:34,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 11:38:34,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 11:38:34,479 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 11:38:34,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 11:38:34,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 11:38:34,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 11:38:34,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 11:38:34,481 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 11:38:34,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 11:38:34,482 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 11:38:34,482 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 11:38:34,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-20 11:38:34,483 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 11:38:34,483 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 11:38:34,483 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 11:38:34,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 11:38:34,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 11:38:34,484 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 11:38:34,484 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 11:38:34,484 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 11:38:34,484 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 11:38:34,486 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 11:38:34,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 11:38:34,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 11:38:34,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 11:38:34,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:38:34,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 11:38:34,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 11:38:34,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 11:38:34,488 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-20 11:38:34,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-20 11:38:34,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 11:38:34,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 11:38:34,489 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 11:38:34,489 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 11:38:34,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 11:38:34,490 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 -> 4c1c24b29e2a448aa58292c6eb9ff7da7a6479c4a0ee37fcfe55a998096eea30 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-20 11:38:34,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 11:38:34,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 11:38:34,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 11:38:34,766 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 11:38:34,766 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 11:38:34,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2024-02-20 11:38:35,857 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 11:38:36,032 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 11:38:36,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2024-02-20 11:38:36,041 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/179550d02/ac14178b4b4743a2ae64282e51597fc4/FLAGad6d21313 [2024-02-20 11:38:36,053 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/179550d02/ac14178b4b4743a2ae64282e51597fc4 [2024-02-20 11:38:36,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 11:38:36,057 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 11:38:36,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 11:38:36,059 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 11:38:36,063 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 11:38:36,063 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:38:36" (1/1) ... [2024-02-20 11:38:36,064 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3366aabc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:36, skipping insertion in model container [2024-02-20 11:38:36,064 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:38:36" (1/1) ... [2024-02-20 11:38:36,083 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 11:38:36,217 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c[2826,2839] [2024-02-20 11:38:36,221 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:38:36,227 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 11:38:36,246 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c[2826,2839] [2024-02-20 11:38:36,247 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:38:36,261 INFO L206 MainTranslator]: Completed translation [2024-02-20 11:38:36,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:36 WrapperNode [2024-02-20 11:38:36,262 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 11:38:36,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 11:38:36,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 11:38:36,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 11:38:36,268 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:38:36" (1/1) ... [2024-02-20 11:38:36,274 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:38:36" (1/1) ... [2024-02-20 11:38:36,289 INFO L138 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 131 [2024-02-20 11:38:36,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 11:38:36,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 11:38:36,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 11:38:36,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 11:38:36,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:36" (1/1) ... [2024-02-20 11:38:36,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:36" (1/1) ... [2024-02-20 11:38:36,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:36" (1/1) ... [2024-02-20 11:38:36,317 INFO L175 MemorySlicer]: Split 14 memory accesses to 7 slices as follows [2, 2, 2, 2, 2, 2, 2]. 14 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 6 writes are split as follows [0, 1, 1, 1, 1, 1, 1]. [2024-02-20 11:38:36,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:36" (1/1) ... [2024-02-20 11:38:36,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:36" (1/1) ... [2024-02-20 11:38:36,323 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:36" (1/1) ... [2024-02-20 11:38:36,327 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:36" (1/1) ... [2024-02-20 11:38:36,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:36" (1/1) ... [2024-02-20 11:38:36,334 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:36" (1/1) ... [2024-02-20 11:38:36,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 11:38:36,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 11:38:36,338 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 11:38:36,338 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 11:38:36,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:36" (1/1) ... [2024-02-20 11:38:36,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:38:36,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:38:36,394 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:38:36,405 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:38:36,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 11:38:36,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 11:38:36,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-20 11:38:36,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-20 11:38:36,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-20 11:38:36,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-20 11:38:36,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-20 11:38:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-02-20 11:38:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-02-20 11:38:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-20 11:38:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-20 11:38:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-20 11:38:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-20 11:38:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-20 11:38:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-02-20 11:38:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-02-20 11:38:36,473 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-20 11:38:36,473 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-20 11:38:36,473 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-20 11:38:36,473 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-20 11:38:36,474 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-20 11:38:36,474 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-20 11:38:36,474 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-02-20 11:38:36,474 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-02-20 11:38:36,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-20 11:38:36,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-20 11:38:36,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-20 11:38:36,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-20 11:38:36,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-20 11:38:36,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-02-20 11:38:36,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-02-20 11:38:36,487 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-02-20 11:38:36,487 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-02-20 11:38:36,487 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-02-20 11:38:36,487 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-02-20 11:38:36,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 11:38:36,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 11:38:36,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 11:38:36,491 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:38:36,598 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 11:38:36,600 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 11:38:36,856 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 11:38:36,856 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 11:38:37,015 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 11:38:37,015 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-02-20 11:38:37,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:38:37 BoogieIcfgContainer [2024-02-20 11:38:37,016 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 11:38:37,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 11:38:37,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 11:38:37,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 11:38:37,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:38:36" (1/3) ... [2024-02-20 11:38:37,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da27d1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:38:37, skipping insertion in model container [2024-02-20 11:38:37,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:36" (2/3) ... [2024-02-20 11:38:37,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da27d1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:38:37, skipping insertion in model container [2024-02-20 11:38:37,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:38:37" (3/3) ... [2024-02-20 11:38:37,025 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2024-02-20 11:38:37,040 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 11:38:37,040 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-20 11:38:37,040 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 11:38:37,093 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-02-20 11:38:37,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 45 transitions, 132 flow [2024-02-20 11:38:37,167 INFO L124 PetriNetUnfolderBase]: 6/39 cut-off events. [2024-02-20 11:38:37,168 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-02-20 11:38:37,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 39 events. 6/39 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 17 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-02-20 11:38:37,171 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 45 transitions, 132 flow [2024-02-20 11:38:37,175 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 38 transitions, 112 flow [2024-02-20 11:38:37,189 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 11:38:37,196 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;@4dfdd1a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 11:38:37,196 INFO L370 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-02-20 11:38:37,215 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 11:38:37,215 INFO L124 PetriNetUnfolderBase]: 6/37 cut-off events. [2024-02-20 11:38:37,215 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-02-20 11:38:37,216 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:37,216 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:37,217 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-02-20 11:38:37,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:37,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1659576246, now seen corresponding path program 1 times [2024-02-20 11:38:37,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:37,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144857254] [2024-02-20 11:38:37,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:37,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:37,723 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:38:37,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:37,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144857254] [2024-02-20 11:38:37,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144857254] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:38:37,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:38:37,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-20 11:38:37,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612922560] [2024-02-20 11:38:37,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:38:37,735 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:38:37,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:37,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:38:37,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:38:37,768 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-20 11:38:37,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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:38:37,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:37,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-20 11:38:37,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:38,211 INFO L124 PetriNetUnfolderBase]: 3277/3974 cut-off events. [2024-02-20 11:38:38,212 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-02-20 11:38:38,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8271 conditions, 3974 events. 3277/3974 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10701 event pairs, 837 based on Foata normal form. 1/2273 useless extension candidates. Maximal degree in co-relation 5564. Up to 2141 conditions per place. [2024-02-20 11:38:38,236 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 59 selfloop transitions, 3 changer transitions 1/64 dead transitions. [2024-02-20 11:38:38,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 64 transitions, 311 flow [2024-02-20 11:38:38,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:38:38,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:38:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-02-20 11:38:38,246 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2024-02-20 11:38:38,249 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2024-02-20 11:38:38,249 INFO L507 AbstractCegarLoop]: Abstraction has has 53 places, 64 transitions, 311 flow [2024-02-20 11:38:38,250 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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:38:38,250 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:38,250 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:38,251 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-20 11:38:38,251 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-02-20 11:38:38,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:38,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1700037346, now seen corresponding path program 1 times [2024-02-20 11:38:38,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:38,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657931288] [2024-02-20 11:38:38,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:38,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:38,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 11:38:38,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:38,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657931288] [2024-02-20 11:38:38,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657931288] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:38:38,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:38:38,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-20 11:38:38,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429420097] [2024-02-20 11:38:38,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:38:38,405 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:38:38,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:38,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:38:38,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:38:38,406 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-20 11:38:38,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 64 transitions, 311 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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:38:38,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:38,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-20 11:38:38,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:38,929 INFO L124 PetriNetUnfolderBase]: 6553/7944 cut-off events. [2024-02-20 11:38:38,930 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2024-02-20 11:38:38,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24469 conditions, 7944 events. 6553/7944 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 24556 event pairs, 837 based on Foata normal form. 1/4541 useless extension candidates. Maximal degree in co-relation 16504. Up to 4478 conditions per place. [2024-02-20 11:38:38,967 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 99 selfloop transitions, 5 changer transitions 19/124 dead transitions. [2024-02-20 11:38:38,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 124 transitions, 851 flow [2024-02-20 11:38:38,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:38:38,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:38:38,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-02-20 11:38:38,973 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2024-02-20 11:38:38,974 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2024-02-20 11:38:38,974 INFO L507 AbstractCegarLoop]: Abstraction has has 55 places, 124 transitions, 851 flow [2024-02-20 11:38:38,975 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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:38:38,975 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:38,975 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:38,975 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-20 11:38:38,975 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-02-20 11:38:38,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:38,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1754056490, now seen corresponding path program 1 times [2024-02-20 11:38:38,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:38,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662239706] [2024-02-20 11:38:38,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:38,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:39,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:38:39,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:39,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662239706] [2024-02-20 11:38:39,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662239706] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:38:39,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:38:39,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-20 11:38:39,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241381476] [2024-02-20 11:38:39,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:38:39,164 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:38:39,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:39,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:38:39,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:38:39,165 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-20 11:38:39,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 124 transitions, 851 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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:38:39,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:39,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-20 11:38:39,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:40,141 INFO L124 PetriNetUnfolderBase]: 13065/15820 cut-off events. [2024-02-20 11:38:40,141 INFO L125 PetriNetUnfolderBase]: For 1519/1519 co-relation queries the response was YES. [2024-02-20 11:38:40,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64521 conditions, 15820 events. 13065/15820 cut-off events. For 1519/1519 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 54766 event pairs, 837 based on Foata normal form. 1/9033 useless extension candidates. Maximal degree in co-relation 43480. Up to 9142 conditions per place. [2024-02-20 11:38:40,327 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 179 selfloop transitions, 9 changer transitions 47/236 dead transitions. [2024-02-20 11:38:40,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 236 transitions, 2089 flow [2024-02-20 11:38:40,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:38:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:38:40,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-02-20 11:38:40,331 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6592592592592592 [2024-02-20 11:38:40,332 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2024-02-20 11:38:40,332 INFO L507 AbstractCegarLoop]: Abstraction has has 57 places, 236 transitions, 2089 flow [2024-02-20 11:38:40,332 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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:38:40,332 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:40,332 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:40,333 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-20 11:38:40,333 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-02-20 11:38:40,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:40,334 INFO L85 PathProgramCache]: Analyzing trace with hash -268922874, now seen corresponding path program 1 times [2024-02-20 11:38:40,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:40,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011662591] [2024-02-20 11:38:40,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:40,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:40,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:38:40,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:40,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011662591] [2024-02-20 11:38:40,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011662591] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:38:40,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:38:40,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:38:40,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569976517] [2024-02-20 11:38:40,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:38:40,468 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:38:40,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:40,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:38:40,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:38:40,470 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-20 11:38:40,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 236 transitions, 2089 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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:38:40,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:40,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-20 11:38:40,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:41,563 INFO L124 PetriNetUnfolderBase]: 12847/15602 cut-off events. [2024-02-20 11:38:41,563 INFO L125 PetriNetUnfolderBase]: For 1606/1606 co-relation queries the response was YES. [2024-02-20 11:38:41,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79251 conditions, 15602 events. 12847/15602 cut-off events. For 1606/1606 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 54798 event pairs, 115 based on Foata normal form. 0/9032 useless extension candidates. Maximal degree in co-relation 74888. Up to 9034 conditions per place. [2024-02-20 11:38:41,639 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 287 selfloop transitions, 21 changer transitions 59/368 dead transitions. [2024-02-20 11:38:41,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 368 transitions, 3939 flow [2024-02-20 11:38:41,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:38:41,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:38:41,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2024-02-20 11:38:41,641 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-02-20 11:38:41,643 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2024-02-20 11:38:41,643 INFO L507 AbstractCegarLoop]: Abstraction has has 61 places, 368 transitions, 3939 flow [2024-02-20 11:38:41,643 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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:38:41,644 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:41,644 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:41,644 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-20 11:38:41,644 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-02-20 11:38:41,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:41,645 INFO L85 PathProgramCache]: Analyzing trace with hash 712336044, now seen corresponding path program 2 times [2024-02-20 11:38:41,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:41,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189242822] [2024-02-20 11:38:41,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:41,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:38:41,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:41,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189242822] [2024-02-20 11:38:41,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189242822] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:38:41,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:38:41,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:38:41,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158795569] [2024-02-20 11:38:41,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:38:41,775 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:38:41,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:41,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:38:41,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:38:41,776 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-20 11:38:41,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 368 transitions, 3939 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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:38:41,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:41,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-20 11:38:41,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:42,963 INFO L124 PetriNetUnfolderBase]: 12511/15266 cut-off events. [2024-02-20 11:38:42,964 INFO L125 PetriNetUnfolderBase]: For 1735/1735 co-relation queries the response was YES. [2024-02-20 11:38:42,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92837 conditions, 15266 events. 12511/15266 cut-off events. For 1735/1735 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 54261 event pairs, 31 based on Foata normal form. 0/9032 useless extension candidates. Maximal degree in co-relation 89216. Up to 8698 conditions per place. [2024-02-20 11:38:43,039 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 475 selfloop transitions, 41 changer transitions 119/636 dead transitions. [2024-02-20 11:38:43,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 636 transitions, 8033 flow [2024-02-20 11:38:43,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:38:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:38:43,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2024-02-20 11:38:43,040 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6488888888888888 [2024-02-20 11:38:43,041 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2024-02-20 11:38:43,041 INFO L507 AbstractCegarLoop]: Abstraction has has 65 places, 636 transitions, 8033 flow [2024-02-20 11:38:43,041 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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:38:43,042 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:43,042 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:43,042 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-20 11:38:43,042 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-02-20 11:38:43,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:43,043 INFO L85 PathProgramCache]: Analyzing trace with hash 65568082, now seen corresponding path program 1 times [2024-02-20 11:38:43,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:43,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359058817] [2024-02-20 11:38:43,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:43,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:43,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:38:43,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:43,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359058817] [2024-02-20 11:38:43,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359058817] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:38:43,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:38:43,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:38:43,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677248118] [2024-02-20 11:38:43,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:38:43,134 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:38:43,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:43,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:38:43,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:38:43,134 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-20 11:38:43,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 636 transitions, 8033 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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:38:43,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:43,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-20 11:38:43,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:44,487 INFO L124 PetriNetUnfolderBase]: 12255/15010 cut-off events. [2024-02-20 11:38:44,487 INFO L125 PetriNetUnfolderBase]: For 1813/1813 co-relation queries the response was YES. [2024-02-20 11:38:44,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106311 conditions, 15010 events. 12255/15010 cut-off events. For 1813/1813 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 52837 event pairs, 14 based on Foata normal form. 0/9032 useless extension candidates. Maximal degree in co-relation 102224. Up to 8570 conditions per place. [2024-02-20 11:38:44,558 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 719 selfloop transitions, 81 changer transitions 299/1100 dead transitions. [2024-02-20 11:38:44,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 1100 transitions, 16015 flow [2024-02-20 11:38:44,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:38:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:38:44,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2024-02-20 11:38:44,559 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6311111111111111 [2024-02-20 11:38:44,562 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2024-02-20 11:38:44,562 INFO L507 AbstractCegarLoop]: Abstraction has has 69 places, 1100 transitions, 16015 flow [2024-02-20 11:38:44,562 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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:38:44,562 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:44,562 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:44,562 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-20 11:38:44,563 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-02-20 11:38:44,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:44,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1434970066, now seen corresponding path program 1 times [2024-02-20 11:38:44,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:44,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088140665] [2024-02-20 11:38:44,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:44,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:44,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:38:44,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:44,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088140665] [2024-02-20 11:38:44,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088140665] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:38:44,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:38:44,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:38:44,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981318049] [2024-02-20 11:38:44,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:38:44,681 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:38:44,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:44,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:38:44,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:38:44,683 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-20 11:38:44,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 1100 transitions, 16015 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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:38:44,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:44,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-20 11:38:44,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:46,808 INFO L124 PetriNetUnfolderBase]: 15011/18330 cut-off events. [2024-02-20 11:38:46,808 INFO L125 PetriNetUnfolderBase]: For 2097/2097 co-relation queries the response was YES. [2024-02-20 11:38:46,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148125 conditions, 18330 events. 15011/18330 cut-off events. For 2097/2097 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 66013 event pairs, 14 based on Foata normal form. 0/11250 useless extension candidates. Maximal degree in co-relation 142848. Up to 11718 conditions per place. [2024-02-20 11:38:46,886 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 1051 selfloop transitions, 97 changer transitions 367/1516 dead transitions. [2024-02-20 11:38:46,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 1516 transitions, 25037 flow [2024-02-20 11:38:46,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:38:46,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:38:46,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2024-02-20 11:38:46,888 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-02-20 11:38:46,888 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2024-02-20 11:38:46,888 INFO L507 AbstractCegarLoop]: Abstraction has has 73 places, 1516 transitions, 25037 flow [2024-02-20 11:38:46,889 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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:38:46,889 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:46,889 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:46,889 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-20 11:38:46,889 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-02-20 11:38:46,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:46,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1652136238, now seen corresponding path program 1 times [2024-02-20 11:38:46,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:46,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465791130] [2024-02-20 11:38:46,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:46,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:46,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:38:46,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:46,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465791130] [2024-02-20 11:38:46,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465791130] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:38:46,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:38:46,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:38:46,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473194481] [2024-02-20 11:38:46,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:38:46,966 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:38:46,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:46,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:38:46,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:38:46,967 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-20 11:38:46,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 1516 transitions, 25037 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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:38:46,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:46,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-20 11:38:46,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:49,006 INFO L124 PetriNetUnfolderBase]: 14665/17984 cut-off events. [2024-02-20 11:38:49,006 INFO L125 PetriNetUnfolderBase]: For 2095/2095 co-relation queries the response was YES. [2024-02-20 11:38:49,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163341 conditions, 17984 events. 14665/17984 cut-off events. For 2095/2095 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 65507 event pairs, 14 based on Foata normal form. 0/11250 useless extension candidates. Maximal degree in co-relation 157516. Up to 11372 conditions per place. [2024-02-20 11:38:49,273 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 1207 selfloop transitions, 65 changer transitions 611/1884 dead transitions. [2024-02-20 11:38:49,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 1884 transitions, 34859 flow [2024-02-20 11:38:49,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:38:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:38:49,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2024-02-20 11:38:49,275 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6622222222222223 [2024-02-20 11:38:49,275 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 26 predicate places. [2024-02-20 11:38:49,275 INFO L507 AbstractCegarLoop]: Abstraction has has 77 places, 1884 transitions, 34859 flow [2024-02-20 11:38:49,275 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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:38:49,276 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:49,276 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:49,276 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-20 11:38:49,276 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-02-20 11:38:49,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:49,277 INFO L85 PathProgramCache]: Analyzing trace with hash -859065302, now seen corresponding path program 2 times [2024-02-20 11:38:49,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:49,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047706024] [2024-02-20 11:38:49,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:49,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:49,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:38:49,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:49,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047706024] [2024-02-20 11:38:49,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047706024] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:38:49,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:38:49,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:38:49,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697276363] [2024-02-20 11:38:49,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:38:49,381 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:38:49,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:49,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:38:49,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:38:49,382 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-20 11:38:49,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 1884 transitions, 34859 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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:38:49,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:49,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-20 11:38:49,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:52,510 INFO L124 PetriNetUnfolderBase]: 16813/20568 cut-off events. [2024-02-20 11:38:52,511 INFO L125 PetriNetUnfolderBase]: For 2187/2187 co-relation queries the response was YES. [2024-02-20 11:38:52,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207345 conditions, 20568 events. 16813/20568 cut-off events. For 2187/2187 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 75448 event pairs, 14 based on Foata normal form. 0/12956 useless extension candidates. Maximal degree in co-relation 200112. Up to 13956 conditions per place. [2024-02-20 11:38:52,620 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 1507 selfloop transitions, 81 changer transitions 679/2268 dead transitions. [2024-02-20 11:38:52,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 2268 transitions, 46425 flow [2024-02-20 11:38:52,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:38:52,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:38:52,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2024-02-20 11:38:52,621 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6488888888888888 [2024-02-20 11:38:52,622 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 30 predicate places. [2024-02-20 11:38:52,622 INFO L507 AbstractCegarLoop]: Abstraction has has 81 places, 2268 transitions, 46425 flow [2024-02-20 11:38:52,622 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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:38:52,622 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:52,622 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:52,623 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-20 11:38:52,623 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-02-20 11:38:52,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:52,623 INFO L85 PathProgramCache]: Analyzing trace with hash 825021564, now seen corresponding path program 1 times [2024-02-20 11:38:52,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:52,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807247103] [2024-02-20 11:38:52,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:52,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:52,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-20 11:38:52,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:52,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807247103] [2024-02-20 11:38:52,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807247103] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:38:52,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139898963] [2024-02-20 11:38:52,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:52,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:38:52,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:38:52,701 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:38:52,719 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:38:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:52,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-20 11:38:52,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:38:52,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-20 11:38:52,960 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:38:53,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-20 11:38:53,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139898963] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:38:53,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:38:53,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-02-20 11:38:53,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9091082] [2024-02-20 11:38:53,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:38:53,069 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 11:38:53,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:53,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 11:38:53,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-20 11:38:53,069 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-20 11:38:53,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 2268 transitions, 46425 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 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:38:53,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:53,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-20 11:38:53,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:58,585 INFO L124 PetriNetUnfolderBase]: 24405/29972 cut-off events. [2024-02-20 11:38:58,585 INFO L125 PetriNetUnfolderBase]: For 3251/3251 co-relation queries the response was YES. [2024-02-20 11:38:58,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332121 conditions, 29972 events. 24405/29972 cut-off events. For 3251/3251 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 117573 event pairs, 18 based on Foata normal form. 1/19273 useless extension candidates. Maximal degree in co-relation 322792. Up to 21170 conditions per place. [2024-02-20 11:38:58,730 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 1789 selfloop transitions, 181 changer transitions 2165/4136 dead transitions. [2024-02-20 11:38:58,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 4136 transitions, 92955 flow [2024-02-20 11:38:58,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:38:58,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:38:58,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2024-02-20 11:38:58,732 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6755555555555556 [2024-02-20 11:38:58,732 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 34 predicate places. [2024-02-20 11:38:58,732 INFO L507 AbstractCegarLoop]: Abstraction has has 85 places, 4136 transitions, 92955 flow [2024-02-20 11:38:58,732 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 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:38:58,732 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:58,732 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:58,745 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:38:58,942 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,SelfDestructingSolverStorable9 [2024-02-20 11:38:58,961 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-02-20 11:38:58,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:58,962 INFO L85 PathProgramCache]: Analyzing trace with hash -454842114, now seen corresponding path program 1 times [2024-02-20 11:38:58,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:58,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600853292] [2024-02-20 11:38:58,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:58,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:59,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-20 11:38:59,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:59,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600853292] [2024-02-20 11:38:59,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600853292] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:38:59,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:38:59,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:38:59,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445818275] [2024-02-20 11:38:59,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:38:59,049 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:38:59,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:59,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:38:59,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:38:59,050 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-20 11:38:59,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 4136 transitions, 92955 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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:38:59,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:59,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-20 11:38:59,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:39:09,653 INFO L124 PetriNetUnfolderBase]: 28513/34928 cut-off events. [2024-02-20 11:39:09,653 INFO L125 PetriNetUnfolderBase]: For 3711/3711 co-relation queries the response was YES. [2024-02-20 11:39:09,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421917 conditions, 34928 events. 28513/34928 cut-off events. For 3711/3711 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 138399 event pairs, 18 based on Foata normal form. 0/22728 useless extension candidates. Maximal degree in co-relation 411760. Up to 26126 conditions per place. [2024-02-20 11:39:09,849 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 2501 selfloop transitions, 181 changer transitions 2385/5068 dead transitions. [2024-02-20 11:39:09,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 5068 transitions, 123977 flow [2024-02-20 11:39:09,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:39:09,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:39:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2024-02-20 11:39:09,851 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6311111111111111 [2024-02-20 11:39:09,851 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 38 predicate places. [2024-02-20 11:39:09,851 INFO L507 AbstractCegarLoop]: Abstraction has has 89 places, 5068 transitions, 123977 flow [2024-02-20 11:39:09,852 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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:39:09,852 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:39:09,852 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:39:09,852 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-20 11:39:09,852 INFO L432 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-02-20 11:39:09,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:39:09,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1658990292, now seen corresponding path program 1 times [2024-02-20 11:39:09,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:39:09,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339117988] [2024-02-20 11:39:09,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:39:09,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:39:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:39:09,919 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-20 11:39:09,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:39:09,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339117988] [2024-02-20 11:39:09,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339117988] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:39:09,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538638183] [2024-02-20 11:39:09,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:39:09,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:39:09,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:39:09,921 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:39:09,922 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:39:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:39:10,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-20 11:39:10,039 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:39:10,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-20 11:39:10,116 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:39:10,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-20 11:39:10,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538638183] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:39:10,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:39:10,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-02-20 11:39:10,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044836792] [2024-02-20 11:39:10,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:39:10,185 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 11:39:10,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:39:10,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 11:39:10,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-20 11:39:10,186 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-20 11:39:10,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 5068 transitions, 123977 flow. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:39:10,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:39:10,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-20 11:39:10,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:39:27,349 INFO L124 PetriNetUnfolderBase]: 38037/46754 cut-off events. [2024-02-20 11:39:27,349 INFO L125 PetriNetUnfolderBase]: For 5121/5121 co-relation queries the response was YES. [2024-02-20 11:39:27,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611065 conditions, 46754 events. 38037/46754 cut-off events. For 5121/5121 co-relation queries the response was YES. Maximal size of possible extension queue 1223. Compared 194911 event pairs, 18 based on Foata normal form. 1/30875 useless extension candidates. Maximal degree in co-relation 597932. Up to 35034 conditions per place. [2024-02-20 11:39:27,630 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 3017 selfloop transitions, 316 changer transitions 5372/8706 dead transitions. [2024-02-20 11:39:27,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 8706 transitions, 229965 flow [2024-02-20 11:39:27,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:39:27,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:39:27,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2024-02-20 11:39:27,632 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.64 [2024-02-20 11:39:27,632 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 42 predicate places. [2024-02-20 11:39:27,632 INFO L507 AbstractCegarLoop]: Abstraction has has 93 places, 8706 transitions, 229965 flow [2024-02-20 11:39:27,632 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:39:27,633 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:39:27,633 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:39:27,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-20 11:39:27,844 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,SelfDestructingSolverStorable11 [2024-02-20 11:39:27,844 INFO L432 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-02-20 11:39:27,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:39:27,845 INFO L85 PathProgramCache]: Analyzing trace with hash 849643666, now seen corresponding path program 1 times [2024-02-20 11:39:27,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:39:27,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039807090] [2024-02-20 11:39:27,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:39:27,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:39:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:39:27,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-20 11:39:27,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:39:27,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039807090] [2024-02-20 11:39:27,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039807090] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:39:27,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:39:27,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:39:27,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761544578] [2024-02-20 11:39:27,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:39:27,927 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:39:27,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:39:27,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:39:27,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:39:27,928 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-20 11:39:27,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 8706 transitions, 229965 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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:39:27,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:39:27,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-20 11:39:27,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:40:07,450 INFO L124 PetriNetUnfolderBase]: 43361/53214 cut-off events. [2024-02-20 11:40:07,450 INFO L125 PetriNetUnfolderBase]: For 5829/5829 co-relation queries the response was YES. [2024-02-20 11:40:07,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 748491 conditions, 53214 events. 43361/53214 cut-off events. For 5829/5829 co-relation queries the response was YES. Maximal size of possible extension queue 1342. Compared 222827 event pairs, 18 based on Foata normal form. 0/35494 useless extension candidates. Maximal degree in co-relation 733348. Up to 39878 conditions per place. [2024-02-20 11:40:08,059 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 4063 selfloop transitions, 316 changer transitions 6130/10510 dead transitions. [2024-02-20 11:40:08,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 10510 transitions, 298343 flow [2024-02-20 11:40:08,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:40:08,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:40:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-02-20 11:40:08,060 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2024-02-20 11:40:08,061 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 46 predicate places. [2024-02-20 11:40:08,061 INFO L507 AbstractCegarLoop]: Abstraction has has 97 places, 10510 transitions, 298343 flow [2024-02-20 11:40:08,061 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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:40:08,061 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:40:08,061 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:40:08,062 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-20 11:40:08,062 INFO L432 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-02-20 11:40:08,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:40:08,062 INFO L85 PathProgramCache]: Analyzing trace with hash -112316900, now seen corresponding path program 1 times [2024-02-20 11:40:08,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:40:08,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744636930] [2024-02-20 11:40:08,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:40:08,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:40:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:40:08,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-20 11:40:08,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:40:08,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744636930] [2024-02-20 11:40:08,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744636930] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:40:08,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658783573] [2024-02-20 11:40:08,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:40:08,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:40:08,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:40:08,501 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:40:08,501 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:40:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:40:08,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-20 11:40:08,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:40:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-20 11:40:22,453 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:40:23,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-20 11:40:23,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658783573] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:40:23,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:40:23,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 4] total 14 [2024-02-20 11:40:23,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326619657] [2024-02-20 11:40:23,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:40:23,841 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-20 11:40:23,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:40:23,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-20 11:40:23,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-02-20 11:40:23,842 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-20 11:40:23,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 10510 transitions, 298343 flow. Second operand has 15 states, 15 states have (on average 14.4) internal successors, (216), 15 states have internal predecessors, (216), 0 states have call successors, (0), 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:40:23,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:40:23,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-20 11:40:23,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:40:43,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:41:30,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:42:20,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:42:24,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:43:01,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []