./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/triangular-longest-2.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/triangular-longest-2.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 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/pthread/triangular-longest-2.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/triangular-longest-2.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.witness-ghost-b44c828-m [2024-05-12 11:10:45,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 11:10:45,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 11:10:45,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 11:10:45,455 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 11:10:45,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 11:10:45,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 11:10:45,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 11:10:45,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 11:10:45,471 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 11:10:45,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 11:10:45,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 11:10:45,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 11:10:45,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 11:10:45,473 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 11:10:45,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 11:10:45,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 11:10:45,474 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 11:10:45,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 11:10:45,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 11:10:45,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 11:10:45,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 11:10:45,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 11:10:45,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 11:10:45,476 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 11:10:45,477 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 11:10:45,477 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 11:10:45,477 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 11:10:45,477 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 11:10:45,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 11:10:45,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 11:10:45,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 11:10:45,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:10:45,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 11:10:45,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 11:10:45,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 11:10:45,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 11:10:45,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 11:10:45,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 11:10:45,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 11:10:45,481 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 11:10:45,481 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 11:10:45,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 11:10:45,481 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-05-12 11:10:45,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 11:10:45,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 11:10:45,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 11:10:45,706 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 11:10:45,707 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 11:10:45,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longest-2.i [2024-05-12 11:10:46,860 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 11:10:47,022 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 11:10:47,022 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i [2024-05-12 11:10:47,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a0bb5ab3/f7f524d4c46f403a9fa606ccc3c10b6c/FLAG03147fa36 [2024-05-12 11:10:47,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a0bb5ab3/f7f524d4c46f403a9fa606ccc3c10b6c [2024-05-12 11:10:47,059 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 11:10:47,060 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 11:10:47,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/mutex-meet/triangular-longest-2.yml/witness.yml [2024-05-12 11:10:47,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 11:10:47,148 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 11:10:47,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 11:10:47,151 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 11:10:47,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 11:10:47,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:10:47" (1/2) ... [2024-05-12 11:10:47,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@640da29d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:47, skipping insertion in model container [2024-05-12 11:10:47,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:10:47" (1/2) ... [2024-05-12 11:10:47,157 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7ffd2bd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:47, skipping insertion in model container [2024-05-12 11:10:47,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:10:47" (2/2) ... [2024-05-12 11:10:47,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@640da29d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:10:47, skipping insertion in model container [2024-05-12 11:10:47,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:10:47" (2/2) ... [2024-05-12 11:10:47,159 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 11:10:47,188 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 11:10:47,189 INFO L97 edCorrectnessWitness]: Location invariant before [L715-L715] (((! multithreaded || ((((0 <= j && 4 <= j) && j % 2 == 0) && j != 0) && j != 1)) && (! multithreaded || ((-7LL + (long long )i) + (long long )j >= 0LL && (1LL - (long long )i) + (long long )j >= 0LL))) && (! multithreaded || ((((((((0 <= i && 0 <= j) && 3 <= i) && 4 <= j) && i % 2 == 1) && j % 2 == 0) && i != 0) && j != 0) && j != 1))) && (! multithreaded || (((0 <= i && 3 <= i) && i % 2 == 1) && i != 0)) [2024-05-12 11:10:47,190 INFO L97 edCorrectnessWitness]: Location invariant before [L714-L714] (((! multithreaded || ((((0 <= j && 4 <= j) && j % 2 == 0) && j != 0) && j != 1)) && (! multithreaded || ((-7LL + (long long )i) + (long long )j >= 0LL && (1LL - (long long )i) + (long long )j >= 0LL))) && (! multithreaded || ((((((((0 <= i && 0 <= j) && 3 <= i) && 4 <= j) && i % 2 == 1) && j % 2 == 0) && i != 0) && j != 0) && j != 1))) && (! multithreaded || (((0 <= i && 3 <= i) && i % 2 == 1) && i != 0)) [2024-05-12 11:10:47,190 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 11:10:47,190 INFO L106 edCorrectnessWitness]: ghost_update [L713-L713] multithreaded = 1; [2024-05-12 11:10:47,224 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 11:10:47,522 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i[30964,30977] [2024-05-12 11:10:47,531 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:10:47,538 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 11:10:47,603 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i[30964,30977] [2024-05-12 11:10:47,604 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:10:47,659 INFO L206 MainTranslator]: Completed translation [2024-05-12 11:10:47,666 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:10:47 WrapperNode [2024-05-12 11:10:47,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 11:10:47,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 11:10:47,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 11:10:47,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 11:10:47,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:10:47" (1/1) ... [2024-05-12 11:10:47,698 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:10:47" (1/1) ... [2024-05-12 11:10:47,719 INFO L138 Inliner]: procedures = 169, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 50 [2024-05-12 11:10:47,720 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 11:10:47,721 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 11:10:47,721 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 11:10:47,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 11:10:47,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:10:47" (1/1) ... [2024-05-12 11:10:47,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:10:47" (1/1) ... [2024-05-12 11:10:47,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:10:47" (1/1) ... [2024-05-12 11:10:47,754 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-05-12 11:10:47,754 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:10:47" (1/1) ... [2024-05-12 11:10:47,755 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:10:47" (1/1) ... [2024-05-12 11:10:47,767 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:10:47" (1/1) ... [2024-05-12 11:10:47,771 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:10:47" (1/1) ... [2024-05-12 11:10:47,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:10:47" (1/1) ... [2024-05-12 11:10:47,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:10:47" (1/1) ... [2024-05-12 11:10:47,778 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 11:10:47,782 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 11:10:47,782 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 11:10:47,782 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 11:10:47,783 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:10:47" (1/1) ... [2024-05-12 11:10:47,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:10:47,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:10:47,824 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-05-12 11:10:47,830 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-05-12 11:10:47,853 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-05-12 11:10:47,854 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-05-12 11:10:47,854 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-05-12 11:10:47,854 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-05-12 11:10:47,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 11:10:47,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 11:10:47,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 11:10:47,855 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 11:10:47,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 11:10:47,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 11:10:47,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 11:10:47,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 11:10:47,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 11:10:47,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 11:10:47,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 11:10:47,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 11:10:47,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 11:10:47,858 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 11:10:47,979 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 11:10:47,980 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 11:10:48,169 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 11:10:48,170 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 11:10:48,250 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 11:10:48,250 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-05-12 11:10:48,250 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:10:48 BoogieIcfgContainer [2024-05-12 11:10:48,250 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 11:10:48,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 11:10:48,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 11:10:48,254 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 11:10:48,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 11:10:47" (1/4) ... [2024-05-12 11:10:48,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f71367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:10:48, skipping insertion in model container [2024-05-12 11:10:48,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:10:47" (2/4) ... [2024-05-12 11:10:48,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f71367 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:10:48, skipping insertion in model container [2024-05-12 11:10:48,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:10:47" (3/4) ... [2024-05-12 11:10:48,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f71367 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:10:48, skipping insertion in model container [2024-05-12 11:10:48,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:10:48" (4/4) ... [2024-05-12 11:10:48,257 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2024-05-12 11:10:48,283 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 11:10:48,284 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-05-12 11:10:48,284 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 11:10:48,320 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 11:10:48,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 30 transitions, 68 flow [2024-05-12 11:10:48,378 INFO L124 PetriNetUnfolderBase]: 3/28 cut-off events. [2024-05-12 11:10:48,379 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:10:48,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 3/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2024-05-12 11:10:48,381 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 30 transitions, 68 flow [2024-05-12 11:10:48,383 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 28 transitions, 62 flow [2024-05-12 11:10:48,390 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 11:10:48,396 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;@176fc969, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 11:10:48,397 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-12 11:10:48,400 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 11:10:48,401 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 11:10:48,401 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:10:48,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:48,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 11:10:48,402 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:10:48,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:48,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1410544718, now seen corresponding path program 1 times [2024-05-12 11:10:48,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:48,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703357803] [2024-05-12 11:10:48,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:48,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:49,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:49,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703357803] [2024-05-12 11:10:49,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703357803] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:10:49,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:10:49,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:10:49,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914102863] [2024-05-12 11:10:49,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:10:49,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:10:49,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:49,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:10:49,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:10:49,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2024-05-12 11:10:49,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-05-12 11:10:49,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:49,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2024-05-12 11:10:49,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:49,291 INFO L124 PetriNetUnfolderBase]: 172/327 cut-off events. [2024-05-12 11:10:49,294 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-05-12 11:10:49,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 327 events. 172/327 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1306 event pairs, 54 based on Foata normal form. 20/327 useless extension candidates. Maximal degree in co-relation 614. Up to 211 conditions per place. [2024-05-12 11:10:49,298 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 25 selfloop transitions, 3 changer transitions 2/38 dead transitions. [2024-05-12 11:10:49,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 38 transitions, 145 flow [2024-05-12 11:10:49,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:10:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:10:49,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2024-05-12 11:10:49,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2024-05-12 11:10:49,309 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 62 flow. Second operand 3 states and 64 transitions. [2024-05-12 11:10:49,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 38 transitions, 145 flow [2024-05-12 11:10:49,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:10:49,313 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 77 flow [2024-05-12 11:10:49,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2024-05-12 11:10:49,317 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2024-05-12 11:10:49,317 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 77 flow [2024-05-12 11:10:49,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-05-12 11:10:49,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:49,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:49,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 11:10:49,318 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:10:49,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:49,320 INFO L85 PathProgramCache]: Analyzing trace with hash -421416505, now seen corresponding path program 1 times [2024-05-12 11:10:49,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:49,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483059979] [2024-05-12 11:10:49,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:49,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:49,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:49,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:49,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483059979] [2024-05-12 11:10:49,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483059979] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:10:49,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:10:49,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 11:10:49,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068581507] [2024-05-12 11:10:49,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:10:49,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 11:10:49,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:49,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 11:10:49,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 11:10:49,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2024-05-12 11:10:49,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 77 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-05-12 11:10:49,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:49,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2024-05-12 11:10:49,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:49,748 INFO L124 PetriNetUnfolderBase]: 160/318 cut-off events. [2024-05-12 11:10:49,748 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-05-12 11:10:49,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 318 events. 160/318 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1260 event pairs, 37 based on Foata normal form. 21/335 useless extension candidates. Maximal degree in co-relation 683. Up to 103 conditions per place. [2024-05-12 11:10:49,751 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 36 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2024-05-12 11:10:49,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 48 transitions, 205 flow [2024-05-12 11:10:49,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:10:49,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:10:49,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2024-05-12 11:10:49,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.62 [2024-05-12 11:10:49,759 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 77 flow. Second operand 5 states and 93 transitions. [2024-05-12 11:10:49,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 48 transitions, 205 flow [2024-05-12 11:10:49,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 48 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 11:10:49,760 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 91 flow [2024-05-12 11:10:49,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2024-05-12 11:10:49,761 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2024-05-12 11:10:49,761 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 91 flow [2024-05-12 11:10:49,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-05-12 11:10:49,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:49,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:49,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 11:10:49,762 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:10:49,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:49,763 INFO L85 PathProgramCache]: Analyzing trace with hash 280436029, now seen corresponding path program 1 times [2024-05-12 11:10:49,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:49,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218237248] [2024-05-12 11:10:49,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:49,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:49,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:49,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218237248] [2024-05-12 11:10:49,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218237248] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:10:49,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:10:49,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 11:10:49,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094711433] [2024-05-12 11:10:49,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:10:49,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 11:10:49,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:49,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 11:10:49,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 11:10:49,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2024-05-12 11:10:49,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-05-12 11:10:49,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:49,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2024-05-12 11:10:49,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:49,976 INFO L124 PetriNetUnfolderBase]: 172/345 cut-off events. [2024-05-12 11:10:49,977 INFO L125 PetriNetUnfolderBase]: For 261/261 co-relation queries the response was YES. [2024-05-12 11:10:49,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 345 events. 172/345 cut-off events. For 261/261 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1378 event pairs, 61 based on Foata normal form. 9/350 useless extension candidates. Maximal degree in co-relation 788. Up to 196 conditions per place. [2024-05-12 11:10:49,979 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 27 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2024-05-12 11:10:49,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 38 transitions, 179 flow [2024-05-12 11:10:49,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:10:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:10:49,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2024-05-12 11:10:49,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2024-05-12 11:10:49,980 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 91 flow. Second operand 3 states and 58 transitions. [2024-05-12 11:10:49,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 38 transitions, 179 flow [2024-05-12 11:10:49,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:10:49,982 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 103 flow [2024-05-12 11:10:49,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-05-12 11:10:49,983 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2024-05-12 11:10:49,983 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 103 flow [2024-05-12 11:10:49,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-05-12 11:10:49,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:49,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:49,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 11:10:49,984 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:10:49,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:49,984 INFO L85 PathProgramCache]: Analyzing trace with hash 77939701, now seen corresponding path program 1 times [2024-05-12 11:10:49,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:49,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911938283] [2024-05-12 11:10:49,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:49,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:50,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:50,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911938283] [2024-05-12 11:10:50,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911938283] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:10:50,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:10:50,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:10:50,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763255367] [2024-05-12 11:10:50,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:10:50,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 11:10:50,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:50,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 11:10:50,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-12 11:10:50,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:10:50,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 103 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-05-12 11:10:50,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:50,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:10:50,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:50,198 INFO L124 PetriNetUnfolderBase]: 544/949 cut-off events. [2024-05-12 11:10:50,198 INFO L125 PetriNetUnfolderBase]: For 654/663 co-relation queries the response was YES. [2024-05-12 11:10:50,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2294 conditions, 949 events. 544/949 cut-off events. For 654/663 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4358 event pairs, 138 based on Foata normal form. 0/909 useless extension candidates. Maximal degree in co-relation 2275. Up to 416 conditions per place. [2024-05-12 11:10:50,203 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 31 selfloop transitions, 6 changer transitions 23/65 dead transitions. [2024-05-12 11:10:50,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 65 transitions, 350 flow [2024-05-12 11:10:50,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:10:50,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:10:50,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-05-12 11:10:50,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2024-05-12 11:10:50,204 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 103 flow. Second operand 6 states and 102 transitions. [2024-05-12 11:10:50,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 65 transitions, 350 flow [2024-05-12 11:10:50,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 11:10:50,206 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 139 flow [2024-05-12 11:10:50,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=139, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2024-05-12 11:10:50,207 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2024-05-12 11:10:50,207 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 139 flow [2024-05-12 11:10:50,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-05-12 11:10:50,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:50,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:50,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 11:10:50,208 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:10:50,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:50,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1079780034, now seen corresponding path program 1 times [2024-05-12 11:10:50,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:50,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592528201] [2024-05-12 11:10:50,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:50,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:50,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:50,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592528201] [2024-05-12 11:10:50,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592528201] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:10:50,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:10:50,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 11:10:50,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785242719] [2024-05-12 11:10:50,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:10:50,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 11:10:50,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:50,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 11:10:50,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-12 11:10:50,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2024-05-12 11:10:50,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 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-05-12 11:10:50,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:50,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2024-05-12 11:10:50,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:50,465 INFO L124 PetriNetUnfolderBase]: 283/573 cut-off events. [2024-05-12 11:10:50,466 INFO L125 PetriNetUnfolderBase]: For 668/679 co-relation queries the response was YES. [2024-05-12 11:10:50,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1454 conditions, 573 events. 283/573 cut-off events. For 668/679 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2457 event pairs, 64 based on Foata normal form. 21/593 useless extension candidates. Maximal degree in co-relation 1430. Up to 238 conditions per place. [2024-05-12 11:10:50,469 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 42 selfloop transitions, 7 changer transitions 1/58 dead transitions. [2024-05-12 11:10:50,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 315 flow [2024-05-12 11:10:50,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:10:50,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:10:50,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-05-12 11:10:50,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6055555555555555 [2024-05-12 11:10:50,471 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 139 flow. Second operand 6 states and 109 transitions. [2024-05-12 11:10:50,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 315 flow [2024-05-12 11:10:50,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 306 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-05-12 11:10:50,473 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 168 flow [2024-05-12 11:10:50,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2024-05-12 11:10:50,474 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2024-05-12 11:10:50,474 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 168 flow [2024-05-12 11:10:50,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 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-05-12 11:10:50,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:50,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:50,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 11:10:50,475 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:10:50,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:50,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1063645019, now seen corresponding path program 1 times [2024-05-12 11:10:50,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:50,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840122075] [2024-05-12 11:10:50,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:50,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:50,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:50,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:50,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840122075] [2024-05-12 11:10:50,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840122075] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:10:50,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:10:50,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:10:50,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641456805] [2024-05-12 11:10:50,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:10:50,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:10:50,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:50,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:10:50,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:10:50,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:10:50,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 168 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-05-12 11:10:50,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:50,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:10:50,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:50,731 INFO L124 PetriNetUnfolderBase]: 652/1185 cut-off events. [2024-05-12 11:10:50,732 INFO L125 PetriNetUnfolderBase]: For 1882/1898 co-relation queries the response was YES. [2024-05-12 11:10:50,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3279 conditions, 1185 events. 652/1185 cut-off events. For 1882/1898 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5744 event pairs, 208 based on Foata normal form. 36/1212 useless extension candidates. Maximal degree in co-relation 3254. Up to 649 conditions per place. [2024-05-12 11:10:50,737 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 52 selfloop transitions, 11 changer transitions 21/89 dead transitions. [2024-05-12 11:10:50,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 89 transitions, 562 flow [2024-05-12 11:10:50,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:10:50,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:10:50,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-05-12 11:10:50,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5481481481481482 [2024-05-12 11:10:50,739 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 168 flow. Second operand 9 states and 148 transitions. [2024-05-12 11:10:50,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 89 transitions, 562 flow [2024-05-12 11:10:50,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 89 transitions, 535 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-05-12 11:10:50,757 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 261 flow [2024-05-12 11:10:50,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=261, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2024-05-12 11:10:50,758 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2024-05-12 11:10:50,758 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 261 flow [2024-05-12 11:10:50,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-05-12 11:10:50,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:50,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:50,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 11:10:50,759 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:10:50,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:50,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2039593339, now seen corresponding path program 2 times [2024-05-12 11:10:50,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:50,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973426778] [2024-05-12 11:10:50,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:50,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:50,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:50,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973426778] [2024-05-12 11:10:50,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973426778] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:10:50,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:10:50,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:10:50,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123369278] [2024-05-12 11:10:50,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:10:50,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:10:50,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:50,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:10:50,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:10:50,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:10:50,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 261 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-05-12 11:10:50,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:50,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:10:50,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:51,045 INFO L124 PetriNetUnfolderBase]: 598/1101 cut-off events. [2024-05-12 11:10:51,045 INFO L125 PetriNetUnfolderBase]: For 2805/2821 co-relation queries the response was YES. [2024-05-12 11:10:51,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3509 conditions, 1101 events. 598/1101 cut-off events. For 2805/2821 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5283 event pairs, 208 based on Foata normal form. 54/1146 useless extension candidates. Maximal degree in co-relation 3478. Up to 637 conditions per place. [2024-05-12 11:10:51,051 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 43 selfloop transitions, 11 changer transitions 28/87 dead transitions. [2024-05-12 11:10:51,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 87 transitions, 653 flow [2024-05-12 11:10:51,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:10:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:10:51,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-05-12 11:10:51,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5458333333333333 [2024-05-12 11:10:51,053 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 261 flow. Second operand 8 states and 131 transitions. [2024-05-12 11:10:51,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 87 transitions, 653 flow [2024-05-12 11:10:51,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 87 transitions, 633 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-05-12 11:10:51,060 INFO L231 Difference]: Finished difference. Result has 64 places, 42 transitions, 318 flow [2024-05-12 11:10:51,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=318, PETRI_PLACES=64, PETRI_TRANSITIONS=42} [2024-05-12 11:10:51,061 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 32 predicate places. [2024-05-12 11:10:51,061 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 42 transitions, 318 flow [2024-05-12 11:10:51,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-05-12 11:10:51,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:51,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:51,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 11:10:51,062 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:10:51,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:51,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1855387724, now seen corresponding path program 1 times [2024-05-12 11:10:51,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:51,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456046567] [2024-05-12 11:10:51,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:51,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:51,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:51,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:51,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456046567] [2024-05-12 11:10:51,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456046567] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:10:51,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:10:51,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:10:51,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489033024] [2024-05-12 11:10:51,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:10:51,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:10:51,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:51,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:10:51,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:10:51,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:10:51,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 42 transitions, 318 flow. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-05-12 11:10:51,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:51,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:10:51,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:51,357 INFO L124 PetriNetUnfolderBase]: 724/1320 cut-off events. [2024-05-12 11:10:51,358 INFO L125 PetriNetUnfolderBase]: For 4562/4578 co-relation queries the response was YES. [2024-05-12 11:10:51,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4467 conditions, 1320 events. 724/1320 cut-off events. For 4562/4578 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6569 event pairs, 161 based on Foata normal form. 27/1334 useless extension candidates. Maximal degree in co-relation 4432. Up to 577 conditions per place. [2024-05-12 11:10:51,366 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 58 selfloop transitions, 20 changer transitions 23/106 dead transitions. [2024-05-12 11:10:51,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 106 transitions, 816 flow [2024-05-12 11:10:51,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:10:51,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:10:51,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 177 transitions. [2024-05-12 11:10:51,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5363636363636364 [2024-05-12 11:10:51,371 INFO L175 Difference]: Start difference. First operand has 64 places, 42 transitions, 318 flow. Second operand 11 states and 177 transitions. [2024-05-12 11:10:51,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 106 transitions, 816 flow [2024-05-12 11:10:51,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 106 transitions, 751 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-05-12 11:10:51,381 INFO L231 Difference]: Finished difference. Result has 71 places, 48 transitions, 422 flow [2024-05-12 11:10:51,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=422, PETRI_PLACES=71, PETRI_TRANSITIONS=48} [2024-05-12 11:10:51,384 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 39 predicate places. [2024-05-12 11:10:51,384 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 48 transitions, 422 flow [2024-05-12 11:10:51,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-05-12 11:10:51,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:51,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:51,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 11:10:51,385 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:10:51,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:51,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1849717684, now seen corresponding path program 2 times [2024-05-12 11:10:51,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:51,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183210942] [2024-05-12 11:10:51,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:51,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:51,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:51,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:51,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183210942] [2024-05-12 11:10:51,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183210942] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:10:51,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:10:51,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:10:51,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009360559] [2024-05-12 11:10:51,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:10:51,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:10:51,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:51,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:10:51,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:10:51,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:10:51,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 48 transitions, 422 flow. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-05-12 11:10:51,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:51,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:10:51,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:51,765 INFO L124 PetriNetUnfolderBase]: 697/1281 cut-off events. [2024-05-12 11:10:51,766 INFO L125 PetriNetUnfolderBase]: For 8069/8086 co-relation queries the response was YES. [2024-05-12 11:10:51,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5008 conditions, 1281 events. 697/1281 cut-off events. For 8069/8086 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 6328 event pairs, 132 based on Foata normal form. 72/1340 useless extension candidates. Maximal degree in co-relation 4970. Up to 425 conditions per place. [2024-05-12 11:10:51,776 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 48 selfloop transitions, 24 changer transitions 35/112 dead transitions. [2024-05-12 11:10:51,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 112 transitions, 1038 flow [2024-05-12 11:10:51,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:10:51,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:10:51,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 174 transitions. [2024-05-12 11:10:51,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5272727272727272 [2024-05-12 11:10:51,778 INFO L175 Difference]: Start difference. First operand has 71 places, 48 transitions, 422 flow. Second operand 11 states and 174 transitions. [2024-05-12 11:10:51,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 112 transitions, 1038 flow [2024-05-12 11:10:51,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 112 transitions, 969 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-05-12 11:10:51,789 INFO L231 Difference]: Finished difference. Result has 80 places, 52 transitions, 515 flow [2024-05-12 11:10:51,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=515, PETRI_PLACES=80, PETRI_TRANSITIONS=52} [2024-05-12 11:10:51,790 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 48 predicate places. [2024-05-12 11:10:51,790 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 52 transitions, 515 flow [2024-05-12 11:10:51,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-05-12 11:10:51,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:51,791 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:51,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 11:10:51,791 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:10:51,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:51,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1026970189, now seen corresponding path program 1 times [2024-05-12 11:10:51,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:51,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128669552] [2024-05-12 11:10:51,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:51,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:52,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:52,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:52,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128669552] [2024-05-12 11:10:52,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128669552] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 11:10:52,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835344056] [2024-05-12 11:10:52,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:52,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:10:52,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:10:52,003 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-05-12 11:10:52,029 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-05-12 11:10:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:52,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjunts are in the unsatisfiable core [2024-05-12 11:10:52,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 11:10:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:52,256 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 11:10:52,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:52,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835344056] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 11:10:52,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 11:10:52,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 19 [2024-05-12 11:10:52,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060216741] [2024-05-12 11:10:52,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 11:10:52,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-05-12 11:10:52,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:52,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-05-12 11:10:52,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2024-05-12 11:10:52,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-05-12 11:10:52,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 52 transitions, 515 flow. Second operand has 21 states, 21 states have (on average 11.428571428571429) internal successors, (240), 21 states have internal predecessors, (240), 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-05-12 11:10:52,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:52,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-05-12 11:10:52,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:52,904 INFO L124 PetriNetUnfolderBase]: 683/1274 cut-off events. [2024-05-12 11:10:52,904 INFO L125 PetriNetUnfolderBase]: For 12618/12715 co-relation queries the response was YES. [2024-05-12 11:10:52,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5345 conditions, 1274 events. 683/1274 cut-off events. For 12618/12715 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 6213 event pairs, 113 based on Foata normal form. 26/1239 useless extension candidates. Maximal degree in co-relation 5302. Up to 480 conditions per place. [2024-05-12 11:10:52,911 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 54 selfloop transitions, 18 changer transitions 5/88 dead transitions. [2024-05-12 11:10:52,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 88 transitions, 819 flow [2024-05-12 11:10:52,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:10:52,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:10:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-05-12 11:10:52,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5259259259259259 [2024-05-12 11:10:52,913 INFO L175 Difference]: Start difference. First operand has 80 places, 52 transitions, 515 flow. Second operand 9 states and 142 transitions. [2024-05-12 11:10:52,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 88 transitions, 819 flow [2024-05-12 11:10:52,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 88 transitions, 747 flow, removed 18 selfloop flow, removed 10 redundant places. [2024-05-12 11:10:52,923 INFO L231 Difference]: Finished difference. Result has 75 places, 52 transitions, 500 flow [2024-05-12 11:10:52,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=500, PETRI_PLACES=75, PETRI_TRANSITIONS=52} [2024-05-12 11:10:52,924 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 43 predicate places. [2024-05-12 11:10:52,924 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 52 transitions, 500 flow [2024-05-12 11:10:52,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 11.428571428571429) internal successors, (240), 21 states have internal predecessors, (240), 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-05-12 11:10:52,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:52,924 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:52,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-05-12 11:10:53,152 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,SelfDestructingSolverStorable9 [2024-05-12 11:10:53,152 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:10:53,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:53,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1405344510, now seen corresponding path program 1 times [2024-05-12 11:10:53,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:53,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899123867] [2024-05-12 11:10:53,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:53,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:53,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:53,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:53,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899123867] [2024-05-12 11:10:53,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899123867] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 11:10:53,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672286709] [2024-05-12 11:10:53,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:53,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:10:53,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:10:53,252 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-05-12 11:10:53,320 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-05-12 11:10:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:53,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2024-05-12 11:10:53,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 11:10:53,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:53,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 11:10:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:53,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672286709] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 11:10:53,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 11:10:53,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-05-12 11:10:53,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707384234] [2024-05-12 11:10:53,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 11:10:53,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-12 11:10:53,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:53,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-12 11:10:53,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-05-12 11:10:53,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:10:53,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 52 transitions, 500 flow. Second operand has 13 states, 13 states have (on average 10.538461538461538) internal successors, (137), 13 states have internal predecessors, (137), 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-05-12 11:10:53,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:53,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:10:53,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:53,921 INFO L124 PetriNetUnfolderBase]: 838/1548 cut-off events. [2024-05-12 11:10:53,921 INFO L125 PetriNetUnfolderBase]: For 13626/13626 co-relation queries the response was YES. [2024-05-12 11:10:53,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6612 conditions, 1548 events. 838/1548 cut-off events. For 13626/13626 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 7435 event pairs, 289 based on Foata normal form. 63/1607 useless extension candidates. Maximal degree in co-relation 6572. Up to 907 conditions per place. [2024-05-12 11:10:53,943 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 72 selfloop transitions, 17 changer transitions 67/160 dead transitions. [2024-05-12 11:10:53,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 160 transitions, 1598 flow [2024-05-12 11:10:53,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-12 11:10:53,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-05-12 11:10:53,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 292 transitions. [2024-05-12 11:10:53,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.512280701754386 [2024-05-12 11:10:53,945 INFO L175 Difference]: Start difference. First operand has 75 places, 52 transitions, 500 flow. Second operand 19 states and 292 transitions. [2024-05-12 11:10:53,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 160 transitions, 1598 flow [2024-05-12 11:10:53,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 160 transitions, 1483 flow, removed 44 selfloop flow, removed 6 redundant places. [2024-05-12 11:10:53,977 INFO L231 Difference]: Finished difference. Result has 100 places, 58 transitions, 652 flow [2024-05-12 11:10:53,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=652, PETRI_PLACES=100, PETRI_TRANSITIONS=58} [2024-05-12 11:10:53,977 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 68 predicate places. [2024-05-12 11:10:53,977 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 58 transitions, 652 flow [2024-05-12 11:10:53,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.538461538461538) internal successors, (137), 13 states have internal predecessors, (137), 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-05-12 11:10:53,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:53,978 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:54,005 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-05-12 11:10:54,189 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-05-12 11:10:54,190 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:10:54,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:54,190 INFO L85 PathProgramCache]: Analyzing trace with hash 846029844, now seen corresponding path program 2 times [2024-05-12 11:10:54,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:54,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308339273] [2024-05-12 11:10:54,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:54,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:54,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:54,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308339273] [2024-05-12 11:10:54,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308339273] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 11:10:54,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227863197] [2024-05-12 11:10:54,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-12 11:10:54,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:10:54,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:10:54,286 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-05-12 11:10:54,311 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-05-12 11:10:54,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-12 11:10:54,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 11:10:54,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2024-05-12 11:10:54,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 11:10:54,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:54,376 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 11:10:54,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:54,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227863197] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 11:10:54,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 11:10:54,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-05-12 11:10:54,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246276884] [2024-05-12 11:10:54,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 11:10:54,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-12 11:10:54,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:54,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-12 11:10:54,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-05-12 11:10:54,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:10:54,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 58 transitions, 652 flow. Second operand has 13 states, 13 states have (on average 10.538461538461538) internal successors, (137), 13 states have internal predecessors, (137), 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-05-12 11:10:54,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:54,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:10:54,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:55,014 INFO L124 PetriNetUnfolderBase]: 991/1823 cut-off events. [2024-05-12 11:10:55,024 INFO L125 PetriNetUnfolderBase]: For 32787/32787 co-relation queries the response was YES. [2024-05-12 11:10:55,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9677 conditions, 1823 events. 991/1823 cut-off events. For 32787/32787 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 9083 event pairs, 92 based on Foata normal form. 81/1900 useless extension candidates. Maximal degree in co-relation 9625. Up to 415 conditions per place. [2024-05-12 11:10:55,050 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 91 selfloop transitions, 48 changer transitions 81/224 dead transitions. [2024-05-12 11:10:55,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 224 transitions, 2602 flow [2024-05-12 11:10:55,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-12 11:10:55,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-05-12 11:10:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 419 transitions. [2024-05-12 11:10:55,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5172839506172839 [2024-05-12 11:10:55,061 INFO L175 Difference]: Start difference. First operand has 100 places, 58 transitions, 652 flow. Second operand 27 states and 419 transitions. [2024-05-12 11:10:55,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 224 transitions, 2602 flow [2024-05-12 11:10:55,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 224 transitions, 2306 flow, removed 137 selfloop flow, removed 11 redundant places. [2024-05-12 11:10:55,096 INFO L231 Difference]: Finished difference. Result has 126 places, 74 transitions, 1027 flow [2024-05-12 11:10:55,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1027, PETRI_PLACES=126, PETRI_TRANSITIONS=74} [2024-05-12 11:10:55,097 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 94 predicate places. [2024-05-12 11:10:55,097 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 74 transitions, 1027 flow [2024-05-12 11:10:55,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.538461538461538) internal successors, (137), 13 states have internal predecessors, (137), 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-05-12 11:10:55,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:55,097 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:55,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-12 11:10:55,308 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-05-12 11:10:55,308 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:10:55,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:55,309 INFO L85 PathProgramCache]: Analyzing trace with hash 6261847, now seen corresponding path program 1 times [2024-05-12 11:10:55,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:55,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930920225] [2024-05-12 11:10:55,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:55,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:55,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:55,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:55,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930920225] [2024-05-12 11:10:55,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930920225] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 11:10:55,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220602133] [2024-05-12 11:10:55,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:55,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:10:55,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:10:55,449 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-05-12 11:10:55,489 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-05-12 11:10:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:55,542 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-12 11:10:55,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 11:10:55,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:55,592 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 11:10:55,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:55,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220602133] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 11:10:55,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 11:10:55,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-05-12 11:10:55,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267563040] [2024-05-12 11:10:55,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 11:10:55,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-05-12 11:10:55,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:55,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-05-12 11:10:55,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-05-12 11:10:55,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:10:55,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 74 transitions, 1027 flow. Second operand has 15 states, 15 states have (on average 10.533333333333333) internal successors, (158), 15 states have internal predecessors, (158), 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-05-12 11:10:55,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:55,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:10:55,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:56,382 INFO L124 PetriNetUnfolderBase]: 1198/2243 cut-off events. [2024-05-12 11:10:56,382 INFO L125 PetriNetUnfolderBase]: For 73159/73159 co-relation queries the response was YES. [2024-05-12 11:10:56,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14525 conditions, 2243 events. 1198/2243 cut-off events. For 73159/73159 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 11921 event pairs, 206 based on Foata normal form. 63/2298 useless extension candidates. Maximal degree in co-relation 14461. Up to 616 conditions per place. [2024-05-12 11:10:56,408 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 101 selfloop transitions, 51 changer transitions 67/223 dead transitions. [2024-05-12 11:10:56,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 223 transitions, 3327 flow [2024-05-12 11:10:56,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-12 11:10:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-05-12 11:10:56,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 387 transitions. [2024-05-12 11:10:56,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.516 [2024-05-12 11:10:56,412 INFO L175 Difference]: Start difference. First operand has 126 places, 74 transitions, 1027 flow. Second operand 25 states and 387 transitions. [2024-05-12 11:10:56,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 223 transitions, 3327 flow [2024-05-12 11:10:56,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 223 transitions, 2845 flow, removed 226 selfloop flow, removed 14 redundant places. [2024-05-12 11:10:56,515 INFO L231 Difference]: Finished difference. Result has 143 places, 84 transitions, 1297 flow [2024-05-12 11:10:56,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1297, PETRI_PLACES=143, PETRI_TRANSITIONS=84} [2024-05-12 11:10:56,516 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 111 predicate places. [2024-05-12 11:10:56,516 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 84 transitions, 1297 flow [2024-05-12 11:10:56,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.533333333333333) internal successors, (158), 15 states have internal predecessors, (158), 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-05-12 11:10:56,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:56,517 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:56,530 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-05-12 11:10:56,728 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-05-12 11:10:56,728 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:10:56,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:56,729 INFO L85 PathProgramCache]: Analyzing trace with hash 342006151, now seen corresponding path program 2 times [2024-05-12 11:10:56,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:56,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540945050] [2024-05-12 11:10:56,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:56,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:56,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:56,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:56,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540945050] [2024-05-12 11:10:56,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540945050] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 11:10:56,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157599067] [2024-05-12 11:10:56,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-12 11:10:56,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:10:56,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:10:56,855 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-05-12 11:10:56,880 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-05-12 11:10:56,915 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-12 11:10:56,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 11:10:56,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-12 11:10:56,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 11:10:56,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:56,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 11:10:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:57,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157599067] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 11:10:57,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 11:10:57,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-05-12 11:10:57,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634731800] [2024-05-12 11:10:57,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 11:10:57,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-05-12 11:10:57,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:57,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-05-12 11:10:57,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-05-12 11:10:57,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:10:57,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 84 transitions, 1297 flow. Second operand has 15 states, 15 states have (on average 10.533333333333333) internal successors, (158), 15 states have internal predecessors, (158), 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-05-12 11:10:57,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:57,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:10:57,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:57,882 INFO L124 PetriNetUnfolderBase]: 1477/2785 cut-off events. [2024-05-12 11:10:57,883 INFO L125 PetriNetUnfolderBase]: For 142094/142094 co-relation queries the response was YES. [2024-05-12 11:10:57,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20386 conditions, 2785 events. 1477/2785 cut-off events. For 142094/142094 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 15239 event pairs, 58 based on Foata normal form. 171/2952 useless extension candidates. Maximal degree in co-relation 20316. Up to 643 conditions per place. [2024-05-12 11:10:57,900 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 95 selfloop transitions, 78 changer transitions 102/279 dead transitions. [2024-05-12 11:10:57,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 279 transitions, 4828 flow [2024-05-12 11:10:57,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-12 11:10:57,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2024-05-12 11:10:57,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 463 transitions. [2024-05-12 11:10:57,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5144444444444445 [2024-05-12 11:10:57,902 INFO L175 Difference]: Start difference. First operand has 143 places, 84 transitions, 1297 flow. Second operand 30 states and 463 transitions. [2024-05-12 11:10:57,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 279 transitions, 4828 flow [2024-05-12 11:10:58,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 279 transitions, 4109 flow, removed 324 selfloop flow, removed 20 redundant places. [2024-05-12 11:10:58,012 INFO L231 Difference]: Finished difference. Result has 164 places, 105 transitions, 1879 flow [2024-05-12 11:10:58,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1879, PETRI_PLACES=164, PETRI_TRANSITIONS=105} [2024-05-12 11:10:58,012 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 132 predicate places. [2024-05-12 11:10:58,013 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 105 transitions, 1879 flow [2024-05-12 11:10:58,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.533333333333333) internal successors, (158), 15 states have internal predecessors, (158), 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-05-12 11:10:58,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:58,013 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:58,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-12 11:10:58,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-05-12 11:10:58,225 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:10:58,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:58,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1163821743, now seen corresponding path program 3 times [2024-05-12 11:10:58,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:58,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309166628] [2024-05-12 11:10:58,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:58,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:58,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:58,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309166628] [2024-05-12 11:10:58,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309166628] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 11:10:58,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404680067] [2024-05-12 11:10:58,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-12 11:10:58,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:10:58,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:10:58,371 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 11:10:58,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-12 11:10:58,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-05-12 11:10:58,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 11:10:58,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2024-05-12 11:10:58,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 11:10:58,493 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:58,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 11:10:58,646 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:58,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404680067] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 11:10:58,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 11:10:58,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2024-05-12 11:10:58,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493461680] [2024-05-12 11:10:58,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 11:10:58,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-05-12 11:10:58,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:58,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-05-12 11:10:58,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2024-05-12 11:10:58,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:10:58,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 105 transitions, 1879 flow. Second operand has 24 states, 24 states have (on average 10.291666666666666) internal successors, (247), 24 states have internal predecessors, (247), 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-05-12 11:10:58,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:58,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:10:58,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:59,985 INFO L124 PetriNetUnfolderBase]: 2107/3862 cut-off events. [2024-05-12 11:10:59,985 INFO L125 PetriNetUnfolderBase]: For 283102/283102 co-relation queries the response was YES. [2024-05-12 11:10:59,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32712 conditions, 3862 events. 2107/3862 cut-off events. For 283102/283102 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 19832 event pairs, 56 based on Foata normal form. 144/4002 useless extension candidates. Maximal degree in co-relation 32634. Up to 877 conditions per place. [2024-05-12 11:11:00,013 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 145 selfloop transitions, 112 changer transitions 135/396 dead transitions. [2024-05-12 11:11:00,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 396 transitions, 7747 flow [2024-05-12 11:11:00,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-12 11:11:00,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2024-05-12 11:11:00,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 707 transitions. [2024-05-12 11:11:00,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5123188405797101 [2024-05-12 11:11:00,015 INFO L175 Difference]: Start difference. First operand has 164 places, 105 transitions, 1879 flow. Second operand 46 states and 707 transitions. [2024-05-12 11:11:00,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 396 transitions, 7747 flow [2024-05-12 11:11:00,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 396 transitions, 6705 flow, removed 481 selfloop flow, removed 22 redundant places. [2024-05-12 11:11:00,170 INFO L231 Difference]: Finished difference. Result has 207 places, 139 transitions, 2937 flow [2024-05-12 11:11:00,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1443, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=2937, PETRI_PLACES=207, PETRI_TRANSITIONS=139} [2024-05-12 11:11:00,172 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 175 predicate places. [2024-05-12 11:11:00,172 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 139 transitions, 2937 flow [2024-05-12 11:11:00,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.291666666666666) internal successors, (247), 24 states have internal predecessors, (247), 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-05-12 11:11:00,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:11:00,173 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:11:00,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-05-12 11:11:00,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-05-12 11:11:00,385 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:11:00,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:11:00,386 INFO L85 PathProgramCache]: Analyzing trace with hash 2074897144, now seen corresponding path program 4 times [2024-05-12 11:11:00,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:11:00,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999344167] [2024-05-12 11:11:00,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:11:00,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:11:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:11:00,746 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:00,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:11:00,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999344167] [2024-05-12 11:11:00,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999344167] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 11:11:00,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471812251] [2024-05-12 11:11:00,747 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-12 11:11:00,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:11:00,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:11:00,748 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 11:11:00,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-05-12 11:11:00,824 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-12 11:11:00,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 11:11:00,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 20 conjunts are in the unsatisfiable core [2024-05-12 11:11:00,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 11:11:00,953 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:00,953 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 11:11:01,349 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:01,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471812251] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 11:11:01,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 11:11:01,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2024-05-12 11:11:01,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408323339] [2024-05-12 11:11:01,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 11:11:01,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-05-12 11:11:01,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:11:01,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-05-12 11:11:01,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=923, Unknown=0, NotChecked=0, Total=1190 [2024-05-12 11:11:01,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:11:01,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 139 transitions, 2937 flow. Second operand has 35 states, 35 states have (on average 10.228571428571428) internal successors, (358), 35 states have internal predecessors, (358), 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-05-12 11:11:01,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:11:01,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:11:01,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:11:03,522 INFO L124 PetriNetUnfolderBase]: 2845/5393 cut-off events. [2024-05-12 11:11:03,523 INFO L125 PetriNetUnfolderBase]: For 738986/738986 co-relation queries the response was YES. [2024-05-12 11:11:03,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59819 conditions, 5393 events. 2845/5393 cut-off events. For 738986/738986 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 28662 event pairs, 556 based on Foata normal form. 270/5655 useless extension candidates. Maximal degree in co-relation 59725. Up to 1972 conditions per place. [2024-05-12 11:11:03,565 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 192 selfloop transitions, 99 changer transitions 189/484 dead transitions. [2024-05-12 11:11:03,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 484 transitions, 13132 flow [2024-05-12 11:11:03,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-05-12 11:11:03,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2024-05-12 11:11:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 821 transitions. [2024-05-12 11:11:03,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49757575757575756 [2024-05-12 11:11:03,567 INFO L175 Difference]: Start difference. First operand has 207 places, 139 transitions, 2937 flow. Second operand 55 states and 821 transitions. [2024-05-12 11:11:03,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 484 transitions, 13132 flow [2024-05-12 11:11:03,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 484 transitions, 9887 flow, removed 1583 selfloop flow, removed 26 redundant places. [2024-05-12 11:11:03,964 INFO L231 Difference]: Finished difference. Result has 258 places, 181 transitions, 3834 flow [2024-05-12 11:11:03,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2022, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=3834, PETRI_PLACES=258, PETRI_TRANSITIONS=181} [2024-05-12 11:11:03,964 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 226 predicate places. [2024-05-12 11:11:03,965 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 181 transitions, 3834 flow [2024-05-12 11:11:03,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 10.228571428571428) internal successors, (358), 35 states have internal predecessors, (358), 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-05-12 11:11:03,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:11:03,965 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:11:03,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-05-12 11:11:04,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:11:04,177 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:11:04,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:11:04,178 INFO L85 PathProgramCache]: Analyzing trace with hash -995534098, now seen corresponding path program 5 times [2024-05-12 11:11:04,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:11:04,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844491649] [2024-05-12 11:11:04,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:11:04,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:11:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:11:04,513 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:04,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:11:04,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844491649] [2024-05-12 11:11:04,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844491649] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 11:11:04,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924289176] [2024-05-12 11:11:04,514 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-12 11:11:04,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:11:04,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:11:04,516 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 11:11:04,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-05-12 11:11:04,588 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-05-12 11:11:04,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 11:11:04,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 20 conjunts are in the unsatisfiable core [2024-05-12 11:11:04,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 11:11:04,698 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 1 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:04,698 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 11:11:05,070 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:05,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924289176] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 11:11:05,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 11:11:05,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2024-05-12 11:11:05,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760574516] [2024-05-12 11:11:05,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 11:11:05,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-05-12 11:11:05,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:11:05,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-05-12 11:11:05,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1036, Unknown=0, NotChecked=0, Total=1260 [2024-05-12 11:11:05,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:11:05,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 181 transitions, 3834 flow. Second operand has 36 states, 36 states have (on average 10.222222222222221) internal successors, (368), 36 states have internal predecessors, (368), 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-05-12 11:11:05,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:11:05,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:11:05,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:11:08,101 INFO L124 PetriNetUnfolderBase]: 3457/6822 cut-off events. [2024-05-12 11:11:08,101 INFO L125 PetriNetUnfolderBase]: For 1331817/1331817 co-relation queries the response was YES. [2024-05-12 11:11:08,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81634 conditions, 6822 events. 3457/6822 cut-off events. For 1331817/1331817 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 39631 event pairs, 310 based on Foata normal form. 270/7088 useless extension candidates. Maximal degree in co-relation 81521. Up to 1693 conditions per place. [2024-05-12 11:11:08,171 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 183 selfloop transitions, 191 changer transitions 201/579 dead transitions. [2024-05-12 11:11:08,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 579 transitions, 16244 flow [2024-05-12 11:11:08,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-05-12 11:11:08,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2024-05-12 11:11:08,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 917 transitions. [2024-05-12 11:11:08,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010928961748634 [2024-05-12 11:11:08,176 INFO L175 Difference]: Start difference. First operand has 258 places, 181 transitions, 3834 flow. Second operand 61 states and 917 transitions. [2024-05-12 11:11:08,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 579 transitions, 16244 flow [2024-05-12 11:11:09,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 579 transitions, 13700 flow, removed 1237 selfloop flow, removed 31 redundant places. [2024-05-12 11:11:09,033 INFO L231 Difference]: Finished difference. Result has 306 places, 242 transitions, 5759 flow [2024-05-12 11:11:09,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2922, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=5759, PETRI_PLACES=306, PETRI_TRANSITIONS=242} [2024-05-12 11:11:09,033 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 274 predicate places. [2024-05-12 11:11:09,033 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 242 transitions, 5759 flow [2024-05-12 11:11:09,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 10.222222222222221) internal successors, (368), 36 states have internal predecessors, (368), 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-05-12 11:11:09,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:11:09,034 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:11:09,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-05-12 11:11:09,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-05-12 11:11:09,245 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:11:09,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:11:09,245 INFO L85 PathProgramCache]: Analyzing trace with hash 863619206, now seen corresponding path program 6 times [2024-05-12 11:11:09,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:11:09,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104618146] [2024-05-12 11:11:09,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:11:09,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:11:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:11:09,513 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:09,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:11:09,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104618146] [2024-05-12 11:11:09,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104618146] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 11:11:09,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636034588] [2024-05-12 11:11:09,514 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-12 11:11:09,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:11:09,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:11:09,532 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 11:11:09,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-05-12 11:11:09,644 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-05-12 11:11:09,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 11:11:09,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 20 conjunts are in the unsatisfiable core [2024-05-12 11:11:09,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 11:11:09,785 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:09,785 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 11:11:10,069 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:10,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636034588] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 11:11:10,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 11:11:10,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2024-05-12 11:11:10,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170106501] [2024-05-12 11:11:10,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 11:11:10,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-05-12 11:11:10,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:11:10,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-05-12 11:11:10,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2024-05-12 11:11:10,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:11:10,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 242 transitions, 5759 flow. Second operand has 35 states, 35 states have (on average 10.228571428571428) internal successors, (358), 35 states have internal predecessors, (358), 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-05-12 11:11:10,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:11:10,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:11:10,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:11:13,985 INFO L124 PetriNetUnfolderBase]: 4663/9203 cut-off events. [2024-05-12 11:11:13,986 INFO L125 PetriNetUnfolderBase]: For 2718702/2718702 co-relation queries the response was YES. [2024-05-12 11:11:14,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130659 conditions, 9203 events. 4663/9203 cut-off events. For 2718702/2718702 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 56642 event pairs, 92 based on Foata normal form. 270/9465 useless extension candidates. Maximal degree in co-relation 130528. Up to 2281 conditions per place. [2024-05-12 11:11:14,081 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 228 selfloop transitions, 272 changer transitions 205/709 dead transitions. [2024-05-12 11:11:14,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 709 transitions, 23227 flow [2024-05-12 11:11:14,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-05-12 11:11:14,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2024-05-12 11:11:14,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 1084 transitions. [2024-05-12 11:11:14,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5089201877934272 [2024-05-12 11:11:14,084 INFO L175 Difference]: Start difference. First operand has 306 places, 242 transitions, 5759 flow. Second operand 71 states and 1084 transitions. [2024-05-12 11:11:14,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 709 transitions, 23227 flow [2024-05-12 11:11:15,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 709 transitions, 19356 flow, removed 1891 selfloop flow, removed 31 redundant places. [2024-05-12 11:11:15,487 INFO L231 Difference]: Finished difference. Result has 370 places, 303 transitions, 8170 flow [2024-05-12 11:11:15,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=4290, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=8170, PETRI_PLACES=370, PETRI_TRANSITIONS=303} [2024-05-12 11:11:15,488 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 338 predicate places. [2024-05-12 11:11:15,488 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 303 transitions, 8170 flow [2024-05-12 11:11:15,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 10.228571428571428) internal successors, (358), 35 states have internal predecessors, (358), 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-05-12 11:11:15,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:11:15,488 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:11:15,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-05-12 11:11:15,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-05-12 11:11:15,699 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:11:15,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:11:15,700 INFO L85 PathProgramCache]: Analyzing trace with hash 418560832, now seen corresponding path program 7 times [2024-05-12 11:11:15,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:11:15,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374786060] [2024-05-12 11:11:15,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:11:15,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:11:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:11:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:16,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:11:16,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374786060] [2024-05-12 11:11:16,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374786060] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 11:11:16,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960818199] [2024-05-12 11:11:16,081 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-05-12 11:11:16,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:11:16,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:11:16,082 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 11:11:16,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-05-12 11:11:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:11:16,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2024-05-12 11:11:16,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 11:11:16,308 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:16,308 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 11:11:16,782 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:16,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960818199] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 11:11:16,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 11:11:16,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2024-05-12 11:11:16,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163055850] [2024-05-12 11:11:16,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 11:11:16,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-05-12 11:11:16,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:11:16,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-05-12 11:11:16,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1519, Unknown=0, NotChecked=0, Total=1980 [2024-05-12 11:11:17,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:11:17,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 303 transitions, 8170 flow. Second operand has 45 states, 45 states have (on average 10.177777777777777) internal successors, (458), 45 states have internal predecessors, (458), 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-05-12 11:11:17,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:11:17,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:11:17,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:11:23,864 INFO L124 PetriNetUnfolderBase]: 6688/12971 cut-off events. [2024-05-12 11:11:23,864 INFO L125 PetriNetUnfolderBase]: For 5906203/5906203 co-relation queries the response was YES. [2024-05-12 11:11:23,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219620 conditions, 12971 events. 6688/12971 cut-off events. For 5906203/5906203 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 79987 event pairs, 86 based on Foata normal form. 549/13516 useless extension candidates. Maximal degree in co-relation 219463. Up to 3157 conditions per place. [2024-05-12 11:11:24,027 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 316 selfloop transitions, 401 changer transitions 341/1062 dead transitions. [2024-05-12 11:11:24,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 1062 transitions, 44257 flow [2024-05-12 11:11:24,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-05-12 11:11:24,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2024-05-12 11:11:24,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 1603 transitions. [2024-05-12 11:11:24,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5088888888888888 [2024-05-12 11:11:24,030 INFO L175 Difference]: Start difference. First operand has 370 places, 303 transitions, 8170 flow. Second operand 105 states and 1603 transitions. [2024-05-12 11:11:24,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 1062 transitions, 44257 flow [2024-05-12 11:11:28,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 1062 transitions, 33843 flow, removed 5114 selfloop flow, removed 36 redundant places. [2024-05-12 11:11:28,053 INFO L231 Difference]: Finished difference. Result has 485 places, 434 transitions, 13399 flow [2024-05-12 11:11:28,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=5754, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=272, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=13399, PETRI_PLACES=485, PETRI_TRANSITIONS=434} [2024-05-12 11:11:28,054 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 453 predicate places. [2024-05-12 11:11:28,054 INFO L495 AbstractCegarLoop]: Abstraction has has 485 places, 434 transitions, 13399 flow [2024-05-12 11:11:28,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 10.177777777777777) internal successors, (458), 45 states have internal predecessors, (458), 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-05-12 11:11:28,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:11:28,055 INFO L208 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:11:28,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-05-12 11:11:28,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:11:28,259 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:11:28,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:11:28,259 INFO L85 PathProgramCache]: Analyzing trace with hash -309399472, now seen corresponding path program 8 times [2024-05-12 11:11:28,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:11:28,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864189035] [2024-05-12 11:11:28,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:11:28,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:11:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:11:29,143 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 0 proven. 885 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-12 11:11:29,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:11:29,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864189035] [2024-05-12 11:11:29,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864189035] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 11:11:29,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162449755] [2024-05-12 11:11:29,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-12 11:11:29,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:11:29,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:11:29,144 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 11:11:29,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-05-12 11:11:29,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-12 11:11:29,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 11:11:29,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 42 conjunts are in the unsatisfiable core [2024-05-12 11:11:29,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 11:11:29,361 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 0 proven. 885 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-12 11:11:29,361 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 11:11:29,834 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 0 proven. 885 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-12 11:11:29,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162449755] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 11:11:29,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 11:11:29,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 45 [2024-05-12 11:11:29,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245302595] [2024-05-12 11:11:29,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 11:11:29,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-05-12 11:11:29,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:11:29,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-05-12 11:11:29,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=1610, Unknown=0, NotChecked=0, Total=2070 [2024-05-12 11:11:30,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:11:30,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 434 transitions, 13399 flow. Second operand has 46 states, 46 states have (on average 10.326086956521738) internal successors, (475), 46 states have internal predecessors, (475), 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-05-12 11:11:30,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:11:30,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:11:30,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:11:37,491 INFO L124 PetriNetUnfolderBase]: 7669/14666 cut-off events. [2024-05-12 11:11:37,492 INFO L125 PetriNetUnfolderBase]: For 8613200/8613200 co-relation queries the response was YES. [2024-05-12 11:11:37,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255114 conditions, 14666 events. 7669/14666 cut-off events. For 8613200/8613200 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 90642 event pairs, 52 based on Foata normal form. 72/14734 useless extension candidates. Maximal degree in co-relation 254911. Up to 3523 conditions per place. [2024-05-12 11:11:37,855 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 318 selfloop transitions, 578 changer transitions 199/1099 dead transitions. [2024-05-12 11:11:37,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 1099 transitions, 49248 flow [2024-05-12 11:11:37,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-05-12 11:11:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2024-05-12 11:11:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 1333 transitions. [2024-05-12 11:11:37,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5049242424242424 [2024-05-12 11:11:37,859 INFO L175 Difference]: Start difference. First operand has 485 places, 434 transitions, 13399 flow. Second operand 88 states and 1333 transitions. [2024-05-12 11:11:37,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 1099 transitions, 49248 flow [2024-05-12 11:11:52,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 1099 transitions, 31376 flow, removed 8778 selfloop flow, removed 54 redundant places. [2024-05-12 11:11:52,977 INFO L231 Difference]: Finished difference. Result has 515 places, 615 transitions, 14559 flow [2024-05-12 11:11:52,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=8484, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=402, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=88, PETRI_FLOW=14559, PETRI_PLACES=515, PETRI_TRANSITIONS=615} [2024-05-12 11:11:52,978 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 483 predicate places. [2024-05-12 11:11:52,979 INFO L495 AbstractCegarLoop]: Abstraction has has 515 places, 615 transitions, 14559 flow [2024-05-12 11:11:52,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 10.326086956521738) internal successors, (475), 46 states have internal predecessors, (475), 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-05-12 11:11:52,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:11:52,979 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:11:52,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-05-12 11:11:53,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:11:53,190 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:11:53,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:11:53,191 INFO L85 PathProgramCache]: Analyzing trace with hash -244220117, now seen corresponding path program 9 times [2024-05-12 11:11:53,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:11:53,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971919557] [2024-05-12 11:11:53,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:11:53,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:11:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 11:11:53,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-12 11:11:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 11:11:53,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-12 11:11:53,315 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-12 11:11:53,316 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-05-12 11:11:53,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-05-12 11:11:53,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-05-12 11:11:53,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-05-12 11:11:53,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-05-12 11:11:53,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 11:11:53,318 INFO L445 BasicCegarLoop]: Path program histogram: [9, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-05-12 11:11:53,322 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-12 11:11:53,322 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-12 11:11:53,426 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-05-12 11:11:53,426 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-05-12 11:11:53,427 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.05 11:11:53 BasicIcfg [2024-05-12 11:11:53,427 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-12 11:11:53,427 INFO L158 Benchmark]: Toolchain (without parser) took 66279.14ms. Allocated memory was 192.9MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 117.2MB in the beginning and 5.8GB in the end (delta: -5.7GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2024-05-12 11:11:53,428 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 192.9MB. Free memory is still 151.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 11:11:53,428 INFO L158 Benchmark]: Witness Parser took 0.12ms. Allocated memory is still 192.9MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 11:11:53,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.92ms. Allocated memory is still 192.9MB. Free memory was 116.9MB in the beginning and 161.4MB in the end (delta: -44.5MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2024-05-12 11:11:53,428 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.77ms. Allocated memory is still 192.9MB. Free memory was 161.4MB in the beginning and 159.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-05-12 11:11:53,428 INFO L158 Benchmark]: Boogie Preprocessor took 60.36ms. Allocated memory is still 192.9MB. Free memory was 159.3MB in the beginning and 156.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-05-12 11:11:53,429 INFO L158 Benchmark]: RCFGBuilder took 468.94ms. Allocated memory is still 192.9MB. Free memory was 156.5MB in the beginning and 132.7MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-05-12 11:11:53,429 INFO L158 Benchmark]: TraceAbstraction took 65175.10ms. Allocated memory was 192.9MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 132.0MB in the beginning and 5.8GB in the end (delta: -5.7GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2024-05-12 11:11:53,430 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 192.9MB. Free memory is still 151.8MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.12ms. Allocated memory is still 192.9MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 516.92ms. Allocated memory is still 192.9MB. Free memory was 116.9MB in the beginning and 161.4MB in the end (delta: -44.5MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.77ms. Allocated memory is still 192.9MB. Free memory was 161.4MB in the beginning and 159.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.36ms. Allocated memory is still 192.9MB. Free memory was 159.3MB in the beginning and 156.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 468.94ms. Allocated memory is still 192.9MB. Free memory was 156.5MB in the beginning and 132.7MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 65175.10ms. Allocated memory was 192.9MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 132.0MB in the beginning and 5.8GB in the end (delta: -5.7GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; VAL [\old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1={5:0}, id2={3:0}, j=6] [L713] 0 //@ ghost multithreaded = 1; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1={5:0}, id2={3:0}, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] 0 //@ assert ((((!multithreaded || (((((0 <= j) && (4 <= j)) && ((j % 2) == 0)) && (j != 0)) && (j != 1))) && (!multithreaded || ((((-7LL + (long long) i) + (long long) j) >= 0LL) && (((1LL - (long long) i) + (long long) j) >= 0LL)))) && (!multithreaded || (((((((((0 <= i) && (0 <= j)) && (3 <= i)) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)) && (i != 0)) && (j != 0)) && (j != 1)))) && (!multithreaded || ((((0 <= i) && (3 <= i)) && ((i % 2) == 1)) && (i != 0)))); [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, argc=51, i=3, id1={5:0}, id2={3:0}, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=10] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=11] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=11] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=11] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=12] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=12] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=13] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=13] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=13] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=13] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=14] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=14] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=14] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=14, k=15] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=15] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=16] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=16] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=17] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=17] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=17] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=18] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=18] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=19] [L715] 0 //@ assert ((((!multithreaded || (((((0 <= j) && (4 <= j)) && ((j % 2) == 0)) && (j != 0)) && (j != 1))) && (!multithreaded || ((((-7LL + (long long) i) + (long long) j) >= 0LL) && (((1LL - (long long) i) + (long long) j) >= 0LL)))) && (!multithreaded || (((((((((0 <= i) && (0 <= j)) && (3 <= i)) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)) && (i != 0)) && (j != 0)) && (j != 1)))) && (!multithreaded || ((((0 <= i) && (3 <= i)) && ((i % 2) == 1)) && (i != 0)))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, i=43, id1={5:0}, id2={3:0}, j=44, k=18, k=19] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L716] 0 int condI = i >= (2*20 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, i=43, id1={5:0}, id2={3:0}, j=44, k=19, k=19] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] [L719] 0 int condJ = j >= (2*20 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1={5:0}, id2={3:0}, j=46, k=19, k=19] [L721] COND TRUE 0 condI || condJ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1={5:0}, id2={3:0}, j=46, k=19, k=19] [L722] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1={5:0}, id2={3:0}, j=46, k=19, k=19] - UnprovableResult [Line: 714]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 40 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 65.0s, OverallIterations: 21, TraceHistogramMax: 20, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 52.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9460 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9294 mSDsluCounter, 431 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 406 mSDsCounter, 448 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11761 IncrementalHoareTripleChecker+Invalid, 12209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 448 mSolverCounterUnsat, 25 mSDtfsCounter, 11761 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1693 GetRequests, 856 SyntacticMatches, 31 SemanticMatches, 806 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22557 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14559occurred in iteration=20, InterpolantAutomatonStates: 598, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 1274 NumberOfCodeBlocks, 1274 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 1607 ConstructedInterpolants, 0 QuantifiedInterpolants, 6940 SizeOfPredicates, 132 NumberOfNonLiveVariables, 1849 ConjunctsInSsa, 194 ConjunctsInUnsatCore, 42 InterpolantComputations, 9 PerfectInterpolantSequences, 10/4503 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-05-12 11:11:53,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE