./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/fib_unsafe-7.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-08-20_10-08-36.files/mutex-meet-local/fib_unsafe-7.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da67795f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread/fib_unsafe-7.i ./goblint.2024-08-20_10-08-36.files/mutex-meet-local/fib_unsafe-7.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_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-tmp.dk.goblint-eval-da67795-m [2024-08-27 10:57:41,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-27 10:57:41,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-08-27 10:57:41,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-27 10:57:41,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-27 10:57:41,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-27 10:57:41,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-27 10:57:41,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-27 10:57:41,385 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-27 10:57:41,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-27 10:57:41,386 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-27 10:57:41,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-27 10:57:41,387 INFO L153 SettingsManager]: * Use SBE=true [2024-08-27 10:57:41,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-27 10:57:41,388 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-27 10:57:41,388 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-27 10:57:41,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-27 10:57:41,392 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-27 10:57:41,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-27 10:57:41,393 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-27 10:57:41,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-27 10:57:41,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-27 10:57:41,393 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-27 10:57:41,394 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-27 10:57:41,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-27 10:57:41,395 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-27 10:57:41,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-27 10:57:41,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-27 10:57:41,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-27 10:57:41,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-27 10:57:41,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-27 10:57:41,396 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-27 10:57:41,396 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-27 10:57:41,396 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-27 10:57:41,397 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-27 10:57:41,397 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-08-27 10:57:41,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-27 10:57:41,397 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-27 10:57:41,397 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-08-27 10:57:41,398 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-27 10:57:41,398 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-08-27 10:57:41,400 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-08-27 10:57:41,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/UGemCutter-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-08-27 10:57:41,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-27 10:57:41,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-27 10:57:41,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-27 10:57:41,673 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-27 10:57:41,674 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-27 10:57:41,675 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-08-20_10-08-36.files/mutex-meet-local/fib_unsafe-7.yml/witness.yml [2024-08-27 10:57:41,755 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-27 10:57:41,755 INFO L274 PluginConnector]: CDTParser initialized [2024-08-27 10:57:41,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-7.i [2024-08-27 10:57:43,184 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-27 10:57:43,431 INFO L384 CDTParser]: Found 1 translation units. [2024-08-27 10:57:43,431 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-7.i [2024-08-27 10:57:43,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/61bf8d2a9/35a889618a6b4bf886713d5b3c1960b6/FLAGfad382598 [2024-08-27 10:57:43,453 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/61bf8d2a9/35a889618a6b4bf886713d5b3c1960b6 [2024-08-27 10:57:43,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-27 10:57:43,454 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-08-27 10:57:43,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-27 10:57:43,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-27 10:57:43,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-27 10:57:43,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 10:57:41" (1/2) ... [2024-08-27 10:57:43,467 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aaf175a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 10:57:43, skipping insertion in model container [2024-08-27 10:57:43,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 10:57:41" (1/2) ... [2024-08-27 10:57:43,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6d528934 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 10:57:43, skipping insertion in model container [2024-08-27 10:57:43,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:57:43" (2/2) ... [2024-08-27 10:57:43,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aaf175a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:57:43, skipping insertion in model container [2024-08-27 10:57:43,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:57:43" (2/2) ... [2024-08-27 10:57:43,469 INFO L85 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-08-27 10:57:43,509 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-08-27 10:57:43,510 INFO L1541 ArrayList]: Location invariant before [L718-L718] (((((((i == 1) && (j == 0)) && (p == 0)) && (q == 0)) && (cur == 1)) && (prev == 0)) && (next == 0)) && (x == 0) [2024-08-27 10:57:43,510 INFO L1541 ArrayList]: Location invariant before [L689-L689] (1 <= i) && (1 <= j) [2024-08-27 10:57:43,510 INFO L1541 ArrayList]: Location invariant before [L724-L724] (1 <= i) && (1 <= j) [2024-08-27 10:57:43,510 INFO L1541 ArrayList]: Location invariant before [L715-L715] (((((((i == 0) && (j == 0)) && (p == 0)) && (q == 0)) && (cur == 1)) && (prev == 0)) && (next == 0)) && (x == 0) [2024-08-27 10:57:43,510 INFO L1541 ArrayList]: Location invariant before [L697-L697] (1 <= i) && (1 <= j) [2024-08-27 10:57:43,552 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-08-27 10:57:43,855 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-7.i[30243,30256] [2024-08-27 10:57:43,884 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-27 10:57:43,899 INFO L202 MainTranslator]: Completed pre-run [2024-08-27 10:57:43,934 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-7.i[30243,30256] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-08-27 10:57:43,973 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-27 10:57:44,014 INFO L206 MainTranslator]: Completed translation [2024-08-27 10:57:44,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:57:44 WrapperNode [2024-08-27 10:57:44,014 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-27 10:57:44,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-08-27 10:57:44,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-08-27 10:57:44,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-08-27 10:57:44,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:57:44" (1/1) ... [2024-08-27 10:57:44,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:57:44" (1/1) ... [2024-08-27 10:57:44,055 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2024-08-27 10:57:44,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-08-27 10:57:44,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-27 10:57:44,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-27 10:57:44,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-27 10:57:44,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:57:44" (1/1) ... [2024-08-27 10:57:44,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:57:44" (1/1) ... [2024-08-27 10:57:44,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:57:44" (1/1) ... [2024-08-27 10:57:44,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:57:44" (1/1) ... [2024-08-27 10:57:44,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:57:44" (1/1) ... [2024-08-27 10:57:44,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:57:44" (1/1) ... [2024-08-27 10:57:44,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:57:44" (1/1) ... [2024-08-27 10:57:44,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:57:44" (1/1) ... [2024-08-27 10:57:44,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-27 10:57:44,084 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-08-27 10:57:44,084 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-08-27 10:57:44,084 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-08-27 10:57:44,085 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:57:44" (1/1) ... [2024-08-27 10:57:44,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-27 10:57:44,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 10:57:44,127 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-08-27 10:57:44,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-08-27 10:57:44,170 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-08-27 10:57:44,170 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-08-27 10:57:44,170 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-08-27 10:57:44,171 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-08-27 10:57:44,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-08-27 10:57:44,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-27 10:57:44,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-08-27 10:57:44,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-08-27 10:57:44,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-27 10:57:44,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-27 10:57:44,172 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-08-27 10:57:44,283 INFO L242 CfgBuilder]: Building ICFG [2024-08-27 10:57:44,285 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-27 10:57:44,454 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-08-27 10:57:44,454 INFO L291 CfgBuilder]: Performing block encoding [2024-08-27 10:57:44,564 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-27 10:57:44,566 INFO L318 CfgBuilder]: Removed 3 assume(true) statements. [2024-08-27 10:57:44,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:57:44 BoogieIcfgContainer [2024-08-27 10:57:44,569 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-08-27 10:57:44,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-27 10:57:44,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-27 10:57:44,575 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-27 10:57:44,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 10:57:41" (1/4) ... [2024-08-27 10:57:44,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b0cf and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.08 10:57:44, skipping insertion in model container [2024-08-27 10:57:44,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:57:43" (2/4) ... [2024-08-27 10:57:44,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b0cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:57:44, skipping insertion in model container [2024-08-27 10:57:44,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:57:44" (3/4) ... [2024-08-27 10:57:44,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b0cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:57:44, skipping insertion in model container [2024-08-27 10:57:44,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:57:44" (4/4) ... [2024-08-27 10:57:44,579 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-7.i [2024-08-27 10:57:44,598 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-27 10:57:44,599 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-08-27 10:57:44,599 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-08-27 10:57:44,646 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-27 10:57:44,693 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 10:57:44,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 10:57:44,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 10:57:44,695 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-27 10:57:44,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-08-27 10:57:44,737 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 10:57:44,792 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-08-27 10:57:44,803 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=PARTIAL_ORDER_FA, 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;@6b4499b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 10:57:44,804 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-27 10:57:44,920 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 10:57:44,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 10:57:44,925 INFO L85 PathProgramCache]: Analyzing trace with hash 315772146, now seen corresponding path program 1 times [2024-08-27 10:57:44,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 10:57:44,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429601190] [2024-08-27 10:57:44,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 10:57:44,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 10:57:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 10:57:45,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 10:57:45,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 10:57:45,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429601190] [2024-08-27 10:57:45,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429601190] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 10:57:45,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 10:57:45,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-27 10:57:45,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748846821] [2024-08-27 10:57:45,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 10:57:45,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-27 10:57:45,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 10:57:45,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-27 10:57:45,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-08-27 10:57:45,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:45,326 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 10:57:45,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-08-27 10:57:45,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:45,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:45,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-27 10:57:45,417 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 10:57:45,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 10:57:45,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1835280151, now seen corresponding path program 1 times [2024-08-27 10:57:45,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 10:57:45,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268466878] [2024-08-27 10:57:45,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 10:57:45,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 10:57:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 10:57:45,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 10:57:45,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 10:57:45,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268466878] [2024-08-27 10:57:45,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268466878] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 10:57:45,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 10:57:45,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-27 10:57:45,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013320829] [2024-08-27 10:57:45,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 10:57:45,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 10:57:45,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 10:57:45,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 10:57:45,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-08-27 10:57:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:45,614 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 10:57:45,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-08-27 10:57:45,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:45,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:45,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:45,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 10:57:45,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-27 10:57:45,710 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 10:57:45,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 10:57:45,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1057715220, now seen corresponding path program 1 times [2024-08-27 10:57:45,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 10:57:45,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426319689] [2024-08-27 10:57:45,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 10:57:45,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 10:57:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 10:57:45,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 10:57:45,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 10:57:45,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426319689] [2024-08-27 10:57:45,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426319689] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 10:57:45,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961306186] [2024-08-27 10:57:45,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 10:57:45,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 10:57:45,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 10:57:45,823 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 10:57:45,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-08-27 10:57:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 10:57:45,919 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2024-08-27 10:57:45,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 10:57:46,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 10:57:46,100 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 10:57:46,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961306186] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 10:57:46,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-27 10:57:46,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2024-08-27 10:57:46,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794315700] [2024-08-27 10:57:46,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 10:57:46,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-27 10:57:46,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 10:57:46,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-27 10:57:46,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-08-27 10:57:46,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:46,105 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 10:57:46,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-08-27 10:57:46,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:46,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 10:57:46,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:46,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:46,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 10:57:46,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 10:57:46,689 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 1 remaining) [2024-08-27 10:57:46,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-08-27 10:57:46,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-08-27 10:57:46,896 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-08-27 10:57:46,897 INFO L308 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2024-08-27 10:57:46,900 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 10:57:46,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 10:57:46,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 10:57:46,902 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-27 10:57:46,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-08-27 10:57:46,908 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 10:57:46,909 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-27 10:57:46,910 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=PARTIAL_ORDER_FA, 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;@6b4499b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 10:57:46,911 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-08-27 10:57:46,911 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-27 10:57:46,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 10:57:46,915 INFO L85 PathProgramCache]: Analyzing trace with hash 9101, now seen corresponding path program 1 times [2024-08-27 10:57:46,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 10:57:46,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750731681] [2024-08-27 10:57:46,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 10:57:46,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 10:57:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 10:57:46,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 10:57:46,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 10:57:46,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750731681] [2024-08-27 10:57:46,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750731681] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 10:57:46,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 10:57:46,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-08-27 10:57:46,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502847498] [2024-08-27 10:57:46,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 10:57:46,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 10:57:46,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 10:57:46,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 10:57:46,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 10:57:46,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:46,981 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 10:57:46,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-08-27 10:57:46,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:46,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 10:57:46,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-08-27 10:57:46,989 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-27 10:57:46,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 10:57:46,989 INFO L85 PathProgramCache]: Analyzing trace with hash 282403, now seen corresponding path program 1 times [2024-08-27 10:57:46,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 10:57:46,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203843086] [2024-08-27 10:57:46,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 10:57:46,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 10:57:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 10:57:47,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 10:57:47,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 10:57:47,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203843086] [2024-08-27 10:57:47,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203843086] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 10:57:47,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 10:57:47,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 10:57:47,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879633503] [2024-08-27 10:57:47,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 10:57:47,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-27 10:57:47,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 10:57:47,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-27 10:57:47,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-08-27 10:57:47,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:47,078 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 10:57:47,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-08-27 10:57:47,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 10:57:47,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:47,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 10:57:47,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:47,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-08-27 10:57:47,203 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-27 10:57:47,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 10:57:47,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1768133360, now seen corresponding path program 1 times [2024-08-27 10:57:47,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 10:57:47,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464649361] [2024-08-27 10:57:47,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 10:57:47,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 10:57:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 10:57:47,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 10:57:47,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 10:57:47,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464649361] [2024-08-27 10:57:47,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464649361] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 10:57:47,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 10:57:47,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-27 10:57:47,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443520970] [2024-08-27 10:57:47,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 10:57:47,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-27 10:57:47,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 10:57:47,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-27 10:57:47,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-08-27 10:57:47,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:47,276 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 10:57:47,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-08-27 10:57:47,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 10:57:47,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:47,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:47,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 10:57:47,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:47,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:47,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-08-27 10:57:47,324 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-27 10:57:47,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 10:57:47,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1527341765, now seen corresponding path program 1 times [2024-08-27 10:57:47,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 10:57:47,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150275918] [2024-08-27 10:57:47,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 10:57:47,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 10:57:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 10:57:47,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 10:57:47,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 10:57:47,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150275918] [2024-08-27 10:57:47,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150275918] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 10:57:47,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 10:57:47,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-27 10:57:47,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234307722] [2024-08-27 10:57:47,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 10:57:47,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 10:57:47,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 10:57:47,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 10:57:47,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-08-27 10:57:47,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:47,421 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 10:57:47,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-08-27 10:57:47,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 10:57:47,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:47,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:47,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:47,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 10:57:47,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:47,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:47,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 10:57:47,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-27 10:57:47,497 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-27 10:57:47,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 10:57:47,497 INFO L85 PathProgramCache]: Analyzing trace with hash -617439478, now seen corresponding path program 1 times [2024-08-27 10:57:47,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 10:57:47,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990636491] [2024-08-27 10:57:47,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 10:57:47,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 10:57:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 10:57:47,555 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 10:57:47,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 10:57:47,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990636491] [2024-08-27 10:57:47,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990636491] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 10:57:47,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724631863] [2024-08-27 10:57:47,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 10:57:47,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 10:57:47,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 10:57:47,558 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 10:57:47,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-08-27 10:57:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 10:57:47,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2024-08-27 10:57:47,626 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 10:57:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 10:57:47,734 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 10:57:47,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724631863] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 10:57:47,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-27 10:57:47,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2024-08-27 10:57:47,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566965559] [2024-08-27 10:57:47,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 10:57:47,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-27 10:57:47,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 10:57:47,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-27 10:57:47,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-08-27 10:57:47,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:47,737 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 10:57:47,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-08-27 10:57:47,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 10:57:47,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:47,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:47,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 10:57:47,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:47,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 10:57:47,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:47,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:47,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 10:57:47,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 10:57:47,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-08-27 10:57:48,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 10:57:48,029 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-27 10:57:48,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 10:57:48,030 INFO L85 PathProgramCache]: Analyzing trace with hash 52262193, now seen corresponding path program 1 times [2024-08-27 10:57:48,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 10:57:48,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337080221] [2024-08-27 10:57:48,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 10:57:48,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 10:57:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 10:57:48,104 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 10:57:48,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 10:57:48,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337080221] [2024-08-27 10:57:48,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337080221] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 10:57:48,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045056388] [2024-08-27 10:57:48,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 10:57:48,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 10:57:48,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 10:57:48,108 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 10:57:48,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-08-27 10:57:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 10:57:48,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjunts are in the unsatisfiable core [2024-08-27 10:57:48,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 10:57:48,219 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 10:57:48,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 10:57:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 10:57:48,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045056388] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 10:57:48,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 10:57:48,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-08-27 10:57:48,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752623348] [2024-08-27 10:57:48,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 10:57:48,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-27 10:57:48,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 10:57:48,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-27 10:57:48,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-08-27 10:57:48,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:48,283 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 10:57:48,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 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-08-27 10:57:48,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 10:57:48,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:48,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:48,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 10:57:48,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 10:57:48,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:48,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 10:57:48,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:48,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:48,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 10:57:48,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 10:57:48,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 10:57:48,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-08-27 10:57:48,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-08-27 10:57:48,600 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-27 10:57:48,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 10:57:48,601 INFO L85 PathProgramCache]: Analyzing trace with hash -768086606, now seen corresponding path program 2 times [2024-08-27 10:57:48,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 10:57:48,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999442935] [2024-08-27 10:57:48,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 10:57:48,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 10:57:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 10:57:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 10:57:48,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 10:57:48,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999442935] [2024-08-27 10:57:48,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999442935] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 10:57:48,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700379190] [2024-08-27 10:57:48,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-27 10:57:48,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 10:57:48,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 10:57:48,764 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 10:57:48,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-08-27 10:57:48,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-27 10:57:48,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-27 10:57:48,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 8 conjunts are in the unsatisfiable core [2024-08-27 10:57:48,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 10:57:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 10:57:48,942 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 10:57:49,095 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 10:57:49,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700379190] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 10:57:49,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 10:57:49,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-08-27 10:57:49,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695338419] [2024-08-27 10:57:49,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 10:57:49,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-08-27 10:57:49,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 10:57:49,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-08-27 10:57:49,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2024-08-27 10:57:49,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:49,101 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 10:57:49,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 17 states have internal predecessors, (121), 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-08-27 10:57:49,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 10:57:49,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:49,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:49,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 10:57:49,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 10:57:49,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 10:57:49,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:49,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 10:57:49,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:49,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:49,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 10:57:49,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 10:57:49,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 10:57:49,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-27 10:57:49,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-08-27 10:57:49,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-08-27 10:57:49,519 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-27 10:57:49,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 10:57:49,519 INFO L85 PathProgramCache]: Analyzing trace with hash -2144558414, now seen corresponding path program 3 times [2024-08-27 10:57:49,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 10:57:49,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905464526] [2024-08-27 10:57:49,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 10:57:49,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 10:57:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 10:57:49,956 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 0 proven. 735 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 10:57:49,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 10:57:49,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905464526] [2024-08-27 10:57:49,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905464526] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 10:57:49,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705253717] [2024-08-27 10:57:49,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-27 10:57:49,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 10:57:49,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 10:57:49,959 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 10:57:49,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-08-27 10:57:50,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-08-27 10:57:50,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-27 10:57:50,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 16 conjunts are in the unsatisfiable core [2024-08-27 10:57:50,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 10:57:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 0 proven. 735 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 10:57:50,229 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 10:57:50,487 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 0 proven. 735 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 10:57:50,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705253717] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 10:57:50,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 10:57:50,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 19 [2024-08-27 10:57:50,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738615640] [2024-08-27 10:57:50,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 10:57:50,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-08-27 10:57:50,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 10:57:50,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-08-27 10:57:50,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2024-08-27 10:57:50,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:50,494 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 10:57:50,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.157894736842105) internal successors, (136), 19 states have internal predecessors, (136), 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-08-27 10:57:50,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 10:57:50,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:50,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:50,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 10:57:50,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 10:57:50,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 10:57:50,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-08-27 10:57:50,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:50,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 10:57:50,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:50,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:50,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 10:57:50,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 10:57:50,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 10:57:50,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-27 10:57:50,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-27 10:57:50,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-08-27 10:57:50,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-08-27 10:57:50,928 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-27 10:57:50,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 10:57:50,928 INFO L85 PathProgramCache]: Analyzing trace with hash 764827634, now seen corresponding path program 4 times [2024-08-27 10:57:50,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 10:57:50,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292785311] [2024-08-27 10:57:50,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 10:57:50,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 10:57:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 10:57:52,168 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 813 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 10:57:52,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 10:57:52,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292785311] [2024-08-27 10:57:52,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292785311] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 10:57:52,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622421897] [2024-08-27 10:57:52,168 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-08-27 10:57:52,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 10:57:52,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 10:57:52,170 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 10:57:52,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-08-27 10:57:52,279 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-08-27 10:57:52,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-27 10:57:52,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjunts are in the unsatisfiable core [2024-08-27 10:57:52,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 10:57:52,552 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 646 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2024-08-27 10:57:52,552 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 10:57:52,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622421897] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 10:57:52,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-27 10:57:52,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [37] total 45 [2024-08-27 10:57:52,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984056023] [2024-08-27 10:57:52,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 10:57:52,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-27 10:57:52,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 10:57:52,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-27 10:57:52,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=585, Invalid=1395, Unknown=0, NotChecked=0, Total=1980 [2024-08-27 10:57:52,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:52,555 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 10:57:52,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 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-08-27 10:57:52,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 10:57:52,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:52,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:52,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 10:57:52,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 10:57:52,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 10:57:52,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-08-27 10:57:52,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-27 10:57:52,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:52,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 10:57:52,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:52,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:52,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 10:57:52,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 10:57:52,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 10:57:52,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-27 10:57:52,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-27 10:57:52,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-27 10:57:52,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-08-27 10:57:52,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 10:57:52,937 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-27 10:57:52,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 10:57:52,938 INFO L85 PathProgramCache]: Analyzing trace with hash 67829539, now seen corresponding path program 1 times [2024-08-27 10:57:52,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 10:57:52,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773120042] [2024-08-27 10:57:52,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 10:57:52,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 10:57:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 10:57:53,396 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 549 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 10:57:53,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 10:57:53,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773120042] [2024-08-27 10:57:53,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773120042] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 10:57:53,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824714938] [2024-08-27 10:57:53,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 10:57:53,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 10:57:53,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 10:57:53,399 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 10:57:53,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-08-27 10:57:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 10:57:53,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 9 conjunts are in the unsatisfiable core [2024-08-27 10:57:53,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 10:57:53,591 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 443 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-08-27 10:57:53,591 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 10:57:53,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824714938] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 10:57:53,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-27 10:57:53,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 20 [2024-08-27 10:57:53,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983348995] [2024-08-27 10:57:53,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 10:57:53,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-27 10:57:53,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 10:57:53,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-27 10:57:53,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2024-08-27 10:57:53,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:53,593 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 10:57:53,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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-08-27 10:57:53,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 10:57:53,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:53,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:53,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 10:57:53,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 10:57:53,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 10:57:53,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-08-27 10:57:53,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-27 10:57:53,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-27 10:57:53,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 10:57:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 10:57:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 10:57:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 10:57:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 10:57:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 10:57:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-27 10:57:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-27 10:57:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-27 10:57:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-27 10:57:53,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-08-27 10:57:53,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 10:57:53,975 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-08-27 10:57:53,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 10:57:53,976 INFO L85 PathProgramCache]: Analyzing trace with hash 777442584, now seen corresponding path program 1 times [2024-08-27 10:57:53,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 10:57:53,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000997770] [2024-08-27 10:57:53,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 10:57:53,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 10:57:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 10:57:54,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-27 10:57:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 10:57:54,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-27 10:57:54,093 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-27 10:57:54,093 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-08-27 10:57:54,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-08-27 10:57:54,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-08-27 10:57:54,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 6 remaining) [2024-08-27 10:57:54,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-08-27 10:57:54,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-08-27 10:57:54,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-08-27 10:57:54,096 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2024-08-27 10:57:54,097 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/3) [2024-08-27 10:57:54,100 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-08-27 10:57:54,100 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-08-27 10:57:54,212 INFO L507 ceAbstractionStarter]: Automizer considered 5 witness invariants [2024-08-27 10:57:54,212 INFO L508 ceAbstractionStarter]: WitnessConsidered=5 [2024-08-27 10:57:54,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:57:54 BasicIcfg [2024-08-27 10:57:54,213 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-27 10:57:54,214 INFO L158 Benchmark]: Toolchain (without parser) took 10759.49ms. Allocated memory was 174.1MB in the beginning and 257.9MB in the end (delta: 83.9MB). Free memory was 115.6MB in the beginning and 137.4MB in the end (delta: -21.9MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2024-08-27 10:57:54,214 INFO L158 Benchmark]: Witness Parser took 0.54ms. Allocated memory is still 174.1MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-27 10:57:54,214 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 174.1MB. Free memory is still 134.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-27 10:57:54,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 558.83ms. Allocated memory is still 174.1MB. Free memory was 114.9MB in the beginning and 89.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-08-27 10:57:54,215 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.40ms. Allocated memory is still 174.1MB. Free memory was 89.8MB in the beginning and 87.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-27 10:57:54,215 INFO L158 Benchmark]: Boogie Preprocessor took 26.68ms. Allocated memory is still 174.1MB. Free memory was 87.7MB in the beginning and 86.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-27 10:57:54,215 INFO L158 Benchmark]: RCFGBuilder took 485.06ms. Allocated memory is still 174.1MB. Free memory was 86.2MB in the beginning and 59.7MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-08-27 10:57:54,215 INFO L158 Benchmark]: TraceAbstraction took 9642.82ms. Allocated memory was 174.1MB in the beginning and 257.9MB in the end (delta: 83.9MB). Free memory was 59.0MB in the beginning and 137.4MB in the end (delta: -78.5MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2024-08-27 10:57:54,217 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.54ms. Allocated memory is still 174.1MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.22ms. Allocated memory is still 174.1MB. Free memory is still 134.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 558.83ms. Allocated memory is still 174.1MB. Free memory was 114.9MB in the beginning and 89.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.40ms. Allocated memory is still 174.1MB. Free memory was 89.8MB in the beginning and 87.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.68ms. Allocated memory is still 174.1MB. Free memory was 87.7MB in the beginning and 86.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 485.06ms. Allocated memory is still 174.1MB. Free memory was 86.2MB in the beginning and 59.7MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9642.82ms. Allocated memory was 174.1MB in the beginning and 257.9MB in the end (delta: 83.9MB). Free memory was 59.0MB in the beginning and 137.4MB in the end (delta: -78.5MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4646, independent: 3854, independent conditional: 3396, independent unconditional: 458, dependent: 792, dependent conditional: 785, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3985, independent: 3854, independent conditional: 3396, independent unconditional: 458, dependent: 131, dependent conditional: 124, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3985, independent: 3854, independent conditional: 3396, independent unconditional: 458, dependent: 131, dependent conditional: 124, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4185, independent: 3854, independent conditional: 0, independent unconditional: 3854, dependent: 331, dependent conditional: 200, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4185, independent: 3854, independent conditional: 0, independent unconditional: 3854, dependent: 331, dependent conditional: 200, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4185, independent: 3854, independent conditional: 0, independent unconditional: 3854, dependent: 331, dependent conditional: 200, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 416, independent: 371, independent conditional: 0, independent unconditional: 371, dependent: 45, dependent conditional: 38, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 416, independent: 362, independent conditional: 0, independent unconditional: 362, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 54, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 45, dependent conditional: 38, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 45, dependent conditional: 38, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 225, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 158, dependent conditional: 136, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4185, independent: 3483, independent conditional: 0, independent unconditional: 3483, dependent: 286, dependent conditional: 162, dependent unconditional: 124, unknown: 416, unknown conditional: 38, unknown unconditional: 378] , Statistics on independence cache: Total cache size (in pairs): 416, Positive cache size: 371, Positive conditional cache size: 0, Positive unconditional cache size: 371, Negative cache size: 45, Negative conditional cache size: 38, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3, Independence queries for same thread: 661 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 254, Number of trivial persistent sets: 202, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 465, independent: 458, independent conditional: 0, independent unconditional: 458, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4646, independent: 3854, independent conditional: 3396, independent unconditional: 458, dependent: 792, dependent conditional: 785, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3985, independent: 3854, independent conditional: 3396, independent unconditional: 458, dependent: 131, dependent conditional: 124, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3985, independent: 3854, independent conditional: 3396, independent unconditional: 458, dependent: 131, dependent conditional: 124, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4185, independent: 3854, independent conditional: 0, independent unconditional: 3854, dependent: 331, dependent conditional: 200, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4185, independent: 3854, independent conditional: 0, independent unconditional: 3854, dependent: 331, dependent conditional: 200, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4185, independent: 3854, independent conditional: 0, independent unconditional: 3854, dependent: 331, dependent conditional: 200, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 416, independent: 371, independent conditional: 0, independent unconditional: 371, dependent: 45, dependent conditional: 38, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 416, independent: 362, independent conditional: 0, independent unconditional: 362, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 54, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 45, dependent conditional: 38, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 45, dependent conditional: 38, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 225, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 158, dependent conditional: 136, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4185, independent: 3483, independent conditional: 0, independent unconditional: 3483, dependent: 286, dependent conditional: 162, dependent unconditional: 124, unknown: 416, unknown conditional: 38, unknown unconditional: 378] , Statistics on independence cache: Total cache size (in pairs): 416, Positive cache size: 371, Positive conditional cache size: 0, Positive unconditional cache size: 371, Negative cache size: 45, Negative conditional cache size: 38, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3, Independence queries for same thread: 661 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5291, independent: 4368, independent conditional: 4026, independent unconditional: 342, dependent: 923, dependent conditional: 916, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4377, independent: 4368, independent conditional: 4026, independent unconditional: 342, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4377, independent: 4368, independent conditional: 4026, independent unconditional: 342, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4379, independent: 4368, independent conditional: 0, independent unconditional: 4368, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4379, independent: 4368, independent conditional: 0, independent unconditional: 4368, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4379, independent: 4368, independent conditional: 0, independent unconditional: 4368, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 321, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 321, independent: 303, independent conditional: 0, independent unconditional: 303, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 18, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 52, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 20, dependent conditional: 5, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4379, independent: 4056, independent conditional: 0, independent unconditional: 4056, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 321, unknown conditional: 2, unknown unconditional: 319] , Statistics on independence cache: Total cache size (in pairs): 321, Positive cache size: 312, Positive conditional cache size: 0, Positive unconditional cache size: 312, Negative cache size: 9, Negative conditional cache size: 2, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1, Independence queries for same thread: 914 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 47, Number of trivial persistent sets: 31, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 349, independent: 342, independent conditional: 0, independent unconditional: 342, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5291, independent: 4368, independent conditional: 4026, independent unconditional: 342, dependent: 923, dependent conditional: 916, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4377, independent: 4368, independent conditional: 4026, independent unconditional: 342, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4377, independent: 4368, independent conditional: 4026, independent unconditional: 342, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4379, independent: 4368, independent conditional: 0, independent unconditional: 4368, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4379, independent: 4368, independent conditional: 0, independent unconditional: 4368, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4379, independent: 4368, independent conditional: 0, independent unconditional: 4368, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 321, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 321, independent: 303, independent conditional: 0, independent unconditional: 303, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 18, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 52, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 20, dependent conditional: 5, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4379, independent: 4056, independent conditional: 0, independent unconditional: 4056, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 321, unknown conditional: 2, unknown unconditional: 319] , Statistics on independence cache: Total cache size (in pairs): 321, Positive cache size: 312, Positive conditional cache size: 0, Positive unconditional cache size: 312, Negative cache size: 9, Negative conditional cache size: 2, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1, Independence queries for same thread: 914 - CounterExampleResult [Line: 681]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L682] 0 int i, j; [L685] 0 int p, q; [L702] 0 int cur = 1, prev = 0, next = 0; [L703] 0 int x; [L713] 0 pthread_t id1, id2; VAL [\old(argc)=1598, \old(argv)={1599:1600}, argc=1598, cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L715] 0 //@ assert ((((((((i == 0) && (j == 0)) && (p == 0)) && (q == 0)) && (cur == 1)) && (prev == 0)) && (next == 0)) && (x == 0)); [L715] 0 i = 1 VAL [\old(argc)=1598, \old(argv)={1599:1600}, argc=1598, cur=1, i=1, j=0, next=0, p=0, prev=0, q=0, x=0] [L718] 0 //@ assert ((((((((i == 1) && (j == 0)) && (p == 0)) && (q == 0)) && (cur == 1)) && (prev == 0)) && (next == 0)) && (x == 0)); [L718] 0 j = 1 VAL [\old(argc)=1598, \old(argv)={1599:1600}, argc=1598, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L720] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=1598, \old(argv)={1599:1600}, argc=1598, cur=1, i=1, id1=-2, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] 1 p = 0 VAL [\old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L721] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=1598, \old(argv)={1599:1600}, arg={0:0}, argc=1598, cur=1, i=1, id1=-2, id2=-1, j=1, next=0, p=0, prev=0, q=0, x=0] [L695] 2 q = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L722] CALL, EXPR 0 fib() [L705] 0 x = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] COND TRUE 1 p < 7 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L689] 1 //@ assert ((1 <= i) && (1 <= j)); [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=1, prev=0, q=0, x=0] [L695] COND TRUE 2 q < 7 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=1, prev=0, q=0, x=0] [L697] 2 //@ assert ((1 <= i) && (1 <= j)); [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=0, x=0] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=1, x=0] [L705] COND TRUE 0 x < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=1] [L687] COND TRUE 1 p < 7 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=1] [L689] 1 //@ assert ((1 <= i) && (1 <= j)); [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=1, prev=1, q=1, x=1] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=2, prev=1, q=1, x=1] [L695] COND TRUE 2 q < 7 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=2, prev=1, q=1, x=1] [L697] 2 //@ assert ((1 <= i) && (1 <= j)); [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=1, x=1] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=2, x=1] [L705] COND TRUE 0 x < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=2] [L687] COND TRUE 1 p < 7 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=2] [L689] 1 //@ assert ((1 <= i) && (1 <= j)); [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=2, prev=1, q=2, x=2] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=3, prev=1, q=2, x=2] [L695] COND TRUE 2 q < 7 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=3, prev=1, q=2, x=2] [L697] 2 //@ assert ((1 <= i) && (1 <= j)); [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=2, x=2] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=3, x=2] [L705] COND TRUE 0 x < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=3] [L687] COND TRUE 1 p < 7 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=3] [L689] 1 //@ assert ((1 <= i) && (1 <= j)); [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=3, prev=2, q=3, x=3] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=4, prev=2, q=3, x=3] [L695] COND TRUE 2 q < 7 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=4, prev=2, q=3, x=3] [L697] 2 //@ assert ((1 <= i) && (1 <= j)); [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=3, x=3] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=4, x=3] [L705] COND TRUE 0 x < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=4] [L687] COND TRUE 1 p < 7 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=4] [L689] 1 //@ assert ((1 <= i) && (1 <= j)); [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=4, prev=3, q=4, x=4] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=5, prev=3, q=4, x=4] [L695] COND TRUE 2 q < 7 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=5, prev=3, q=4, x=4] [L697] 2 //@ assert ((1 <= i) && (1 <= j)); [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=4, x=4] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=5, x=4] [L705] COND TRUE 0 x < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5] [L687] COND TRUE 1 p < 7 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5] [L689] 1 //@ assert ((1 <= i) && (1 <= j)); [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=5, prev=5, q=5, x=5] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=6, prev=5, q=5, x=5] [L695] COND TRUE 2 q < 7 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=6, prev=5, q=5, x=5] [L697] 2 //@ assert ((1 <= i) && (1 <= j)); [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=8, p=6, prev=5, q=5, x=5] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=8, p=6, prev=5, q=6, x=5] [L705] COND TRUE 0 x < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=377, next=13, p=6, prev=8, q=6, x=6] [L687] COND TRUE 1 p < 7 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=377, next=13, p=6, prev=8, q=6, x=6] [L689] 1 //@ assert ((1 <= i) && (1 <= j)); [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=377, next=13, p=6, prev=8, q=6, x=6] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=377, next=13, p=7, prev=8, q=6, x=6] [L695] COND TRUE 2 q < 7 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=377, next=13, p=7, prev=8, q=6, x=6] [L697] 2 //@ assert ((1 <= i) && (1 <= j)); [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=987, next=13, p=7, prev=8, q=6, x=6] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=987, next=13, p=7, prev=8, q=7, x=6] [L705] COND TRUE 0 x < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=7, x=7] [L687] COND FALSE 1 !(p < 7) [L692] 1 return ((void *)0); [L695] COND FALSE 2 !(q < 7) [L700] 2 return ((void *)0); [L705] COND TRUE 0 x < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=34, i=610, j=987, next=34, p=7, prev=21, q=7, x=8] [L705] COND TRUE 0 x < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=55, i=610, j=987, next=55, p=7, prev=34, q=7, x=9] [L705] COND TRUE 0 x < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=89, i=610, j=987, next=89, p=7, prev=55, q=7, x=10] [L705] COND TRUE 0 x < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=144, i=610, j=987, next=144, p=7, prev=89, q=7, x=11] [L705] COND TRUE 0 x < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=233, i=610, j=987, next=233, p=7, prev=144, q=7, x=12] [L705] COND TRUE 0 x < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=377, i=610, j=987, next=377, p=7, prev=233, q=7, x=13] [L705] COND TRUE 0 x < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=610, i=610, j=987, next=610, p=7, prev=377, q=7, x=14] [L705] COND TRUE 0 x < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=987, i=610, j=987, next=987, p=7, prev=610, q=7, x=15] [L705] COND TRUE 0 x < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=610, j=987, next=1597, p=7, prev=987, q=7, x=16] [L705] COND FALSE 0 !(x < 16) [L710] 0 return prev; [L722] RET, EXPR 0 fib() [L722] 0 int correct = fib(); [L724] 0 //@ assert ((1 <= i) && (1 <= j)); [L724] 0 _Bool assert_cond = i < correct && j < correct; VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=1598, \old(argv)={1599:1600}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, argc=1598, assert_cond=0, correct=987, cur=1597, i=610, id1=-2, id2=-1, j=987, next=1597, p=7, prev=987, q=7, x=16] [L726] CALL 0 __VERIFIER_assert(assert_cond) [L681] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=1597, expression=0, i=610, j=987, next=1597, p=7, prev=987, q=7, x=16] [L681] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=1597, expression=0, i=610, j=987, next=1597, p=7, prev=987, q=7, x=16] - UnprovableResult [Line: 715]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 720]: 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: 721]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 45 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 15, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 362 SizeOfPredicates, 0 NumberOfNonLiveVariables, 146 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 4/6 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 45 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 1.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 84, 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.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1064 NumberOfCodeBlocks, 1045 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1184 ConstructedInterpolants, 0 QuantifiedInterpolants, 3441 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1897 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 2945/5836 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-08-27 10:57:54,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2024-08-27 10:57:54,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-08-27 10:57:54,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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