./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/bench-exp2x3.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 958ec4d9 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/bench-exp2x3.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-958ec4d-m [2024-02-07 14:28:23,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 14:28:23,337 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 14:28:23,352 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 14:28:23,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 14:28:23,365 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 14:28:23,366 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 14:28:23,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 14:28:23,367 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 14:28:23,367 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 14:28:23,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 14:28:23,367 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 14:28:23,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 14:28:23,369 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 14:28:23,370 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 14:28:23,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 14:28:23,370 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 14:28:23,373 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 14:28:23,373 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 14:28:23,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 14:28:23,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 14:28:23,376 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 14:28:23,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 14:28:23,376 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 14:28:23,377 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 14:28:23,377 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 14:28:23,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 14:28:23,377 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 14:28:23,378 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 14:28:23,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 14:28:23,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 14:28:23,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 14:28:23,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:28:23,379 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 14:28:23,379 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 14:28:23,379 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 14:28:23,380 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 14:28:23,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 14:28:23,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 14:28:23,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 14:28:23,381 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 14:28:23,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 14:28:23,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 14:28:23,382 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 14:28:23,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 14:28:23,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 14:28:23,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 14:28:23,628 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 14:28:23,628 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 14:28:23,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/bench-exp2x3.wvr.yml/witness.yml [2024-02-07 14:28:23,682 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 14:28:23,683 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 14:28:23,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2024-02-07 14:28:24,738 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 14:28:24,939 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 14:28:24,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2024-02-07 14:28:24,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7d923cc9/11be3a20860d44818165c39a3eb36f1e/FLAG806da9245 [2024-02-07 14:28:24,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7d923cc9/11be3a20860d44818165c39a3eb36f1e [2024-02-07 14:28:24,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 14:28:24,962 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 14:28:24,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 14:28:24,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 14:28:24,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 14:28:24,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:28:23" (1/2) ... [2024-02-07 14:28:24,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69aeff01 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:24, skipping insertion in model container [2024-02-07 14:28:24,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:28:23" (1/2) ... [2024-02-07 14:28:24,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2622e08f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:24, skipping insertion in model container [2024-02-07 14:28:24,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:28:24" (2/2) ... [2024-02-07 14:28:24,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69aeff01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:24, skipping insertion in model container [2024-02-07 14:28:24,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:28:24" (2/2) ... [2024-02-07 14:28:24,973 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 14:28:24,988 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 14:28:24,989 INFO L76 edCorrectnessWitness]: Location invariant before [L73-L73] ((((0LL - (long long )n) + (long long )x1 >= 0LL) && ((long long )n + (long long )x1 >= 0LL)) && ((0LL - (long long )n) - (long long )x1 >= 0LL)) && ((long long )n - (long long )x1 >= 0LL) [2024-02-07 14:28:25,007 INFO L178 MainTranslator]: Built tables and reachable declarations [2024-02-07 14:28:25,128 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c[2289,2302] [2024-02-07 14:28:25,132 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:28:25,139 INFO L203 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 14:28:25,181 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c[2289,2302] [2024-02-07 14:28:25,182 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:28:25,194 INFO L207 MainTranslator]: Completed translation [2024-02-07 14:28:25,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:25 WrapperNode [2024-02-07 14:28:25,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 14:28:25,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 14:28:25,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 14:28:25,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 14:28:25,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:25" (1/1) ... [2024-02-07 14:28:25,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:25" (1/1) ... [2024-02-07 14:28:25,229 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2024-02-07 14:28:25,230 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 14:28:25,231 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 14:28:25,231 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 14:28:25,231 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 14:28:25,243 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:25" (1/1) ... [2024-02-07 14:28:25,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:25" (1/1) ... [2024-02-07 14:28:25,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:25" (1/1) ... [2024-02-07 14:28:25,263 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 14:28:25,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:25" (1/1) ... [2024-02-07 14:28:25,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:25" (1/1) ... [2024-02-07 14:28:25,269 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:25" (1/1) ... [2024-02-07 14:28:25,276 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:25" (1/1) ... [2024-02-07 14:28:25,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:25" (1/1) ... [2024-02-07 14:28:25,279 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:25" (1/1) ... [2024-02-07 14:28:25,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 14:28:25,282 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 14:28:25,282 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 14:28:25,282 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 14:28:25,283 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:25" (1/1) ... [2024-02-07 14:28:25,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:28:25,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:28:25,323 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 14:28:25,339 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 14:28:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 14:28:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-07 14:28:25,365 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-07 14:28:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-07 14:28:25,365 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-07 14:28:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-07 14:28:25,365 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-07 14:28:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-02-07 14:28:25,366 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-02-07 14:28:25,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 14:28:25,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 14:28:25,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 14:28:25,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 14:28:25,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-07 14:28:25,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 14:28:25,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 14:28:25,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 14:28:25,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 14:28:25,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 14:28:25,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-07 14:28:25,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 14:28:25,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 14:28:25,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-07 14:28:25,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-07 14:28:25,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-07 14:28:25,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-07 14:28:25,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-07 14:28:25,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 14:28:25,372 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 14:28:25,482 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 14:28:25,483 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 14:28:25,743 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 14:28:25,744 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 14:28:25,902 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 14:28:25,902 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-07 14:28:25,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:28:25 BoogieIcfgContainer [2024-02-07 14:28:25,903 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 14:28:25,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 14:28:25,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 14:28:25,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 14:28:25,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:28:23" (1/4) ... [2024-02-07 14:28:25,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42494a27 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:28:25, skipping insertion in model container [2024-02-07 14:28:25,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 02:28:24" (2/4) ... [2024-02-07 14:28:25,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42494a27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:28:25, skipping insertion in model container [2024-02-07 14:28:25,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:25" (3/4) ... [2024-02-07 14:28:25,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42494a27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:28:25, skipping insertion in model container [2024-02-07 14:28:25,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:28:25" (4/4) ... [2024-02-07 14:28:25,908 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2024-02-07 14:28:25,922 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 14:28:25,922 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-02-07 14:28:25,922 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 14:28:25,989 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-07 14:28:26,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 102 flow [2024-02-07 14:28:26,062 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2024-02-07 14:28:26,062 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-07 14:28:26,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 33 events. 4/33 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2024-02-07 14:28:26,068 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 37 transitions, 102 flow [2024-02-07 14:28:26,071 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 32 transitions, 88 flow [2024-02-07 14:28:26,085 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 14:28:26,092 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;@7c3da0fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 14:28:26,092 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-02-07 14:28:26,095 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 14:28:26,095 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-07 14:28:26,095 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:28:26,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:26,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-07 14:28:26,096 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 14:28:26,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:26,100 INFO L85 PathProgramCache]: Analyzing trace with hash 10455, now seen corresponding path program 1 times [2024-02-07 14:28:26,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:26,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724486741] [2024-02-07 14:28:26,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:26,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:26,343 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 14:28:26,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:26,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724486741] [2024-02-07 14:28:26,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724486741] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:26,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:26,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:28:26,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233892421] [2024-02-07 14:28:26,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:26,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:28:26,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:26,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:28:26,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:28:26,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-02-07 14:28:26,374 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 14:28:26,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:26,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-02-07 14:28:26,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:26,635 INFO L124 PetriNetUnfolderBase]: 1116/1439 cut-off events. [2024-02-07 14:28:26,635 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-02-07 14:28:26,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2964 conditions, 1439 events. 1116/1439 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4686 event pairs, 517 based on Foata normal form. 0/840 useless extension candidates. Maximal degree in co-relation 2205. Up to 1399 conditions per place. [2024-02-07 14:28:26,648 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 24 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2024-02-07 14:28:26,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 138 flow [2024-02-07 14:28:26,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:28:26,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:28:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2024-02-07 14:28:26,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-02-07 14:28:26,659 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 88 flow. Second operand 3 states and 54 transitions. [2024-02-07 14:28:26,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 138 flow [2024-02-07 14:28:26,664 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 14:28:26,665 INFO L231 Difference]: Finished difference. Result has 34 places, 31 transitions, 74 flow [2024-02-07 14:28:26,667 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 14:28:26,669 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2024-02-07 14:28:26,670 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 31 transitions, 74 flow [2024-02-07 14:28:26,671 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 14:28:26,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:26,671 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 14:28:26,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 14:28:26,671 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 14:28:26,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:26,672 INFO L85 PathProgramCache]: Analyzing trace with hash 353569154, now seen corresponding path program 1 times [2024-02-07 14:28:26,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:26,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812950058] [2024-02-07 14:28:26,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:26,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:26,859 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 14:28:26,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:26,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812950058] [2024-02-07 14:28:26,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812950058] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:26,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:26,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:28:26,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297301787] [2024-02-07 14:28:26,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:26,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:28:26,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:26,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:28:26,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:28:26,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:26,867 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 14:28:26,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:26,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:26,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:27,054 INFO L124 PetriNetUnfolderBase]: 1537/1956 cut-off events. [2024-02-07 14:28:27,055 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-02-07 14:28:27,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3952 conditions, 1956 events. 1537/1956 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6367 event pairs, 141 based on Foata normal form. 1/1140 useless extension candidates. Maximal degree in co-relation 3943. Up to 1733 conditions per place. [2024-02-07 14:28:27,063 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 42 selfloop transitions, 5 changer transitions 1/53 dead transitions. [2024-02-07 14:28:27,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 53 transitions, 221 flow [2024-02-07 14:28:27,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:28:27,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:28:27,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-02-07 14:28:27,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7117117117117117 [2024-02-07 14:28:27,069 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 74 flow. Second operand 3 states and 79 transitions. [2024-02-07 14:28:27,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 53 transitions, 221 flow [2024-02-07 14:28:27,075 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 14:28:27,076 INFO L231 Difference]: Finished difference. Result has 35 places, 35 transitions, 103 flow [2024-02-07 14:28:27,076 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 14:28:27,077 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -6 predicate places. [2024-02-07 14:28:27,077 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 35 transitions, 103 flow [2024-02-07 14:28:27,077 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 14:28:27,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:27,078 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 14:28:27,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 14:28:27,078 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 14:28:27,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:27,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1679556793, now seen corresponding path program 1 times [2024-02-07 14:28:27,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:27,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24029763] [2024-02-07 14:28:27,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:27,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:27,226 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 14:28:27,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:27,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24029763] [2024-02-07 14:28:27,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24029763] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:27,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:27,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:27,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942906045] [2024-02-07 14:28:27,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:27,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:27,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:27,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:27,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:27,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:27,232 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 14:28:27,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:27,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:27,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:27,467 INFO L124 PetriNetUnfolderBase]: 1837/2363 cut-off events. [2024-02-07 14:28:27,468 INFO L125 PetriNetUnfolderBase]: For 591/591 co-relation queries the response was YES. [2024-02-07 14:28:27,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5860 conditions, 2363 events. 1837/2363 cut-off events. For 591/591 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 8362 event pairs, 98 based on Foata normal form. 34/2395 useless extension candidates. Maximal degree in co-relation 1437. Up to 964 conditions per place. [2024-02-07 14:28:27,478 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 72 selfloop transitions, 11 changer transitions 0/88 dead transitions. [2024-02-07 14:28:27,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 88 transitions, 419 flow [2024-02-07 14:28:27,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:27,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:27,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2024-02-07 14:28:27,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6864864864864865 [2024-02-07 14:28:27,481 INFO L175 Difference]: Start difference. First operand has 35 places, 35 transitions, 103 flow. Second operand 5 states and 127 transitions. [2024-02-07 14:28:27,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 88 transitions, 419 flow [2024-02-07 14:28:27,482 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 14:28:27,483 INFO L231 Difference]: Finished difference. Result has 40 places, 42 transitions, 167 flow [2024-02-07 14:28:27,483 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 14:28:27,483 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2024-02-07 14:28:27,483 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 42 transitions, 167 flow [2024-02-07 14:28:27,483 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 14:28:27,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:27,484 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 14:28:27,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 14:28:27,484 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 14:28:27,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:27,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1998766937, now seen corresponding path program 2 times [2024-02-07 14:28:27,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:27,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200761055] [2024-02-07 14:28:27,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:27,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:27,571 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 14:28:27,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:27,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200761055] [2024-02-07 14:28:27,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200761055] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:27,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:27,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:27,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402152888] [2024-02-07 14:28:27,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:27,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:27,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:27,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:27,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:27,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:27,577 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 14:28:27,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:27,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:27,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:27,760 INFO L124 PetriNetUnfolderBase]: 1743/2279 cut-off events. [2024-02-07 14:28:27,760 INFO L125 PetriNetUnfolderBase]: For 1824/1824 co-relation queries the response was YES. [2024-02-07 14:28:27,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6840 conditions, 2279 events. 1743/2279 cut-off events. For 1824/1824 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 8534 event pairs, 365 based on Foata normal form. 70/2347 useless extension candidates. Maximal degree in co-relation 1731. Up to 1211 conditions per place. [2024-02-07 14:28:27,772 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 73 selfloop transitions, 10 changer transitions 0/88 dead transitions. [2024-02-07 14:28:27,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 88 transitions, 474 flow [2024-02-07 14:28:27,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:27,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:27,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2024-02-07 14:28:27,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6864864864864865 [2024-02-07 14:28:27,773 INFO L175 Difference]: Start difference. First operand has 40 places, 42 transitions, 167 flow. Second operand 5 states and 127 transitions. [2024-02-07 14:28:27,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 88 transitions, 474 flow [2024-02-07 14:28:27,775 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 14:28:27,776 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 221 flow [2024-02-07 14:28:27,776 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 14:28:27,777 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2024-02-07 14:28:27,777 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 221 flow [2024-02-07 14:28:27,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 14:28:27,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:27,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 14:28:27,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 14:28:27,778 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 14:28:27,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:27,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1288452694, now seen corresponding path program 1 times [2024-02-07 14:28:27,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:27,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611163140] [2024-02-07 14:28:27,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:27,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:27,844 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 14:28:27,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:27,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611163140] [2024-02-07 14:28:27,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611163140] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:27,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:27,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:27,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007272513] [2024-02-07 14:28:27,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:27,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:27,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:27,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:27,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:27,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:27,848 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 14:28:27,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:27,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:27,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:28,039 INFO L124 PetriNetUnfolderBase]: 1709/2235 cut-off events. [2024-02-07 14:28:28,039 INFO L125 PetriNetUnfolderBase]: For 3477/3477 co-relation queries the response was YES. [2024-02-07 14:28:28,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7387 conditions, 2235 events. 1709/2235 cut-off events. For 3477/3477 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8343 event pairs, 118 based on Foata normal form. 58/2291 useless extension candidates. Maximal degree in co-relation 3826. Up to 906 conditions per place. [2024-02-07 14:28:28,051 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 75 selfloop transitions, 9 changer transitions 0/89 dead transitions. [2024-02-07 14:28:28,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 89 transitions, 510 flow [2024-02-07 14:28:28,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:28,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-02-07 14:28:28,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6810810810810811 [2024-02-07 14:28:28,053 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 221 flow. Second operand 5 states and 126 transitions. [2024-02-07 14:28:28,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 89 transitions, 510 flow [2024-02-07 14:28:28,059 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 14:28:28,060 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 228 flow [2024-02-07 14:28:28,060 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 14:28:28,060 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2024-02-07 14:28:28,060 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 228 flow [2024-02-07 14:28:28,061 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 14:28:28,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:28,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:28:28,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 14:28:28,061 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 14:28:28,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:28,061 INFO L85 PathProgramCache]: Analyzing trace with hash -672897079, now seen corresponding path program 1 times [2024-02-07 14:28:28,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:28,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400781783] [2024-02-07 14:28:28,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:28,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:28,128 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 14:28:28,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:28,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400781783] [2024-02-07 14:28:28,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400781783] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:28:28,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076412752] [2024-02-07 14:28:28,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:28,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:28:28,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:28:28,130 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 14:28:28,159 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 14:28:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:28,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-07 14:28:28,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:28:28,329 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 14:28:28,329 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:28:28,393 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 14:28:28,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076412752] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:28:28,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:28:28,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-02-07 14:28:28,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140391347] [2024-02-07 14:28:28,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:28:28,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:28:28,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:28,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:28:28,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:28:28,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:28,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:28:28,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:28,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:28,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:28,643 INFO L124 PetriNetUnfolderBase]: 2045/2783 cut-off events. [2024-02-07 14:28:28,643 INFO L125 PetriNetUnfolderBase]: For 7094/7094 co-relation queries the response was YES. [2024-02-07 14:28:28,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9834 conditions, 2783 events. 2045/2783 cut-off events. For 7094/7094 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 11711 event pairs, 323 based on Foata normal form. 80/2857 useless extension candidates. Maximal degree in co-relation 5006. Up to 1205 conditions per place. [2024-02-07 14:28:28,658 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 102 selfloop transitions, 9 changer transitions 0/116 dead transitions. [2024-02-07 14:28:28,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 116 transitions, 865 flow [2024-02-07 14:28:28,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:28:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:28:28,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2024-02-07 14:28:28,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6081081081081081 [2024-02-07 14:28:28,659 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 228 flow. Second operand 6 states and 135 transitions. [2024-02-07 14:28:28,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 116 transitions, 865 flow [2024-02-07 14:28:28,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 116 transitions, 830 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-02-07 14:28:28,663 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 272 flow [2024-02-07 14:28:28,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2024-02-07 14:28:28,664 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2024-02-07 14:28:28,664 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 272 flow [2024-02-07 14:28:28,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:28:28,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:28,664 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 14:28:28,687 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 14:28:28,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-02-07 14:28:28,876 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 14:28:28,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:28,877 INFO L85 PathProgramCache]: Analyzing trace with hash -953106779, now seen corresponding path program 2 times [2024-02-07 14:28:28,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:28,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491034856] [2024-02-07 14:28:28,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:28,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:28,939 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 14:28:28,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:28,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491034856] [2024-02-07 14:28:28,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491034856] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:28,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:28,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:28,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943787571] [2024-02-07 14:28:28,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:28,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:28,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:28,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:28,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:28,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:28,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 272 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:28:28,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:28,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:28,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:29,153 INFO L124 PetriNetUnfolderBase]: 1843/2483 cut-off events. [2024-02-07 14:28:29,153 INFO L125 PetriNetUnfolderBase]: For 6828/6828 co-relation queries the response was YES. [2024-02-07 14:28:29,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10202 conditions, 2483 events. 1843/2483 cut-off events. For 6828/6828 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 9671 event pairs, 99 based on Foata normal form. 38/2515 useless extension candidates. Maximal degree in co-relation 6284. Up to 1018 conditions per place. [2024-02-07 14:28:29,168 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 102 selfloop transitions, 12 changer transitions 0/119 dead transitions. [2024-02-07 14:28:29,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 119 transitions, 906 flow [2024-02-07 14:28:29,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:29,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:29,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-02-07 14:28:29,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6648648648648648 [2024-02-07 14:28:29,169 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 272 flow. Second operand 5 states and 123 transitions. [2024-02-07 14:28:29,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 119 transitions, 906 flow [2024-02-07 14:28:29,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 119 transitions, 904 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:28:29,176 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 333 flow [2024-02-07 14:28:29,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=333, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2024-02-07 14:28:29,176 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2024-02-07 14:28:29,177 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 333 flow [2024-02-07 14:28:29,177 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 14:28:29,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:29,177 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 14:28:29,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 14:28:29,177 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 14:28:29,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:29,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1657779612, now seen corresponding path program 1 times [2024-02-07 14:28:29,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:29,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525225120] [2024-02-07 14:28:29,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:29,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:29,232 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 14:28:29,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:29,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525225120] [2024-02-07 14:28:29,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525225120] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:29,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:29,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:29,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714538320] [2024-02-07 14:28:29,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:29,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:29,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:29,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:29,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:29,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:29,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 333 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:28:29,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:29,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:29,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:29,457 INFO L124 PetriNetUnfolderBase]: 1801/2441 cut-off events. [2024-02-07 14:28:29,457 INFO L125 PetriNetUnfolderBase]: For 7852/7852 co-relation queries the response was YES. [2024-02-07 14:28:29,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10807 conditions, 2441 events. 1801/2441 cut-off events. For 7852/7852 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 9662 event pairs, 75 based on Foata normal form. 42/2477 useless extension candidates. Maximal degree in co-relation 6671. Up to 1137 conditions per place. [2024-02-07 14:28:29,475 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 99 selfloop transitions, 9 changer transitions 4/117 dead transitions. [2024-02-07 14:28:29,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 117 transitions, 919 flow [2024-02-07 14:28:29,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-02-07 14:28:29,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6594594594594595 [2024-02-07 14:28:29,476 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 333 flow. Second operand 5 states and 122 transitions. [2024-02-07 14:28:29,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 117 transitions, 919 flow [2024-02-07 14:28:29,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 117 transitions, 908 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-02-07 14:28:29,482 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 338 flow [2024-02-07 14:28:29,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=338, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2024-02-07 14:28:29,485 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2024-02-07 14:28:29,485 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 338 flow [2024-02-07 14:28:29,485 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 14:28:29,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:29,485 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 14:28:29,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 14:28:29,485 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 14:28:29,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:29,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1828671652, now seen corresponding path program 2 times [2024-02-07 14:28:29,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:29,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990765546] [2024-02-07 14:28:29,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:29,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:29,552 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 14:28:29,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:29,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990765546] [2024-02-07 14:28:29,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990765546] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:29,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:29,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:29,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153662746] [2024-02-07 14:28:29,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:29,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:29,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:29,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:29,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:29,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:29,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 338 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:28:29,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:29,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:29,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:29,803 INFO L124 PetriNetUnfolderBase]: 1725/2377 cut-off events. [2024-02-07 14:28:29,803 INFO L125 PetriNetUnfolderBase]: For 8241/8241 co-relation queries the response was YES. [2024-02-07 14:28:29,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10858 conditions, 2377 events. 1725/2377 cut-off events. For 8241/8241 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 9831 event pairs, 293 based on Foata normal form. 76/2447 useless extension candidates. Maximal degree in co-relation 6703. Up to 1307 conditions per place. [2024-02-07 14:28:29,814 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 102 selfloop transitions, 8 changer transitions 0/115 dead transitions. [2024-02-07 14:28:29,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 115 transitions, 937 flow [2024-02-07 14:28:29,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:29,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:29,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2024-02-07 14:28:29,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6432432432432432 [2024-02-07 14:28:29,815 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 338 flow. Second operand 5 states and 119 transitions. [2024-02-07 14:28:29,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 115 transitions, 937 flow [2024-02-07 14:28:29,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 115 transitions, 920 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-02-07 14:28:29,821 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 374 flow [2024-02-07 14:28:29,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=374, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2024-02-07 14:28:29,822 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places. [2024-02-07 14:28:29,822 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 374 flow [2024-02-07 14:28:29,822 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 14:28:29,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:29,823 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 14:28:29,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 14:28:29,824 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 14:28:29,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:29,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1079849732, now seen corresponding path program 2 times [2024-02-07 14:28:29,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:29,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110564533] [2024-02-07 14:28:29,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:29,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:29,899 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 14:28:29,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:29,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110564533] [2024-02-07 14:28:29,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110564533] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:29,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:29,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:29,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334519499] [2024-02-07 14:28:29,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:29,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:29,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:29,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:29,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:29,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:29,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 374 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:28:29,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:29,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:29,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:30,127 INFO L124 PetriNetUnfolderBase]: 1657/2292 cut-off events. [2024-02-07 14:28:30,127 INFO L125 PetriNetUnfolderBase]: For 8426/8442 co-relation queries the response was YES. [2024-02-07 14:28:30,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11009 conditions, 2292 events. 1657/2292 cut-off events. For 8426/8442 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9625 event pairs, 481 based on Foata normal form. 72/2362 useless extension candidates. Maximal degree in co-relation 9665. Up to 1331 conditions per place. [2024-02-07 14:28:30,140 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 118 selfloop transitions, 8 changer transitions 0/131 dead transitions. [2024-02-07 14:28:30,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 131 transitions, 1118 flow [2024-02-07 14:28:30,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:30,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:30,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-02-07 14:28:30,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6648648648648648 [2024-02-07 14:28:30,141 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 374 flow. Second operand 5 states and 123 transitions. [2024-02-07 14:28:30,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 131 transitions, 1118 flow [2024-02-07 14:28:30,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 131 transitions, 1060 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-02-07 14:28:30,154 INFO L231 Difference]: Finished difference. Result has 72 places, 59 transitions, 411 flow [2024-02-07 14:28:30,155 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 14:28:30,155 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places. [2024-02-07 14:28:30,155 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 59 transitions, 411 flow [2024-02-07 14:28:30,156 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 14:28:30,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:30,156 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 14:28:30,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 14:28:30,156 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 14:28:30,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:30,157 INFO L85 PathProgramCache]: Analyzing trace with hash -588724765, now seen corresponding path program 1 times [2024-02-07 14:28:30,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:30,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5622041] [2024-02-07 14:28:30,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:30,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:30,489 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 14:28:30,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:30,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5622041] [2024-02-07 14:28:30,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5622041] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:28:30,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460301470] [2024-02-07 14:28:30,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:30,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:28:30,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:28:30,490 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 14:28:30,520 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 14:28:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:30,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-07 14:28:30,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:30:06,539 WARN L293 SmtUtils]: Spent 12.16s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:31:14,706 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 14:31:14,707 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:31:44,011 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 14:31:44,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460301470] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:31:44,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:31:44,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 17 [2024-02-07 14:31:44,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761632345] [2024-02-07 14:31:44,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:31:44,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-07 14:31:44,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:31:44,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-07 14:31:44,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=189, Unknown=21, NotChecked=0, Total=272 [2024-02-07 14:31:48,039 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 14:31:48,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-02-07 14:31:48,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 59 transitions, 411 flow. Second operand has 17 states, 17 states have (on average 12.764705882352942) internal successors, (217), 17 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:31:48,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:31:48,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-02-07 14:31:48,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:31:54,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:31:55,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:31:57,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:32:01,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:32:11,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:32:23,897 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 14:32:29,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:32:32,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:32:36,835 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 14:32:40,840 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 14:32:44,843 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 14:32:57,025 WARN L293 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 49 DAG size of output: 40 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:32:58,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:33:01,562 INFO L124 PetriNetUnfolderBase]: 3125/4332 cut-off events. [2024-02-07 14:33:01,562 INFO L125 PetriNetUnfolderBase]: For 15196/15196 co-relation queries the response was YES. [2024-02-07 14:33:01,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20827 conditions, 4332 events. 3125/4332 cut-off events. For 15196/15196 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 19875 event pairs, 341 based on Foata normal form. 19/4349 useless extension candidates. Maximal degree in co-relation 18728. Up to 2383 conditions per place. [2024-02-07 14:33:01,594 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 208 selfloop transitions, 101 changer transitions 28/342 dead transitions. [2024-02-07 14:33:01,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 342 transitions, 2864 flow [2024-02-07 14:33:01,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-02-07 14:33:01,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-02-07 14:33:01,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 383 transitions. [2024-02-07 14:33:01,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6469594594594594 [2024-02-07 14:33:01,597 INFO L175 Difference]: Start difference. First operand has 72 places, 59 transitions, 411 flow. Second operand 16 states and 383 transitions. [2024-02-07 14:33:01,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 342 transitions, 2864 flow [2024-02-07 14:33:01,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 342 transitions, 2775 flow, removed 32 selfloop flow, removed 1 redundant places. [2024-02-07 14:33:01,620 INFO L231 Difference]: Finished difference. Result has 96 places, 157 transitions, 1650 flow [2024-02-07 14:33:01,620 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=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1650, PETRI_PLACES=96, PETRI_TRANSITIONS=157} [2024-02-07 14:33:01,620 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 55 predicate places. [2024-02-07 14:33:01,621 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 157 transitions, 1650 flow [2024-02-07 14:33:01,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.764705882352942) internal successors, (217), 17 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:33:01,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:33:01,621 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 14:33:01,639 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 14:33:01,833 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 14:33:01,834 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 14:33:01,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:33:01,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1127588339, now seen corresponding path program 2 times [2024-02-07 14:33:01,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:33:01,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619991711] [2024-02-07 14:33:01,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:33:01,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:33:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:33:02,323 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 14:33:02,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:33:02,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619991711] [2024-02-07 14:33:02,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619991711] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:33:02,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668553985] [2024-02-07 14:33:02,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-07 14:33:02,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:33:02,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:33:02,325 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 14:33:02,369 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 14:33:02,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-07 14:33:02,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:33:02,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-07 14:33:02,676 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:34:02,354 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 14:34:02,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:34:12,629 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 14:34:12,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668553985] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:34:12,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:34:12,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-02-07 14:34:12,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348884105] [2024-02-07 14:34:12,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:34:12,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-07 14:34:12,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:34:12,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-07 14:34:12,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=168, Unknown=2, NotChecked=0, Total=240 [2024-02-07 14:34:16,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 14:34:16,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-02-07 14:34:16,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 157 transitions, 1650 flow. Second operand has 16 states, 16 states have (on average 13.125) internal successors, (210), 16 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:34:16,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:34:16,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-02-07 14:34:16,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:34:24,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:34:28,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:34:38,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.89s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:34:43,008 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 14:34:54,815 WARN L293 SmtUtils]: Spent 7.12s on a formula simplification. DAG size of input: 59 DAG size of output: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:35:05,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:35:08,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:35:13,097 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 14:35:14,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:35:17,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:35:19,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:35:23,094 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 14:35:29,155 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 14:35:39,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:35:41,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:35:46,018 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 14:35:50,140 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 14:35:54,766 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 14:35:56,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:35:56,494 INFO L124 PetriNetUnfolderBase]: 3983/5532 cut-off events. [2024-02-07 14:35:56,494 INFO L125 PetriNetUnfolderBase]: For 29772/29772 co-relation queries the response was YES. [2024-02-07 14:35:56,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31519 conditions, 5532 events. 3983/5532 cut-off events. For 29772/29772 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 26447 event pairs, 463 based on Foata normal form. 17/5547 useless extension candidates. Maximal degree in co-relation 30967. Up to 4108 conditions per place. [2024-02-07 14:35:56,532 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 285 selfloop transitions, 105 changer transitions 26/421 dead transitions. [2024-02-07 14:35:56,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 421 transitions, 4369 flow [2024-02-07 14:35:56,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-02-07 14:35:56,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-02-07 14:35:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 380 transitions. [2024-02-07 14:35:56,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.604133545310016 [2024-02-07 14:35:56,534 INFO L175 Difference]: Start difference. First operand has 96 places, 157 transitions, 1650 flow. Second operand 17 states and 380 transitions. [2024-02-07 14:35:56,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 421 transitions, 4369 flow [2024-02-07 14:35:56,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 421 transitions, 4176 flow, removed 94 selfloop flow, removed 1 redundant places. [2024-02-07 14:35:56,661 INFO L231 Difference]: Finished difference. Result has 118 places, 251 transitions, 2878 flow [2024-02-07 14:35:56,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1459, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2878, PETRI_PLACES=118, PETRI_TRANSITIONS=251} [2024-02-07 14:35:56,662 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 77 predicate places. [2024-02-07 14:35:56,662 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 251 transitions, 2878 flow [2024-02-07 14:35:56,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 13.125) internal successors, (210), 16 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:35:56,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:35:56,662 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 14:35:56,677 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 14:35:56,864 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 14:35:56,865 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 14:35:56,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:35:56,865 INFO L85 PathProgramCache]: Analyzing trace with hash 95363993, now seen corresponding path program 1 times [2024-02-07 14:35:56,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:35:56,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462080816] [2024-02-07 14:35:56,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:35:56,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:35:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:35:57,235 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 14:35:57,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:35:57,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462080816] [2024-02-07 14:35:57,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462080816] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:35:57,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985806436] [2024-02-07 14:35:57,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:35:57,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:35:57,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:35:57,236 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 14:35:57,237 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 14:35:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:35:57,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-07 14:35:57,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:36:28,244 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 14:36:28,244 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:36:39,522 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 14:36:39,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985806436] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:36:39,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:36:39,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-02-07 14:36:39,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661822745] [2024-02-07 14:36:39,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:36:39,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-07 14:36:39,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:36:39,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-07 14:36:39,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=173, Unknown=2, NotChecked=0, Total=240 [2024-02-07 14:36:43,673 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 14:36:43,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-02-07 14:36:43,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 251 transitions, 2878 flow. Second operand has 16 states, 16 states have (on average 12.875) internal successors, (206), 16 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:36:43,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:36:43,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-02-07 14:36:43,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:37:09,016 WARN L293 SmtUtils]: Spent 23.09s on a formula simplification. DAG size of input: 80 DAG size of output: 42 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:37:12,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:14,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:33,609 WARN L293 SmtUtils]: Spent 14.46s on a formula simplification. DAG size of input: 79 DAG size of output: 41 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:37:36,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:38,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:39,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:44,629 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 14:38:12,500 WARN L293 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 57 DAG size of output: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:38:16,503 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 14:38:20,507 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 14:38:24,510 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 14:38:28,513 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 14:38:30,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:38:34,724 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 14:38:37,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:38:42,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.65s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:38:45,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:38:50,519 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 14:38:52,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:38:59,953 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 14:39:03,957 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 14:39:05,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:39:10,084 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 14:39:11,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:39:15,648 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 14:39:20,490 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 14:39:23,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:39:27,701 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 14:39:32,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:39:37,758 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 14:39:42,122 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 14:39:43,235 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 14:39:45,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:39:46,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:39:49,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:39:54,904 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 14:39:59,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:03,871 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 14:40:06,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:08,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:14,057 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 14:40:18,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:22,402 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 14:40:23,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:28,861 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 14:40:32,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:34,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:40,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:42,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:43,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:46,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:48,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:51,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:52,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:52,344 INFO L124 PetriNetUnfolderBase]: 7164/10126 cut-off events. [2024-02-07 14:40:52,344 INFO L125 PetriNetUnfolderBase]: For 75553/75553 co-relation queries the response was YES. [2024-02-07 14:40:52,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60237 conditions, 10126 events. 7164/10126 cut-off events. For 75553/75553 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 54525 event pairs, 222 based on Foata normal form. 45/10169 useless extension candidates. Maximal degree in co-relation 59424. Up to 5467 conditions per place. [2024-02-07 14:40:52,404 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 496 selfloop transitions, 174 changer transitions 29/704 dead transitions. [2024-02-07 14:40:52,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 704 transitions, 7661 flow [2024-02-07 14:40:52,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-02-07 14:40:52,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-02-07 14:40:52,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 485 transitions. [2024-02-07 14:40:52,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.689900426742532 [2024-02-07 14:40:52,406 INFO L175 Difference]: Start difference. First operand has 118 places, 251 transitions, 2878 flow. Second operand 19 states and 485 transitions. [2024-02-07 14:40:52,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 704 transitions, 7661 flow [2024-02-07 14:40:52,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 704 transitions, 7040 flow, removed 301 selfloop flow, removed 2 redundant places. [2024-02-07 14:40:52,675 INFO L231 Difference]: Finished difference. Result has 144 places, 408 transitions, 4805 flow [2024-02-07 14:40:52,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2455, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4805, PETRI_PLACES=144, PETRI_TRANSITIONS=408} [2024-02-07 14:40:52,676 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 103 predicate places. [2024-02-07 14:40:52,676 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 408 transitions, 4805 flow [2024-02-07 14:40:52,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.875) internal successors, (206), 16 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:40:52,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:40:52,677 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 14:40:52,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-02-07 14:40:52,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:40:52,885 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 14:40:52,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:40:52,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1305282003, now seen corresponding path program 2 times [2024-02-07 14:40:52,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:40:52,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390165852] [2024-02-07 14:40:52,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:40:52,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:40:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:40:53,297 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 14:40:53,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:40:53,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390165852] [2024-02-07 14:40:53,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390165852] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:40:53,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391418280] [2024-02-07 14:40:53,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-07 14:40:53,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:40:53,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:40:53,304 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 14:40:53,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-02-07 14:40:53,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-07 14:40:53,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:40:53,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-07 14:40:53,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:42:27,802 WARN L293 SmtUtils]: Spent 12.18s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15