./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/bench-exp2x6.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7c74aec Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/bench-exp2x6.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.fix-undeclared-acsl-variable-e7c74ae-m [2024-02-07 19:08:15,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 19:08:15,777 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 19:08:15,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 19:08:15,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 19:08:15,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 19:08:15,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 19:08:15,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 19:08:15,821 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 19:08:15,822 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 19:08:15,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 19:08:15,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 19:08:15,824 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 19:08:15,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 19:08:15,828 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 19:08:15,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 19:08:15,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 19:08:15,830 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 19:08:15,830 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 19:08:15,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 19:08:15,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 19:08:15,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 19:08:15,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 19:08:15,832 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 19:08:15,832 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 19:08:15,832 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 19:08:15,833 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 19:08:15,833 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 19:08:15,834 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 19:08:15,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 19:08:15,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 19:08:15,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 19:08:15,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:08:15,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 19:08:15,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 19:08:15,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 19:08:15,836 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 19:08:15,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 19:08:15,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 19:08:15,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 19:08:15,837 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 19:08:15,838 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 19:08:15,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 19:08:15,838 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-02-07 19:08:16,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 19:08:16,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 19:08:16,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 19:08:16,148 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 19:08:16,149 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 19:08:16,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/bench-exp2x6.wvr.yml/witness.yml [2024-02-07 19:08:16,239 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 19:08:16,239 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 19:08:16,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2024-02-07 19:08:17,416 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 19:08:17,609 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 19:08:17,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2024-02-07 19:08:17,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eb3156bf/5fa47e01419249fe80d52cfb27c15541/FLAG978682b30 [2024-02-07 19:08:17,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eb3156bf/5fa47e01419249fe80d52cfb27c15541 [2024-02-07 19:08:17,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 19:08:17,630 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 19:08:17,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 19:08:17,634 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 19:08:17,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 19:08:17,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:08:16" (1/2) ... [2024-02-07 19:08:17,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@757f221f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:08:17, skipping insertion in model container [2024-02-07 19:08:17,640 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:08:16" (1/2) ... [2024-02-07 19:08:17,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4284e3fb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:08:17, skipping insertion in model container [2024-02-07 19:08:17,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:08:17" (2/2) ... [2024-02-07 19:08:17,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@757f221f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:17, skipping insertion in model container [2024-02-07 19:08:17,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:08:17" (2/2) ... [2024-02-07 19:08:17,643 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 19:08:17,656 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 19:08:17,658 INFO L76 edCorrectnessWitness]: Location invariant before [L85-L85] ((((0LL - (long long )x1) + (long long )x3 >= 0LL) && ((long long )x1 + (long long )x3 >= 0LL)) && ((0LL - (long long )x1) - (long long )x3 >= 0LL)) && ((long long )x1 - (long long )x3 >= 0LL) [2024-02-07 19:08:17,688 INFO L181 MainTranslator]: Built tables and reachable declarations [2024-02-07 19:08:17,918 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c[2505,2518] [2024-02-07 19:08:17,923 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:08:17,932 INFO L206 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 19:08:17,991 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c[2505,2518] [2024-02-07 19:08:17,993 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:08:18,013 INFO L211 MainTranslator]: Completed translation [2024-02-07 19:08:18,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:18 WrapperNode [2024-02-07 19:08:18,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 19:08:18,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 19:08:18,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 19:08:18,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 19:08:18,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:18" (1/1) ... [2024-02-07 19:08:18,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:18" (1/1) ... [2024-02-07 19:08:18,086 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2024-02-07 19:08:18,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 19:08:18,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 19:08:18,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 19:08:18,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 19:08:18,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:18" (1/1) ... [2024-02-07 19:08:18,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:18" (1/1) ... [2024-02-07 19:08:18,116 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:18" (1/1) ... [2024-02-07 19:08:18,139 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-02-07 19:08:18,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:18" (1/1) ... [2024-02-07 19:08:18,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:18" (1/1) ... [2024-02-07 19:08:18,154 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:18" (1/1) ... [2024-02-07 19:08:18,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:18" (1/1) ... [2024-02-07 19:08:18,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:18" (1/1) ... [2024-02-07 19:08:18,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:18" (1/1) ... [2024-02-07 19:08:18,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 19:08:18,173 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 19:08:18,173 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 19:08:18,173 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 19:08:18,174 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:18" (1/1) ... [2024-02-07 19:08:18,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:08:18,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:08:18,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-07 19:08:18,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-07 19:08:18,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 19:08:18,246 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-07 19:08:18,246 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-07 19:08:18,246 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-07 19:08:18,246 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-07 19:08:18,247 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-07 19:08:18,247 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-07 19:08:18,247 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-02-07 19:08:18,247 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-02-07 19:08:18,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 19:08:18,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 19:08:18,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 19:08:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 19:08:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-07 19:08:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 19:08:18,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 19:08:18,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 19:08:18,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 19:08:18,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 19:08:18,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-07 19:08:18,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 19:08:18,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 19:08:18,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-07 19:08:18,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-07 19:08:18,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-07 19:08:18,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-07 19:08:18,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-07 19:08:18,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 19:08:18,255 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-07 19:08:18,393 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 19:08:18,395 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 19:08:18,702 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 19:08:18,702 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 19:08:18,870 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 19:08:18,870 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-07 19:08:18,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:08:18 BoogieIcfgContainer [2024-02-07 19:08:18,871 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 19:08:18,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 19:08:18,873 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 19:08:18,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 19:08:18,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:08:16" (1/4) ... [2024-02-07 19:08:18,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7439b08f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:08:18, skipping insertion in model container [2024-02-07 19:08:18,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 07:08:17" (2/4) ... [2024-02-07 19:08:18,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7439b08f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:08:18, skipping insertion in model container [2024-02-07 19:08:18,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:08:18" (3/4) ... [2024-02-07 19:08:18,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7439b08f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:08:18, skipping insertion in model container [2024-02-07 19:08:18,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:08:18" (4/4) ... [2024-02-07 19:08:18,880 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x6.wvr.c [2024-02-07 19:08:18,896 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 19:08:18,896 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-02-07 19:08:18,896 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 19:08:18,944 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-07 19:08:18,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 102 flow [2024-02-07 19:08:19,004 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2024-02-07 19:08:19,004 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-07 19:08:19,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 33 events. 4/33 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2024-02-07 19:08:19,007 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 37 transitions, 102 flow [2024-02-07 19:08:19,010 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 32 transitions, 88 flow [2024-02-07 19:08:19,020 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 19:08:19,027 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;@19606057, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 19:08:19,027 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-02-07 19:08:19,029 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 19:08:19,030 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-07 19:08:19,030 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:08:19,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:08:19,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-07 19:08:19,031 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:08:19,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:08:19,037 INFO L85 PathProgramCache]: Analyzing trace with hash 11290, now seen corresponding path program 1 times [2024-02-07 19:08:19,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:08:19,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455599434] [2024-02-07 19:08:19,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:08:19,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:08:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:08:19,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:19,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:08:19,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455599434] [2024-02-07 19:08:19,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455599434] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:08:19,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:08:19,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:08:19,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666862825] [2024-02-07 19:08:19,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:08:19,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:08:19,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:08:19,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:08:19,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:08:19,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-02-07 19:08:19,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:08:19,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:08:19,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-02-07 19:08:19,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:08:19,774 INFO L124 PetriNetUnfolderBase]: 1172/1495 cut-off events. [2024-02-07 19:08:19,774 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-02-07 19:08:19,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3084 conditions, 1495 events. 1172/1495 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4768 event pairs, 537 based on Foata normal form. 0/842 useless extension candidates. Maximal degree in co-relation 2325. Up to 1463 conditions per place. [2024-02-07 19:08:19,799 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 24 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2024-02-07 19:08:19,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 138 flow [2024-02-07 19:08:19,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:08:19,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:08:19,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2024-02-07 19:08:19,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-02-07 19:08:19,816 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 88 flow. Second operand 3 states and 54 transitions. [2024-02-07 19:08:19,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 138 flow [2024-02-07 19:08:19,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-02-07 19:08:19,825 INFO L231 Difference]: Finished difference. Result has 34 places, 31 transitions, 74 flow [2024-02-07 19:08:19,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=34, PETRI_TRANSITIONS=31} [2024-02-07 19:08:19,833 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2024-02-07 19:08:19,833 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 31 transitions, 74 flow [2024-02-07 19:08:19,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:08:19,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:08:19,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:08:19,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 19:08:19,835 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:08:19,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:08:19,837 INFO L85 PathProgramCache]: Analyzing trace with hash -44251893, now seen corresponding path program 1 times [2024-02-07 19:08:19,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:08:19,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549737350] [2024-02-07 19:08:19,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:08:19,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:08:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:08:20,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:20,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:08:20,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549737350] [2024-02-07 19:08:20,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549737350] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:08:20,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:08:20,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:08:20,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406527844] [2024-02-07 19:08:20,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:08:20,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:08:20,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:08:20,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:08:20,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:08:20,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 19:08:20,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:08:20,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:08:20,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 19:08:20,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:08:20,418 INFO L124 PetriNetUnfolderBase]: 1537/1956 cut-off events. [2024-02-07 19:08:20,418 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-02-07 19:08:20,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3952 conditions, 1956 events. 1537/1956 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6372 event pairs, 141 based on Foata normal form. 1/1129 useless extension candidates. Maximal degree in co-relation 3943. Up to 1733 conditions per place. [2024-02-07 19:08:20,431 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 42 selfloop transitions, 5 changer transitions 1/53 dead transitions. [2024-02-07 19:08:20,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 53 transitions, 221 flow [2024-02-07 19:08:20,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:08:20,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:08:20,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-02-07 19:08:20,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7117117117117117 [2024-02-07 19:08:20,434 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 74 flow. Second operand 3 states and 79 transitions. [2024-02-07 19:08:20,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 53 transitions, 221 flow [2024-02-07 19:08:20,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 53 transitions, 217 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:08:20,437 INFO L231 Difference]: Finished difference. Result has 35 places, 35 transitions, 103 flow [2024-02-07 19:08:20,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=35, PETRI_TRANSITIONS=35} [2024-02-07 19:08:20,438 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -6 predicate places. [2024-02-07 19:08:20,438 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 35 transitions, 103 flow [2024-02-07 19:08:20,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:08:20,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:08:20,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:08:20,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 19:08:20,439 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:08:20,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:08:20,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2060879258, now seen corresponding path program 1 times [2024-02-07 19:08:20,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:08:20,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379415052] [2024-02-07 19:08:20,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:08:20,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:08:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:08:20,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:20,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:08:20,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379415052] [2024-02-07 19:08:20,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379415052] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:08:20,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:08:20,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:08:20,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189000186] [2024-02-07 19:08:20,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:08:20,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:08:20,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:08:20,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:08:20,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:08:20,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 19:08:20,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 35 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:08:20,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:08:20,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 19:08:20,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:08:20,966 INFO L124 PetriNetUnfolderBase]: 1843/2369 cut-off events. [2024-02-07 19:08:20,966 INFO L125 PetriNetUnfolderBase]: For 599/599 co-relation queries the response was YES. [2024-02-07 19:08:20,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5876 conditions, 2369 events. 1843/2369 cut-off events. For 599/599 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8395 event pairs, 99 based on Foata normal form. 34/2393 useless extension candidates. Maximal degree in co-relation 1448. Up to 967 conditions per place. [2024-02-07 19:08:20,985 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 72 selfloop transitions, 11 changer transitions 0/88 dead transitions. [2024-02-07 19:08:20,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 88 transitions, 419 flow [2024-02-07 19:08:20,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:08:20,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:08:20,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2024-02-07 19:08:20,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6864864864864865 [2024-02-07 19:08:20,991 INFO L175 Difference]: Start difference. First operand has 35 places, 35 transitions, 103 flow. Second operand 5 states and 127 transitions. [2024-02-07 19:08:20,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 88 transitions, 419 flow [2024-02-07 19:08:20,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 88 transitions, 411 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:08:20,994 INFO L231 Difference]: Finished difference. Result has 40 places, 42 transitions, 167 flow [2024-02-07 19:08:20,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=40, PETRI_TRANSITIONS=42} [2024-02-07 19:08:20,996 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2024-02-07 19:08:20,996 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 42 transitions, 167 flow [2024-02-07 19:08:20,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:08:20,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:08:20,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:08:20,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 19:08:20,997 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:08:20,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:08:20,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1594374882, now seen corresponding path program 2 times [2024-02-07 19:08:20,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:08:20,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532131027] [2024-02-07 19:08:20,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:08:20,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:08:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:08:21,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:21,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:08:21,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532131027] [2024-02-07 19:08:21,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532131027] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:08:21,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:08:21,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:08:21,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239434495] [2024-02-07 19:08:21,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:08:21,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:08:21,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:08:21,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:08:21,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:08:21,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 19:08:21,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 42 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:08:21,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:08:21,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 19:08:21,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:08:21,399 INFO L124 PetriNetUnfolderBase]: 1758/2294 cut-off events. [2024-02-07 19:08:21,400 INFO L125 PetriNetUnfolderBase]: For 1843/1843 co-relation queries the response was YES. [2024-02-07 19:08:21,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6893 conditions, 2294 events. 1758/2294 cut-off events. For 1843/1843 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8581 event pairs, 376 based on Foata normal form. 70/2324 useless extension candidates. Maximal degree in co-relation 1747. Up to 1213 conditions per place. [2024-02-07 19:08:21,418 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 73 selfloop transitions, 10 changer transitions 0/88 dead transitions. [2024-02-07 19:08:21,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 88 transitions, 474 flow [2024-02-07 19:08:21,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:08:21,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:08:21,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2024-02-07 19:08:21,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6864864864864865 [2024-02-07 19:08:21,421 INFO L175 Difference]: Start difference. First operand has 40 places, 42 transitions, 167 flow. Second operand 5 states and 127 transitions. [2024-02-07 19:08:21,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 88 transitions, 474 flow [2024-02-07 19:08:21,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 88 transitions, 474 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 19:08:21,425 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 221 flow [2024-02-07 19:08:21,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2024-02-07 19:08:21,426 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2024-02-07 19:08:21,426 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 221 flow [2024-02-07 19:08:21,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:08:21,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:08:21,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:08:21,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 19:08:21,427 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:08:21,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:08:21,428 INFO L85 PathProgramCache]: Analyzing trace with hash -716355681, now seen corresponding path program 1 times [2024-02-07 19:08:21,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:08:21,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997445385] [2024-02-07 19:08:21,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:08:21,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:08:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:08:21,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:21,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:08:21,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997445385] [2024-02-07 19:08:21,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997445385] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:08:21,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:08:21,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:08:21,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056013171] [2024-02-07 19:08:21,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:08:21,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:08:21,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:08:21,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:08:21,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:08:21,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 19:08:21,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 221 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:08:21,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:08:21,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 19:08:21,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:08:21,812 INFO L124 PetriNetUnfolderBase]: 1715/2241 cut-off events. [2024-02-07 19:08:21,812 INFO L125 PetriNetUnfolderBase]: For 3499/3499 co-relation queries the response was YES. [2024-02-07 19:08:21,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7413 conditions, 2241 events. 1715/2241 cut-off events. For 3499/3499 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 8427 event pairs, 119 based on Foata normal form. 58/2289 useless extension candidates. Maximal degree in co-relation 3852. Up to 909 conditions per place. [2024-02-07 19:08:21,837 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 75 selfloop transitions, 9 changer transitions 0/89 dead transitions. [2024-02-07 19:08:21,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 89 transitions, 510 flow [2024-02-07 19:08:21,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:08:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:08:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-02-07 19:08:21,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6810810810810811 [2024-02-07 19:08:21,838 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 221 flow. Second operand 5 states and 126 transitions. [2024-02-07 19:08:21,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 89 transitions, 510 flow [2024-02-07 19:08:21,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 89 transitions, 501 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-02-07 19:08:21,849 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 228 flow [2024-02-07 19:08:21,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=228, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2024-02-07 19:08:21,852 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2024-02-07 19:08:21,852 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 228 flow [2024-02-07 19:08:21,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:08:21,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:08:21,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:08:21,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 19:08:21,853 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:08:21,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:08:21,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1123212444, now seen corresponding path program 1 times [2024-02-07 19:08:21,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:08:21,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362870765] [2024-02-07 19:08:21,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:08:21,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:08:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:08:21,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:21,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:08:21,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362870765] [2024-02-07 19:08:21,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362870765] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:08:21,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:08:21,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:08:21,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472229304] [2024-02-07 19:08:21,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:08:21,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:08:21,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:08:21,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:08:21,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:08:21,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 19:08:21,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:08:21,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:08:21,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 19:08:21,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:08:22,285 INFO L124 PetriNetUnfolderBase]: 2045/2783 cut-off events. [2024-02-07 19:08:22,285 INFO L125 PetriNetUnfolderBase]: For 7100/7104 co-relation queries the response was YES. [2024-02-07 19:08:22,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9834 conditions, 2783 events. 2045/2783 cut-off events. For 7100/7104 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 11663 event pairs, 323 based on Foata normal form. 81/2796 useless extension candidates. Maximal degree in co-relation 5006. Up to 1205 conditions per place. [2024-02-07 19:08:22,306 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 103 selfloop transitions, 8 changer transitions 0/116 dead transitions. [2024-02-07 19:08:22,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 116 transitions, 865 flow [2024-02-07 19:08:22,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:08:22,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:08:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2024-02-07 19:08:22,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6756756756756757 [2024-02-07 19:08:22,308 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 228 flow. Second operand 5 states and 125 transitions. [2024-02-07 19:08:22,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 116 transitions, 865 flow [2024-02-07 19:08:22,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 116 transitions, 830 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-02-07 19:08:22,314 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 270 flow [2024-02-07 19:08:22,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=270, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2024-02-07 19:08:22,315 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2024-02-07 19:08:22,315 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 270 flow [2024-02-07 19:08:22,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:08:22,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:08:22,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:08:22,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 19:08:22,316 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:08:22,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:08:22,316 INFO L85 PathProgramCache]: Analyzing trace with hash 929190725, now seen corresponding path program 1 times [2024-02-07 19:08:22,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:08:22,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169254195] [2024-02-07 19:08:22,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:08:22,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:08:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:08:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:22,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:08:22,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169254195] [2024-02-07 19:08:22,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169254195] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:08:22,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:08:22,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:08:22,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737845848] [2024-02-07 19:08:22,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:08:22,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:08:22,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:08:22,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:08:22,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:08:22,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 19:08:22,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 270 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:08:22,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:08:22,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 19:08:22,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:08:22,742 INFO L124 PetriNetUnfolderBase]: 2003/2729 cut-off events. [2024-02-07 19:08:22,742 INFO L125 PetriNetUnfolderBase]: For 7695/7699 co-relation queries the response was YES. [2024-02-07 19:08:22,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11209 conditions, 2729 events. 2003/2729 cut-off events. For 7695/7699 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 11077 event pairs, 75 based on Foata normal form. 43/2728 useless extension candidates. Maximal degree in co-relation 6895. Up to 1137 conditions per place. [2024-02-07 19:08:22,763 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 104 selfloop transitions, 11 changer transitions 0/120 dead transitions. [2024-02-07 19:08:22,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 120 transitions, 912 flow [2024-02-07 19:08:22,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:08:22,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:08:22,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-02-07 19:08:22,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6648648648648648 [2024-02-07 19:08:22,765 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 270 flow. Second operand 5 states and 123 transitions. [2024-02-07 19:08:22,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 120 transitions, 912 flow [2024-02-07 19:08:22,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 120 transitions, 912 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 19:08:22,776 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 335 flow [2024-02-07 19:08:22,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=335, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2024-02-07 19:08:22,776 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2024-02-07 19:08:22,777 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 335 flow [2024-02-07 19:08:22,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:08:22,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:08:22,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:08:22,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 19:08:22,777 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:08:22,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:08:22,778 INFO L85 PathProgramCache]: Analyzing trace with hash 870327660, now seen corresponding path program 2 times [2024-02-07 19:08:22,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:08:22,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558535113] [2024-02-07 19:08:22,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:08:22,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:08:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:08:22,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:22,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:08:22,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558535113] [2024-02-07 19:08:22,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558535113] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:08:22,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:08:22,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:08:22,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716372370] [2024-02-07 19:08:22,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:08:22,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:08:22,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:08:22,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:08:22,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:08:22,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 19:08:22,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 335 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:08:22,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:08:22,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 19:08:22,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:08:23,207 INFO L124 PetriNetUnfolderBase]: 1801/2441 cut-off events. [2024-02-07 19:08:23,207 INFO L125 PetriNetUnfolderBase]: For 7830/7834 co-relation queries the response was YES. [2024-02-07 19:08:23,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10745 conditions, 2441 events. 1801/2441 cut-off events. For 7830/7834 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 9479 event pairs, 99 based on Foata normal form. 39/2436 useless extension candidates. Maximal degree in co-relation 6631. Up to 987 conditions per place. [2024-02-07 19:08:23,226 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 98 selfloop transitions, 10 changer transitions 4/117 dead transitions. [2024-02-07 19:08:23,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 117 transitions, 919 flow [2024-02-07 19:08:23,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:08:23,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:08:23,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-02-07 19:08:23,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6594594594594595 [2024-02-07 19:08:23,227 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 335 flow. Second operand 5 states and 122 transitions. [2024-02-07 19:08:23,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 117 transitions, 919 flow [2024-02-07 19:08:23,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 117 transitions, 906 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-02-07 19:08:23,241 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 337 flow [2024-02-07 19:08:23,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=337, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2024-02-07 19:08:23,241 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2024-02-07 19:08:23,242 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 337 flow [2024-02-07 19:08:23,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:08:23,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:08:23,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:08:23,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 19:08:23,242 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:08:23,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:08:23,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1914395525, now seen corresponding path program 2 times [2024-02-07 19:08:23,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:08:23,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790283417] [2024-02-07 19:08:23,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:08:23,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:08:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:08:23,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:23,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:08:23,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790283417] [2024-02-07 19:08:23,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790283417] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:08:23,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751926372] [2024-02-07 19:08:23,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-07 19:08:23,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:08:23,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:08:23,332 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 19:08:23,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-07 19:08:23,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-07 19:08:23,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 19:08:23,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-07 19:08:23,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:08:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:23,687 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:08:23,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:23,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751926372] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:08:23,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:08:23,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-02-07 19:08:23,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222833735] [2024-02-07 19:08:23,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:08:23,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 19:08:23,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:08:23,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 19:08:23,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-07 19:08:23,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 19:08:23,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 337 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:08:23,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:08:23,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 19:08:23,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:08:24,141 INFO L124 PetriNetUnfolderBase]: 1725/2377 cut-off events. [2024-02-07 19:08:24,141 INFO L125 PetriNetUnfolderBase]: For 8113/8117 co-relation queries the response was YES. [2024-02-07 19:08:24,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10790 conditions, 2377 events. 1725/2377 cut-off events. For 8113/8117 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9853 event pairs, 293 based on Foata normal form. 77/2398 useless extension candidates. Maximal degree in co-relation 6791. Up to 1307 conditions per place. [2024-02-07 19:08:24,161 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 101 selfloop transitions, 9 changer transitions 0/115 dead transitions. [2024-02-07 19:08:24,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 115 transitions, 933 flow [2024-02-07 19:08:24,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 19:08:24,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 19:08:24,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2024-02-07 19:08:24,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.581081081081081 [2024-02-07 19:08:24,163 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 337 flow. Second operand 6 states and 129 transitions. [2024-02-07 19:08:24,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 115 transitions, 933 flow [2024-02-07 19:08:24,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 115 transitions, 920 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-02-07 19:08:24,172 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 376 flow [2024-02-07 19:08:24,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2024-02-07 19:08:24,173 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2024-02-07 19:08:24,173 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 376 flow [2024-02-07 19:08:24,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:08:24,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:08:24,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:08:24,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-07 19:08:24,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:08:24,394 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:08:24,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:08:24,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1658603593, now seen corresponding path program 2 times [2024-02-07 19:08:24,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:08:24,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953637783] [2024-02-07 19:08:24,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:08:24,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:08:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:08:24,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:24,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:08:24,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953637783] [2024-02-07 19:08:24,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953637783] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:08:24,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:08:24,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:08:24,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586638719] [2024-02-07 19:08:24,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:08:24,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:08:24,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:08:24,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:08:24,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:08:24,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 19:08:24,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 376 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:08:24,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:08:24,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 19:08:24,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:08:24,806 INFO L124 PetriNetUnfolderBase]: 1657/2292 cut-off events. [2024-02-07 19:08:24,807 INFO L125 PetriNetUnfolderBase]: For 8386/8386 co-relation queries the response was YES. [2024-02-07 19:08:24,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11026 conditions, 2292 events. 1657/2292 cut-off events. For 8386/8386 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9629 event pairs, 481 based on Foata normal form. 68/2336 useless extension candidates. Maximal degree in co-relation 9644. Up to 1331 conditions per place. [2024-02-07 19:08:24,826 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 118 selfloop transitions, 8 changer transitions 0/131 dead transitions. [2024-02-07 19:08:24,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 131 transitions, 1120 flow [2024-02-07 19:08:24,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:08:24,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:08:24,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-02-07 19:08:24,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6648648648648648 [2024-02-07 19:08:24,828 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 376 flow. Second operand 5 states and 123 transitions. [2024-02-07 19:08:24,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 131 transitions, 1120 flow [2024-02-07 19:08:24,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 131 transitions, 1060 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-02-07 19:08:24,842 INFO L231 Difference]: Finished difference. Result has 72 places, 59 transitions, 411 flow [2024-02-07 19:08:24,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=411, PETRI_PLACES=72, PETRI_TRANSITIONS=59} [2024-02-07 19:08:24,843 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places. [2024-02-07 19:08:24,843 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 59 transitions, 411 flow [2024-02-07 19:08:24,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:08:24,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:08:24,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:08:24,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 19:08:24,844 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:08:24,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:08:24,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1609854932, now seen corresponding path program 1 times [2024-02-07 19:08:24,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:08:24,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734023618] [2024-02-07 19:08:24,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:08:24,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:08:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:08:25,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:25,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:08:25,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734023618] [2024-02-07 19:08:25,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734023618] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:08:25,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461144065] [2024-02-07 19:08:25,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:08:25,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:08:25,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:08:25,303 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 19:08:25,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-02-07 19:08:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:08:25,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-07 19:08:25,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:08:44,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:44,832 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:08:49,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:08:49,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461144065] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:08:49,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:08:49,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-02-07 19:08:49,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980259523] [2024-02-07 19:08:49,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:08:49,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-02-07 19:08:49,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:08:49,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-02-07 19:08:49,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=128, Unknown=1, NotChecked=0, Total=182 [2024-02-07 19:08:52,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:08:52,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-02-07 19:08:52,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 59 transitions, 411 flow. Second operand has 14 states, 14 states have (on average 13.571428571428571) internal successors, (190), 14 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:08:52,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:08:52,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-02-07 19:08:52,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:09:01,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:09:13,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:09:21,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:09:26,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:09:30,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:09:35,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:09:37,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:09:41,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:09:45,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:09:48,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:09:58,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:10:02,108 INFO L124 PetriNetUnfolderBase]: 3003/4149 cut-off events. [2024-02-07 19:10:02,108 INFO L125 PetriNetUnfolderBase]: For 14759/14759 co-relation queries the response was YES. [2024-02-07 19:10:02,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20223 conditions, 4149 events. 3003/4149 cut-off events. For 14759/14759 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 18682 event pairs, 331 based on Foata normal form. 3/4132 useless extension candidates. Maximal degree in co-relation 17944. Up to 2321 conditions per place. [2024-02-07 19:10:02,147 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 212 selfloop transitions, 97 changer transitions 12/326 dead transitions. [2024-02-07 19:10:02,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 326 transitions, 2760 flow [2024-02-07 19:10:02,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-02-07 19:10:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-02-07 19:10:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 370 transitions. [2024-02-07 19:10:02,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-02-07 19:10:02,150 INFO L175 Difference]: Start difference. First operand has 72 places, 59 transitions, 411 flow. Second operand 16 states and 370 transitions. [2024-02-07 19:10:02,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 326 transitions, 2760 flow [2024-02-07 19:10:02,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 326 transitions, 2671 flow, removed 32 selfloop flow, removed 1 redundant places. [2024-02-07 19:10:02,184 INFO L231 Difference]: Finished difference. Result has 93 places, 153 transitions, 1580 flow [2024-02-07 19:10:02,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1580, PETRI_PLACES=93, PETRI_TRANSITIONS=153} [2024-02-07 19:10:02,185 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 52 predicate places. [2024-02-07 19:10:02,185 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 153 transitions, 1580 flow [2024-02-07 19:10:02,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.571428571428571) internal successors, (190), 14 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:10:02,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:10:02,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:10:02,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-07 19:10:02,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-02-07 19:10:02,401 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:10:02,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:10:02,401 INFO L85 PathProgramCache]: Analyzing trace with hash -2050132326, now seen corresponding path program 2 times [2024-02-07 19:10:02,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:10:02,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802538189] [2024-02-07 19:10:02,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:10:02,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:10:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:10:02,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:10:02,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:10:02,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802538189] [2024-02-07 19:10:02,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802538189] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:10:02,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406871148] [2024-02-07 19:10:02,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-07 19:10:02,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:10:02,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:10:02,874 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 19:10:02,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-02-07 19:10:03,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-07 19:10:03,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 19:10:03,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-07 19:10:03,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:11:09,844 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 34 DAG size of output: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 19:11:42,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:11:42,714 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:11:57,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:11:57,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406871148] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:11:57,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:11:57,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 17 [2024-02-07 19:11:57,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191991151] [2024-02-07 19:11:57,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:11:57,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-07 19:11:57,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:11:57,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-07 19:11:57,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=182, Unknown=10, NotChecked=0, Total=272 [2024-02-07 19:11:59,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:11:59,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-02-07 19:11:59,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 153 transitions, 1580 flow. Second operand has 17 states, 17 states have (on average 12.882352941176471) internal successors, (219), 17 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:11:59,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:11:59,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-02-07 19:11:59,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:12:57,794 WARN L293 SmtUtils]: Spent 49.22s on a formula simplification. DAG size of input: 88 DAG size of output: 53 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 19:13:01,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:13:06,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:13:28,974 WARN L293 SmtUtils]: Spent 6.01s on a formula simplification. DAG size of input: 70 DAG size of output: 32 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 19:13:30,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:13:34,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:13:40,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:13:44,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:13:48,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:13:52,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:13:57,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:13:59,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:14:12,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:14:16,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:14:20,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:14:24,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:14:27,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:14:49,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:14:53,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.91s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:15:09,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:15:11,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:15:19,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:15:23,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:15:27,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:15:31,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:15:35,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:15:39,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:15:43,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:15:48,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:15:49,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:15:53,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:15:54,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:15:58,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:16:03,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:16:08,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:16:12,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:17:03,423 WARN L293 SmtUtils]: Spent 26.66s on a formula simplification. DAG size of input: 61 DAG size of output: 48 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 19:17:06,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:17:10,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:17:34,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:17:38,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:17:42,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:17:46,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:17:50,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:17:54,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:17:58,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:18:35,632 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification. DAG size of input: 58 DAG size of output: 48 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 19:18:39,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:18:40,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:18:44,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:18:46,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:19:25,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:19:29,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:19:33,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:19:37,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:19:41,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:19:43,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:19:47,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:19:51,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:19:55,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:19:59,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:01,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:05,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:06,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:10,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:15,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:20,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:24,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:28,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:32,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:35,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:38,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:42,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:46,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:50,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:52,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:20:56,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:21:00,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:21:05,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 19:21:09,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 19:21:10,568 INFO L124 PetriNetUnfolderBase]: 4215/5929 cut-off events. [2024-02-07 19:21:10,568 INFO L125 PetriNetUnfolderBase]: For 28752/28752 co-relation queries the response was YES. [2024-02-07 19:21:10,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32783 conditions, 5929 events. 4215/5929 cut-off events. For 28752/28752 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 28999 event pairs, 147 based on Foata normal form. 4/5917 useless extension candidates. Maximal degree in co-relation 31348. Up to 3082 conditions per place. [2024-02-07 19:21:10,616 INFO L140 encePairwiseOnDemand]: 20/37 looper letters, 312 selfloop transitions, 176 changer transitions 45/538 dead transitions. [2024-02-07 19:21:10,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 538 transitions, 5341 flow [2024-02-07 19:21:10,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-02-07 19:21:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-02-07 19:21:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 513 transitions. [2024-02-07 19:21:10,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6028202115158637 [2024-02-07 19:21:10,619 INFO L175 Difference]: Start difference. First operand has 93 places, 153 transitions, 1580 flow. Second operand 23 states and 513 transitions. [2024-02-07 19:21:10,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 538 transitions, 5341 flow [2024-02-07 19:21:10,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 538 transitions, 5022 flow, removed 156 selfloop flow, removed 1 redundant places. [2024-02-07 19:21:10,752 INFO L231 Difference]: Finished difference. Result has 127 places, 292 transitions, 3654 flow [2024-02-07 19:21:10,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1339, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3654, PETRI_PLACES=127, PETRI_TRANSITIONS=292} [2024-02-07 19:21:10,753 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 86 predicate places. [2024-02-07 19:21:10,753 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 292 transitions, 3654 flow [2024-02-07 19:21:10,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.882352941176471) internal successors, (219), 17 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:21:10,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:21:10,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:21:10,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-07 19:21:10,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:21:10,969 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 19:21:10,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:21:10,969 INFO L85 PathProgramCache]: Analyzing trace with hash 675564402, now seen corresponding path program 1 times [2024-02-07 19:21:10,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:21:10,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348454627] [2024-02-07 19:21:10,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:21:10,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:21:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:21:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:21:11,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:21:11,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348454627] [2024-02-07 19:21:11,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348454627] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:21:11,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466179235] [2024-02-07 19:21:11,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:21:11,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:21:11,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:21:11,459 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 19:21:11,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-02-07 19:21:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:21:12,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-07 19:21:12,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:22:39,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:22:39,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... Killed by 15