./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/fib_unsafe-10.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-09-02_08-21-23.files/protection-local/fib_unsafe-10.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e94c40da 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-10.i ./goblint.2024-09-02_08-21-23.files/protection-local/fib_unsafe-10.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-e94c40d-m [2024-09-24 09:38:31,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-24 09:38:31,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-24 09:38:31,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-24 09:38:31,557 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-24 09:38:31,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-24 09:38:31,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-24 09:38:31,580 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-24 09:38:31,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-24 09:38:31,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-24 09:38:31,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-24 09:38:31,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-24 09:38:31,584 INFO L153 SettingsManager]: * Use SBE=true [2024-09-24 09:38:31,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-24 09:38:31,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-24 09:38:31,584 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-24 09:38:31,584 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-24 09:38:31,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-24 09:38:31,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-24 09:38:31,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-24 09:38:31,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-24 09:38:31,587 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-24 09:38:31,587 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-24 09:38:31,587 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-24 09:38:31,587 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-24 09:38:31,587 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-24 09:38:31,588 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-24 09:38:31,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-24 09:38:31,588 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-24 09:38:31,588 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-24 09:38:31,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-24 09:38:31,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-24 09:38:31,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-24 09:38:31,589 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-24 09:38:31,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-24 09:38:31,590 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-24 09:38:31,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-24 09:38:31,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-24 09:38:31,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-24 09:38:31,591 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-24 09:38:31,591 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-24 09:38:31,591 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: Positions where we compute the Hoare Annotation -> None Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-09-24 09:38:31,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-24 09:38:31,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-24 09:38:31,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-24 09:38:31,792 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-24 09:38:31,793 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-24 09:38:31,794 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-09-02_08-21-23.files/protection-local/fib_unsafe-10.yml/witness.yml [2024-09-24 09:38:31,903 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-24 09:38:31,904 INFO L274 PluginConnector]: CDTParser initialized [2024-09-24 09:38:31,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-10.i [2024-09-24 09:38:33,090 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-24 09:38:33,298 INFO L384 CDTParser]: Found 1 translation units. [2024-09-24 09:38:33,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-10.i [2024-09-24 09:38:33,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7a00ff71f/889deb0cc85444aeb0c69166499ba1ef/FLAGc78a9663a [2024-09-24 09:38:33,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7a00ff71f/889deb0cc85444aeb0c69166499ba1ef [2024-09-24 09:38:33,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-24 09:38:33,663 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-24 09:38:33,664 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-24 09:38:33,664 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-24 09:38:33,669 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-24 09:38:33,670 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 24.09 09:38:31" (1/2) ... [2024-09-24 09:38:33,671 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@632c787f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 09:38:33, skipping insertion in model container [2024-09-24 09:38:33,671 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 24.09 09:38:31" (1/2) ... [2024-09-24 09:38:33,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@d98d651 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 09:38:33, skipping insertion in model container [2024-09-24 09:38:33,673 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 09:38:33" (2/2) ... [2024-09-24 09:38:33,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@632c787f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:38:33, skipping insertion in model container [2024-09-24 09:38:33,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 09:38:33" (2/2) ... [2024-09-24 09:38:33,704 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-24 09:38:33,704 INFO L1541 ArrayList]: Location invariant before [L718-L718] (((((((i == 1) && (j == 0)) && (p == 0)) && (q == 0)) && (cur == 1)) && (prev == 0)) && (next == 0)) && (x == 0) [2024-09-24 09:38:33,704 INFO L1541 ArrayList]: Location invariant before [L724-L724] (1 <= i) && (1 <= j) [2024-09-24 09:38:33,704 INFO L1541 ArrayList]: Location invariant before [L697-L697] (1 <= i) && (1 <= j) [2024-09-24 09:38:33,704 INFO L1541 ArrayList]: Location invariant before [L689-L689] (1 <= i) && (1 <= j) [2024-09-24 09:38:33,704 INFO L1541 ArrayList]: Location invariant before [L715-L715] (((((((i == 0) && (j == 0)) && (p == 0)) && (q == 0)) && (cur == 1)) && (prev == 0)) && (next == 0)) && (x == 0) [2024-09-24 09:38:33,736 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-24 09:38:34,033 WARN L248 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-10.i[30243,30256] [2024-09-24 09:38:34,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 09:38:34,058 INFO L200 MainTranslator]: Completed pre-run [2024-09-24 09:38:34,086 WARN L248 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-10.i[30243,30256] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-09-24 09:38:34,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 09:38:34,150 INFO L204 MainTranslator]: Completed translation [2024-09-24 09:38:34,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:38:34 WrapperNode [2024-09-24 09:38:34,150 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-24 09:38:34,151 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-24 09:38:34,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-24 09:38:34,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-24 09:38:34,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:38:34" (1/1) ... [2024-09-24 09:38:34,168 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:38:34" (1/1) ... [2024-09-24 09:38:34,189 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2024-09-24 09:38:34,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-24 09:38:34,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-24 09:38:34,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-24 09:38:34,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-24 09:38:34,197 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:38:34" (1/1) ... [2024-09-24 09:38:34,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:38:34" (1/1) ... [2024-09-24 09:38:34,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:38:34" (1/1) ... [2024-09-24 09:38:34,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:38:34" (1/1) ... [2024-09-24 09:38:34,203 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:38:34" (1/1) ... [2024-09-24 09:38:34,206 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:38:34" (1/1) ... [2024-09-24 09:38:34,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:38:34" (1/1) ... [2024-09-24 09:38:34,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:38:34" (1/1) ... [2024-09-24 09:38:34,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-24 09:38:34,210 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-24 09:38:34,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-24 09:38:34,211 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-24 09:38:34,212 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:38:34" (1/1) ... [2024-09-24 09:38:34,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-24 09:38:34,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 09:38:34,250 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-09-24 09:38:34,256 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-09-24 09:38:34,295 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-09-24 09:38:34,295 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-09-24 09:38:34,295 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-09-24 09:38:34,296 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-09-24 09:38:34,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-24 09:38:34,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-24 09:38:34,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-24 09:38:34,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-24 09:38:34,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-24 09:38:34,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-24 09:38:34,298 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-24 09:38:34,408 INFO L242 CfgBuilder]: Building ICFG [2024-09-24 09:38:34,410 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-24 09:38:34,580 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-24 09:38:34,580 INFO L291 CfgBuilder]: Performing block encoding [2024-09-24 09:38:34,680 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-24 09:38:34,680 INFO L318 CfgBuilder]: Removed 3 assume(true) statements. [2024-09-24 09:38:34,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 09:38:34 BoogieIcfgContainer [2024-09-24 09:38:34,681 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-24 09:38:34,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-24 09:38:34,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-24 09:38:34,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-24 09:38:34,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 24.09 09:38:31" (1/4) ... [2024-09-24 09:38:34,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50fd2e69 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 24.09 09:38:34, skipping insertion in model container [2024-09-24 09:38:34,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 09:38:33" (2/4) ... [2024-09-24 09:38:34,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50fd2e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 09:38:34, skipping insertion in model container [2024-09-24 09:38:34,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:38:34" (3/4) ... [2024-09-24 09:38:34,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50fd2e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 09:38:34, skipping insertion in model container [2024-09-24 09:38:34,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 09:38:34" (4/4) ... [2024-09-24 09:38:34,691 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-10.i [2024-09-24 09:38:34,704 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-24 09:38:34,705 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-09-24 09:38:34,705 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-24 09:38:34,743 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-24 09:38:34,778 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 09:38:34,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-24 09:38:34,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 09:38:34,781 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-09-24 09:38:34,783 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-09-24 09:38:34,814 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-24 09:38:34,825 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-09-24 09:38:34,832 INFO L336 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@1c28e79d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 09:38:34,832 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-24 09:38:34,913 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:38:34,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:38:34,918 INFO L85 PathProgramCache]: Analyzing trace with hash 315772146, now seen corresponding path program 1 times [2024-09-24 09:38:34,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 09:38:34,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677475499] [2024-09-24 09:38:34,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:38:34,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 09:38:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:38:35,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:38:35,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 09:38:35,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677475499] [2024-09-24 09:38:35,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677475499] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:38:35,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:38:35,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-24 09:38:35,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107080316] [2024-09-24 09:38:35,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:38:35,247 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-24 09:38:35,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 09:38:35,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-24 09:38:35,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-24 09:38:35,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:35,273 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:38:35,274 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 09:38:35,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:35,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:35,333 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-24 09:38:35,333 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:38:35,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:38:35,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1835280151, now seen corresponding path program 1 times [2024-09-24 09:38:35,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 09:38:35,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352251048] [2024-09-24 09:38:35,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:38:35,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 09:38:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:38:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:38:35,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 09:38:35,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352251048] [2024-09-24 09:38:35,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352251048] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:38:35,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:38:35,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 09:38:35,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13331083] [2024-09-24 09:38:35,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:38:35,484 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 09:38:35,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 09:38:35,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 09:38:35,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-24 09:38:35,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:35,486 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:38:35,486 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 09:38:35,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:35,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:35,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:35,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:38:35,545 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-24 09:38:35,546 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:38:35,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:38:35,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1057715220, now seen corresponding path program 1 times [2024-09-24 09:38:35,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 09:38:35,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911798048] [2024-09-24 09:38:35,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:38:35,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 09:38:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:38:35,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:38:35,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 09:38:35,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911798048] [2024-09-24 09:38:35,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911798048] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 09:38:35,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075036444] [2024-09-24 09:38:35,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:38:35,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 09:38:35,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 09:38:35,636 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-09-24 09:38:35,638 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-09-24 09:38:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:38:35,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-24 09:38:35,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:38:35,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:38:35,848 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 09:38:35,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075036444] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:38:35,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-24 09:38:35,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2024-09-24 09:38:35,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032487531] [2024-09-24 09:38:35,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:38:35,850 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-24 09:38:35,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 09:38:35,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-24 09:38:35,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-09-24 09:38:35,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:35,851 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:38:35,851 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 09:38:35,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:35,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:38:35,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:36,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:36,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:38:36,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 09:38:36,355 INFO L785 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 1 remaining) [2024-09-24 09:38:36,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-24 09:38:36,555 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-09-24 09:38:36,561 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-09-24 09:38:36,563 INFO L312 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2024-09-24 09:38:36,568 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 09:38:36,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-24 09:38:36,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 09:38:36,572 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-24 09:38:36,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-09-24 09:38:36,575 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-24 09:38:36,576 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-24 09:38:36,577 INFO L336 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@1c28e79d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 09:38:36,577 INFO L337 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-09-24 09:38:36,578 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 09:38:36,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:38:36,578 INFO L85 PathProgramCache]: Analyzing trace with hash 9101, now seen corresponding path program 1 times [2024-09-24 09:38:36,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 09:38:36,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25844601] [2024-09-24 09:38:36,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:38:36,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 09:38:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:38:36,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:38:36,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 09:38:36,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25844601] [2024-09-24 09:38:36,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25844601] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:38:36,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:38:36,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-24 09:38:36,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222438556] [2024-09-24 09:38:36,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:38:36,621 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 09:38:36,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 09:38:36,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 09:38:36,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 09:38:36,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:36,622 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:38:36,622 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 09:38:36,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:36,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:38:36,635 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-24 09:38:36,636 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 09:38:36,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:38:36,636 INFO L85 PathProgramCache]: Analyzing trace with hash 282403, now seen corresponding path program 1 times [2024-09-24 09:38:36,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 09:38:36,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653492863] [2024-09-24 09:38:36,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:38:36,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 09:38:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:38:36,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:38:36,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 09:38:36,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653492863] [2024-09-24 09:38:36,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653492863] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:38:36,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:38:36,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 09:38:36,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885740056] [2024-09-24 09:38:36,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:38:36,707 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-24 09:38:36,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 09:38:36,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-24 09:38:36,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-24 09:38:36,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:36,709 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:38:36,709 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 09:38:36,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:38:36,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:36,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:38:36,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:36,808 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-24 09:38:36,809 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 09:38:36,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:38:36,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1768133360, now seen corresponding path program 1 times [2024-09-24 09:38:36,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 09:38:36,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662570883] [2024-09-24 09:38:36,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:38:36,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 09:38:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:38:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:38:36,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 09:38:36,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662570883] [2024-09-24 09:38:36,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662570883] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:38:36,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:38:36,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 09:38:36,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415664925] [2024-09-24 09:38:36,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:38:36,868 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-24 09:38:36,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 09:38:36,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-24 09:38:36,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-24 09:38:36,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:36,869 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:38:36,869 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 09:38:36,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:38:36,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:36,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:36,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:38:36,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:36,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:36,914 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-24 09:38:36,915 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 09:38:36,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:38:36,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1527341765, now seen corresponding path program 1 times [2024-09-24 09:38:36,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 09:38:36,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924256545] [2024-09-24 09:38:36,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:38:36,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 09:38:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:38:36,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 09:38:36,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 09:38:36,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924256545] [2024-09-24 09:38:36,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924256545] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:38:36,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:38:36,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 09:38:36,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041657280] [2024-09-24 09:38:36,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:38:36,973 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 09:38:36,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 09:38:36,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 09:38:36,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-24 09:38:36,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:36,974 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:38:36,974 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 09:38:36,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:38:36,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:36,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:36,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:37,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:38:37,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:37,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:37,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:38:37,024 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-24 09:38:37,025 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 09:38:37,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:38:37,025 INFO L85 PathProgramCache]: Analyzing trace with hash -617439478, now seen corresponding path program 1 times [2024-09-24 09:38:37,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 09:38:37,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261389504] [2024-09-24 09:38:37,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:38:37,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 09:38:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:38:37,062 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:38:37,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 09:38:37,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261389504] [2024-09-24 09:38:37,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261389504] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 09:38:37,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735758395] [2024-09-24 09:38:37,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:38:37,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 09:38:37,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 09:38:37,064 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-09-24 09:38:37,066 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-09-24 09:38:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:38:37,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-24 09:38:37,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:38:37,206 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:38:37,207 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 09:38:37,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735758395] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:38:37,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-24 09:38:37,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2024-09-24 09:38:37,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411662609] [2024-09-24 09:38:37,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:38:37,208 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-24 09:38:37,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 09:38:37,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-24 09:38:37,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-09-24 09:38:37,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:37,209 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:38:37,210 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 09:38:37,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:38:37,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:37,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:37,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:38:37,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:37,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:38:37,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:37,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:37,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:38:37,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 09:38:37,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-24 09:38:37,503 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 09:38:37,503 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 09:38:37,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:38:37,504 INFO L85 PathProgramCache]: Analyzing trace with hash 52262193, now seen corresponding path program 1 times [2024-09-24 09:38:37,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 09:38:37,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813686897] [2024-09-24 09:38:37,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:38:37,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 09:38:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:38:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:38:37,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 09:38:37,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813686897] [2024-09-24 09:38:37,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813686897] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 09:38:37,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734097813] [2024-09-24 09:38:37,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:38:37,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 09:38:37,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 09:38:37,580 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-09-24 09:38:37,581 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-09-24 09:38:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:38:37,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-24 09:38:37,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:38:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:38:37,661 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 09:38:37,695 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:38:37,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734097813] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 09:38:37,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 09:38:37,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-09-24 09:38:37,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409535424] [2024-09-24 09:38:37,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 09:38:37,697 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-24 09:38:37,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 09:38:37,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-24 09:38:37,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-24 09:38:37,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:37,698 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:38:37,698 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 09:38:37,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:38:37,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:37,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:37,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:38:37,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 09:38:37,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:37,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:38:37,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:37,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:37,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:38:37,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 09:38:37,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:38:37,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-24 09:38:37,985 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-09-24 09:38:37,986 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 09:38:37,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:38:37,987 INFO L85 PathProgramCache]: Analyzing trace with hash -768086606, now seen corresponding path program 2 times [2024-09-24 09:38:37,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 09:38:37,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370873632] [2024-09-24 09:38:37,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:38:37,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 09:38:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:38:38,110 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:38:38,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 09:38:38,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370873632] [2024-09-24 09:38:38,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370873632] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 09:38:38,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592750248] [2024-09-24 09:38:38,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-24 09:38:38,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 09:38:38,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 09:38:38,112 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-09-24 09:38:38,113 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-09-24 09:38:38,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-24 09:38:38,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 09:38:38,180 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-24 09:38:38,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:38:38,234 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:38:38,234 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 09:38:38,361 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:38:38,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592750248] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 09:38:38,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 09:38:38,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-09-24 09:38:38,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957363809] [2024-09-24 09:38:38,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 09:38:38,362 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-24 09:38:38,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 09:38:38,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-24 09:38:38,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2024-09-24 09:38:38,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:38,363 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:38:38,363 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 17 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 09:38:38,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:38:38,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:38,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:38,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:38:38,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 09:38:38,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:38:38,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:38,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:38:38,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:38,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:38,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:38:38,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 09:38:38,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:38:38,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-24 09:38:38,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-24 09:38:38,747 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-24 09:38:38,748 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 09:38:38,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:38:38,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2144558414, now seen corresponding path program 3 times [2024-09-24 09:38:38,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 09:38:38,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481884454] [2024-09-24 09:38:38,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:38:38,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 09:38:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:38:39,129 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 0 proven. 735 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:38:39,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 09:38:39,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481884454] [2024-09-24 09:38:39,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481884454] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 09:38:39,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284771464] [2024-09-24 09:38:39,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-24 09:38:39,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 09:38:39,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 09:38:39,134 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 09:38:39,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-24 09:38:39,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-09-24 09:38:39,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 09:38:39,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-24 09:38:39,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:38:39,375 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 0 proven. 735 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:38:39,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 09:38:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 0 proven. 735 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:38:39,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284771464] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 09:38:39,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 09:38:39,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2024-09-24 09:38:39,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272429076] [2024-09-24 09:38:39,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 09:38:39,672 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-24 09:38:39,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 09:38:39,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-24 09:38:39,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-09-24 09:38:39,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:39,673 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:38:39,673 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.12) internal successors, (178), 25 states have internal predecessors, (178), 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-09-24 09:38:39,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:38:39,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:39,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:39,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:38:39,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 09:38:39,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:38:39,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-24 09:38:39,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:39,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:38:39,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:39,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:39,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:38:39,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 09:38:39,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:38:39,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-24 09:38:39,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-24 09:38:39,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-24 09:38:40,104 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-24 09:38:40,105 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 09:38:40,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:38:40,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1820219314, now seen corresponding path program 4 times [2024-09-24 09:38:40,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 09:38:40,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945787196] [2024-09-24 09:38:40,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:38:40,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 09:38:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:38:41,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 1578 proven. 193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:38:41,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 09:38:41,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945787196] [2024-09-24 09:38:41,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945787196] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 09:38:41,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089838319] [2024-09-24 09:38:41,852 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-24 09:38:41,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 09:38:41,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 09:38:41,853 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 09:38:41,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-24 09:38:41,950 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-24 09:38:41,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 09:38:41,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-24 09:38:41,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:38:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 1237 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2024-09-24 09:38:42,284 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 09:38:42,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089838319] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:38:42,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-24 09:38:42,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [49] total 60 [2024-09-24 09:38:42,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434122500] [2024-09-24 09:38:42,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:38:42,285 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-24 09:38:42,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 09:38:42,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-24 09:38:42,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1080, Invalid=2460, Unknown=0, NotChecked=0, Total=3540 [2024-09-24 09:38:42,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:42,287 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:38:42,287 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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-09-24 09:38:42,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:38:42,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:42,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:42,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:38:42,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 09:38:42,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:38:42,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-24 09:38:42,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-09-24 09:38:42,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:42,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:38:42,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:38:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 09:38:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:38:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-24 09:38:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-24 09:38:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-24 09:38:42,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-24 09:38:42,657 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 09:38:42,657 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 09:38:42,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:38:42,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1227092982, now seen corresponding path program 1 times [2024-09-24 09:38:42,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 09:38:42,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361222361] [2024-09-24 09:38:42,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:38:42,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 09:38:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:38:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 1065 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:38:43,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 09:38:43,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361222361] [2024-09-24 09:38:43,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361222361] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 09:38:43,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958659620] [2024-09-24 09:38:43,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:38:43,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 09:38:43,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 09:38:43,105 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 09:38:43,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-24 09:38:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:38:43,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-24 09:38:43,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:38:43,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 857 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-09-24 09:38:43,262 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 09:38:43,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958659620] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:38:43,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-24 09:38:43,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [25] total 26 [2024-09-24 09:38:43,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792173531] [2024-09-24 09:38:43,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:38:43,263 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-24 09:38:43,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 09:38:43,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-24 09:38:43,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2024-09-24 09:38:43,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:43,264 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:38:43,265 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 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-09-24 09:38:43,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:38:43,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:43,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:43,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:38:43,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 09:38:43,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:38:43,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-24 09:38:43,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-09-24 09:38:43,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-09-24 09:38:43,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:38:43,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:38:43,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:43,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:38:43,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:38:43,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 09:38:43,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:38:43,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-24 09:38:43,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-24 09:38:43,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-24 09:38:43,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-24 09:38:43,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-24 09:38:43,643 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 09:38:43,644 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 09:38:43,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:38:43,644 INFO L85 PathProgramCache]: Analyzing trace with hash -856448462, now seen corresponding path program 1 times [2024-09-24 09:38:43,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 09:38:43,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240367817] [2024-09-24 09:38:43,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:38:43,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 09:38:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 09:38:43,671 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-24 09:38:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 09:38:43,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-24 09:38:43,727 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-24 09:38:43,727 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-09-24 09:38:43,727 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-09-24 09:38:43,728 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-09-24 09:38:43,728 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 6 remaining) [2024-09-24 09:38:43,728 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-09-24 09:38:43,728 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-09-24 09:38:43,728 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-24 09:38:43,729 INFO L408 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 09:38:43,730 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/3) [2024-09-24 09:38:43,817 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-09-24 09:38:43,818 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-24 09:38:43,820 INFO L469 ceAbstractionStarter]: Automizer considered 5 witness invariants [2024-09-24 09:38:43,820 INFO L470 ceAbstractionStarter]: WitnessConsidered=5 [2024-09-24 09:38:43,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.09 09:38:43 BasicIcfg [2024-09-24 09:38:43,822 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-24 09:38:43,823 INFO L158 Benchmark]: Toolchain (without parser) took 10160.37ms. Allocated memory was 155.2MB in the beginning and 318.8MB in the end (delta: 163.6MB). Free memory was 78.5MB in the beginning and 112.0MB in the end (delta: -33.4MB). Peak memory consumption was 132.2MB. Max. memory is 16.1GB. [2024-09-24 09:38:43,823 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 106.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-24 09:38:43,823 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 155.2MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-24 09:38:43,823 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.10ms. Allocated memory was 155.2MB in the beginning and 218.1MB in the end (delta: 62.9MB). Free memory was 78.3MB in the beginning and 174.4MB in the end (delta: -96.1MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2024-09-24 09:38:43,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.22ms. Allocated memory is still 218.1MB. Free memory was 174.4MB in the beginning and 172.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 09:38:43,824 INFO L158 Benchmark]: Boogie Preprocessor took 19.60ms. Allocated memory is still 218.1MB. Free memory was 172.3MB in the beginning and 170.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 09:38:43,824 INFO L158 Benchmark]: RCFGBuilder took 471.75ms. Allocated memory is still 218.1MB. Free memory was 170.2MB in the beginning and 144.0MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-09-24 09:38:43,824 INFO L158 Benchmark]: TraceAbstraction took 9138.70ms. Allocated memory was 218.1MB in the beginning and 318.8MB in the end (delta: 100.7MB). Free memory was 143.0MB in the beginning and 112.0MB in the end (delta: 31.0MB). Peak memory consumption was 132.7MB. Max. memory is 16.1GB. [2024-09-24 09:38:43,825 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.15ms. Allocated memory is still 155.2MB. Free memory is still 106.7MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.12ms. Allocated memory is still 155.2MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 487.10ms. Allocated memory was 155.2MB in the beginning and 218.1MB in the end (delta: 62.9MB). Free memory was 78.3MB in the beginning and 174.4MB in the end (delta: -96.1MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.22ms. Allocated memory is still 218.1MB. Free memory was 174.4MB in the beginning and 172.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.60ms. Allocated memory is still 218.1MB. Free memory was 172.3MB in the beginning and 170.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 471.75ms. Allocated memory is still 218.1MB. Free memory was 170.2MB in the beginning and 144.0MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9138.70ms. Allocated memory was 218.1MB in the beginning and 318.8MB in the end (delta: 100.7MB). Free memory was 143.0MB in the beginning and 112.0MB in the end (delta: 31.0MB). Peak memory consumption was 132.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4646, independent: 3854, independent conditional: 3396, independent unconditional: 458, dependent: 792, dependent conditional: 785, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3985, independent: 3854, independent conditional: 3396, independent unconditional: 458, dependent: 131, dependent conditional: 124, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3985, independent: 3854, independent conditional: 3396, independent unconditional: 458, dependent: 131, dependent conditional: 124, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4185, independent: 3854, independent conditional: 3396, independent unconditional: 458, dependent: 331, dependent conditional: 324, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4185, independent: 3854, independent conditional: 0, independent unconditional: 3854, dependent: 331, dependent conditional: 200, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4185, independent: 3854, independent conditional: 0, independent unconditional: 3854, dependent: 331, dependent conditional: 200, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 416, independent: 371, independent conditional: 0, independent unconditional: 371, dependent: 45, dependent conditional: 38, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 416, independent: 362, independent conditional: 0, independent unconditional: 362, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 54, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 45, dependent conditional: 38, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 45, dependent conditional: 38, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 170, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 134, dependent conditional: 113, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4185, independent: 3483, independent conditional: 0, independent unconditional: 3483, dependent: 286, dependent conditional: 162, dependent unconditional: 124, unknown: 416, unknown conditional: 38, unknown unconditional: 378] , Statistics on independence cache: Total cache size (in pairs): 416, Positive cache size: 371, Positive conditional cache size: 0, Positive unconditional cache size: 371, Negative cache size: 45, Negative conditional cache size: 38, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3520, Maximal queried relation: 3, Independence queries for same thread: 661, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 254, Number of trivial persistent sets: 202, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 465, independent: 458, independent conditional: 0, independent unconditional: 458, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4646, independent: 3854, independent conditional: 3396, independent unconditional: 458, dependent: 792, dependent conditional: 785, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3985, independent: 3854, independent conditional: 3396, independent unconditional: 458, dependent: 131, dependent conditional: 124, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3985, independent: 3854, independent conditional: 3396, independent unconditional: 458, dependent: 131, dependent conditional: 124, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4185, independent: 3854, independent conditional: 3396, independent unconditional: 458, dependent: 331, dependent conditional: 324, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4185, independent: 3854, independent conditional: 0, independent unconditional: 3854, dependent: 331, dependent conditional: 200, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4185, independent: 3854, independent conditional: 0, independent unconditional: 3854, dependent: 331, dependent conditional: 200, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 416, independent: 371, independent conditional: 0, independent unconditional: 371, dependent: 45, dependent conditional: 38, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 416, independent: 362, independent conditional: 0, independent unconditional: 362, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 54, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 45, dependent conditional: 38, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 45, dependent conditional: 38, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 170, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 134, dependent conditional: 113, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4185, independent: 3483, independent conditional: 0, independent unconditional: 3483, dependent: 286, dependent conditional: 162, dependent unconditional: 124, unknown: 416, unknown conditional: 38, unknown unconditional: 378] , Statistics on independence cache: Total cache size (in pairs): 416, Positive cache size: 371, Positive conditional cache size: 0, Positive unconditional cache size: 371, Negative cache size: 45, Negative conditional cache size: 38, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3520, Maximal queried relation: 3, Independence queries for same thread: 661 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6191, independent: 5115, independent conditional: 4773, independent unconditional: 342, dependent: 1076, dependent conditional: 1069, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5124, independent: 5115, independent conditional: 4773, independent unconditional: 342, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5124, independent: 5115, independent conditional: 4773, independent unconditional: 342, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5126, independent: 5115, independent conditional: 4773, independent unconditional: 342, dependent: 11, dependent conditional: 4, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5126, independent: 5115, independent conditional: 0, independent unconditional: 5115, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5126, independent: 5115, independent conditional: 0, independent unconditional: 5115, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 321, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 321, independent: 303, independent conditional: 0, independent unconditional: 303, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 18, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 13, dependent conditional: 3, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 5126, independent: 4803, independent conditional: 0, independent unconditional: 4803, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 321, unknown conditional: 2, unknown unconditional: 319] , Statistics on independence cache: Total cache size (in pairs): 321, Positive cache size: 312, Positive conditional cache size: 0, Positive unconditional cache size: 312, Negative cache size: 9, Negative conditional cache size: 2, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4775, Maximal queried relation: 1, Independence queries for same thread: 1067, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 47, Number of trivial persistent sets: 31, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 349, independent: 342, independent conditional: 0, independent unconditional: 342, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6191, independent: 5115, independent conditional: 4773, independent unconditional: 342, dependent: 1076, dependent conditional: 1069, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5124, independent: 5115, independent conditional: 4773, independent unconditional: 342, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5124, independent: 5115, independent conditional: 4773, independent unconditional: 342, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5126, independent: 5115, independent conditional: 4773, independent unconditional: 342, dependent: 11, dependent conditional: 4, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5126, independent: 5115, independent conditional: 0, independent unconditional: 5115, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5126, independent: 5115, independent conditional: 0, independent unconditional: 5115, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 321, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 321, independent: 303, independent conditional: 0, independent unconditional: 303, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 18, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 13, dependent conditional: 3, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 5126, independent: 4803, independent conditional: 0, independent unconditional: 4803, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 321, unknown conditional: 2, unknown unconditional: 319] , Statistics on independence cache: Total cache size (in pairs): 321, Positive cache size: 312, Positive conditional cache size: 0, Positive unconditional cache size: 312, Negative cache size: 9, Negative conditional cache size: 2, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4775, Maximal queried relation: 1, Independence queries for same thread: 1067 - CounterExampleResult [Line: 681]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L682] 0 int i, j; [L685] 0 int p, q; [L702] 0 int cur = 1, prev = 0, next = 0; [L703] 0 int x; [L713] 0 pthread_t id1, id2; VAL [\old(argc)=28658, \old(argv)={28659:28660}, argc=28658, cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L715] 0 //@ assert ((((((((i == 0) && (j == 0)) && (p == 0)) && (q == 0)) && (cur == 1)) && (prev == 0)) && (next == 0)) && (x == 0)); [L715] 0 i = 1 VAL [\old(argc)=28658, \old(argv)={28659:28660}, argc=28658, cur=1, i=1, j=0, next=0, p=0, prev=0, q=0, x=0] [L718] 0 //@ assert ((((((((i == 1) && (j == 0)) && (p == 0)) && (q == 0)) && (cur == 1)) && (prev == 0)) && (next == 0)) && (x == 0)); [L718] 0 j = 1 VAL [\old(argc)=28658, \old(argv)={28659:28660}, argc=28658, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L720] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=28658, \old(argv)={28659:28660}, argc=28658, cur=1, i=1, id1=-2, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] 1 p = 0 VAL [\old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L721] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=28658, \old(argv)={28659:28660}, arg={0:0}, argc=28658, cur=1, i=1, id1=-2, id2=-1, j=1, next=0, p=0, prev=0, q=0, x=0] [L695] 2 q = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L722] CALL, EXPR 0 fib() [L705] 0 x = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] COND TRUE 1 p < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L689] 1 //@ assert ((1 <= i) && (1 <= j)); [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=1, prev=0, q=0, x=0] [L695] COND TRUE 2 q < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=1, prev=0, q=0, x=0] [L697] 2 //@ assert ((1 <= i) && (1 <= j)); [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=0, x=0] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=1, x=0] [L705] COND TRUE 0 x < 22 [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 < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=1] [L689] 1 //@ assert ((1 <= i) && (1 <= j)); [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=1, prev=1, q=1, x=1] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=2, prev=1, q=1, x=1] [L695] COND TRUE 2 q < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=2, prev=1, q=1, x=1] [L697] 2 //@ assert ((1 <= i) && (1 <= j)); [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=1, x=1] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=2, x=1] [L705] COND TRUE 0 x < 22 [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 < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=2] [L689] 1 //@ assert ((1 <= i) && (1 <= j)); [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=2, prev=1, q=2, x=2] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=3, prev=1, q=2, x=2] [L695] COND TRUE 2 q < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=3, prev=1, q=2, x=2] [L697] 2 //@ assert ((1 <= i) && (1 <= j)); [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=2, x=2] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=3, x=2] [L705] COND TRUE 0 x < 22 [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 < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=3] [L689] 1 //@ assert ((1 <= i) && (1 <= j)); [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=3, prev=2, q=3, x=3] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=4, prev=2, q=3, x=3] [L695] COND TRUE 2 q < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=4, prev=2, q=3, x=3] [L697] 2 //@ assert ((1 <= i) && (1 <= j)); [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=3, x=3] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=4, x=3] [L705] COND TRUE 0 x < 22 [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 < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=4] [L689] 1 //@ assert ((1 <= i) && (1 <= j)); [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=4, prev=3, q=4, x=4] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=5, prev=3, q=4, x=4] [L695] COND TRUE 2 q < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=5, prev=3, q=4, x=4] [L697] 2 //@ assert ((1 <= i) && (1 <= j)); [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=4, x=4] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=5, x=4] [L705] COND TRUE 0 x < 22 [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 < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5] [L689] 1 //@ assert ((1 <= i) && (1 <= j)); [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=5, prev=5, q=5, x=5] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=6, prev=5, q=5, x=5] [L695] COND TRUE 2 q < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=6, prev=5, q=5, x=5] [L697] 2 //@ assert ((1 <= i) && (1 <= j)); [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=8, p=6, prev=5, q=5, x=5] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=8, p=6, prev=5, q=6, x=5] [L705] COND TRUE 0 x < 22 [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 < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=377, next=13, p=6, prev=8, q=6, x=6] [L689] 1 //@ assert ((1 <= i) && (1 <= j)); [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=377, next=13, p=6, prev=8, q=6, x=6] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=377, next=13, p=7, prev=8, q=6, x=6] [L695] COND TRUE 2 q < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=377, next=13, p=7, prev=8, q=6, x=6] [L697] 2 //@ assert ((1 <= i) && (1 <= j)); [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=987, next=13, p=7, prev=8, q=6, x=6] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=987, next=13, p=7, prev=8, q=7, x=6] [L705] COND TRUE 0 x < 22 [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 < 10 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 //@ assert ((1 <= i) && (1 <= j)); [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=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 < 10 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 //@ assert ((1 <= i) && (1 <= j)); [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=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 < 22 [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 < 10 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 //@ assert ((1 <= i) && (1 <= j)); [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=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 < 10 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 //@ assert ((1 <= i) && (1 <= j)); [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=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 < 22 [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 < 10 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 //@ assert ((1 <= i) && (1 <= j)); [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=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 < 10 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 //@ assert ((1 <= i) && (1 <= j)); [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=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 < 22 [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 FALSE 1 !(p < 10) [L692] 1 return ((void *)0); [L695] COND FALSE 2 !(q < 10) [L700] 2 return ((void *)0); [L705] COND TRUE 0 x < 22 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=144, i=10946, j=17711, next=144, p=10, prev=89, q=10, x=11] [L705] COND TRUE 0 x < 22 [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=10946, j=17711, next=233, p=10, prev=144, q=10, x=12] [L705] COND TRUE 0 x < 22 [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=10946, j=17711, next=377, p=10, prev=233, q=10, x=13] [L705] COND TRUE 0 x < 22 [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=10946, j=17711, next=610, p=10, prev=377, q=10, x=14] [L705] COND TRUE 0 x < 22 [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=10946, j=17711, next=987, p=10, prev=610, q=10, x=15] [L705] COND TRUE 0 x < 22 [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=10946, j=17711, next=1597, p=10, prev=987, q=10, x=16] [L705] COND TRUE 0 x < 22 [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=10946, j=17711, next=2584, p=10, prev=1597, q=10, x=17] [L705] COND TRUE 0 x < 22 [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=10946, j=17711, next=4181, p=10, prev=2584, q=10, x=18] [L705] COND TRUE 0 x < 22 [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=10946, j=17711, next=6765, p=10, prev=4181, q=10, x=19] [L705] COND TRUE 0 x < 22 [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=10946, j=17711, next=10946, p=10, prev=6765, q=10, x=20] [L705] COND TRUE 0 x < 22 [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=10946, j=17711, next=17711, p=10, prev=10946, q=10, x=21] [L705] COND TRUE 0 x < 22 [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=10946, j=17711, next=28657, p=10, prev=17711, q=10, x=22] [L705] COND FALSE 0 !(x < 22) [L710] 0 return prev; [L722] RET, EXPR 0 fib() [L722] 0 int correct = fib(); [L724] 0 //@ assert ((1 <= i) && (1 <= j)); [L724] 0 _Bool assert_cond = i < correct && j < correct; VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=28658, \old(argv)={28659:28660}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, argc=28658, assert_cond=0, correct=17711, cur=28657, i=10946, id1=-2, id2=-1, j=17711, next=28657, p=10, prev=17711, q=10, x=22] [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=28657, expression=0, i=10946, j=17711, next=28657, p=10, prev=17711, q=10, x=22] [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=28657, expression=0, i=10946, j=17711, next=28657, p=10, prev=17711, q=10, x=22] - UnprovableResult [Line: 715]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 45 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 362 SizeOfPredicates, 0 NumberOfNonLiveVariables, 146 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 4/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 45 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 1.1s, 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: 96, 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, 4.0s InterpolantComputationTime, 1238 NumberOfCodeBlocks, 1213 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1334 ConstructedInterpolants, 0 QuantifiedInterpolants, 3909 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2098 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 5588/8560 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-09-24 09:38:43,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2024-09-24 09:38:44,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-09-24 09:38:44,254 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