./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/fib_unsafe-11.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-08-08_07-59-58.files/mutex-meet-ghost/fib_unsafe-11.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7bc0c755 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-11.i ./goblint.2024-08-08_07-59-58.files/mutex-meet-ghost/fib_unsafe-11.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-validation-atomicfix-7bc0c75-m [2024-08-22 20:51:28,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-22 20:51:28,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-08-22 20:51:28,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-22 20:51:28,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-22 20:51:28,334 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-22 20:51:28,335 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-22 20:51:28,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-22 20:51:28,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-22 20:51:28,337 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-22 20:51:28,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-22 20:51:28,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-22 20:51:28,339 INFO L153 SettingsManager]: * Use SBE=true [2024-08-22 20:51:28,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-22 20:51:28,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-22 20:51:28,341 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-22 20:51:28,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-22 20:51:28,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-22 20:51:28,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-22 20:51:28,344 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-22 20:51:28,345 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-22 20:51:28,345 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-22 20:51:28,345 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-22 20:51:28,346 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-22 20:51:28,346 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-22 20:51:28,346 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-22 20:51:28,346 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-22 20:51:28,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-22 20:51:28,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-22 20:51:28,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-22 20:51:28,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-22 20:51:28,348 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-22 20:51:28,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-22 20:51:28,348 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-22 20:51:28,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-22 20:51:28,349 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-08-22 20:51:28,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-22 20:51:28,350 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-22 20:51:28,350 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-08-22 20:51:28,350 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-22 20:51:28,351 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-08-22 20:51:28,351 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-08-22 20:51:28,351 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-22 20:51:28,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-22 20:51:28,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-22 20:51:28,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-22 20:51:28,612 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-22 20:51:28,613 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-22 20:51:28,614 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-08-08_07-59-58.files/mutex-meet-ghost/fib_unsafe-11.yml/witness.yml [2024-08-22 20:51:28,770 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-22 20:51:28,771 INFO L274 PluginConnector]: CDTParser initialized [2024-08-22 20:51:28,772 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-11.i [2024-08-22 20:51:30,223 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-22 20:51:30,476 INFO L384 CDTParser]: Found 1 translation units. [2024-08-22 20:51:30,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-11.i [2024-08-22 20:51:30,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3a22344f6/63f9c7fb71f04518b7c9a24a630faf7b/FLAG7e03b3bf8 [2024-08-22 20:51:30,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3a22344f6/63f9c7fb71f04518b7c9a24a630faf7b [2024-08-22 20:51:30,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-22 20:51:30,514 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-08-22 20:51:30,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-22 20:51:30,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-22 20:51:30,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-22 20:51:30,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 22.08 08:51:28" (1/2) ... [2024-08-22 20:51:30,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e0bc9c8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 22.08 08:51:30, skipping insertion in model container [2024-08-22 20:51:30,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 22.08 08:51:28" (1/2) ... [2024-08-22 20:51:30,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6b711ae8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 22.08 08:51:30, skipping insertion in model container [2024-08-22 20:51:30,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 08:51:30" (2/2) ... [2024-08-22 20:51:30,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e0bc9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:51:30, skipping insertion in model container [2024-08-22 20:51:30,527 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 08:51:30" (2/2) ... [2024-08-22 20:51:30,527 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-08-22 20:51:30,580 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-08-22 20:51:30,581 INFO L97 edCorrectnessWitness]: Location invariant before [L721-L721] ((((((((! multithreaded || 0 <= p) && (! multithreaded || 0 <= prev)) && (! multithreaded || 1 <= i)) && (! multithreaded || 0 <= x)) && (! multithreaded || 1 <= j)) && (! multithreaded || 0 <= q)) && (! multithreaded || (1 <= i && 1 <= j))) && (! multithreaded || 0 <= cur)) && (! multithreaded || 0 <= next) [2024-08-22 20:51:30,581 INFO L97 edCorrectnessWitness]: Location invariant before [L722-L722] ((((((((! multithreaded || 0 <= p) && (! multithreaded || 0 <= prev)) && (! multithreaded || 1 <= i)) && (! multithreaded || 0 <= x)) && (! multithreaded || 1 <= j)) && (! multithreaded || 0 <= q)) && (! multithreaded || (1 <= i && 1 <= j))) && (! multithreaded || 0 <= cur)) && (! multithreaded || 0 <= next) [2024-08-22 20:51:30,582 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-08-22 20:51:30,582 INFO L106 edCorrectnessWitness]: ghost_update [L720-L720] multithreaded = 1; [2024-08-22 20:51:30,625 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-08-22 20:51:30,976 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-11.i[30243,30256] [2024-08-22 20:51:31,002 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-22 20:51:31,014 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-08-22 20:51:31,078 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-11.i[30243,30256] Start Parsing Local Start Parsing Local Start Parsing Local [2024-08-22 20:51:31,099 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-22 20:51:31,133 INFO L206 MainTranslator]: Completed translation [2024-08-22 20:51:31,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:51:31 WrapperNode [2024-08-22 20:51:31,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-22 20:51:31,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-08-22 20:51:31,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-08-22 20:51:31,136 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-08-22 20:51:31,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:51:31" (1/1) ... [2024-08-22 20:51:31,173 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:51:31" (1/1) ... [2024-08-22 20:51:31,203 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2024-08-22 20:51:31,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-08-22 20:51:31,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-22 20:51:31,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-22 20:51:31,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-22 20:51:31,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:51:31" (1/1) ... [2024-08-22 20:51:31,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:51:31" (1/1) ... [2024-08-22 20:51:31,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:51:31" (1/1) ... [2024-08-22 20:51:31,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:51:31" (1/1) ... [2024-08-22 20:51:31,229 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:51:31" (1/1) ... [2024-08-22 20:51:31,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:51:31" (1/1) ... [2024-08-22 20:51:31,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:51:31" (1/1) ... [2024-08-22 20:51:31,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:51:31" (1/1) ... [2024-08-22 20:51:31,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-22 20:51:31,244 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-08-22 20:51:31,248 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-08-22 20:51:31,248 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-08-22 20:51:31,249 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:51:31" (1/1) ... [2024-08-22 20:51:31,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-22 20:51:31,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-22 20:51:31,286 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-22 20:51:31,290 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-22 20:51:31,330 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-08-22 20:51:31,331 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-08-22 20:51:31,331 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-08-22 20:51:31,332 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-08-22 20:51:31,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-08-22 20:51:31,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-22 20:51:31,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-08-22 20:51:31,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-08-22 20:51:31,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-22 20:51:31,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-22 20:51:31,334 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-08-22 20:51:31,450 INFO L243 CfgBuilder]: Building ICFG [2024-08-22 20:51:31,452 INFO L269 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-22 20:51:31,622 INFO L288 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-08-22 20:51:31,622 INFO L292 CfgBuilder]: Performing block encoding [2024-08-22 20:51:31,737 INFO L314 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-22 20:51:31,738 INFO L319 CfgBuilder]: Removed 3 assume(true) statements. [2024-08-22 20:51:31,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 08:51:31 BoogieIcfgContainer [2024-08-22 20:51:31,738 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-08-22 20:51:31,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-22 20:51:31,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-22 20:51:31,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-22 20:51:31,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 22.08 08:51:28" (1/4) ... [2024-08-22 20:51:31,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123a00de and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 22.08 08:51:31, skipping insertion in model container [2024-08-22 20:51:31,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 08:51:30" (2/4) ... [2024-08-22 20:51:31,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123a00de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 08:51:31, skipping insertion in model container [2024-08-22 20:51:31,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 08:51:31" (3/4) ... [2024-08-22 20:51:31,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123a00de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 08:51:31, skipping insertion in model container [2024-08-22 20:51:31,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 08:51:31" (4/4) ... [2024-08-22 20:51:31,746 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-11.i [2024-08-22 20:51:31,762 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-22 20:51:31,762 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-08-22 20:51:31,762 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-08-22 20:51:31,796 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-22 20:51:31,844 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-22 20:51:31,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-22 20:51:31,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-22 20:51:31,847 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-22 20:51:31,849 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-22 20:51:31,886 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-22 20:51:31,897 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-22 20:51:31,904 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;@48d1dc38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-22 20:51:31,904 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-08-22 20:51:32,005 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-08-22 20:51:32,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-22 20:51:32,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1018018145, now seen corresponding path program 1 times [2024-08-22 20:51:32,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-22 20:51:32,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226418342] [2024-08-22 20:51:32,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-22 20:51:32,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-22 20:51:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-22 20:51:32,712 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-22 20:51:32,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-22 20:51:32,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226418342] [2024-08-22 20:51:32,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226418342] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-22 20:51:32,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-22 20:51:32,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-22 20:51:32,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555808667] [2024-08-22 20:51:32,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-22 20:51:32,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-22 20:51:32,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-22 20:51:32,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-22 20:51:32,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-08-22 20:51:32,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:51:32,757 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-22 20:51:32,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-22 20:51:32,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:51:32,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-22 20:51:32,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-22 20:51:32,932 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-08-22 20:51:32,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-22 20:51:32,933 INFO L85 PathProgramCache]: Analyzing trace with hash 747276657, now seen corresponding path program 1 times [2024-08-22 20:51:32,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-22 20:51:32,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930724347] [2024-08-22 20:51:32,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-22 20:51:32,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-22 20:51:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-22 20:51:33,067 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-22 20:51:33,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-22 20:51:33,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930724347] [2024-08-22 20:51:33,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930724347] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-22 20:51:33,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8296407] [2024-08-22 20:51:33,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-22 20:51:33,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-22 20:51:33,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-22 20:51:33,092 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-22 20:51:33,094 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-22 20:51:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-22 20:51:33,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjunts are in the unsatisfiable core [2024-08-22 20:51:33,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-22 20:51:33,279 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-22 20:51:33,279 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-22 20:51:33,341 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-22 20:51:33,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8296407] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-22 20:51:33,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-22 20:51:33,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-08-22 20:51:33,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273020251] [2024-08-22 20:51:33,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-22 20:51:33,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-22 20:51:33,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-22 20:51:33,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-22 20:51:33,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-08-22 20:51:33,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:51:33,349 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-22 20:51:33,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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-22 20:51:33,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-22 20:51:33,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:51:33,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-22 20:51:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-22 20:51:33,526 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-22 20:51:33,708 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,SelfDestructingSolverStorable1 [2024-08-22 20:51:33,709 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-08-22 20:51:33,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-22 20:51:33,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1909400929, now seen corresponding path program 2 times [2024-08-22 20:51:33,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-22 20:51:33,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733140375] [2024-08-22 20:51:33,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-22 20:51:33,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-22 20:51:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-22 20:51:33,913 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-22 20:51:33,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-22 20:51:33,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733140375] [2024-08-22 20:51:33,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733140375] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-22 20:51:33,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121594230] [2024-08-22 20:51:33,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-22 20:51:33,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-22 20:51:33,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-22 20:51:33,917 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-22 20:51:33,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-08-22 20:51:34,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-22 20:51:34,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-22 20:51:34,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjunts are in the unsatisfiable core [2024-08-22 20:51:34,039 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-22 20:51:34,142 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-22 20:51:34,143 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-22 20:51:34,320 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-22 20:51:34,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121594230] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-22 20:51:34,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-22 20:51:34,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-08-22 20:51:34,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255370977] [2024-08-22 20:51:34,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-22 20:51:34,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-08-22 20:51:34,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-22 20:51:34,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-08-22 20:51:34,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2024-08-22 20:51:34,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:51:34,329 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-22 20:51:34,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.294117647058823) internal successors, (124), 17 states have internal predecessors, (124), 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-22 20:51:34,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-22 20:51:34,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-22 20:51:34,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:51:34,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-22 20:51:34,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-22 20:51:34,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-22 20:51:34,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-08-22 20:51:34,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-22 20:51:34,717 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-08-22 20:51:34,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-22 20:51:34,718 INFO L85 PathProgramCache]: Analyzing trace with hash -366972641, now seen corresponding path program 3 times [2024-08-22 20:51:34,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-22 20:51:34,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908179240] [2024-08-22 20:51:34,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-22 20:51:34,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-22 20:51:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-22 20:51:35,205 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-22 20:51:35,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-22 20:51:35,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908179240] [2024-08-22 20:51:35,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908179240] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-22 20:51:35,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077783304] [2024-08-22 20:51:35,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-22 20:51:35,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-22 20:51:35,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-22 20:51:35,209 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-22 20:51:35,211 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-22 20:51:35,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-08-22 20:51:35,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-22 20:51:35,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 16 conjunts are in the unsatisfiable core [2024-08-22 20:51:35,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-22 20:51:35,787 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 735 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-22 20:51:35,788 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-22 20:51:35,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077783304] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-22 20:51:35,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-22 20:51:35,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [17] total 32 [2024-08-22 20:51:35,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793941060] [2024-08-22 20:51:35,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-22 20:51:35,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-08-22 20:51:35,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-22 20:51:35,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-08-22 20:51:35,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2024-08-22 20:51:35,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:51:35,794 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-22 20:51:35,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.176470588235294) internal successors, (122), 17 states have internal predecessors, (122), 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-22 20:51:35,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-22 20:51:35,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-22 20:51:35,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-08-22 20:51:35,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:51:36,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-22 20:51:36,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-22 20:51:36,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-22 20:51:36,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-22 20:51:36,074 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-22 20:51:36,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-22 20:51:36,261 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-08-22 20:51:36,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-22 20:51:36,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1535368232, now seen corresponding path program 1 times [2024-08-22 20:51:36,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-22 20:51:36,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225885765] [2024-08-22 20:51:36,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-22 20:51:36,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-22 20:51:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-22 20:51:36,680 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-22 20:51:36,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-22 20:51:36,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225885765] [2024-08-22 20:51:36,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225885765] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-22 20:51:36,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971985625] [2024-08-22 20:51:36,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-22 20:51:36,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-22 20:51:36,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-22 20:51:36,687 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-22 20:51:36,689 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-22 20:51:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-22 20:51:36,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 13 conjunts are in the unsatisfiable core [2024-08-22 20:51:36,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-22 20:51:37,070 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 575 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-08-22 20:51:37,070 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-22 20:51:37,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971985625] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-22 20:51:37,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-22 20:51:37,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [17] total 29 [2024-08-22 20:51:37,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161689210] [2024-08-22 20:51:37,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-22 20:51:37,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-08-22 20:51:37,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-22 20:51:37,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-08-22 20:51:37,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=586, Unknown=0, NotChecked=0, Total=812 [2024-08-22 20:51:37,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:51:37,074 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-22 20:51:37,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-22 20:51:37,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-22 20:51:37,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-22 20:51:37,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-08-22 20:51:37,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-22 20:51:37,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:51:37,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-22 20:51:37,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-22 20:51:37,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-22 20:51:37,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-22 20:51:37,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-22 20:51:37,267 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-22 20:51:37,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-22 20:51:37,455 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-08-22 20:51:37,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-22 20:51:37,455 INFO L85 PathProgramCache]: Analyzing trace with hash 978744228, now seen corresponding path program 1 times [2024-08-22 20:51:37,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-22 20:51:37,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791202431] [2024-08-22 20:51:37,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-22 20:51:37,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-22 20:51:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-22 20:51:37,790 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 0 proven. 457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-22 20:51:37,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-22 20:51:37,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791202431] [2024-08-22 20:51:37,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791202431] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-22 20:51:37,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726473022] [2024-08-22 20:51:37,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-22 20:51:37,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-22 20:51:37,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-22 20:51:37,794 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-22 20:51:37,796 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-22 20:51:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-22 20:51:37,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 16 conjunts are in the unsatisfiable core [2024-08-22 20:51:37,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-22 20:51:38,016 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 0 proven. 457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-22 20:51:38,016 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-22 20:51:38,362 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 0 proven. 457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-22 20:51:38,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726473022] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-22 20:51:38,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-22 20:51:38,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2024-08-22 20:51:38,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529551059] [2024-08-22 20:51:38,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-22 20:51:38,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-08-22 20:51:38,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-22 20:51:38,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-08-22 20:51:38,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2024-08-22 20:51:38,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:51:38,367 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-22 20:51:38,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.481481481481482) internal successors, (175), 27 states have internal predecessors, (175), 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-22 20:51:38,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-22 20:51:38,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-22 20:51:38,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-08-22 20:51:38,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-22 20:51:38,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-22 20:51:38,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-22 20:51:38,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-22 20:51:38,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-22 20:51:38,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-22 20:51:38,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-22 20:51:38,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-22 20:51:38,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-08-22 20:51:38,513 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-22 20:51:38,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-22 20:51:38,700 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-08-22 20:51:38,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-22 20:51:38,701 INFO L85 PathProgramCache]: Analyzing trace with hash -950681756, now seen corresponding path program 2 times [2024-08-22 20:51:38,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-22 20:51:38,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872606800] [2024-08-22 20:51:38,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-22 20:51:38,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-22 20:51:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-22 20:51:38,794 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-22 20:51:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-22 20:51:38,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-22 20:51:38,917 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-22 20:51:38,918 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-08-22 20:51:38,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-08-22 20:51:38,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-08-22 20:51:38,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-08-22 20:51:38,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-08-22 20:51:38,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-22 20:51:38,931 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2024-08-22 20:51:38,937 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-08-22 20:51:38,937 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-08-22 20:51:39,085 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-08-22 20:51:39,086 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-08-22 20:51:39,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 08:51:39 BasicIcfg [2024-08-22 20:51:39,087 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-22 20:51:39,087 INFO L158 Benchmark]: Toolchain (without parser) took 8573.81ms. Allocated memory was 184.5MB in the beginning and 241.2MB in the end (delta: 56.6MB). Free memory was 109.1MB in the beginning and 162.9MB in the end (delta: -53.8MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2024-08-22 20:51:39,087 INFO L158 Benchmark]: Witness Parser took 0.21ms. Allocated memory is still 104.9MB. Free memory is still 65.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-22 20:51:39,087 INFO L158 Benchmark]: CDTParser took 1.61ms. Allocated memory is still 184.5MB. Free memory is still 156.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-22 20:51:39,088 INFO L158 Benchmark]: CACSL2BoogieTranslator took 619.90ms. Allocated memory is still 184.5MB. Free memory was 108.9MB in the beginning and 143.8MB in the end (delta: -34.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-08-22 20:51:39,088 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.55ms. Allocated memory is still 184.5MB. Free memory was 143.8MB in the beginning and 142.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-22 20:51:39,090 INFO L158 Benchmark]: Boogie Preprocessor took 38.23ms. Allocated memory is still 184.5MB. Free memory was 141.7MB in the beginning and 140.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-22 20:51:39,090 INFO L158 Benchmark]: RCFGBuilder took 493.92ms. Allocated memory is still 184.5MB. Free memory was 140.3MB in the beginning and 115.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-08-22 20:51:39,090 INFO L158 Benchmark]: TraceAbstraction took 7346.82ms. Allocated memory was 184.5MB in the beginning and 241.2MB in the end (delta: 56.6MB). Free memory was 114.5MB in the beginning and 162.9MB in the end (delta: -48.4MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2024-08-22 20:51:39,091 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.21ms. Allocated memory is still 104.9MB. Free memory is still 65.9MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 1.61ms. Allocated memory is still 184.5MB. Free memory is still 156.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 619.90ms. Allocated memory is still 184.5MB. Free memory was 108.9MB in the beginning and 143.8MB in the end (delta: -34.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.55ms. Allocated memory is still 184.5MB. Free memory was 143.8MB in the beginning and 142.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.23ms. Allocated memory is still 184.5MB. Free memory was 141.7MB in the beginning and 140.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 493.92ms. Allocated memory is still 184.5MB. Free memory was 140.3MB in the beginning and 115.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7346.82ms. Allocated memory was 184.5MB in the beginning and 241.2MB in the end (delta: 56.6MB). Free memory was 114.5MB in the beginning and 162.9MB in the end (delta: -48.4MB). Peak memory consumption was 8.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: 4284, independent: 3641, independent conditional: 3368, independent unconditional: 273, dependent: 643, dependent conditional: 629, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3655, independent: 3641, independent conditional: 3368, independent unconditional: 273, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3655, independent: 3641, independent conditional: 3368, independent unconditional: 273, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3655, independent: 3641, independent conditional: 0, independent unconditional: 3641, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3655, independent: 3641, independent conditional: 0, independent unconditional: 3641, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3655, independent: 3641, independent conditional: 0, independent unconditional: 3641, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 253, independent: 239, independent conditional: 0, independent unconditional: 239, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 253, independent: 234, independent conditional: 0, independent unconditional: 234, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 19, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 107, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3655, independent: 3402, independent conditional: 0, independent unconditional: 3402, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 253, unknown conditional: 0, unknown unconditional: 253] , Statistics on independence cache: Total cache size (in pairs): 253, Positive cache size: 239, Positive conditional cache size: 0, Positive unconditional cache size: 239, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 629 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 45, Number of trivial persistent sets: 28, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 287, independent: 273, independent conditional: 0, independent unconditional: 273, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4284, independent: 3641, independent conditional: 3368, independent unconditional: 273, dependent: 643, dependent conditional: 629, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3655, independent: 3641, independent conditional: 3368, independent unconditional: 273, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3655, independent: 3641, independent conditional: 3368, independent unconditional: 273, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3655, independent: 3641, independent conditional: 0, independent unconditional: 3641, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3655, independent: 3641, independent conditional: 0, independent unconditional: 3641, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3655, independent: 3641, independent conditional: 0, independent unconditional: 3641, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 253, independent: 239, independent conditional: 0, independent unconditional: 239, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 253, independent: 234, independent conditional: 0, independent unconditional: 234, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 19, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 107, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3655, independent: 3402, independent conditional: 0, independent unconditional: 3402, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 253, unknown conditional: 0, unknown unconditional: 253] , Statistics on independence cache: Total cache size (in pairs): 253, Positive cache size: 239, Positive conditional cache size: 0, Positive unconditional cache size: 239, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 629 - CounterExampleResult [Line: 681]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [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)=75026, \old(argv)={75027:75028}, argc=75026, cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L715] 0 i = 1 VAL [\old(argc)=75026, \old(argv)={75027:75028}, argc=75026, cur=1, i=1, j=0, next=0, p=0, prev=0, q=0, x=0] [L718] 0 j = 1 VAL [\old(argc)=75026, \old(argv)={75027:75028}, argc=75026, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L720] 0 //@ ghost multithreaded = 1; VAL [\old(argc)=75026, \old(argv)={75027:75028}, argc=75026, cur=1, i=1, id1=-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)=75026, \old(argv)={75027:75028}, argc=75026, cur=1, i=1, id1=-1, 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] 0 //@ assert (((((((((!multithreaded || (0 <= p)) && (!multithreaded || (0 <= prev))) && (!multithreaded || (1 <= i))) && (!multithreaded || (0 <= x))) && (!multithreaded || (1 <= j))) && (!multithreaded || (0 <= q))) && (!multithreaded || ((1 <= i) && (1 <= j)))) && (!multithreaded || (0 <= cur))) && (!multithreaded || (0 <= next))); [L721] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=75026, \old(argv)={75027:75028}, arg={0:0}, argc=75026, cur=1, i=1, id1=-1, id2=0, 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] 0 //@ assert (((((((((!multithreaded || (0 <= p)) && (!multithreaded || (0 <= prev))) && (!multithreaded || (1 <= i))) && (!multithreaded || (0 <= x))) && (!multithreaded || (1 <= j))) && (!multithreaded || (0 <= q))) && (!multithreaded || ((1 <= i) && (1 <= j)))) && (!multithreaded || (0 <= cur))) && (!multithreaded || (0 <= next))); [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 < 11 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 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 < 11 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 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 < 24 [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 < 11 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 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 < 11 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 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 < 24 [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 < 11 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 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 < 11 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 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 < 24 [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 < 11 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 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 < 11 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 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 < 24 [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 < 11 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 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 < 11 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 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 < 24 [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 < 11 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 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 < 11 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 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 < 24 [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 < 11 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 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 < 11 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 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 < 24 [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 TRUE 1 p < 11 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] [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=987, next=21, p=7, prev=13, q=7, x=7] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=987, next=21, p=8, prev=13, q=7, x=7] [L695] COND TRUE 2 q < 11 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=987, next=21, p=8, prev=13, q=7, x=7] [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=2584, next=21, p=8, prev=13, q=7, x=7] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=2584, next=21, p=8, prev=13, q=8, x=7] [L705] COND TRUE 0 x < 24 [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=34, i=1597, j=2584, next=34, p=8, prev=21, q=8, x=8] [L687] COND TRUE 1 p < 11 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=1597, j=2584, next=34, p=8, prev=21, q=8, x=8] [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=2584, next=34, p=8, prev=21, q=8, x=8] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=2584, next=34, p=9, prev=21, q=8, x=8] [L695] COND TRUE 2 q < 11 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=2584, next=34, p=9, prev=21, q=8, x=8] [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=6765, next=34, p=9, prev=21, q=8, x=8] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=6765, next=34, p=9, prev=21, q=9, x=8] [L705] COND TRUE 0 x < 24 [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=55, i=4181, j=6765, next=55, p=9, prev=34, q=9, x=9] [L687] COND TRUE 1 p < 11 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=4181, j=6765, next=55, p=9, prev=34, q=9, x=9] [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=6765, next=55, p=9, prev=34, q=9, x=9] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=6765, next=55, p=10, prev=34, q=9, x=9] [L695] COND TRUE 2 q < 11 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=6765, next=55, p=10, prev=34, q=9, x=9] [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=17711, next=55, p=10, prev=34, q=9, x=9] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=17711, next=55, p=10, prev=34, q=10, x=9] [L705] COND TRUE 0 x < 24 [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=89, i=10946, j=17711, next=89, p=10, prev=55, q=10, x=10] [L687] COND TRUE 1 p < 11 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=10946, j=17711, next=89, p=10, prev=55, q=10, x=10] [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=17711, next=89, p=10, prev=55, q=10, x=10] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=17711, next=89, p=11, prev=55, q=10, x=10] [L695] COND TRUE 2 q < 11 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=17711, next=89, p=11, prev=55, q=10, x=10] [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=46368, next=89, p=11, prev=55, q=10, x=10] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=46368, next=89, p=11, prev=55, q=11, x=10] [L705] COND TRUE 0 x < 24 [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=144, i=28657, j=46368, next=144, p=11, prev=89, q=11, x=11] [L687] COND FALSE 1 !(p < 11) [L692] 1 return ((void *)0); [L695] COND FALSE 2 !(q < 11) [L700] 2 return ((void *)0); [L705] COND TRUE 0 x < 24 [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=28657, j=46368, next=233, p=11, prev=144, q=11, x=12] [L705] COND TRUE 0 x < 24 [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=28657, j=46368, next=377, p=11, prev=233, q=11, x=13] [L705] COND TRUE 0 x < 24 [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=28657, j=46368, next=610, p=11, prev=377, q=11, x=14] [L705] COND TRUE 0 x < 24 [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=28657, j=46368, next=987, p=11, prev=610, q=11, x=15] [L705] COND TRUE 0 x < 24 [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=28657, j=46368, next=1597, p=11, prev=987, q=11, x=16] [L705] COND TRUE 0 x < 24 [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=2584, i=28657, j=46368, next=2584, p=11, prev=1597, q=11, x=17] [L705] COND TRUE 0 x < 24 [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=4181, i=28657, j=46368, next=4181, p=11, prev=2584, q=11, x=18] [L705] COND TRUE 0 x < 24 [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=6765, i=28657, j=46368, next=6765, p=11, prev=4181, q=11, x=19] [L705] COND TRUE 0 x < 24 [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=10946, i=28657, j=46368, next=10946, p=11, prev=6765, q=11, x=20] [L705] COND TRUE 0 x < 24 [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=17711, i=28657, j=46368, next=17711, p=11, prev=10946, q=11, x=21] [L705] COND TRUE 0 x < 24 [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=28657, i=28657, j=46368, next=28657, p=11, prev=17711, q=11, x=22] [L705] COND TRUE 0 x < 24 [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=46368, i=28657, j=46368, next=46368, p=11, prev=28657, q=11, x=23] [L705] COND TRUE 0 x < 24 [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=75025, i=28657, j=46368, next=75025, p=11, prev=46368, q=11, x=24] [L705] COND FALSE 0 !(x < 24) [L710] 0 return prev; [L722] RET, EXPR 0 fib() [L722] 0 int correct = fib(); [L724] 0 _Bool assert_cond = i < correct && j < correct; VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=75026, \old(argv)={75027:75028}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, argc=75026, assert_cond=0, correct=46368, cur=75025, i=28657, id1=-1, id2=0, j=46368, next=75025, p=11, prev=46368, q=11, x=24] [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=75025, expression=0, i=28657, j=46368, next=75025, p=11, prev=46368, q=11, x=24] [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=75025, expression=0, i=28657, j=46368, next=75025, p=11, prev=46368, q=11, x=24] - UnprovableResult [Line: 721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 722]: 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: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 43 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 1.2s, 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, 985 NumberOfCodeBlocks, 985 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1061 ConstructedInterpolants, 0 QuantifiedInterpolants, 2894 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1593 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 1331/4516 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-22 20:51:39,127 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-22 20:51:39,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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