./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 273a578a 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-273a578-m [2024-02-19 14:19:59,422 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 14:19:59,515 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 14:19:59,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 14:19:59,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 14:19:59,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 14:19:59,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 14:19:59,554 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 14:19:59,555 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 14:19:59,560 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 14:19:59,561 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 14:19:59,561 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 14:19:59,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 14:19:59,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 14:19:59,565 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 14:19:59,565 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 14:19:59,566 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 14:19:59,566 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 14:19:59,566 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 14:19:59,566 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 14:19:59,567 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 14:19:59,567 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 14:19:59,568 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 14:19:59,568 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 14:19:59,568 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 14:19:59,568 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 14:19:59,569 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 14:19:59,569 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 14:19:59,570 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 14:19:59,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 14:19:59,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 14:19:59,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 14:19:59,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:19:59,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 14:19:59,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 14:19:59,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 14:19:59,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 14:19:59,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 14:19:59,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 14:19:59,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 14:19:59,573 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 14:19:59,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 14:19:59,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 14:19:59,574 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-19 14:19:59,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 14:19:59,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 14:19:59,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 14:19:59,882 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 14:19:59,882 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 14:19:59,883 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-19 14:20:01,230 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 14:20:01,418 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 14:20:01,418 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2024-02-19 14:20:01,427 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59c1f52b8/08a946a52c764cd08d364361d739277f/FLAG35c4caaa4 [2024-02-19 14:20:01,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59c1f52b8/08a946a52c764cd08d364361d739277f [2024-02-19 14:20:01,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 14:20:01,448 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 14:20:01,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 14:20:01,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 14:20:01,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 14:20:01,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:20:01" (1/1) ... [2024-02-19 14:20:01,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@206bc700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:20:01, skipping insertion in model container [2024-02-19 14:20:01,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:20:01" (1/1) ... [2024-02-19 14:20:01,478 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 14:20:01,690 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-19 14:20:01,702 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:20:01,714 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 14:20:01,755 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-19 14:20:01,759 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:20:01,776 INFO L206 MainTranslator]: Completed translation [2024-02-19 14:20:01,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:20:01 WrapperNode [2024-02-19 14:20:01,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 14:20:01,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 14:20:01,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 14:20:01,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 14:20:01,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:20:01" (1/1) ... [2024-02-19 14:20:01,804 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:20:01" (1/1) ... [2024-02-19 14:20:01,836 INFO L138 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 131 [2024-02-19 14:20:01,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 14:20:01,838 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 14:20:01,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 14:20:01,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 14:20:01,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:20:01" (1/1) ... [2024-02-19 14:20:01,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:20:01" (1/1) ... [2024-02-19 14:20:01,867 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:20:01" (1/1) ... [2024-02-19 14:20:01,893 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-19 14:20:01,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:20:01" (1/1) ... [2024-02-19 14:20:01,894 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:20:01" (1/1) ... [2024-02-19 14:20:01,905 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:20:01" (1/1) ... [2024-02-19 14:20:01,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:20:01" (1/1) ... [2024-02-19 14:20:01,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:20:01" (1/1) ... [2024-02-19 14:20:01,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:20:01" (1/1) ... [2024-02-19 14:20:01,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 14:20:01,924 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 14:20:01,924 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 14:20:01,924 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 14:20:01,925 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:20:01" (1/1) ... [2024-02-19 14:20:01,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:20:01,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:20:01,959 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-19 14:20:01,967 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-19 14:20:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 14:20:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 14:20:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 14:20:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 14:20:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 14:20:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-19 14:20:02,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-19 14:20:02,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-02-19 14:20:02,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-02-19 14:20:02,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 14:20:02,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 14:20:02,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 14:20:02,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-19 14:20:02,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-19 14:20:02,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-02-19 14:20:02,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-02-19 14:20:02,021 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 14:20:02,021 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 14:20:02,021 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 14:20:02,021 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 14:20:02,021 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-19 14:20:02,021 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-19 14:20:02,022 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-02-19 14:20:02,024 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-02-19 14:20:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 14:20:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 14:20:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 14:20:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-19 14:20:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-19 14:20:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-02-19 14:20:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-02-19 14:20:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-02-19 14:20:02,026 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-02-19 14:20:02,027 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-02-19 14:20:02,027 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-02-19 14:20:02,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 14:20:02,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 14:20:02,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 14:20:02,029 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 14:20:02,138 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 14:20:02,141 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 14:20:02,398 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 14:20:02,398 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 14:20:02,642 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 14:20:02,642 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-02-19 14:20:02,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:20:02 BoogieIcfgContainer [2024-02-19 14:20:02,643 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 14:20:02,644 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 14:20:02,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 14:20:02,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 14:20:02,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 02:20:01" (1/3) ... [2024-02-19 14:20:02,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4091ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:20:02, skipping insertion in model container [2024-02-19 14:20:02,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:20:01" (2/3) ... [2024-02-19 14:20:02,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4091ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:20:02, skipping insertion in model container [2024-02-19 14:20:02,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:20:02" (3/3) ... [2024-02-19 14:20:02,650 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2024-02-19 14:20:02,666 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 14:20:02,666 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 14:20:02,667 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 14:20:02,746 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-02-19 14:20:02,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 45 transitions, 132 flow [2024-02-19 14:20:02,837 INFO L124 PetriNetUnfolderBase]: 6/39 cut-off events. [2024-02-19 14:20:02,837 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-02-19 14:20:02,841 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-19 14:20:02,842 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 45 transitions, 132 flow [2024-02-19 14:20:02,845 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 38 transitions, 112 flow [2024-02-19 14:20:02,859 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:20:02,870 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;@c911516, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:20:02,870 INFO L370 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-02-19 14:20:02,891 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:20:02,891 INFO L124 PetriNetUnfolderBase]: 6/37 cut-off events. [2024-02-19 14:20:02,892 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-02-19 14:20:02,892 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:20:02,893 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-19 14:20:02,893 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-19 14:20:02,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:20:02,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1659576246, now seen corresponding path program 1 times [2024-02-19 14:20:02,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:20:02,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399505177] [2024-02-19 14:20:02,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:20:02,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:20:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:20:03,483 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-19 14:20:03,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:20:03,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399505177] [2024-02-19 14:20:03,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399505177] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:20:03,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:20:03,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:20:03,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150169362] [2024-02-19 14:20:03,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:20:03,496 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:20:03,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:20:03,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:20:03,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:20:03,532 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-19 14:20:03,534 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-19 14:20:03,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:20:03,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-19 14:20:03,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:20:04,066 INFO L124 PetriNetUnfolderBase]: 3277/3974 cut-off events. [2024-02-19 14:20:04,066 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-02-19 14:20:04,075 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-19 14:20:04,094 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 59 selfloop transitions, 3 changer transitions 1/64 dead transitions. [2024-02-19 14:20:04,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 64 transitions, 311 flow [2024-02-19 14:20:04,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:20:04,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:20:04,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-02-19 14:20:04,109 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2024-02-19 14:20:04,113 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2024-02-19 14:20:04,113 INFO L507 AbstractCegarLoop]: Abstraction has has 53 places, 64 transitions, 311 flow [2024-02-19 14:20:04,114 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-19 14:20:04,114 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:20:04,114 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-19 14:20:04,114 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 14:20:04,115 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-19 14:20:04,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:20:04,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1700037346, now seen corresponding path program 1 times [2024-02-19 14:20:04,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:20:04,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505931123] [2024-02-19 14:20:04,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:20:04,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:20:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:20:04,351 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-19 14:20:04,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:20:04,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505931123] [2024-02-19 14:20:04,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505931123] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:20:04,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:20:04,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:20:04,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657276253] [2024-02-19 14:20:04,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:20:04,355 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:20:04,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:20:04,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:20:04,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:20:04,358 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-19 14:20:04,358 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-19 14:20:04,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:20:04,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-19 14:20:04,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:20:05,062 INFO L124 PetriNetUnfolderBase]: 6553/7944 cut-off events. [2024-02-19 14:20:05,062 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2024-02-19 14:20:05,075 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-19 14:20:05,113 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 99 selfloop transitions, 5 changer transitions 19/124 dead transitions. [2024-02-19 14:20:05,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 124 transitions, 851 flow [2024-02-19 14:20:05,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:20:05,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:20:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-02-19 14:20:05,116 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2024-02-19 14:20:05,117 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2024-02-19 14:20:05,117 INFO L507 AbstractCegarLoop]: Abstraction has has 55 places, 124 transitions, 851 flow [2024-02-19 14:20:05,117 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-19 14:20:05,117 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:20:05,118 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-19 14:20:05,118 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 14:20:05,118 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-19 14:20:05,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:20:05,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1754056490, now seen corresponding path program 1 times [2024-02-19 14:20:05,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:20:05,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089625042] [2024-02-19 14:20:05,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:20:05,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:20:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:20:05,300 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-19 14:20:05,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:20:05,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089625042] [2024-02-19 14:20:05,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089625042] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:20:05,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:20:05,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:20:05,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448537934] [2024-02-19 14:20:05,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:20:05,302 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:20:05,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:20:05,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:20:05,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:20:05,303 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-19 14:20:05,303 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-19 14:20:05,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:20:05,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-19 14:20:05,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:20:06,683 INFO L124 PetriNetUnfolderBase]: 13065/15820 cut-off events. [2024-02-19 14:20:06,683 INFO L125 PetriNetUnfolderBase]: For 1519/1519 co-relation queries the response was YES. [2024-02-19 14:20:06,709 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-19 14:20:06,857 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 179 selfloop transitions, 9 changer transitions 47/236 dead transitions. [2024-02-19 14:20:06,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 236 transitions, 2089 flow [2024-02-19 14:20:06,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:20:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:20:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-02-19 14:20:06,859 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6592592592592592 [2024-02-19 14:20:06,860 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2024-02-19 14:20:06,860 INFO L507 AbstractCegarLoop]: Abstraction has has 57 places, 236 transitions, 2089 flow [2024-02-19 14:20:06,861 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-19 14:20:06,861 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:20:06,861 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-19 14:20:06,861 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-19 14:20:06,862 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-19 14:20:06,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:20:06,862 INFO L85 PathProgramCache]: Analyzing trace with hash -268922874, now seen corresponding path program 1 times [2024-02-19 14:20:06,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:20:06,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962905021] [2024-02-19 14:20:06,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:20:06,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:20:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:20:06,990 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-19 14:20:06,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:20:06,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962905021] [2024-02-19 14:20:06,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962905021] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:20:06,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:20:06,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:20:06,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844441666] [2024-02-19 14:20:06,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:20:06,992 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:20:06,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:20:06,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:20:06,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:20:06,993 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-19 14:20:06,994 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-19 14:20:06,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:20:06,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-19 14:20:06,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:20:08,464 INFO L124 PetriNetUnfolderBase]: 12847/15602 cut-off events. [2024-02-19 14:20:08,464 INFO L125 PetriNetUnfolderBase]: For 1606/1606 co-relation queries the response was YES. [2024-02-19 14:20:08,486 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-19 14:20:08,548 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 287 selfloop transitions, 21 changer transitions 59/368 dead transitions. [2024-02-19 14:20:08,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 368 transitions, 3939 flow [2024-02-19 14:20:08,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:20:08,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:20:08,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2024-02-19 14:20:08,552 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-02-19 14:20:08,554 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2024-02-19 14:20:08,554 INFO L507 AbstractCegarLoop]: Abstraction has has 61 places, 368 transitions, 3939 flow [2024-02-19 14:20:08,554 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-19 14:20:08,554 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:20:08,555 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-19 14:20:08,555 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-19 14:20:08,555 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-19 14:20:08,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:20:08,556 INFO L85 PathProgramCache]: Analyzing trace with hash 712336044, now seen corresponding path program 2 times [2024-02-19 14:20:08,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:20:08,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934805069] [2024-02-19 14:20:08,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:20:08,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:20:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:20:08,714 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-19 14:20:08,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:20:08,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934805069] [2024-02-19 14:20:08,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934805069] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:20:08,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:20:08,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:20:08,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938705581] [2024-02-19 14:20:08,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:20:08,717 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:20:08,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:20:08,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:20:08,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:20:08,719 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-19 14:20:08,719 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-19 14:20:08,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:20:08,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-19 14:20:08,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:20:09,946 INFO L124 PetriNetUnfolderBase]: 12511/15266 cut-off events. [2024-02-19 14:20:09,947 INFO L125 PetriNetUnfolderBase]: For 1735/1735 co-relation queries the response was YES. [2024-02-19 14:20:09,962 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-19 14:20:10,021 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 475 selfloop transitions, 41 changer transitions 119/636 dead transitions. [2024-02-19 14:20:10,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 636 transitions, 8033 flow [2024-02-19 14:20:10,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:20:10,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:20:10,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2024-02-19 14:20:10,023 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6488888888888888 [2024-02-19 14:20:10,023 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2024-02-19 14:20:10,024 INFO L507 AbstractCegarLoop]: Abstraction has has 65 places, 636 transitions, 8033 flow [2024-02-19 14:20:10,024 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-19 14:20:10,024 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:20:10,024 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-19 14:20:10,024 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-19 14:20:10,025 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-19 14:20:10,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:20:10,025 INFO L85 PathProgramCache]: Analyzing trace with hash 65568082, now seen corresponding path program 1 times [2024-02-19 14:20:10,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:20:10,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454486012] [2024-02-19 14:20:10,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:20:10,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:20:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:20:10,141 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-19 14:20:10,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:20:10,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454486012] [2024-02-19 14:20:10,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454486012] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:20:10,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:20:10,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:20:10,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892306220] [2024-02-19 14:20:10,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:20:10,143 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:20:10,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:20:10,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:20:10,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:20:10,144 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-19 14:20:10,144 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-19 14:20:10,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:20:10,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-19 14:20:10,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:20:11,548 INFO L124 PetriNetUnfolderBase]: 12255/15010 cut-off events. [2024-02-19 14:20:11,548 INFO L125 PetriNetUnfolderBase]: For 1813/1813 co-relation queries the response was YES. [2024-02-19 14:20:11,564 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-19 14:20:11,619 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 719 selfloop transitions, 81 changer transitions 299/1100 dead transitions. [2024-02-19 14:20:11,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 1100 transitions, 16015 flow [2024-02-19 14:20:11,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:20:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:20:11,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2024-02-19 14:20:11,621 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6311111111111111 [2024-02-19 14:20:11,622 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2024-02-19 14:20:11,622 INFO L507 AbstractCegarLoop]: Abstraction has has 69 places, 1100 transitions, 16015 flow [2024-02-19 14:20:11,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-19 14:20:11,622 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:20:11,623 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-19 14:20:11,623 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-19 14:20:11,623 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-19 14:20:11,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:20:11,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1434970066, now seen corresponding path program 1 times [2024-02-19 14:20:11,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:20:11,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994828344] [2024-02-19 14:20:11,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:20:11,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:20:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:20:11,742 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-19 14:20:11,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:20:11,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994828344] [2024-02-19 14:20:11,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994828344] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:20:11,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:20:11,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:20:11,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285875188] [2024-02-19 14:20:11,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:20:11,747 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:20:11,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:20:11,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:20:11,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:20:11,749 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-19 14:20:11,749 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-19 14:20:11,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:20:11,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-19 14:20:11,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:20:13,931 INFO L124 PetriNetUnfolderBase]: 15011/18330 cut-off events. [2024-02-19 14:20:13,931 INFO L125 PetriNetUnfolderBase]: For 2097/2097 co-relation queries the response was YES. [2024-02-19 14:20:13,951 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-19 14:20:14,026 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 1051 selfloop transitions, 97 changer transitions 367/1516 dead transitions. [2024-02-19 14:20:14,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 1516 transitions, 25037 flow [2024-02-19 14:20:14,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:20:14,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:20:14,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2024-02-19 14:20:14,028 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-02-19 14:20:14,029 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2024-02-19 14:20:14,029 INFO L507 AbstractCegarLoop]: Abstraction has has 73 places, 1516 transitions, 25037 flow [2024-02-19 14:20:14,029 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-19 14:20:14,030 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:20:14,030 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-19 14:20:14,030 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-19 14:20:14,030 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-19 14:20:14,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:20:14,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1652136238, now seen corresponding path program 1 times [2024-02-19 14:20:14,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:20:14,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094240927] [2024-02-19 14:20:14,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:20:14,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:20:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:20:14,131 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-19 14:20:14,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:20:14,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094240927] [2024-02-19 14:20:14,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094240927] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:20:14,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:20:14,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:20:14,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534562088] [2024-02-19 14:20:14,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:20:14,133 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:20:14,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:20:14,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:20:14,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:20:14,134 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-19 14:20:14,134 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-19 14:20:14,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:20:14,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-19 14:20:14,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:20:16,557 INFO L124 PetriNetUnfolderBase]: 14665/17984 cut-off events. [2024-02-19 14:20:16,557 INFO L125 PetriNetUnfolderBase]: For 2095/2095 co-relation queries the response was YES. [2024-02-19 14:20:16,591 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-19 14:20:16,655 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 1207 selfloop transitions, 65 changer transitions 611/1884 dead transitions. [2024-02-19 14:20:16,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 1884 transitions, 34859 flow [2024-02-19 14:20:16,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:20:16,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:20:16,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2024-02-19 14:20:16,657 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6622222222222223 [2024-02-19 14:20:16,657 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 26 predicate places. [2024-02-19 14:20:16,658 INFO L507 AbstractCegarLoop]: Abstraction has has 77 places, 1884 transitions, 34859 flow [2024-02-19 14:20:16,658 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-19 14:20:16,658 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:20:16,658 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-19 14:20:16,658 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-19 14:20:16,659 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-19 14:20:16,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:20:16,659 INFO L85 PathProgramCache]: Analyzing trace with hash -859065302, now seen corresponding path program 2 times [2024-02-19 14:20:16,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:20:16,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123006007] [2024-02-19 14:20:16,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:20:16,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:20:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:20:16,752 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-19 14:20:16,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:20:16,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123006007] [2024-02-19 14:20:16,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123006007] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:20:16,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:20:16,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:20:16,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711988139] [2024-02-19 14:20:16,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:20:16,754 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:20:16,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:20:16,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:20:16,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:20:16,755 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-19 14:20:16,755 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-19 14:20:16,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:20:16,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-19 14:20:16,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:20:20,278 INFO L124 PetriNetUnfolderBase]: 16813/20568 cut-off events. [2024-02-19 14:20:20,278 INFO L125 PetriNetUnfolderBase]: For 2187/2187 co-relation queries the response was YES. [2024-02-19 14:20:20,300 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-19 14:20:20,378 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 1507 selfloop transitions, 81 changer transitions 679/2268 dead transitions. [2024-02-19 14:20:20,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 2268 transitions, 46425 flow [2024-02-19 14:20:20,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:20:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:20:20,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2024-02-19 14:20:20,379 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6488888888888888 [2024-02-19 14:20:20,380 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 30 predicate places. [2024-02-19 14:20:20,380 INFO L507 AbstractCegarLoop]: Abstraction has has 81 places, 2268 transitions, 46425 flow [2024-02-19 14:20:20,380 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-19 14:20:20,380 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:20:20,380 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-19 14:20:20,380 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-19 14:20:20,381 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-19 14:20:20,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:20:20,381 INFO L85 PathProgramCache]: Analyzing trace with hash 825021564, now seen corresponding path program 1 times [2024-02-19 14:20:20,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:20:20,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473593246] [2024-02-19 14:20:20,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:20:20,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:20:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:20:20,649 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-19 14:20:20,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:20:20,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473593246] [2024-02-19 14:20:20,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473593246] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:20:20,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049857374] [2024-02-19 14:20:20,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:20:20,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:20:20,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:20:20,660 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-19 14:20:20,683 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-19 14:20:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:20:20,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-19 14:20:20,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:20:20,967 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-19 14:20:20,968 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:20:21,075 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-19 14:20:21,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049857374] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:20:21,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:20:21,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-02-19 14:20:21,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223387819] [2024-02-19 14:20:21,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:20:21,077 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 14:20:21,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:20:21,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 14:20:21,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 14:20:21,079 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-19 14:20:21,079 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-19 14:20:21,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:20:21,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-19 14:20:21,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:20:26,623 INFO L124 PetriNetUnfolderBase]: 24405/29972 cut-off events. [2024-02-19 14:20:26,623 INFO L125 PetriNetUnfolderBase]: For 3251/3251 co-relation queries the response was YES. [2024-02-19 14:20:26,667 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-19 14:20:26,786 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 1789 selfloop transitions, 181 changer transitions 2165/4136 dead transitions. [2024-02-19 14:20:26,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 4136 transitions, 92955 flow [2024-02-19 14:20:26,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:20:26,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:20:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2024-02-19 14:20:26,793 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6755555555555556 [2024-02-19 14:20:26,793 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 34 predicate places. [2024-02-19 14:20:26,793 INFO L507 AbstractCegarLoop]: Abstraction has has 85 places, 4136 transitions, 92955 flow [2024-02-19 14:20:26,793 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-19 14:20:26,793 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:20:26,794 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-19 14:20:26,805 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-19 14:20:26,994 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-19 14:20:26,994 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-19 14:20:26,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:20:26,995 INFO L85 PathProgramCache]: Analyzing trace with hash -454842114, now seen corresponding path program 1 times [2024-02-19 14:20:26,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:20:26,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805896329] [2024-02-19 14:20:26,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:20:26,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:20:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:20:27,106 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-19 14:20:27,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:20:27,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805896329] [2024-02-19 14:20:27,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805896329] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:20:27,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:20:27,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:20:27,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101832162] [2024-02-19 14:20:27,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:20:27,108 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:20:27,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:20:27,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:20:27,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:20:27,110 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-19 14:20:27,110 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-19 14:20:27,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:20:27,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-19 14:20:27,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:20:37,619 INFO L124 PetriNetUnfolderBase]: 28513/34928 cut-off events. [2024-02-19 14:20:37,620 INFO L125 PetriNetUnfolderBase]: For 3711/3711 co-relation queries the response was YES. [2024-02-19 14:20:37,665 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-19 14:20:38,028 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 2501 selfloop transitions, 181 changer transitions 2385/5068 dead transitions. [2024-02-19 14:20:38,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 5068 transitions, 123977 flow [2024-02-19 14:20:38,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:20:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:20:38,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2024-02-19 14:20:38,029 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6311111111111111 [2024-02-19 14:20:38,030 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 38 predicate places. [2024-02-19 14:20:38,030 INFO L507 AbstractCegarLoop]: Abstraction has has 89 places, 5068 transitions, 123977 flow [2024-02-19 14:20:38,030 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-19 14:20:38,030 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:20:38,031 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-19 14:20:38,031 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-19 14:20:38,031 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-19 14:20:38,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:20:38,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1658990292, now seen corresponding path program 1 times [2024-02-19 14:20:38,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:20:38,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646822520] [2024-02-19 14:20:38,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:20:38,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:20:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:20:38,131 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-19 14:20:38,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:20:38,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646822520] [2024-02-19 14:20:38,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646822520] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:20:38,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418038477] [2024-02-19 14:20:38,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:20:38,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:20:38,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:20:38,134 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-19 14:20:38,136 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-19 14:20:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:20:38,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-19 14:20:38,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:20:38,388 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-19 14:20:38,388 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:20:38,490 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-19 14:20:38,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418038477] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:20:38,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:20:38,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-02-19 14:20:38,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587881745] [2024-02-19 14:20:38,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:20:38,492 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 14:20:38,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:20:38,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 14:20:38,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 14:20:38,493 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-19 14:20:38,493 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-19 14:20:38,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:20:38,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-19 14:20:38,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:20:56,769 INFO L124 PetriNetUnfolderBase]: 38037/46754 cut-off events. [2024-02-19 14:20:56,769 INFO L125 PetriNetUnfolderBase]: For 5121/5121 co-relation queries the response was YES. [2024-02-19 14:20:56,903 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-19 14:20:57,139 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 3017 selfloop transitions, 316 changer transitions 5372/8706 dead transitions. [2024-02-19 14:20:57,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 8706 transitions, 229965 flow [2024-02-19 14:20:57,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:20:57,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:20:57,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2024-02-19 14:20:57,141 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.64 [2024-02-19 14:20:57,142 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 42 predicate places. [2024-02-19 14:20:57,142 INFO L507 AbstractCegarLoop]: Abstraction has has 93 places, 8706 transitions, 229965 flow [2024-02-19 14:20:57,143 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-19 14:20:57,143 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:20:57,143 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-19 14:20:57,156 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-19 14:20:57,348 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-19 14:20:57,348 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-19 14:20:57,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:20:57,349 INFO L85 PathProgramCache]: Analyzing trace with hash 849643666, now seen corresponding path program 1 times [2024-02-19 14:20:57,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:20:57,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942284901] [2024-02-19 14:20:57,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:20:57,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:20:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:20:57,466 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-19 14:20:57,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:20:57,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942284901] [2024-02-19 14:20:57,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942284901] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:20:57,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:20:57,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:20:57,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667421129] [2024-02-19 14:20:57,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:20:57,467 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:20:57,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:20:57,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:20:57,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:20:57,469 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-19 14:20:57,469 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-19 14:20:57,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:20:57,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-19 14:20:57,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:21:37,446 INFO L124 PetriNetUnfolderBase]: 43361/53214 cut-off events. [2024-02-19 14:21:37,447 INFO L125 PetriNetUnfolderBase]: For 5829/5829 co-relation queries the response was YES. [2024-02-19 14:21:37,575 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-19 14:21:38,015 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 4063 selfloop transitions, 316 changer transitions 6130/10510 dead transitions. [2024-02-19 14:21:38,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 10510 transitions, 298343 flow [2024-02-19 14:21:38,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:21:38,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:21:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-02-19 14:21:38,016 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2024-02-19 14:21:38,017 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, 46 predicate places. [2024-02-19 14:21:38,017 INFO L507 AbstractCegarLoop]: Abstraction has has 97 places, 10510 transitions, 298343 flow [2024-02-19 14:21:38,017 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-19 14:21:38,018 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:21:38,018 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-19 14:21:38,018 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-19 14:21:38,018 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-19 14:21:38,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:21:38,018 INFO L85 PathProgramCache]: Analyzing trace with hash -112316900, now seen corresponding path program 1 times [2024-02-19 14:21:38,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:21:38,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266831730] [2024-02-19 14:21:38,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:21:38,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:21:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:21:38,590 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-19 14:21:38,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:21:38,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266831730] [2024-02-19 14:21:38,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266831730] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:21:38,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417656279] [2024-02-19 14:21:38,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:21:38,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:21:38,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:21:38,592 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-19 14:21:38,593 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-19 14:21:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:21:39,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 14:21:39,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:21:41,517 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-19 14:21:41,518 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:21:42,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 14:21:42,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417656279] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:21:42,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:21:42,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 15 [2024-02-19 14:21:42,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276058998] [2024-02-19 14:21:42,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:21:42,224 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-19 14:21:42,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:21:42,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-19 14:21:42,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-02-19 14:21:42,226 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2024-02-19 14:21:42,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 10510 transitions, 298343 flow. Second operand has 16 states, 16 states have (on average 13.125) internal successors, (210), 16 states have internal predecessors, (210), 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-19 14:21:42,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:21:42,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2024-02-19 14:21:42,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:21:53,127 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 []