./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/stack_longest-1.i --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/stack_longest-1.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7c74aec Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread/stack_longest-1.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/stack_longest-1.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.fix-undeclared-acsl-variable-e7c74ae-m [2024-02-07 19:22:52,288 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 19:22:52,351 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 19:22:52,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 19:22:52,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 19:22:52,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 19:22:52,379 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 19:22:52,379 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 19:22:52,380 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 19:22:52,383 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 19:22:52,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 19:22:52,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 19:22:52,384 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 19:22:52,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 19:22:52,386 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 19:22:52,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 19:22:52,386 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 19:22:52,386 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 19:22:52,386 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 19:22:52,387 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 19:22:52,387 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 19:22:52,387 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 19:22:52,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 19:22:52,388 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 19:22:52,388 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 19:22:52,388 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 19:22:52,388 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 19:22:52,388 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 19:22:52,389 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 19:22:52,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 19:22:52,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 19:22:52,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 19:22:52,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:22:52,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 19:22:52,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 19:22:52,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 19:22:52,391 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 19:22:52,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 19:22:52,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 19:22:52,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 19:22:52,392 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 19:22:52,392 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 19:22:52,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 19:22:52,392 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-02-07 19:22:52,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 19:22:52,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 19:22:52,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 19:22:52,613 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 19:22:52,613 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 19:22:52,614 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/stack_longest-1.yml/witness.yml [2024-02-07 19:22:52,684 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 19:22:52,685 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 19:22:52,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-1.i [2024-02-07 19:22:53,654 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 19:22:53,864 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 19:22:53,864 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-1.i [2024-02-07 19:22:53,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82adca6cd/1b71adb942c640ec90c354e6e347a75a/FLAG8ebaa20fc [2024-02-07 19:22:53,911 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82adca6cd/1b71adb942c640ec90c354e6e347a75a [2024-02-07 19:22:53,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 19:22:53,913 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 19:22:53,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 19:22:53,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 19:22:53,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 19:22:53,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:22:52" (1/2) ... [2024-02-07 19:22:53,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f09cd14 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:22:53, skipping insertion in model container [2024-02-07 19:22:53,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:22:52" (1/2) ... [2024-02-07 19:22:53,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7bb2d579 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:22:53, skipping insertion in model container [2024-02-07 19:22:53,922 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:22:53" (2/2) ... [2024-02-07 19:22:53,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f09cd14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:53, skipping insertion in model container [2024-02-07 19:22:53,923 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:22:53" (2/2) ... [2024-02-07 19:22:53,923 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 19:22:53,942 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 19:22:53,943 INFO L76 edCorrectnessWitness]: Location invariant before [L1012-L1012] flag == (_Bool)1 [2024-02-07 19:22:53,943 INFO L76 edCorrectnessWitness]: Location invariant before [L999-L999] flag == (_Bool)1 [2024-02-07 19:22:53,943 INFO L76 edCorrectnessWitness]: Location invariant before [L1009-L1009] flag == (_Bool)0 || flag == (_Bool)1 [2024-02-07 19:22:53,980 INFO L181 MainTranslator]: Built tables and reachable declarations [2024-02-07 19:22:54,293 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-1.i[41530,41543] [2024-02-07 19:22:54,326 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:22:54,341 INFO L206 MainTranslator]: Completed pre-run [2024-02-07 19:22:54,372 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-1.i[41530,41543] Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 19:22:54,401 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:22:54,439 INFO L211 MainTranslator]: Completed translation [2024-02-07 19:22:54,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:54 WrapperNode [2024-02-07 19:22:54,440 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 19:22:54,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 19:22:54,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 19:22:54,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 19:22:54,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:54" (1/1) ... [2024-02-07 19:22:54,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:54" (1/1) ... [2024-02-07 19:22:54,477 INFO L138 Inliner]: procedures = 278, calls = 41, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 166 [2024-02-07 19:22:54,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 19:22:54,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 19:22:54,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 19:22:54,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 19:22:54,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:54" (1/1) ... [2024-02-07 19:22:54,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:54" (1/1) ... [2024-02-07 19:22:54,490 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:54" (1/1) ... [2024-02-07 19:22:54,508 INFO L175 MemorySlicer]: Split 14 memory accesses to 5 slices as follows [2, 5, 2, 2, 3]. 36 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0, 0]. The 4 writes are split as follows [0, 0, 1, 1, 2]. [2024-02-07 19:22:54,508 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:54" (1/1) ... [2024-02-07 19:22:54,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:54" (1/1) ... [2024-02-07 19:22:54,514 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:54" (1/1) ... [2024-02-07 19:22:54,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:54" (1/1) ... [2024-02-07 19:22:54,519 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:54" (1/1) ... [2024-02-07 19:22:54,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:54" (1/1) ... [2024-02-07 19:22:54,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 19:22:54,523 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 19:22:54,523 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 19:22:54,523 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 19:22:54,524 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:54" (1/1) ... [2024-02-07 19:22:54,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:22:54,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:22:54,559 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-07 19:22:54,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-07 19:22:54,604 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-02-07 19:22:54,604 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-02-07 19:22:54,604 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-02-07 19:22:54,604 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-02-07 19:22:54,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 19:22:54,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 19:22:54,605 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-02-07 19:22:54,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-07 19:22:54,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-07 19:22:54,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-07 19:22:54,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-07 19:22:54,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-07 19:22:54,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 19:22:54,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 19:22:54,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 19:22:54,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 19:22:54,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-07 19:22:54,608 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-02-07 19:22:54,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 19:22:54,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 19:22:54,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 19:22:54,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 19:22:54,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 19:22:54,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-07 19:22:54,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 19:22:54,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 19:22:54,610 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-07 19:22:54,748 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 19:22:54,750 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 19:22:54,943 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 19:22:54,955 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 19:22:55,110 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 19:22:55,110 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-07 19:22:55,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:22:55 BoogieIcfgContainer [2024-02-07 19:22:55,111 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 19:22:55,112 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 19:22:55,112 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 19:22:55,114 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 19:22:55,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:22:52" (1/4) ... [2024-02-07 19:22:55,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f74b1a2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:22:55, skipping insertion in model container [2024-02-07 19:22:55,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 07:22:53" (2/4) ... [2024-02-07 19:22:55,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f74b1a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:22:55, skipping insertion in model container [2024-02-07 19:22:55,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:54" (3/4) ... [2024-02-07 19:22:55,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f74b1a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:22:55, skipping insertion in model container [2024-02-07 19:22:55,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:22:55" (4/4) ... [2024-02-07 19:22:55,116 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-1.i [2024-02-07 19:22:55,132 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 19:22:55,132 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-02-07 19:22:55,132 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 19:22:55,186 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-07 19:22:55,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 42 transitions, 98 flow [2024-02-07 19:22:55,246 INFO L124 PetriNetUnfolderBase]: 5/40 cut-off events. [2024-02-07 19:22:55,246 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-07 19:22:55,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 40 events. 5/40 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 91 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 36. Up to 3 conditions per place. [2024-02-07 19:22:55,251 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 42 transitions, 98 flow [2024-02-07 19:22:55,255 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 38 transitions, 85 flow [2024-02-07 19:22:55,267 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 19:22:55,274 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;@3a0be7de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 19:22:55,274 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-02-07 19:22:55,281 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 19:22:55,281 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2024-02-07 19:22:55,282 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-07 19:22:55,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:22:55,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:22:55,283 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-02-07 19:22:55,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:22:55,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1500794892, now seen corresponding path program 1 times [2024-02-07 19:22:55,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:22:55,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887575114] [2024-02-07 19:22:55,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:22:55,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:22:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:22:55,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:22:55,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:22:55,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887575114] [2024-02-07 19:22:55,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887575114] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:22:55,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:22:55,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:22:55,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466714703] [2024-02-07 19:22:55,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:22:55,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:22:55,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:22:55,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:22:55,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:22:55,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2024-02-07 19:22:55,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:55,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:22:55,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2024-02-07 19:22:55,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:22:55,907 INFO L124 PetriNetUnfolderBase]: 360/763 cut-off events. [2024-02-07 19:22:55,907 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-02-07 19:22:55,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1409 conditions, 763 events. 360/763 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4023 event pairs, 82 based on Foata normal form. 46/722 useless extension candidates. Maximal degree in co-relation 1244. Up to 375 conditions per place. [2024-02-07 19:22:55,917 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 48 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2024-02-07 19:22:55,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 64 transitions, 248 flow [2024-02-07 19:22:55,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:22:55,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:22:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-02-07 19:22:55,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6904761904761905 [2024-02-07 19:22:55,930 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 85 flow. Second operand 4 states and 116 transitions. [2024-02-07 19:22:55,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 64 transitions, 248 flow [2024-02-07 19:22:55,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 64 transitions, 239 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 19:22:55,936 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 96 flow [2024-02-07 19:22:55,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2024-02-07 19:22:55,940 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2024-02-07 19:22:55,941 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 96 flow [2024-02-07 19:22:55,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:55,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:22:55,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:22:55,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 19:22:55,942 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-02-07 19:22:55,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:22:55,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1097704522, now seen corresponding path program 1 times [2024-02-07 19:22:55,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:22:55,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037798055] [2024-02-07 19:22:55,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:22:55,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:22:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:22:56,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:22:56,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:22:56,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037798055] [2024-02-07 19:22:56,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037798055] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:22:56,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:22:56,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:22:56,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820489571] [2024-02-07 19:22:56,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:22:56,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:22:56,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:22:56,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:22:56,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:22:56,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-02-07 19:22:56,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:56,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:22:56,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-02-07 19:22:56,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:22:56,157 INFO L124 PetriNetUnfolderBase]: 441/856 cut-off events. [2024-02-07 19:22:56,157 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-02-07 19:22:56,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1749 conditions, 856 events. 441/856 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4184 event pairs, 177 based on Foata normal form. 19/826 useless extension candidates. Maximal degree in co-relation 1352. Up to 559 conditions per place. [2024-02-07 19:22:56,161 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 37 selfloop transitions, 2 changer transitions 3/51 dead transitions. [2024-02-07 19:22:56,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 209 flow [2024-02-07 19:22:56,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:22:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:22:56,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-02-07 19:22:56,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-02-07 19:22:56,166 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 96 flow. Second operand 3 states and 77 transitions. [2024-02-07 19:22:56,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 209 flow [2024-02-07 19:22:56,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 207 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:22:56,173 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 108 flow [2024-02-07 19:22:56,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2024-02-07 19:22:56,173 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2024-02-07 19:22:56,173 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 108 flow [2024-02-07 19:22:56,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:56,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:22:56,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:22:56,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 19:22:56,174 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-02-07 19:22:56,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:22:56,175 INFO L85 PathProgramCache]: Analyzing trace with hash -719997158, now seen corresponding path program 1 times [2024-02-07 19:22:56,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:22:56,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542130002] [2024-02-07 19:22:56,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:22:56,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:22:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:22:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:22:56,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:22:56,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542130002] [2024-02-07 19:22:56,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542130002] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:22:56,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:22:56,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:22:56,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483828034] [2024-02-07 19:22:56,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:22:56,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:22:56,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:22:56,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:22:56,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:22:56,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-02-07 19:22:56,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:56,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:22:56,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-02-07 19:22:56,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:22:56,356 INFO L124 PetriNetUnfolderBase]: 357/720 cut-off events. [2024-02-07 19:22:56,357 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-02-07 19:22:56,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 720 events. 357/720 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3310 event pairs, 137 based on Foata normal form. 72/749 useless extension candidates. Maximal degree in co-relation 1106. Up to 398 conditions per place. [2024-02-07 19:22:56,360 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 36 selfloop transitions, 1 changer transitions 3/48 dead transitions. [2024-02-07 19:22:56,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 207 flow [2024-02-07 19:22:56,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:22:56,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:22:56,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-02-07 19:22:56,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2024-02-07 19:22:56,361 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 108 flow. Second operand 3 states and 74 transitions. [2024-02-07 19:22:56,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 207 flow [2024-02-07 19:22:56,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 205 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:22:56,363 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 103 flow [2024-02-07 19:22:56,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2024-02-07 19:22:56,363 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2024-02-07 19:22:56,363 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 103 flow [2024-02-07 19:22:56,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:56,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:22:56,364 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:22:56,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 19:22:56,364 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-02-07 19:22:56,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:22:56,365 INFO L85 PathProgramCache]: Analyzing trace with hash -439063899, now seen corresponding path program 1 times [2024-02-07 19:22:56,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:22:56,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300724904] [2024-02-07 19:22:56,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:22:56,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:22:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:22:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:22:56,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:22:56,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300724904] [2024-02-07 19:22:56,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300724904] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:22:56,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704099097] [2024-02-07 19:22:56,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:22:56,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:22:56,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:22:56,496 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 19:22:56,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-07 19:22:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:22:56,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-07 19:22:56,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:22:56,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-02-07 19:22:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:22:56,755 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:22:56,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:22:56,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704099097] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:22:56,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:22:56,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-02-07 19:22:56,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412483211] [2024-02-07 19:22:56,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:22:56,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-07 19:22:56,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:22:56,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-07 19:22:56,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-02-07 19:22:56,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2024-02-07 19:22:56,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 103 flow. Second operand has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:56,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:22:56,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2024-02-07 19:22:56,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:22:57,163 INFO L124 PetriNetUnfolderBase]: 1009/2134 cut-off events. [2024-02-07 19:22:57,163 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2024-02-07 19:22:57,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4350 conditions, 2134 events. 1009/2134 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 12019 event pairs, 83 based on Foata normal form. 0/2033 useless extension candidates. Maximal degree in co-relation 3754. Up to 408 conditions per place. [2024-02-07 19:22:57,172 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 142 selfloop transitions, 18 changer transitions 3/174 dead transitions. [2024-02-07 19:22:57,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 174 transitions, 762 flow [2024-02-07 19:22:57,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-07 19:22:57,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-07 19:22:57,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 347 transitions. [2024-02-07 19:22:57,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6884920634920635 [2024-02-07 19:22:57,174 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 103 flow. Second operand 12 states and 347 transitions. [2024-02-07 19:22:57,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 174 transitions, 762 flow [2024-02-07 19:22:57,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 174 transitions, 761 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:22:57,177 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 249 flow [2024-02-07 19:22:57,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=249, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2024-02-07 19:22:57,177 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2024-02-07 19:22:57,177 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 249 flow [2024-02-07 19:22:57,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:57,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:22:57,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:22:57,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-07 19:22:57,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:22:57,389 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-02-07 19:22:57,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:22:57,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1086110993, now seen corresponding path program 1 times [2024-02-07 19:22:57,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:22:57,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534339875] [2024-02-07 19:22:57,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:22:57,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:22:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:22:57,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:22:57,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:22:57,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534339875] [2024-02-07 19:22:57,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534339875] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:22:57,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:22:57,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:22:57,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006034656] [2024-02-07 19:22:57,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:22:57,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:22:57,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:22:57,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:22:57,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:22:57,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2024-02-07 19:22:57,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:57,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:22:57,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2024-02-07 19:22:57,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:22:57,619 INFO L124 PetriNetUnfolderBase]: 593/1362 cut-off events. [2024-02-07 19:22:57,619 INFO L125 PetriNetUnfolderBase]: For 477/477 co-relation queries the response was YES. [2024-02-07 19:22:57,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2988 conditions, 1362 events. 593/1362 cut-off events. For 477/477 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 7040 event pairs, 198 based on Foata normal form. 60/1405 useless extension candidates. Maximal degree in co-relation 2860. Up to 607 conditions per place. [2024-02-07 19:22:57,626 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 44 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2024-02-07 19:22:57,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 59 transitions, 327 flow [2024-02-07 19:22:57,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:22:57,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:22:57,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-02-07 19:22:57,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2024-02-07 19:22:57,627 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 249 flow. Second operand 3 states and 81 transitions. [2024-02-07 19:22:57,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 59 transitions, 327 flow [2024-02-07 19:22:57,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 303 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-02-07 19:22:57,634 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 190 flow [2024-02-07 19:22:57,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2024-02-07 19:22:57,636 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2024-02-07 19:22:57,636 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 190 flow [2024-02-07 19:22:57,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:57,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:22:57,637 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] [2024-02-07 19:22:57,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 19:22:57,637 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-02-07 19:22:57,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:22:57,637 INFO L85 PathProgramCache]: Analyzing trace with hash 295389780, now seen corresponding path program 1 times [2024-02-07 19:22:57,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:22:57,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239411239] [2024-02-07 19:22:57,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:22:57,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:22:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:22:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:22:57,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:22:57,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239411239] [2024-02-07 19:22:57,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239411239] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:22:57,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:22:57,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:22:57,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896390588] [2024-02-07 19:22:57,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:22:57,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:22:57,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:22:57,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:22:57,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:22:57,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2024-02-07 19:22:57,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 190 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:57,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:22:57,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2024-02-07 19:22:57,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:22:58,124 INFO L124 PetriNetUnfolderBase]: 651/1474 cut-off events. [2024-02-07 19:22:58,124 INFO L125 PetriNetUnfolderBase]: For 509/509 co-relation queries the response was YES. [2024-02-07 19:22:58,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3312 conditions, 1474 events. 651/1474 cut-off events. For 509/509 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 7845 event pairs, 162 based on Foata normal form. 0/1451 useless extension candidates. Maximal degree in co-relation 2903. Up to 878 conditions per place. [2024-02-07 19:22:58,131 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 62 selfloop transitions, 5 changer transitions 3/81 dead transitions. [2024-02-07 19:22:58,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 81 transitions, 422 flow [2024-02-07 19:22:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:22:58,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:22:58,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2024-02-07 19:22:58,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2024-02-07 19:22:58,132 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 190 flow. Second operand 5 states and 134 transitions. [2024-02-07 19:22:58,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 81 transitions, 422 flow [2024-02-07 19:22:58,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 81 transitions, 412 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:22:58,135 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 222 flow [2024-02-07 19:22:58,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=222, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2024-02-07 19:22:58,136 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 21 predicate places. [2024-02-07 19:22:58,136 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 222 flow [2024-02-07 19:22:58,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:58,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:22:58,136 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:22:58,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 19:22:58,136 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-02-07 19:22:58,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:22:58,137 INFO L85 PathProgramCache]: Analyzing trace with hash -878511727, now seen corresponding path program 1 times [2024-02-07 19:22:58,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:22:58,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923079419] [2024-02-07 19:22:58,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:22:58,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:22:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:22:58,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:22:58,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:22:58,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923079419] [2024-02-07 19:22:58,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923079419] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:22:58,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297000596] [2024-02-07 19:22:58,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:22:58,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:22:58,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:22:58,459 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 19:22:58,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-07 19:22:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:22:58,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-07 19:22:58,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:22:58,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-02-07 19:22:58,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-02-07 19:22:58,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-02-07 19:22:58,745 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:22:58,746 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:22:59,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-02-07 19:22:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:22:59,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297000596] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:22:59,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:22:59,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-02-07 19:22:59,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333011563] [2024-02-07 19:22:59,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:22:59,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-02-07 19:22:59,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:22:59,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-02-07 19:22:59,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-02-07 19:22:59,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2024-02-07 19:22:59,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 222 flow. Second operand has 13 states, 13 states have (on average 18.615384615384617) internal successors, (242), 13 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:59,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:22:59,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2024-02-07 19:22:59,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:22:59,751 INFO L124 PetriNetUnfolderBase]: 1198/2725 cut-off events. [2024-02-07 19:22:59,751 INFO L125 PetriNetUnfolderBase]: For 1276/1276 co-relation queries the response was YES. [2024-02-07 19:22:59,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6056 conditions, 2725 events. 1198/2725 cut-off events. For 1276/1276 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 16096 event pairs, 258 based on Foata normal form. 0/2689 useless extension candidates. Maximal degree in co-relation 4886. Up to 415 conditions per place. [2024-02-07 19:22:59,764 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 142 selfloop transitions, 27 changer transitions 0/180 dead transitions. [2024-02-07 19:22:59,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 180 transitions, 981 flow [2024-02-07 19:22:59,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-07 19:22:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-07 19:22:59,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 335 transitions. [2024-02-07 19:22:59,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6646825396825397 [2024-02-07 19:22:59,766 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 222 flow. Second operand 12 states and 335 transitions. [2024-02-07 19:22:59,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 180 transitions, 981 flow [2024-02-07 19:22:59,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 180 transitions, 976 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:22:59,771 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 388 flow [2024-02-07 19:22:59,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=388, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2024-02-07 19:22:59,772 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2024-02-07 19:22:59,772 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 388 flow [2024-02-07 19:22:59,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.615384615384617) internal successors, (242), 13 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:59,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:22:59,772 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:22:59,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-07 19:22:59,984 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,SelfDestructingSolverStorable6 [2024-02-07 19:22:59,984 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-02-07 19:22:59,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:22:59,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2098065904, now seen corresponding path program 1 times [2024-02-07 19:22:59,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:22:59,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24401103] [2024-02-07 19:22:59,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:22:59,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:23:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:23:00,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 19:23:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:23:00,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 19:23:00,061 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 19:23:00,062 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err2ASSERT_VIOLATIONERROR_FUNCTION (11 of 12 remaining) [2024-02-07 19:23:00,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 12 remaining) [2024-02-07 19:23:00,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 12 remaining) [2024-02-07 19:23:00,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (8 of 12 remaining) [2024-02-07 19:23:00,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 12 remaining) [2024-02-07 19:23:00,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 12 remaining) [2024-02-07 19:23:00,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 12 remaining) [2024-02-07 19:23:00,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONERROR_FUNCTION (4 of 12 remaining) [2024-02-07 19:23:00,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 12 remaining) [2024-02-07 19:23:00,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 12 remaining) [2024-02-07 19:23:00,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 12 remaining) [2024-02-07 19:23:00,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 12 remaining) [2024-02-07 19:23:00,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 19:23:00,069 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:23:00,074 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 19:23:00,074 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 19:23:00,121 INFO L503 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-02-07 19:23:00,121 INFO L504 ceAbstractionStarter]: WitnessConsidered=3 [2024-02-07 19:23:00,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 07:23:00 BasicIcfg [2024-02-07 19:23:00,121 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 19:23:00,122 INFO L158 Benchmark]: Toolchain (without parser) took 6209.14ms. Allocated memory was 151.0MB in the beginning and 232.8MB in the end (delta: 81.8MB). Free memory was 112.2MB in the beginning and 97.3MB in the end (delta: 15.0MB). Peak memory consumption was 97.2MB. Max. memory is 16.1GB. [2024-02-07 19:23:00,122 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:23:00,122 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 93.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:23:00,122 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.20ms. Allocated memory is still 151.0MB. Free memory was 112.2MB in the beginning and 78.1MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-02-07 19:23:00,123 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.78ms. Allocated memory is still 151.0MB. Free memory was 78.1MB in the beginning and 75.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-07 19:23:00,123 INFO L158 Benchmark]: Boogie Preprocessor took 44.66ms. Allocated memory is still 151.0MB. Free memory was 75.3MB in the beginning and 72.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:23:00,123 INFO L158 Benchmark]: RCFGBuilder took 587.83ms. Allocated memory is still 151.0MB. Free memory was 72.5MB in the beginning and 90.9MB in the end (delta: -18.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-02-07 19:23:00,123 INFO L158 Benchmark]: TraceAbstraction took 5009.48ms. Allocated memory was 151.0MB in the beginning and 232.8MB in the end (delta: 81.8MB). Free memory was 90.0MB in the beginning and 97.3MB in the end (delta: -7.2MB). Peak memory consumption was 77.3MB. Max. memory is 16.1GB. [2024-02-07 19:23:00,124 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 93.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 525.20ms. Allocated memory is still 151.0MB. Free memory was 112.2MB in the beginning and 78.1MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.78ms. Allocated memory is still 151.0MB. Free memory was 78.1MB in the beginning and 75.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.66ms. Allocated memory is still 151.0MB. Free memory was 75.3MB in the beginning and 72.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 587.83ms. Allocated memory is still 151.0MB. Free memory was 72.5MB in the beginning and 90.9MB in the end (delta: -18.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5009.48ms. Allocated memory was 151.0MB in the beginning and 232.8MB in the end (delta: 81.8MB). Free memory was 90.0MB in the beginning and 97.3MB in the end (delta: -7.2MB). Peak memory consumption was 77.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 941]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1020] 0 pthread_t id1, id2; [L1022] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1={5:0}, id2={6:0}, m={4:0}, top=0] [L989] 1 int i; [L990] 1 unsigned int tmp; [L991] 1 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L991] COND TRUE 1 i<(800) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1023] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1={5:0}, id2={6:0}, m={4:0}, top=0] [L1005] 2 int i; [L1006] 2 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1006] COND TRUE 2 i<(800) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L994] 1 tmp = __VERIFIER_nondet_uint() [L995] CALL 1 assume_abort_if_not(tmp < (800)) [L23] COND FALSE 1 !(!cond) [L995] RET 1 assume_abort_if_not(tmp < (800)) [L996] CALL, EXPR 1 push(arr,tmp) [L961] COND FALSE 1 !(top==(800)) [L968] CALL, EXPR 1 get_top() [L953] 1 return top; [L968] RET, EXPR 1 get_top() [L968] 1 stack[get_top()] = x [L969] CALL 1 inc_top() [L945] 1 top++ [L969] RET 1 inc_top() [L971] 1 return 0; [L996] RET, EXPR 1 push(arr,tmp) [L996] COND FALSE 1 !(push(arr,tmp)==(-1)) [L998] 1 flag=(1) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=799, top=1] [L999] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[flag],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=799, top=1] [L1009] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[flag],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[flag],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, top=1] [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND FALSE 2 !(get_top()==0) [L982] CALL 2 dec_top() [L949] 2 top-- [L982] RET 2 dec_top() [L983] CALL, EXPR 2 get_top() [L953] 2 return top; [L983] RET, EXPR 2 get_top() [L983] EXPR 2 stack[get_top()] [L983] 2 return stack[get_top()]; [L1011] RET, EXPR 2 pop(arr) [L1011] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1006] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1006] COND TRUE 2 i<(800) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1009] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[flag],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[flag],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND TRUE 2 get_top()==0 [L978] 2 return (-2); [L1011] RET, EXPR 2 pop(arr) [L1011] COND TRUE 2 !(pop(arr)!=(-2)) [L1012] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[flag],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] [L1012] CALL 2 error() [L941] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1023]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 68 locations, 12 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.9s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 542 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 517 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1105 IncrementalHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 10 mSDtfsCounter, 1105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=388occurred in iteration=7, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 190 ConstructedInterpolants, 8 QuantifiedInterpolants, 2088 SizeOfPredicates, 21 NumberOfNonLiveVariables, 354 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 0/33 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-02-07 19:23:00,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE