./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/bench-exp2x6.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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-exp2x6.wvr.c ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/bench-exp2x6.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-958ec4d-m [2024-02-07 14:28:25,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 14:28:25,334 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:25,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 14:28:25,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 14:28:25,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 14:28:25,365 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 14:28:25,365 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 14:28:25,366 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 14:28:25,369 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 14:28:25,369 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 14:28:25,369 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 14:28:25,370 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 14:28:25,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 14:28:25,371 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 14:28:25,371 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 14:28:25,371 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 14:28:25,372 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 14:28:25,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 14:28:25,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 14:28:25,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 14:28:25,373 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 14:28:25,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 14:28:25,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 14:28:25,374 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 14:28:25,374 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 14:28:25,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 14:28:25,374 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 14:28:25,375 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 14:28:25,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 14:28:25,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 14:28:25,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 14:28:25,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:28:25,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 14:28:25,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 14:28:25,377 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 14:28:25,377 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 14:28:25,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 14:28:25,377 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 14:28:25,377 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 14:28:25,377 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 14:28:25,378 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 14:28:25,378 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 14:28:25,378 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:25,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 14:28:25,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 14:28:25,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 14:28:25,603 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 14:28:25,603 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 14:28:25,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/bench-exp2x6.wvr.yml/witness.yml [2024-02-07 14:28:25,714 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 14:28:25,715 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 14:28:25,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2024-02-07 14:28:26,762 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 14:28:26,944 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 14:28:26,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2024-02-07 14:28:26,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/167e28ac8/d68b40f40c9747a681b942a20a79a3aa/FLAG61dd66738 [2024-02-07 14:28:26,966 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/167e28ac8/d68b40f40c9747a681b942a20a79a3aa [2024-02-07 14:28:26,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 14:28:26,967 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 14:28:26,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 14:28:26,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 14:28:26,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 14:28:26,974 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:25" (1/2) ... [2024-02-07 14:28:26,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@176cbba2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:26, skipping insertion in model container [2024-02-07 14:28:26,975 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:25" (1/2) ... [2024-02-07 14:28:26,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3c200c4f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:26, skipping insertion in model container [2024-02-07 14:28:26,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:28:26" (2/2) ... [2024-02-07 14:28:26,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@176cbba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:26, skipping insertion in model container [2024-02-07 14:28:26,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:28:26" (2/2) ... [2024-02-07 14:28:26,977 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 14:28:26,994 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 14:28:26,995 INFO L76 edCorrectnessWitness]: Location invariant before [L85-L85] ((((0LL - (long long )x1) + (long long )x3 >= 0LL) && ((long long )x1 + (long long )x3 >= 0LL)) && ((0LL - (long long )x1) - (long long )x3 >= 0LL)) && ((long long )x1 - (long long )x3 >= 0LL) [2024-02-07 14:28:27,014 INFO L178 MainTranslator]: Built tables and reachable declarations [2024-02-07 14:28:27,171 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c[2505,2518] [2024-02-07 14:28:27,175 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:28:27,182 INFO L203 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 14:28:27,223 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c[2505,2518] [2024-02-07 14:28:27,226 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:28:27,285 INFO L207 MainTranslator]: Completed translation [2024-02-07 14:28:27,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:27 WrapperNode [2024-02-07 14:28:27,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 14:28:27,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 14:28:27,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 14:28:27,286 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 14:28:27,291 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:27" (1/1) ... [2024-02-07 14:28:27,307 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:27" (1/1) ... [2024-02-07 14:28:27,333 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2024-02-07 14:28:27,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 14:28:27,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 14:28:27,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 14:28:27,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 14:28:27,342 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:27" (1/1) ... [2024-02-07 14:28:27,342 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:27" (1/1) ... [2024-02-07 14:28:27,344 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:27" (1/1) ... [2024-02-07 14:28:27,359 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:27,359 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:27" (1/1) ... [2024-02-07 14:28:27,359 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:27" (1/1) ... [2024-02-07 14:28:27,363 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:27" (1/1) ... [2024-02-07 14:28:27,367 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:27" (1/1) ... [2024-02-07 14:28:27,369 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:27" (1/1) ... [2024-02-07 14:28:27,370 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:27" (1/1) ... [2024-02-07 14:28:27,371 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 14:28:27,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 14:28:27,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 14:28:27,381 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 14:28:27,382 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:27" (1/1) ... [2024-02-07 14:28:27,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:28:27,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:28:27,409 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:27,410 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:27,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 14:28:27,438 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-07 14:28:27,438 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-07 14:28:27,438 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-07 14:28:27,438 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-07 14:28:27,438 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-07 14:28:27,438 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-07 14:28:27,438 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-02-07 14:28:27,438 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-02-07 14:28:27,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 14:28:27,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 14:28:27,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 14:28:27,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 14:28:27,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-07 14:28:27,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 14:28:27,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 14:28:27,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 14:28:27,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 14:28:27,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 14:28:27,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-07 14:28:27,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 14:28:27,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 14:28:27,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-07 14:28:27,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-07 14:28:27,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-07 14:28:27,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-07 14:28:27,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-07 14:28:27,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 14:28:27,442 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:27,556 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 14:28:27,558 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 14:28:27,728 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 14:28:27,729 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 14:28:27,868 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 14:28:27,868 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-07 14:28:27,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:28:27 BoogieIcfgContainer [2024-02-07 14:28:27,870 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 14:28:27,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 14:28:27,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 14:28:27,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 14:28:27,875 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:25" (1/4) ... [2024-02-07 14:28:27,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52e39ab0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:28:27, skipping insertion in model container [2024-02-07 14:28:27,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 02:28:26" (2/4) ... [2024-02-07 14:28:27,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52e39ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:28:27, skipping insertion in model container [2024-02-07 14:28:27,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:27" (3/4) ... [2024-02-07 14:28:27,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52e39ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:28:27, skipping insertion in model container [2024-02-07 14:28:27,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:28:27" (4/4) ... [2024-02-07 14:28:27,878 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x6.wvr.c [2024-02-07 14:28:27,891 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 14:28:27,891 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-02-07 14:28:27,891 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 14:28:27,942 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-07 14:28:27,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 102 flow [2024-02-07 14:28:28,007 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2024-02-07 14:28:28,008 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-07 14:28:28,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 33 events. 4/33 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2024-02-07 14:28:28,012 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 37 transitions, 102 flow [2024-02-07 14:28:28,016 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 32 transitions, 88 flow [2024-02-07 14:28:28,029 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 14:28:28,035 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;@8fbc7de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 14:28:28,035 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-02-07 14:28:28,037 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 14:28:28,037 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-07 14:28:28,038 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:28:28,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:28,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-07 14:28:28,039 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:28,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:28,043 INFO L85 PathProgramCache]: Analyzing trace with hash 11290, now seen corresponding path program 1 times [2024-02-07 14:28:28,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:28,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016910764] [2024-02-07 14:28:28,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:28,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:28,329 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:28,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:28,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016910764] [2024-02-07 14:28:28,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016910764] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:28,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:28,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:28:28,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951309988] [2024-02-07 14:28:28,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:28,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:28:28,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:28,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:28:28,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:28:28,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-02-07 14:28:28,370 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:28,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:28,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-02-07 14:28:28,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:28,596 INFO L124 PetriNetUnfolderBase]: 1172/1495 cut-off events. [2024-02-07 14:28:28,596 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-02-07 14:28:28,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3084 conditions, 1495 events. 1172/1495 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4768 event pairs, 537 based on Foata normal form. 0/842 useless extension candidates. Maximal degree in co-relation 2325. Up to 1463 conditions per place. [2024-02-07 14:28:28,610 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 24 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2024-02-07 14:28:28,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 138 flow [2024-02-07 14:28:28,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:28:28,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:28:28,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2024-02-07 14:28:28,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-02-07 14:28:28,622 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:28,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 138 flow [2024-02-07 14:28:28,627 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:28,629 INFO L231 Difference]: Finished difference. Result has 34 places, 31 transitions, 74 flow [2024-02-07 14:28:28,631 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:28,635 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2024-02-07 14:28:28,635 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 31 transitions, 74 flow [2024-02-07 14:28:28,635 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:28,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:28,636 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:28,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 14:28:28,636 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:28,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:28,637 INFO L85 PathProgramCache]: Analyzing trace with hash -44251893, now seen corresponding path program 1 times [2024-02-07 14:28:28,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:28,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066768365] [2024-02-07 14:28:28,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:28,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:28,874 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:28,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:28,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066768365] [2024-02-07 14:28:28,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066768365] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:28,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:28,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:28:28,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803297704] [2024-02-07 14:28:28,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:28,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:28:28,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:28,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:28:28,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:28:28,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:28,882 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:28,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:28,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:28,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:29,055 INFO L124 PetriNetUnfolderBase]: 1537/1956 cut-off events. [2024-02-07 14:28:29,055 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-02-07 14:28:29,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3952 conditions, 1956 events. 1537/1956 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6372 event pairs, 141 based on Foata normal form. 1/1129 useless extension candidates. Maximal degree in co-relation 3943. Up to 1733 conditions per place. [2024-02-07 14:28:29,066 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 42 selfloop transitions, 5 changer transitions 1/53 dead transitions. [2024-02-07 14:28:29,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 53 transitions, 221 flow [2024-02-07 14:28:29,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:28:29,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:28:29,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-02-07 14:28:29,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7117117117117117 [2024-02-07 14:28:29,072 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:29,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 53 transitions, 221 flow [2024-02-07 14:28:29,076 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:29,078 INFO L231 Difference]: Finished difference. Result has 35 places, 35 transitions, 103 flow [2024-02-07 14:28:29,078 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:29,079 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -6 predicate places. [2024-02-07 14:28:29,079 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 35 transitions, 103 flow [2024-02-07 14:28:29,080 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:29,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:29,080 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,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 14:28:29,080 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:29,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:29,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2060879258, now seen corresponding path program 1 times [2024-02-07 14:28:29,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:29,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049066155] [2024-02-07 14:28:29,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:29,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:29,206 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,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:29,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049066155] [2024-02-07 14:28:29,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049066155] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:29,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:29,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:29,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262208570] [2024-02-07 14:28:29,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:29,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:29,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:29,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:29,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:29,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:29,214 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:29,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:29,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:29,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:29,489 INFO L124 PetriNetUnfolderBase]: 1843/2369 cut-off events. [2024-02-07 14:28:29,489 INFO L125 PetriNetUnfolderBase]: For 599/599 co-relation queries the response was YES. [2024-02-07 14:28:29,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5876 conditions, 2369 events. 1843/2369 cut-off events. For 599/599 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8395 event pairs, 99 based on Foata normal form. 34/2393 useless extension candidates. Maximal degree in co-relation 1448. Up to 967 conditions per place. [2024-02-07 14:28:29,505 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 72 selfloop transitions, 11 changer transitions 0/88 dead transitions. [2024-02-07 14:28:29,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 88 transitions, 419 flow [2024-02-07 14:28:29,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:29,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:29,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2024-02-07 14:28:29,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6864864864864865 [2024-02-07 14:28:29,511 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:29,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 88 transitions, 419 flow [2024-02-07 14:28:29,513 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:29,514 INFO L231 Difference]: Finished difference. Result has 40 places, 42 transitions, 167 flow [2024-02-07 14:28:29,514 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:29,515 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2024-02-07 14:28:29,516 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 42 transitions, 167 flow [2024-02-07 14:28:29,516 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,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:29,516 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,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 14:28:29,517 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:29,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:29,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1594374882, now seen corresponding path program 2 times [2024-02-07 14:28:29,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:29,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293049571] [2024-02-07 14:28:29,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:29,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:29,591 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,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:29,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293049571] [2024-02-07 14:28:29,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293049571] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:29,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:29,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:29,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225772929] [2024-02-07 14:28:29,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:29,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:29,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:29,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:29,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:29,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:29,599 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:29,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:29,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:29,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:29,838 INFO L124 PetriNetUnfolderBase]: 1758/2294 cut-off events. [2024-02-07 14:28:29,838 INFO L125 PetriNetUnfolderBase]: For 1843/1843 co-relation queries the response was YES. [2024-02-07 14:28:29,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6893 conditions, 2294 events. 1758/2294 cut-off events. For 1843/1843 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8581 event pairs, 376 based on Foata normal form. 70/2324 useless extension candidates. Maximal degree in co-relation 1747. Up to 1213 conditions per place. [2024-02-07 14:28:29,851 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 73 selfloop transitions, 10 changer transitions 0/88 dead transitions. [2024-02-07 14:28:29,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 88 transitions, 474 flow [2024-02-07 14:28:29,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:29,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:29,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2024-02-07 14:28:29,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6864864864864865 [2024-02-07 14:28:29,853 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:29,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 88 transitions, 474 flow [2024-02-07 14:28:29,855 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:29,856 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 221 flow [2024-02-07 14:28:29,856 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:29,856 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2024-02-07 14:28:29,857 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 221 flow [2024-02-07 14:28:29,857 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,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:29,857 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,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 14:28:29,857 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:29,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:29,858 INFO L85 PathProgramCache]: Analyzing trace with hash -716355681, now seen corresponding path program 1 times [2024-02-07 14:28:29,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:29,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720631176] [2024-02-07 14:28:29,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:29,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:29,923 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,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:29,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720631176] [2024-02-07 14:28:29,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720631176] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:29,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:29,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:29,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403956797] [2024-02-07 14:28:29,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:29,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:29,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:29,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:29,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:29,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:29,928 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:29,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:29,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:29,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:30,133 INFO L124 PetriNetUnfolderBase]: 1715/2241 cut-off events. [2024-02-07 14:28:30,133 INFO L125 PetriNetUnfolderBase]: For 3499/3499 co-relation queries the response was YES. [2024-02-07 14:28:30,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7413 conditions, 2241 events. 1715/2241 cut-off events. For 3499/3499 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 8427 event pairs, 119 based on Foata normal form. 58/2289 useless extension candidates. Maximal degree in co-relation 3852. Up to 909 conditions per place. [2024-02-07 14:28:30,165 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 75 selfloop transitions, 9 changer transitions 0/89 dead transitions. [2024-02-07 14:28:30,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 89 transitions, 510 flow [2024-02-07 14:28:30,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:30,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:30,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-02-07 14:28:30,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6810810810810811 [2024-02-07 14:28:30,167 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:30,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 89 transitions, 510 flow [2024-02-07 14:28:30,172 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:30,173 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 228 flow [2024-02-07 14:28:30,173 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:30,174 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2024-02-07 14:28:30,174 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 228 flow [2024-02-07 14:28:30,174 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,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:30,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:28:30,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 14:28:30,175 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:30,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:30,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1123212444, now seen corresponding path program 1 times [2024-02-07 14:28:30,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:30,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165387691] [2024-02-07 14:28:30,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:30,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:30,234 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:30,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:30,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165387691] [2024-02-07 14:28:30,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165387691] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:30,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:30,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:30,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093574937] [2024-02-07 14:28:30,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:30,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:30,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:30,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:30,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:30,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:30,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:28:30,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:30,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:30,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:30,453 INFO L124 PetriNetUnfolderBase]: 2045/2783 cut-off events. [2024-02-07 14:28:30,453 INFO L125 PetriNetUnfolderBase]: For 7100/7104 co-relation queries the response was YES. [2024-02-07 14:28:30,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9834 conditions, 2783 events. 2045/2783 cut-off events. For 7100/7104 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 11663 event pairs, 323 based on Foata normal form. 81/2796 useless extension candidates. Maximal degree in co-relation 5006. Up to 1205 conditions per place. [2024-02-07 14:28:30,468 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 103 selfloop transitions, 8 changer transitions 0/116 dead transitions. [2024-02-07 14:28:30,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 116 transitions, 865 flow [2024-02-07 14:28:30,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:30,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:30,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2024-02-07 14:28:30,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6756756756756757 [2024-02-07 14:28:30,469 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 228 flow. Second operand 5 states and 125 transitions. [2024-02-07 14:28:30,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 116 transitions, 865 flow [2024-02-07 14:28:30,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 116 transitions, 830 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-02-07 14:28:30,474 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 270 flow [2024-02-07 14:28:30,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=270, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2024-02-07 14:28:30,474 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2024-02-07 14:28:30,474 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 270 flow [2024-02-07 14:28:30,475 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,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:30,475 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:30,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 14:28:30,475 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:30,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:30,476 INFO L85 PathProgramCache]: Analyzing trace with hash 929190725, now seen corresponding path program 1 times [2024-02-07 14:28:30,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:30,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839693371] [2024-02-07 14:28:30,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:30,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:30,538 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:30,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:30,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839693371] [2024-02-07 14:28:30,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839693371] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:30,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:30,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:30,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627351599] [2024-02-07 14:28:30,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:30,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:30,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:30,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:30,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:30,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:30,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 270 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:28:30,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:30,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:30,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:30,759 INFO L124 PetriNetUnfolderBase]: 2003/2729 cut-off events. [2024-02-07 14:28:30,760 INFO L125 PetriNetUnfolderBase]: For 7695/7699 co-relation queries the response was YES. [2024-02-07 14:28:30,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11209 conditions, 2729 events. 2003/2729 cut-off events. For 7695/7699 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 11077 event pairs, 75 based on Foata normal form. 43/2728 useless extension candidates. Maximal degree in co-relation 6895. Up to 1137 conditions per place. [2024-02-07 14:28:30,775 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 104 selfloop transitions, 11 changer transitions 0/120 dead transitions. [2024-02-07 14:28:30,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 120 transitions, 912 flow [2024-02-07 14:28:30,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:30,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-02-07 14:28:30,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6648648648648648 [2024-02-07 14:28:30,777 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 270 flow. Second operand 5 states and 123 transitions. [2024-02-07 14:28:30,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 120 transitions, 912 flow [2024-02-07 14:28:30,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 120 transitions, 912 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 14:28:30,786 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 335 flow [2024-02-07 14:28:30,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=335, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2024-02-07 14:28:30,787 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2024-02-07 14:28:30,787 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 335 flow [2024-02-07 14:28:30,787 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,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:30,787 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:30,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 14:28:30,788 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:30,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:30,788 INFO L85 PathProgramCache]: Analyzing trace with hash 870327660, now seen corresponding path program 2 times [2024-02-07 14:28:30,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:30,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156968075] [2024-02-07 14:28:30,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:30,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:30,879 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:30,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:30,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156968075] [2024-02-07 14:28:30,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156968075] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:30,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:30,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:30,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504870062] [2024-02-07 14:28:30,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:30,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:30,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:30,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:30,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:30,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:30,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 335 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:28:30,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:30,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:30,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:31,102 INFO L124 PetriNetUnfolderBase]: 1801/2441 cut-off events. [2024-02-07 14:28:31,102 INFO L125 PetriNetUnfolderBase]: For 7830/7834 co-relation queries the response was YES. [2024-02-07 14:28:31,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10745 conditions, 2441 events. 1801/2441 cut-off events. For 7830/7834 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 9479 event pairs, 99 based on Foata normal form. 39/2436 useless extension candidates. Maximal degree in co-relation 6631. Up to 987 conditions per place. [2024-02-07 14:28:31,119 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 98 selfloop transitions, 10 changer transitions 4/117 dead transitions. [2024-02-07 14:28:31,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 117 transitions, 919 flow [2024-02-07 14:28:31,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:31,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-02-07 14:28:31,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6594594594594595 [2024-02-07 14:28:31,121 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 335 flow. Second operand 5 states and 122 transitions. [2024-02-07 14:28:31,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 117 transitions, 919 flow [2024-02-07 14:28:31,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 117 transitions, 906 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-02-07 14:28:31,138 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 337 flow [2024-02-07 14:28:31,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=337, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2024-02-07 14:28:31,141 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2024-02-07 14:28:31,141 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 337 flow [2024-02-07 14:28:31,141 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:31,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:31,142 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:31,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 14:28:31,142 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:31,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:31,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1914395525, now seen corresponding path program 2 times [2024-02-07 14:28:31,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:31,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886224278] [2024-02-07 14:28:31,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:31,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:31,225 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:31,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:31,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886224278] [2024-02-07 14:28:31,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886224278] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:28:31,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850754935] [2024-02-07 14:28:31,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-07 14:28:31,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:28:31,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:28:31,228 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:31,232 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:31,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-07 14:28:31,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:28:31,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-07 14:28:31,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:28:31,524 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:31,524 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:28:31,626 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:31,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850754935] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:28:31,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:28:31,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-02-07 14:28:31,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407596092] [2024-02-07 14:28:31,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:28:31,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:28:31,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:31,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:28:31,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:28:31,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:31,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 337 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:28:31,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:31,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:31,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:31,877 INFO L124 PetriNetUnfolderBase]: 1725/2377 cut-off events. [2024-02-07 14:28:31,878 INFO L125 PetriNetUnfolderBase]: For 8113/8117 co-relation queries the response was YES. [2024-02-07 14:28:31,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10790 conditions, 2377 events. 1725/2377 cut-off events. For 8113/8117 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9853 event pairs, 293 based on Foata normal form. 77/2398 useless extension candidates. Maximal degree in co-relation 6791. Up to 1307 conditions per place. [2024-02-07 14:28:31,893 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 101 selfloop transitions, 9 changer transitions 0/115 dead transitions. [2024-02-07 14:28:31,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 115 transitions, 933 flow [2024-02-07 14:28:31,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:28:31,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:28:31,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2024-02-07 14:28:31,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.581081081081081 [2024-02-07 14:28:31,895 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 337 flow. Second operand 6 states and 129 transitions. [2024-02-07 14:28:31,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 115 transitions, 933 flow [2024-02-07 14:28:31,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 115 transitions, 920 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-02-07 14:28:31,900 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 376 flow [2024-02-07 14:28:31,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2024-02-07 14:28:31,901 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2024-02-07 14:28:31,901 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 376 flow [2024-02-07 14:28:31,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:28:31,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:31,902 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:31,916 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:32,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:28:32,116 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:32,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:32,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1658603593, now seen corresponding path program 2 times [2024-02-07 14:28:32,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:32,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762299320] [2024-02-07 14:28:32,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:32,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:32,193 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:32,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:32,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762299320] [2024-02-07 14:28:32,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762299320] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:32,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:32,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:32,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75879610] [2024-02-07 14:28:32,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:32,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:32,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:32,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:32,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:32,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:32,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 376 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:28:32,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:32,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:32,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:32,432 INFO L124 PetriNetUnfolderBase]: 1657/2292 cut-off events. [2024-02-07 14:28:32,432 INFO L125 PetriNetUnfolderBase]: For 8386/8386 co-relation queries the response was YES. [2024-02-07 14:28:32,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11026 conditions, 2292 events. 1657/2292 cut-off events. For 8386/8386 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9629 event pairs, 481 based on Foata normal form. 68/2336 useless extension candidates. Maximal degree in co-relation 9644. Up to 1331 conditions per place. [2024-02-07 14:28:32,445 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 118 selfloop transitions, 8 changer transitions 0/131 dead transitions. [2024-02-07 14:28:32,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 131 transitions, 1120 flow [2024-02-07 14:28:32,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:32,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:32,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-02-07 14:28:32,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6648648648648648 [2024-02-07 14:28:32,446 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 376 flow. Second operand 5 states and 123 transitions. [2024-02-07 14:28:32,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 131 transitions, 1120 flow [2024-02-07 14:28:32,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 131 transitions, 1060 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-02-07 14:28:32,457 INFO L231 Difference]: Finished difference. Result has 72 places, 59 transitions, 411 flow [2024-02-07 14:28:32,459 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:32,459 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places. [2024-02-07 14:28:32,459 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 59 transitions, 411 flow [2024-02-07 14:28:32,460 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:32,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:32,460 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:32,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 14:28:32,460 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:32,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:32,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1609854932, now seen corresponding path program 1 times [2024-02-07 14:28:32,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:32,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812249616] [2024-02-07 14:28:32,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:32,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:32,870 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:32,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:32,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812249616] [2024-02-07 14:28:32,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812249616] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:28:32,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397989055] [2024-02-07 14:28:32,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:32,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:28:32,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:28:32,872 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:32,876 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:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:33,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-07 14:28:33,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:28:43,511 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:43,511 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:28:44,938 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:44,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397989055] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:28:44,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:28:44,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-02-07 14:28:44,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271474872] [2024-02-07 14:28:44,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:28:44,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-02-07 14:28:44,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:44,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-02-07 14:28:44,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=128, Unknown=1, NotChecked=0, Total=182 [2024-02-07 14:28:48,986 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:28:48,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-02-07 14:28:48,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 59 transitions, 411 flow. Second operand has 14 states, 14 states have (on average 13.571428571428571) internal successors, (190), 14 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:28:48,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:48,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-02-07 14:28:48,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:50,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:28:55,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:29:08,744 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:29:15,297 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:29:24,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:29:28,865 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:29:33,608 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:29:37,610 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:29:52,726 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:29:56,829 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:30:00,841 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:30:02,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:30:08,813 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:30:11,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:30:15,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:30:19,499 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:30:26,003 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:30:34,579 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:30:37,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:30:39,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:30:40,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:30:48,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:30:52,305 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:30:54,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:30:58,812 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:30:59,015 INFO L124 PetriNetUnfolderBase]: 3055/4223 cut-off events. [2024-02-07 14:30:59,015 INFO L125 PetriNetUnfolderBase]: For 15048/15048 co-relation queries the response was YES. [2024-02-07 14:30:59,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20551 conditions, 4223 events. 3055/4223 cut-off events. For 15048/15048 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 19109 event pairs, 331 based on Foata normal form. 3/4206 useless extension candidates. Maximal degree in co-relation 18272. Up to 2345 conditions per place. [2024-02-07 14:30:59,041 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 215 selfloop transitions, 106 changer transitions 19/345 dead transitions. [2024-02-07 14:30:59,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 345 transitions, 2914 flow [2024-02-07 14:30:59,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-02-07 14:30:59,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-02-07 14:30:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 396 transitions. [2024-02-07 14:30:59,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.629570747217806 [2024-02-07 14:30:59,044 INFO L175 Difference]: Start difference. First operand has 72 places, 59 transitions, 411 flow. Second operand 17 states and 396 transitions. [2024-02-07 14:30:59,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 345 transitions, 2914 flow [2024-02-07 14:30:59,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 345 transitions, 2823 flow, removed 32 selfloop flow, removed 1 redundant places. [2024-02-07 14:30:59,072 INFO L231 Difference]: Finished difference. Result has 95 places, 162 transitions, 1687 flow [2024-02-07 14:30:59,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1687, PETRI_PLACES=95, PETRI_TRANSITIONS=162} [2024-02-07 14:30:59,073 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 54 predicate places. [2024-02-07 14:30:59,073 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 162 transitions, 1687 flow [2024-02-07 14:30:59,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.571428571428571) internal successors, (190), 14 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:30:59,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:30:59,073 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:30:59,087 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:30:59,284 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:30:59,285 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:30:59,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:30:59,285 INFO L85 PathProgramCache]: Analyzing trace with hash -2050132326, now seen corresponding path program 2 times [2024-02-07 14:30:59,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:30:59,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999610839] [2024-02-07 14:30:59,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:30:59,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:30:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:30:59,643 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:30:59,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:30:59,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999610839] [2024-02-07 14:30:59,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999610839] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:30:59,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382689376] [2024-02-07 14:30:59,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-07 14:30:59,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:30:59,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:30:59,652 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:30:59,654 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:30:59,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-07 14:30:59,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:30:59,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-07 14:30:59,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:32:00,468 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:32:00,468 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:32:09,357 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:32:09,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382689376] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:32:09,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:32:09,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-02-07 14:32:09,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483817051] [2024-02-07 14:32:09,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:32:09,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-07 14:32:09,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:32:09,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-07 14:32:09,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=168, Unknown=4, NotChecked=0, Total=240 [2024-02-07 14:32:13,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:32:13,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-02-07 14:32:13,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 162 transitions, 1687 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:32:13,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:32:13,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-02-07 14:32:13,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:32:23,237 WARN L293 SmtUtils]: Spent 6.91s on a formula simplification. DAG size of input: 65 DAG size of output: 30 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:32:34,189 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:38,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:32:52,083 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:56,091 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:33:00,103 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:33:02,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:33:12,092 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:33:16,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:33:20,166 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:33:24,181 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:33:28,578 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:33:30,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:33:34,068 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:33:36,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:33:45,803 WARN L293 SmtUtils]: Spent 5.91s on a formula simplification. DAG size of input: 37 DAG size of output: 35 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:33:55,566 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:01,486 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:03,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:34:18,174 WARN L293 SmtUtils]: Spent 6.60s on a formula simplification. DAG size of input: 38 DAG size of output: 36 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:34:22,306 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:34:26,332 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:34:31,648 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:35,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.79s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:34:39,609 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:34:43,752 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:34:46,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:34:46,726 INFO L124 PetriNetUnfolderBase]: 4155/5775 cut-off events. [2024-02-07 14:34:46,726 INFO L125 PetriNetUnfolderBase]: For 32434/32434 co-relation queries the response was YES. [2024-02-07 14:34:46,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32787 conditions, 5775 events. 4155/5775 cut-off events. For 32434/32434 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 27747 event pairs, 445 based on Foata normal form. 25/5780 useless extension candidates. Maximal degree in co-relation 32138. Up to 4072 conditions per place. [2024-02-07 14:34:46,762 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 290 selfloop transitions, 97 changer transitions 37/429 dead transitions. [2024-02-07 14:34:46,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 429 transitions, 4496 flow [2024-02-07 14:34:46,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-02-07 14:34:46,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-02-07 14:34:46,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 397 transitions. [2024-02-07 14:34:46,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5960960960960962 [2024-02-07 14:34:46,765 INFO L175 Difference]: Start difference. First operand has 95 places, 162 transitions, 1687 flow. Second operand 18 states and 397 transitions. [2024-02-07 14:34:46,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 429 transitions, 4496 flow [2024-02-07 14:34:46,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 429 transitions, 4223 flow, removed 134 selfloop flow, removed 1 redundant places. [2024-02-07 14:34:46,917 INFO L231 Difference]: Finished difference. Result has 123 places, 254 transitions, 2839 flow [2024-02-07 14:34:46,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2839, PETRI_PLACES=123, PETRI_TRANSITIONS=254} [2024-02-07 14:34:46,918 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 82 predicate places. [2024-02-07 14:34:46,918 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 254 transitions, 2839 flow [2024-02-07 14:34:46,918 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:34:46,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:34:46,919 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:34:46,930 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:34:47,130 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:34:47,133 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:34:47,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:34:47,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1845730428, now seen corresponding path program 1 times [2024-02-07 14:34:47,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:34:47,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137202876] [2024-02-07 14:34:47,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:34:47,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:34:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:34:47,482 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:47,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:34:47,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137202876] [2024-02-07 14:34:47,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137202876] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:34:47,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491720083] [2024-02-07 14:34:47,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:34:47,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:34:47,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:34:47,483 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:34:47,484 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:34:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:34:47,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-07 14:34:47,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:35:57,734 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,734 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:36:14,670 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:14,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491720083] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:36:14,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:36:14,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-02-07 14:36:14,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587412616] [2024-02-07 14:36:14,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:36:14,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-02-07 14:36:14,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:36:14,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-02-07 14:36:14,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=136, Unknown=2, NotChecked=0, Total=182 [2024-02-07 14:36:15,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:36:18,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:36:22,874 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:22,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-02-07 14:36:22,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 254 transitions, 2839 flow. Second operand has 14 states, 14 states have (on average 13.428571428571429) internal successors, (188), 14 states have internal predecessors, (188), 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:22,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:36:22,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-02-07 14:36:22,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:36:24,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:36:25,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:36:29,674 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:38,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:36:42,228 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:36:44,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:36:46,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:36:50,974 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:36:54,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:36:58,634 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:37:02,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:06,148 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:37:09,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:13,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:17,141 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:37:20,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:25,489 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:37:30,445 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:37:32,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:34,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:40,221 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:37:41,275 INFO L124 PetriNetUnfolderBase]: 5076/7072 cut-off events. [2024-02-07 14:37:41,275 INFO L125 PetriNetUnfolderBase]: For 57657/57657 co-relation queries the response was YES. [2024-02-07 14:37:41,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43505 conditions, 7072 events. 5076/7072 cut-off events. For 57657/57657 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 35852 event pairs, 333 based on Foata normal form. 2/7040 useless extension candidates. Maximal degree in co-relation 43041. Up to 5806 conditions per place. [2024-02-07 14:37:41,323 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 353 selfloop transitions, 32 changer transitions 9/399 dead transitions. [2024-02-07 14:37:41,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 399 transitions, 4520 flow [2024-02-07 14:37:41,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-02-07 14:37:41,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-02-07 14:37:41,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 248 transitions. [2024-02-07 14:37:41,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6702702702702703 [2024-02-07 14:37:41,324 INFO L175 Difference]: Start difference. First operand has 123 places, 254 transitions, 2839 flow. Second operand 10 states and 248 transitions. [2024-02-07 14:37:41,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 399 transitions, 4520 flow [2024-02-07 14:37:41,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 399 transitions, 4231 flow, removed 142 selfloop flow, removed 1 redundant places. [2024-02-07 14:37:41,644 INFO L231 Difference]: Finished difference. Result has 135 places, 280 transitions, 2994 flow [2024-02-07 14:37:41,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2550, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2994, PETRI_PLACES=135, PETRI_TRANSITIONS=280} [2024-02-07 14:37:41,644 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 94 predicate places. [2024-02-07 14:37:41,644 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 280 transitions, 2994 flow [2024-02-07 14:37:41,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.428571428571429) internal successors, (188), 14 states have internal predecessors, (188), 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:37:41,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:37:41,645 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:37:41,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-02-07 14:37:41,845 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:37:41,845 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:37:41,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:37:41,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1578219242, now seen corresponding path program 2 times [2024-02-07 14:37:41,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:37:41,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435318276] [2024-02-07 14:37:41,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:37:41,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:37:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:37:42,192 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:37:42,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:37:42,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435318276] [2024-02-07 14:37:42,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435318276] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:37:42,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105324103] [2024-02-07 14:37:42,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-07 14:37:42,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:37:42,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:37:42,194 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:37:42,206 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:37:42,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-07 14:37:42,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:37:42,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-07 14:37:42,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:38:40,508 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:38:40,509 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:39:02,829 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:39:02,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105324103] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:39:02,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:39:02,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-02-07 14:39:02,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243283197] [2024-02-07 14:39:02,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:39:02,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-07 14:39:02,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:39:02,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-07 14:39:02,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=173, Unknown=9, NotChecked=0, Total=240 [2024-02-07 14:39:07,462 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:07,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-02-07 14:39:07,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 280 transitions, 2994 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:39:07,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:39:07,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-02-07 14:39:07,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:39:56,309 WARN L293 SmtUtils]: Spent 44.45s on a formula simplification. DAG size of input: 89 DAG size of output: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:39:59,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:02,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:06,288 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:10,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:13,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:29,791 WARN L293 SmtUtils]: Spent 12.39s on a formula simplification. DAG size of input: 82 DAG size of output: 50 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:40:32,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:38,728 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:43,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:47,091 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:51,095 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:55,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:40:59,100 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:41:07,420 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:41:08,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:41:12,503 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:41:18,824 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:41:23,059 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:41:27,065 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:41:31,068 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:41:35,072 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:42:26,930 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:42:34,980 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:42:37,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:42:41,810 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:42:44,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:42:48,109 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:42:52,112 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:42:56,116 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:43:00,511 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 [] Killed by 15