./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/bench-exp2x3.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7c74aec 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/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/bench-exp2x3.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.fix-undeclared-acsl-variable-e7c74ae-m [2024-02-07 19:08:11,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 19:08:11,389 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 19:08:11,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 19:08:11,394 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 19:08:11,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 19:08:11,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 19:08:11,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 19:08:11,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 19:08:11,414 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 19:08:11,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 19:08:11,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 19:08:11,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 19:08:11,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 19:08:11,416 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 19:08:11,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 19:08:11,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 19:08:11,417 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 19:08:11,417 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 19:08:11,419 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 19:08:11,419 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 19:08:11,423 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 19:08:11,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 19:08:11,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 19:08:11,423 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 19:08:11,424 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 19:08:11,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 19:08:11,424 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 19:08:11,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 19:08:11,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 19:08:11,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 19:08:11,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 19:08:11,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:08:11,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 19:08:11,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 19:08:11,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 19:08:11,428 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 19:08:11,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 19:08:11,428 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 19:08:11,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 19:08:11,429 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 19:08:11,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 19:08:11,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 19:08:11,430 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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-02-07 19:08:11,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 19:08:11,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 19:08:11,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 19:08:11,691 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 19:08:11,693 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 19:08:11,694 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/bench-exp2x3.wvr.yml/witness.yml [2024-02-07 19:08:11,761 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 19:08:11,762 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 19:08:11,764 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2024-02-07 19:08:12,911 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 19:08:13,079 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 19:08:13,079 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2024-02-07 19:08:13,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00972cbe2/6462100a47d1433bb75370f28f16a5cc/FLAGbb9d5bdbd [2024-02-07 19:08:13,101 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00972cbe2/6462100a47d1433bb75370f28f16a5cc [2024-02-07 19:08:13,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 19:08:13,102 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 19:08:13,103 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 19:08:13,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 19:08:13,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 19:08:13,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:08:11" (1/2) ... [2024-02-07 19:08:13,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a528970 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:08:13, skipping insertion in model container [2024-02-07 19:08:13,113 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:08:11" (1/2) ... [2024-02-07 19:08:13,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@699554ee and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:08:13, skipping insertion in model container [2024-02-07 19:08:13,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:08:13" (2/2) ... [2024-02-07 19:08:13,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a528970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:13, skipping insertion in model container [2024-02-07 19:08:13,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:08:13" (2/2) ... [2024-02-07 19:08:13,115 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 19:08:13,137 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 19:08:13,138 INFO L76 edCorrectnessWitness]: Location invariant before [L73-L73] ((((0LL - (long long )n) + (long long )x1 >= 0LL) && ((long long )n + (long long )x1 >= 0LL)) && ((0LL - (long long )n) - (long long )x1 >= 0LL)) && ((long long )n - (long long )x1 >= 0LL) [2024-02-07 19:08:13,159 INFO L181 MainTranslator]: Built tables and reachable declarations [2024-02-07 19:08:13,338 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-exp2x3.wvr.c[2289,2302] [2024-02-07 19:08:13,346 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:08:13,355 INFO L206 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 19:08:13,415 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-exp2x3.wvr.c[2289,2302] [2024-02-07 19:08:13,417 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:08:13,430 INFO L211 MainTranslator]: Completed translation [2024-02-07 19:08:13,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:13 WrapperNode [2024-02-07 19:08:13,430 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 19:08:13,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 19:08:13,432 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 19:08:13,432 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 19:08:13,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:13" (1/1) ... [2024-02-07 19:08:13,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:13" (1/1) ... [2024-02-07 19:08:13,472 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2024-02-07 19:08:13,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 19:08:13,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 19:08:13,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 19:08:13,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 19:08:13,489 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:13" (1/1) ... [2024-02-07 19:08:13,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:13" (1/1) ... [2024-02-07 19:08:13,492 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:13" (1/1) ... [2024-02-07 19:08:13,507 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-02-07 19:08:13,508 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:13" (1/1) ... [2024-02-07 19:08:13,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:13" (1/1) ... [2024-02-07 19:08:13,513 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:13" (1/1) ... [2024-02-07 19:08:13,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:13" (1/1) ... [2024-02-07 19:08:13,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:13" (1/1) ... [2024-02-07 19:08:13,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:13" (1/1) ... [2024-02-07 19:08:13,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 19:08:13,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 19:08:13,525 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 19:08:13,525 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 19:08:13,526 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:13" (1/1) ... [2024-02-07 19:08:13,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:08:13,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:08:13,557 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-07 19:08:13,604 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-07 19:08:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 19:08:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-07 19:08:13,633 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-07 19:08:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-07 19:08:13,634 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-07 19:08:13,634 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-07 19:08:13,634 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-07 19:08:13,634 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-02-07 19:08:13,634 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-02-07 19:08:13,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 19:08:13,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 19:08:13,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 19:08:13,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 19:08:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-07 19:08:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 19:08:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 19:08:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 19:08:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 19:08:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 19:08:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-07 19:08:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 19:08:13,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 19:08:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-07 19:08:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-07 19:08:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-07 19:08:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-07 19:08:13,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-07 19:08:13,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 19:08:13,641 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-07 19:08:13,764 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 19:08:13,766 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 19:08:14,125 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 19:08:14,125 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 19:08:14,264 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 19:08:14,264 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-07 19:08:14,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:08:14 BoogieIcfgContainer [2024-02-07 19:08:14,265 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 19:08:14,268 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 19:08:14,268 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 19:08:14,271 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 19:08:14,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:08:11" (1/4) ... [2024-02-07 19:08:14,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6520187a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:08:14, skipping insertion in model container [2024-02-07 19:08:14,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 07:08:13" (2/4) ... [2024-02-07 19:08:14,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6520187a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:08:14, skipping insertion in model container [2024-02-07 19:08:14,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:13" (3/4) ... [2024-02-07 19:08:14,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6520187a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:08:14, skipping insertion in model container [2024-02-07 19:08:14,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:08:14" (4/4) ... [2024-02-07 19:08:14,274 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2024-02-07 19:08:14,293 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 19:08:14,294 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-02-07 19:08:14,294 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 19:08:14,361 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-07 19:08:14,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 102 flow [2024-02-07 19:08:14,436 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2024-02-07 19:08:14,437 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-07 19:08:14,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 33 events. 4/33 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2024-02-07 19:08:14,439 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 37 transitions, 102 flow [2024-02-07 19:08:14,442 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 32 transitions, 88 flow [2024-02-07 19:08:14,455 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 19:08:14,461 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@cd86022, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 19:08:14,462 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-02-07 19:08:14,471 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 19:08:14,472 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-07 19:08:14,472 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:08:14,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:08:14,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-07 19:08:14,474 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:08:14,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:08:14,480 INFO L85 PathProgramCache]: Analyzing trace with hash 10455, now seen corresponding path program 1 times [2024-02-07 19:08:14,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:08:14,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043790900] [2024-02-07 19:08:14,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:08:14,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:08:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:08:14,877 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-07 19:08:14,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:08:14,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043790900] [2024-02-07 19:08:14,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043790900] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:08:14,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:08:14,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:08:14,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327458207] [2024-02-07 19:08:14,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:08:14,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:08:14,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:08:14,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:08:14,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:08:14,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-02-07 19:08:14,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-07 19:08:14,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:08:14,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-02-07 19:08:14,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:08:15,261 INFO L124 PetriNetUnfolderBase]: 1116/1439 cut-off events. [2024-02-07 19:08:15,262 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-02-07 19:08:15,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2964 conditions, 1439 events. 1116/1439 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4686 event pairs, 517 based on Foata normal form. 0/840 useless extension candidates. Maximal degree in co-relation 2205. Up to 1399 conditions per place. [2024-02-07 19:08:15,274 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 24 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2024-02-07 19:08:15,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 138 flow [2024-02-07 19:08:15,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:08:15,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:08:15,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2024-02-07 19:08:15,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-02-07 19:08:15,286 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 88 flow. Second operand 3 states and 54 transitions. [2024-02-07 19:08:15,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 138 flow [2024-02-07 19:08:15,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-02-07 19:08:15,293 INFO L231 Difference]: Finished difference. Result has 34 places, 31 transitions, 74 flow [2024-02-07 19:08:15,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=34, PETRI_TRANSITIONS=31} [2024-02-07 19:08:15,297 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2024-02-07 19:08:15,297 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 31 transitions, 74 flow [2024-02-07 19:08:15,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-07 19:08:15,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:08:15,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:08:15,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 19:08:15,299 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:08:15,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:08:15,300 INFO L85 PathProgramCache]: Analyzing trace with hash 353569154, now seen corresponding path program 1 times [2024-02-07 19:08:15,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:08:15,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766123706] [2024-02-07 19:08:15,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:08:15,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:08:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:08:15,531 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-07 19:08:15,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:08:15,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766123706] [2024-02-07 19:08:15,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766123706] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:08:15,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:08:15,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:08:15,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982967456] [2024-02-07 19:08:15,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:08:15,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:08:15,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:08:15,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:08:15,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:08:15,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 19:08:15,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 74 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-07 19:08:15,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:08:15,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 19:08:15,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:08:15,712 INFO L124 PetriNetUnfolderBase]: 1537/1956 cut-off events. [2024-02-07 19:08:15,713 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-02-07 19:08:15,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3952 conditions, 1956 events. 1537/1956 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6367 event pairs, 141 based on Foata normal form. 1/1140 useless extension candidates. Maximal degree in co-relation 3943. Up to 1733 conditions per place. [2024-02-07 19:08:15,754 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 42 selfloop transitions, 5 changer transitions 1/53 dead transitions. [2024-02-07 19:08:15,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 53 transitions, 221 flow [2024-02-07 19:08:15,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:08:15,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:08:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-02-07 19:08:15,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7117117117117117 [2024-02-07 19:08:15,760 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 74 flow. Second operand 3 states and 79 transitions. [2024-02-07 19:08:15,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 53 transitions, 221 flow [2024-02-07 19:08:15,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 53 transitions, 217 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:08:15,768 INFO L231 Difference]: Finished difference. Result has 35 places, 35 transitions, 103 flow [2024-02-07 19:08:15,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=35, PETRI_TRANSITIONS=35} [2024-02-07 19:08:15,769 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -6 predicate places. [2024-02-07 19:08:15,769 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 35 transitions, 103 flow [2024-02-07 19:08:15,770 INFO L496 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-07 19:08:15,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:08:15,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:08:15,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 19:08:15,770 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:08:15,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:08:15,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1679556793, now seen corresponding path program 1 times [2024-02-07 19:08:15,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:08:15,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273912421] [2024-02-07 19:08:15,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:08:15,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:08:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:08:15,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:15,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:08:15,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273912421] [2024-02-07 19:08:15,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273912421] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:08:15,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:08:15,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:08:15,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578366672] [2024-02-07 19:08:15,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:08:15,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:08:15,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:08:15,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:08:15,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:08:15,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 19:08:15,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 35 transitions, 103 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-07 19:08:15,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:08:15,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 19:08:15,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:08:16,176 INFO L124 PetriNetUnfolderBase]: 1837/2363 cut-off events. [2024-02-07 19:08:16,176 INFO L125 PetriNetUnfolderBase]: For 591/591 co-relation queries the response was YES. [2024-02-07 19:08:16,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5860 conditions, 2363 events. 1837/2363 cut-off events. For 591/591 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 8362 event pairs, 98 based on Foata normal form. 34/2395 useless extension candidates. Maximal degree in co-relation 1437. Up to 964 conditions per place. [2024-02-07 19:08:16,193 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 72 selfloop transitions, 11 changer transitions 0/88 dead transitions. [2024-02-07 19:08:16,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 88 transitions, 419 flow [2024-02-07 19:08:16,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:08:16,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:08:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2024-02-07 19:08:16,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6864864864864865 [2024-02-07 19:08:16,199 INFO L175 Difference]: Start difference. First operand has 35 places, 35 transitions, 103 flow. Second operand 5 states and 127 transitions. [2024-02-07 19:08:16,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 88 transitions, 419 flow [2024-02-07 19:08:16,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 88 transitions, 411 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:08:16,202 INFO L231 Difference]: Finished difference. Result has 40 places, 42 transitions, 167 flow [2024-02-07 19:08:16,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=40, PETRI_TRANSITIONS=42} [2024-02-07 19:08:16,204 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2024-02-07 19:08:16,204 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 42 transitions, 167 flow [2024-02-07 19:08:16,204 INFO L496 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-07 19:08:16,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:08:16,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:08:16,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 19:08:16,205 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:08:16,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:08:16,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1998766937, now seen corresponding path program 2 times [2024-02-07 19:08:16,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:08:16,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395387828] [2024-02-07 19:08:16,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:08:16,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:08:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:08:16,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:16,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:08:16,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395387828] [2024-02-07 19:08:16,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395387828] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:08:16,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:08:16,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:08:16,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360440390] [2024-02-07 19:08:16,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:08:16,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:08:16,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:08:16,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:08:16,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:08:16,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 19:08:16,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 42 transitions, 167 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-07 19:08:16,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:08:16,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 19:08:16,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:08:16,582 INFO L124 PetriNetUnfolderBase]: 1743/2279 cut-off events. [2024-02-07 19:08:16,582 INFO L125 PetriNetUnfolderBase]: For 1824/1824 co-relation queries the response was YES. [2024-02-07 19:08:16,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6840 conditions, 2279 events. 1743/2279 cut-off events. For 1824/1824 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 8534 event pairs, 365 based on Foata normal form. 70/2347 useless extension candidates. Maximal degree in co-relation 1731. Up to 1211 conditions per place. [2024-02-07 19:08:16,600 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 73 selfloop transitions, 10 changer transitions 0/88 dead transitions. [2024-02-07 19:08:16,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 88 transitions, 474 flow [2024-02-07 19:08:16,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:08:16,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:08:16,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2024-02-07 19:08:16,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6864864864864865 [2024-02-07 19:08:16,603 INFO L175 Difference]: Start difference. First operand has 40 places, 42 transitions, 167 flow. Second operand 5 states and 127 transitions. [2024-02-07 19:08:16,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 88 transitions, 474 flow [2024-02-07 19:08:16,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 88 transitions, 474 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 19:08:16,611 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 221 flow [2024-02-07 19:08:16,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2024-02-07 19:08:16,613 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2024-02-07 19:08:16,613 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 221 flow [2024-02-07 19:08:16,614 INFO L496 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-07 19:08:16,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:08:16,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:08:16,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 19:08:16,614 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:08:16,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:08:16,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1288452694, now seen corresponding path program 1 times [2024-02-07 19:08:16,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:08:16,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288925449] [2024-02-07 19:08:16,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:08:16,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:08:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:08:16,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:16,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:08:16,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288925449] [2024-02-07 19:08:16,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288925449] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:08:16,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:08:16,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:08:16,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876071079] [2024-02-07 19:08:16,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:08:16,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:08:16,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:08:16,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:08:16,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:08:16,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 19:08:16,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 221 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-07 19:08:16,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:08:16,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 19:08:16,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:08:17,003 INFO L124 PetriNetUnfolderBase]: 1709/2235 cut-off events. [2024-02-07 19:08:17,003 INFO L125 PetriNetUnfolderBase]: For 3477/3477 co-relation queries the response was YES. [2024-02-07 19:08:17,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7387 conditions, 2235 events. 1709/2235 cut-off events. For 3477/3477 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8343 event pairs, 118 based on Foata normal form. 58/2291 useless extension candidates. Maximal degree in co-relation 3826. Up to 906 conditions per place. [2024-02-07 19:08:17,025 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 75 selfloop transitions, 9 changer transitions 0/89 dead transitions. [2024-02-07 19:08:17,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 89 transitions, 510 flow [2024-02-07 19:08:17,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:08:17,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:08:17,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-02-07 19:08:17,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6810810810810811 [2024-02-07 19:08:17,027 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 221 flow. Second operand 5 states and 126 transitions. [2024-02-07 19:08:17,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 89 transitions, 510 flow [2024-02-07 19:08:17,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 89 transitions, 501 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-02-07 19:08:17,039 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 228 flow [2024-02-07 19:08:17,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=228, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2024-02-07 19:08:17,044 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2024-02-07 19:08:17,045 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 228 flow [2024-02-07 19:08:17,045 INFO L496 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-07 19:08:17,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:08:17,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:08:17,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 19:08:17,045 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:08:17,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:08:17,045 INFO L85 PathProgramCache]: Analyzing trace with hash -672897079, now seen corresponding path program 1 times [2024-02-07 19:08:17,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:08:17,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435992359] [2024-02-07 19:08:17,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:08:17,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:08:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:08:17,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:17,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:08:17,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435992359] [2024-02-07 19:08:17,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435992359] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:08:17,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092398433] [2024-02-07 19:08:17,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:08:17,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:08:17,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:08:17,169 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-07 19:08:17,208 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-07 19:08:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:08:17,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-07 19:08:17,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:08:17,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:17,515 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:08:17,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:17,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092398433] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:08:17,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:08:17,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-02-07 19:08:17,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027735651] [2024-02-07 19:08:17,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:08:17,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 19:08:17,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:08:17,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 19:08:17,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-07 19:08:17,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 19:08:17,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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-07 19:08:17,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:08:17,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 19:08:17,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:08:17,933 INFO L124 PetriNetUnfolderBase]: 2045/2783 cut-off events. [2024-02-07 19:08:17,933 INFO L125 PetriNetUnfolderBase]: For 7094/7094 co-relation queries the response was YES. [2024-02-07 19:08:17,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9834 conditions, 2783 events. 2045/2783 cut-off events. For 7094/7094 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 11711 event pairs, 323 based on Foata normal form. 80/2857 useless extension candidates. Maximal degree in co-relation 5006. Up to 1205 conditions per place. [2024-02-07 19:08:17,955 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 102 selfloop transitions, 9 changer transitions 0/116 dead transitions. [2024-02-07 19:08:17,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 116 transitions, 865 flow [2024-02-07 19:08:17,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 19:08:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 19:08:17,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2024-02-07 19:08:17,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6081081081081081 [2024-02-07 19:08:17,957 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 228 flow. Second operand 6 states and 135 transitions. [2024-02-07 19:08:17,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 116 transitions, 865 flow [2024-02-07 19:08:17,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 116 transitions, 830 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-02-07 19:08:17,963 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 272 flow [2024-02-07 19:08:17,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2024-02-07 19:08:17,966 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2024-02-07 19:08:17,966 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 272 flow [2024-02-07 19:08:17,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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-07 19:08:17,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:08:17,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:08:17,981 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-07 19:08:18,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-02-07 19:08:18,182 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:08:18,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:08:18,183 INFO L85 PathProgramCache]: Analyzing trace with hash -953106779, now seen corresponding path program 2 times [2024-02-07 19:08:18,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:08:18,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863461497] [2024-02-07 19:08:18,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:08:18,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:08:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:08:18,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:18,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:08:18,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863461497] [2024-02-07 19:08:18,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863461497] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:08:18,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:08:18,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:08:18,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233897068] [2024-02-07 19:08:18,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:08:18,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:08:18,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:08:18,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:08:18,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:08:18,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 19:08:18,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 272 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-07 19:08:18,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:08:18,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 19:08:18,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:08:18,543 INFO L124 PetriNetUnfolderBase]: 1843/2483 cut-off events. [2024-02-07 19:08:18,543 INFO L125 PetriNetUnfolderBase]: For 6828/6828 co-relation queries the response was YES. [2024-02-07 19:08:18,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10202 conditions, 2483 events. 1843/2483 cut-off events. For 6828/6828 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 9671 event pairs, 99 based on Foata normal form. 38/2515 useless extension candidates. Maximal degree in co-relation 6284. Up to 1018 conditions per place. [2024-02-07 19:08:18,566 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 102 selfloop transitions, 12 changer transitions 0/119 dead transitions. [2024-02-07 19:08:18,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 119 transitions, 906 flow [2024-02-07 19:08:18,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:08:18,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:08:18,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-02-07 19:08:18,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6648648648648648 [2024-02-07 19:08:18,568 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 272 flow. Second operand 5 states and 123 transitions. [2024-02-07 19:08:18,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 119 transitions, 906 flow [2024-02-07 19:08:18,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 119 transitions, 904 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:08:18,578 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 333 flow [2024-02-07 19:08:18,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=333, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2024-02-07 19:08:18,579 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2024-02-07 19:08:18,579 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 333 flow [2024-02-07 19:08:18,579 INFO L496 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-07 19:08:18,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:08:18,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:08:18,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 19:08:18,580 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:08:18,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:08:18,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1657779612, now seen corresponding path program 1 times [2024-02-07 19:08:18,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:08:18,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494364493] [2024-02-07 19:08:18,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:08:18,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:08:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:08:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:18,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:08:18,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494364493] [2024-02-07 19:08:18,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494364493] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:08:18,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:08:18,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:08:18,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197188340] [2024-02-07 19:08:18,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:08:18,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:08:18,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:08:18,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:08:18,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:08:18,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 19:08:18,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 333 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-07 19:08:18,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:08:18,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 19:08:18,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:08:18,922 INFO L124 PetriNetUnfolderBase]: 1801/2441 cut-off events. [2024-02-07 19:08:18,922 INFO L125 PetriNetUnfolderBase]: For 7852/7852 co-relation queries the response was YES. [2024-02-07 19:08:18,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10807 conditions, 2441 events. 1801/2441 cut-off events. For 7852/7852 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 9662 event pairs, 75 based on Foata normal form. 42/2477 useless extension candidates. Maximal degree in co-relation 6671. Up to 1137 conditions per place. [2024-02-07 19:08:18,939 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 99 selfloop transitions, 9 changer transitions 4/117 dead transitions. [2024-02-07 19:08:18,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 117 transitions, 919 flow [2024-02-07 19:08:18,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:08:18,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:08:18,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-02-07 19:08:18,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6594594594594595 [2024-02-07 19:08:18,941 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 333 flow. Second operand 5 states and 122 transitions. [2024-02-07 19:08:18,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 117 transitions, 919 flow [2024-02-07 19:08:18,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 117 transitions, 908 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-02-07 19:08:18,950 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 338 flow [2024-02-07 19:08:18,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=338, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2024-02-07 19:08:18,952 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2024-02-07 19:08:18,952 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 338 flow [2024-02-07 19:08:18,953 INFO L496 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-07 19:08:18,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:08:18,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:08:18,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 19:08:18,953 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:08:18,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:08:18,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1828671652, now seen corresponding path program 2 times [2024-02-07 19:08:18,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:08:18,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120525686] [2024-02-07 19:08:18,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:08:18,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:08:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:08:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:19,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:08:19,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120525686] [2024-02-07 19:08:19,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120525686] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:08:19,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:08:19,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:08:19,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117741133] [2024-02-07 19:08:19,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:08:19,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:08:19,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:08:19,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:08:19,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:08:19,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 19:08:19,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 338 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-07 19:08:19,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:08:19,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 19:08:19,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:08:19,409 INFO L124 PetriNetUnfolderBase]: 1725/2377 cut-off events. [2024-02-07 19:08:19,410 INFO L125 PetriNetUnfolderBase]: For 8241/8241 co-relation queries the response was YES. [2024-02-07 19:08:19,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10858 conditions, 2377 events. 1725/2377 cut-off events. For 8241/8241 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 9831 event pairs, 293 based on Foata normal form. 76/2447 useless extension candidates. Maximal degree in co-relation 6703. Up to 1307 conditions per place. [2024-02-07 19:08:19,432 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 102 selfloop transitions, 8 changer transitions 0/115 dead transitions. [2024-02-07 19:08:19,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 115 transitions, 937 flow [2024-02-07 19:08:19,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:08:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:08:19,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2024-02-07 19:08:19,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6432432432432432 [2024-02-07 19:08:19,434 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 338 flow. Second operand 5 states and 119 transitions. [2024-02-07 19:08:19,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 115 transitions, 937 flow [2024-02-07 19:08:19,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 115 transitions, 920 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-02-07 19:08:19,443 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 374 flow [2024-02-07 19:08:19,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=374, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2024-02-07 19:08:19,444 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places. [2024-02-07 19:08:19,444 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 374 flow [2024-02-07 19:08:19,444 INFO L496 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-07 19:08:19,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:08:19,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:08:19,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 19:08:19,445 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:08:19,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:08:19,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1079849732, now seen corresponding path program 2 times [2024-02-07 19:08:19,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:08:19,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528197632] [2024-02-07 19:08:19,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:08:19,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:08:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:08:19,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:19,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:08:19,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528197632] [2024-02-07 19:08:19,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528197632] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:08:19,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:08:19,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:08:19,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031688193] [2024-02-07 19:08:19,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:08:19,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:08:19,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:08:19,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:08:19,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:08:19,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 19:08:19,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 374 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-07 19:08:19,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:08:19,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 19:08:19,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:08:19,865 INFO L124 PetriNetUnfolderBase]: 1657/2292 cut-off events. [2024-02-07 19:08:19,865 INFO L125 PetriNetUnfolderBase]: For 8426/8442 co-relation queries the response was YES. [2024-02-07 19:08:19,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11009 conditions, 2292 events. 1657/2292 cut-off events. For 8426/8442 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9625 event pairs, 481 based on Foata normal form. 72/2362 useless extension candidates. Maximal degree in co-relation 9665. Up to 1331 conditions per place. [2024-02-07 19:08:19,887 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 118 selfloop transitions, 8 changer transitions 0/131 dead transitions. [2024-02-07 19:08:19,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 131 transitions, 1118 flow [2024-02-07 19:08:19,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:08:19,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:08:19,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-02-07 19:08:19,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6648648648648648 [2024-02-07 19:08:19,889 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 374 flow. Second operand 5 states and 123 transitions. [2024-02-07 19:08:19,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 131 transitions, 1118 flow [2024-02-07 19:08:19,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 131 transitions, 1060 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-02-07 19:08:19,906 INFO L231 Difference]: Finished difference. Result has 72 places, 59 transitions, 411 flow [2024-02-07 19:08:19,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=411, PETRI_PLACES=72, PETRI_TRANSITIONS=59} [2024-02-07 19:08:19,908 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places. [2024-02-07 19:08:19,908 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 59 transitions, 411 flow [2024-02-07 19:08:19,908 INFO L496 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-07 19:08:19,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:08:19,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:08:19,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 19:08:19,909 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:08:19,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:08:19,910 INFO L85 PathProgramCache]: Analyzing trace with hash -588724765, now seen corresponding path program 1 times [2024-02-07 19:08:19,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:08:19,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584469897] [2024-02-07 19:08:19,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:08:19,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:08:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:08:20,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:20,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:08:20,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584469897] [2024-02-07 19:08:20,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584469897] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:08:20,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937704370] [2024-02-07 19:08:20,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:08:20,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:08:20,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:08:20,365 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-07 19:08:20,380 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-07 19:08:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:08:20,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-07 19:08:20,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:09:58,487 WARN L293 SmtUtils]: Spent 9.33s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 19:10:47,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:10:47,984 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:11:15,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:11:15,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937704370] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:11:15,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:11:15,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 17 [2024-02-07 19:11:15,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211731457] [2024-02-07 19:11:15,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:11:15,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-07 19:11:15,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:11:15,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-07 19:11:15,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=189, Unknown=21, NotChecked=0, Total=272 [2024-02-07 19:11:19,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:11:19,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-02-07 19:11:19,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 59 transitions, 411 flow. Second operand has 17 states, 17 states have (on average 12.764705882352942) internal successors, (217), 17 states have internal predecessors, (217), 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-07 19:11:19,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:11:19,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-02-07 19:11:19,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:11:24,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:11:26,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:11:31,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:11:34,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:11:46,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:11:48,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:11:52,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:11:56,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:12:00,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:12:05,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:12:22,020 WARN L293 SmtUtils]: Spent 12.15s on a formula simplification. DAG size of input: 38 DAG size of output: 35 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 19:12:24,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:12:28,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:12:32,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:12:37,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:12:37,791 INFO L124 PetriNetUnfolderBase]: 2851/3946 cut-off events. [2024-02-07 19:12:37,791 INFO L125 PetriNetUnfolderBase]: For 13781/13781 co-relation queries the response was YES. [2024-02-07 19:12:37,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19061 conditions, 3946 events. 2851/3946 cut-off events. For 13781/13781 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 17769 event pairs, 325 based on Foata normal form. 19/3963 useless extension candidates. Maximal degree in co-relation 16962. Up to 2341 conditions per place. [2024-02-07 19:12:37,814 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 204 selfloop transitions, 102 changer transitions 30/341 dead transitions. [2024-02-07 19:12:37,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 341 transitions, 2874 flow [2024-02-07 19:12:37,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-02-07 19:12:37,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-02-07 19:12:37,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 375 transitions. [2024-02-07 19:12:37,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6334459459459459 [2024-02-07 19:12:37,816 INFO L175 Difference]: Start difference. First operand has 72 places, 59 transitions, 411 flow. Second operand 16 states and 375 transitions. [2024-02-07 19:12:37,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 341 transitions, 2874 flow [2024-02-07 19:12:37,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 341 transitions, 2783 flow, removed 32 selfloop flow, removed 1 redundant places. [2024-02-07 19:12:37,836 INFO L231 Difference]: Finished difference. Result has 94 places, 159 transitions, 1648 flow [2024-02-07 19:12:37,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1648, PETRI_PLACES=94, PETRI_TRANSITIONS=159} [2024-02-07 19:12:37,836 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 53 predicate places. [2024-02-07 19:12:37,836 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 159 transitions, 1648 flow [2024-02-07 19:12:37,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.764705882352942) internal successors, (217), 17 states have internal predecessors, (217), 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-07 19:12:37,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:12:37,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:12:37,851 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-07 19:12:38,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-02-07 19:12:38,049 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:12:38,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:12:38,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1699043145, now seen corresponding path program 2 times [2024-02-07 19:12:38,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:12:38,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944617381] [2024-02-07 19:12:38,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:12:38,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:12:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:12:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:12:38,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:12:38,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944617381] [2024-02-07 19:12:38,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944617381] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:12:38,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548227150] [2024-02-07 19:12:38,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-07 19:12:38,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:12:38,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:12:38,423 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-07 19:12:38,425 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-07 19:12:38,619 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-07 19:12:38,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 19:12:38,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-07 19:12:38,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:14:01,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:14:01,608 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:14:06,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:14:06,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548227150] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:14:06,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:14:06,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-02-07 19:14:06,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126429759] [2024-02-07 19:14:06,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:14:06,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-07 19:14:06,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:14:06,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-07 19:14:06,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=167, Unknown=6, NotChecked=0, Total=240 [2024-02-07 19:14:06,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-02-07 19:14:06,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 159 transitions, 1648 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-07 19:14:06,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:14:06,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-02-07 19:14:06,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:14:10,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:14:14,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:14:17,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:14:23,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:14:25,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:14:27,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:14:30,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:14:35,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:14:37,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:14:43,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:14:47,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:15:02,063 WARN L293 SmtUtils]: Spent 6.44s on a formula simplification. DAG size of input: 59 DAG size of output: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 19:15:30,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:15:34,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:15:39,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:15:56,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:16:00,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:16:04,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.98s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:16:08,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:16:13,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.63s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:16:17,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:16:21,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:16:25,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:16:29,043 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (* (- 1) c_~x4~0))) (let ((.cse0 (mod c_~x1~0 4294967296)) (.cse3 (mod (* (div .cse6 2) 4294967295) 4294967296)) (.cse1 (mod c_~n~0 4294967296)) (.cse2 (mod (div c_~x3~0 2) 4294967296)) (.cse4 (* c_~x3~0 2)) (.cse5 (* 4294967296 (div c_~n~0 4294967296)))) (and (= .cse0 (mod c_~x2~0 4294967296)) (<= .cse1 (mod c_~x4~0 4294967296)) (= .cse2 .cse3) (<= 1 .cse0) (= (+ c_~x1~0 (* (div c_~x2~0 4294967296) 4294967296)) (+ (* 4294967296 (div c_~x1~0 4294967296)) c_~x2~0)) (<= (+ .cse3 1) .cse1) (<= (+ .cse4 2 .cse5) (+ c_~n~0 (* (div (+ .cse4 .cse6) 4294967296) 4294967296) c_~x4~0)) (= (mod c_~x4~0 2) 0) (<= 1 .cse2) (= (mod c_~x3~0 2) 0) (<= (+ .cse4 .cse5) (+ (* 4294967296 (div (+ (- 1) c_~x3~0 (* (div (+ (- 1) c_~x3~0 .cse6 c_~n~0) 2147483648) 2147483648)) 4294967296)) c_~x4~0))))) is different from false [2024-02-07 19:16:30,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:16:35,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:16:40,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:16:43,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:16:45,798 INFO L124 PetriNetUnfolderBase]: 3997/5584 cut-off events. [2024-02-07 19:16:45,799 INFO L125 PetriNetUnfolderBase]: For 26902/26902 co-relation queries the response was YES. [2024-02-07 19:16:45,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30721 conditions, 5584 events. 3997/5584 cut-off events. For 26902/26902 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 27161 event pairs, 471 based on Foata normal form. 5/5587 useless extension candidates. Maximal degree in co-relation 30203. Up to 3736 conditions per place. [2024-02-07 19:16:45,833 INFO L140 encePairwiseOnDemand]: 21/37 looper letters, 299 selfloop transitions, 122 changer transitions 19/445 dead transitions. [2024-02-07 19:16:45,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 445 transitions, 4493 flow [2024-02-07 19:16:45,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-02-07 19:16:45,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-02-07 19:16:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 425 transitions. [2024-02-07 19:16:45,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.604551920341394 [2024-02-07 19:16:45,835 INFO L175 Difference]: Start difference. First operand has 94 places, 159 transitions, 1648 flow. Second operand 19 states and 425 transitions. [2024-02-07 19:16:45,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 445 transitions, 4493 flow [2024-02-07 19:16:45,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 445 transitions, 4268 flow, removed 110 selfloop flow, removed 1 redundant places. [2024-02-07 19:16:45,910 INFO L231 Difference]: Finished difference. Result has 125 places, 266 transitions, 3011 flow [2024-02-07 19:16:45,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1429, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3011, PETRI_PLACES=125, PETRI_TRANSITIONS=266} [2024-02-07 19:16:45,911 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 84 predicate places. [2024-02-07 19:16:45,911 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 266 transitions, 3011 flow [2024-02-07 19:16:45,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-07 19:16:45,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:16:45,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:16:45,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-02-07 19:16:46,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:16:46,125 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:16:46,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:16:46,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1347637051, now seen corresponding path program 1 times [2024-02-07 19:16:46,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:16:46,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009351131] [2024-02-07 19:16:46,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:16:46,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:16:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:16:46,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:16:46,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:16:46,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009351131] [2024-02-07 19:16:46,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009351131] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:16:46,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324814275] [2024-02-07 19:16:46,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:16:46,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:16:46,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:16:46,518 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 19:16:46,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-02-07 19:16:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:16:46,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-07 19:16:46,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:17:46,535 WARN L293 SmtUtils]: Spent 6.30s on a formula simplification. DAG size of input: 32 DAG size of output: 30 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 19:18:15,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:18:15,787 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:18:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:18:27,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324814275] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:18:27,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:18:27,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-02-07 19:18:27,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918660705] [2024-02-07 19:18:27,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:18:27,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-07 19:18:27,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:18:27,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-07 19:18:27,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=168, Unknown=4, NotChecked=0, Total=240 [2024-02-07 19:18:28,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-02-07 19:18:28,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 266 transitions, 3011 flow. Second operand has 16 states, 16 states have (on average 12.875) internal successors, (206), 16 states have internal predecessors, (206), 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-07 19:18:28,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:18:28,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-02-07 19:18:28,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:18:43,956 WARN L293 SmtUtils]: Spent 10.99s on a formula simplification. DAG size of input: 71 DAG size of output: 42 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 19:18:46,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:19:08,465 WARN L293 SmtUtils]: Spent 5.44s on a formula simplification. DAG size of input: 62 DAG size of output: 41 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 19:19:10,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:19:26,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:19:29,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:19:34,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:19:37,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:19:40,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:19:44,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:19:48,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:19:52,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:19:58,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:00,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:04,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:14,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:26,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:30,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:33,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:36,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:37,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:39,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:40,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:44,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:48,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:50,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:55,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:59,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:21:02,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:21:02,294 INFO L124 PetriNetUnfolderBase]: 5799/8124 cut-off events. [2024-02-07 19:21:02,294 INFO L125 PetriNetUnfolderBase]: For 56626/56626 co-relation queries the response was YES. [2024-02-07 19:21:02,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50796 conditions, 8124 events. 5799/8124 cut-off events. For 56626/56626 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 42455 event pairs, 351 based on Foata normal form. 25/8147 useless extension candidates. Maximal degree in co-relation 50336. Up to 5841 conditions per place. [2024-02-07 19:21:02,350 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 446 selfloop transitions, 92 changer transitions 18/561 dead transitions. [2024-02-07 19:21:02,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 561 transitions, 6273 flow [2024-02-07 19:21:02,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-02-07 19:21:02,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-02-07 19:21:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 406 transitions. [2024-02-07 19:21:02,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6858108108108109 [2024-02-07 19:21:02,352 INFO L175 Difference]: Start difference. First operand has 125 places, 266 transitions, 3011 flow. Second operand 16 states and 406 transitions. [2024-02-07 19:21:02,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 561 transitions, 6273 flow [2024-02-07 19:21:02,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 561 transitions, 5931 flow, removed 162 selfloop flow, removed 2 redundant places. [2024-02-07 19:21:02,605 INFO L231 Difference]: Finished difference. Result has 148 places, 355 transitions, 4029 flow [2024-02-07 19:21:02,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2685, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4029, PETRI_PLACES=148, PETRI_TRANSITIONS=355} [2024-02-07 19:21:02,606 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 107 predicate places. [2024-02-07 19:21:02,606 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 355 transitions, 4029 flow [2024-02-07 19:21:02,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.875) internal successors, (206), 16 states have internal predecessors, (206), 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-07 19:21:02,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:21:02,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:21:02,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-02-07 19:21:02,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:21:02,816 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:21:02,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:21:02,817 INFO L85 PathProgramCache]: Analyzing trace with hash 796483793, now seen corresponding path program 2 times [2024-02-07 19:21:02,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:21:02,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765222944] [2024-02-07 19:21:02,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:21:02,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:21:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:21:03,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:21:03,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:21:03,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765222944] [2024-02-07 19:21:03,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765222944] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:21:03,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921178283] [2024-02-07 19:21:03,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-07 19:21:03,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:21:03,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:21:03,264 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 19:21:03,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-02-07 19:21:03,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-07 19:21:03,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 19:21:03,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-07 19:21:03,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:22:14,272 WARN L293 SmtUtils]: Spent 12.16s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15