./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/fibo_2calls_6-2.yml/witness.yml --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03fe66fa Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/fibo_2calls_6-2.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-03fe66f-m [2024-08-15 18:29:39,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-15 18:29:39,578 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-08-15 18:29:39,585 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-15 18:29:39,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-15 18:29:39,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-15 18:29:39,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-15 18:29:39,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-15 18:29:39,626 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-15 18:29:39,628 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-15 18:29:39,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-15 18:29:39,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-15 18:29:39,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-15 18:29:39,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-15 18:29:39,630 INFO L153 SettingsManager]: * Use SBE=true [2024-08-15 18:29:39,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-15 18:29:39,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-15 18:29:39,631 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-15 18:29:39,632 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-15 18:29:39,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-15 18:29:39,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-15 18:29:39,636 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-15 18:29:39,637 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-15 18:29:39,637 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-15 18:29:39,637 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-15 18:29:39,638 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-15 18:29:39,638 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-15 18:29:39,638 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-15 18:29:39,638 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-15 18:29:39,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-15 18:29:39,639 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-15 18:29:39,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-15 18:29:39,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-15 18:29:39,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-15 18:29:39,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-15 18:29:39,642 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-15 18:29:39,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-15 18:29:39,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-15 18:29:39,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-15 18:29:39,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-15 18:29:39,643 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-15 18:29:39,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-15 18:29:39,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-15 18:29:39,644 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-15 18:29:39,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-15 18:29:39,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-15 18:29:39,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-15 18:29:39,939 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-15 18:29:39,940 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-15 18:29:39,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/fibo_2calls_6-2.yml/witness.yml [2024-08-15 18:29:40,105 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-15 18:29:40,106 INFO L274 PluginConnector]: CDTParser initialized [2024-08-15 18:29:40,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2024-08-15 18:29:41,677 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-15 18:29:41,883 INFO L384 CDTParser]: Found 1 translation units. [2024-08-15 18:29:41,884 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2024-08-15 18:29:41,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c8ce1b82/96a91809b5cc4d7ab4672fc6b0841dea/FLAG8bd6ff8cb [2024-08-15 18:29:42,276 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c8ce1b82/96a91809b5cc4d7ab4672fc6b0841dea [2024-08-15 18:29:42,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-15 18:29:42,278 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-15 18:29:42,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-15 18:29:42,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-15 18:29:42,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-15 18:29:42,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:29:40" (1/2) ... [2024-08-15 18:29:42,287 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a88f40 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:29:42, skipping insertion in model container [2024-08-15 18:29:42,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:29:40" (1/2) ... [2024-08-15 18:29:42,289 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@29fc64ff and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:29:42, skipping insertion in model container [2024-08-15 18:29:42,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:29:42" (2/2) ... [2024-08-15 18:29:42,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a88f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:29:42, skipping insertion in model container [2024-08-15 18:29:42,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:29:42" (2/2) ... [2024-08-15 18:29:42,308 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-15 18:29:42,496 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c[946,959] [2024-08-15 18:29:42,503 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:29:42,520 INFO L200 MainTranslator]: Completed pre-run [2024-08-15 18:29:42,534 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c[946,959] [2024-08-15 18:29:42,535 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:29:42,552 INFO L204 MainTranslator]: Completed translation [2024-08-15 18:29:42,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:29:42 WrapperNode [2024-08-15 18:29:42,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-15 18:29:42,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-15 18:29:42,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-15 18:29:42,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-15 18:29:42,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:29:42" (1/1) ... [2024-08-15 18:29:42,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:29:42" (1/1) ... [2024-08-15 18:29:42,575 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:29:42" (1/1) ... [2024-08-15 18:29:42,589 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-08-15 18:29:42,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:29:42" (1/1) ... [2024-08-15 18:29:42,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:29:42" (1/1) ... [2024-08-15 18:29:42,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:29:42" (1/1) ... [2024-08-15 18:29:42,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:29:42" (1/1) ... [2024-08-15 18:29:42,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:29:42" (1/1) ... [2024-08-15 18:29:42,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-15 18:29:42,597 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-15 18:29:42,597 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-15 18:29:42,598 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-15 18:29:42,599 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:29:42" (1/1) ... [2024-08-15 18:29:42,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-15 18:29:42,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:29:42,639 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-15 18:29:42,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-15 18:29:42,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-15 18:29:42,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-15 18:29:42,696 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-15 18:29:42,696 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-08-15 18:29:42,696 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-08-15 18:29:42,696 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-15 18:29:42,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2024-08-15 18:29:42,697 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-15 18:29:42,698 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-15 18:29:42,698 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-15 18:29:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-15 18:29:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-08-15 18:29:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-08-15 18:29:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-15 18:29:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-15 18:29:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-15 18:29:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-15 18:29:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-15 18:29:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-15 18:29:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-15 18:29:42,799 INFO L273 CfgBuilder]: Building ICFG [2024-08-15 18:29:42,803 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-15 18:29:42,936 INFO L1266 $ProcedureCfgBuilder]: dead code at ProgramPoint L25: havoc #t~ret6;havoc #t~ret7; [2024-08-15 18:29:42,966 INFO L1266 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: havoc #t~ret4;havoc #t~ret5; [2024-08-15 18:29:43,022 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-08-15 18:29:43,023 INFO L327 CfgBuilder]: Performing block encoding [2024-08-15 18:29:43,037 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-15 18:29:43,037 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-15 18:29:43,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:29:43 BoogieIcfgContainer [2024-08-15 18:29:43,038 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-15 18:29:43,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-15 18:29:43,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-15 18:29:43,046 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-15 18:29:43,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:29:40" (1/4) ... [2024-08-15 18:29:43,046 WARN L100 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-15 18:29:43,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed2c542 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 15.08 06:29:43, skipping insertion in model container [2024-08-15 18:29:43,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.08 06:29:42" (2/4) ... [2024-08-15 18:29:43,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed2c542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.08 06:29:43, skipping insertion in model container [2024-08-15 18:29:43,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:29:42" (3/4) ... [2024-08-15 18:29:43,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed2c542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.08 06:29:43, skipping insertion in model container [2024-08-15 18:29:43,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:29:43" (4/4) ... [2024-08-15 18:29:43,053 INFO L128 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2024-08-15 18:29:43,074 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-15 18:29:43,075 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-15 18:29:43,107 INFO L90 WitnessUtils]: Constructing product of automaton with 35 states and violation witness of the following lengths: [97] [2024-08-15 18:29:43,728 INFO L95 WitnessUtils]: Product has 1780 reachable states. [2024-08-15 18:29:43,756 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-15 18:29:43,764 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@704ef631, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-15 18:29:43,765 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-15 18:29:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 8966 transitions. [2024-08-15 18:29:43,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-08-15 18:29:43,947 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:29:43,948 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 15, 14, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:29:43,949 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:29:43,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:29:43,956 INFO L85 PathProgramCache]: Analyzing trace with hash -831636693, now seen corresponding path program 1 times [2024-08-15 18:29:43,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:29:43,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668910488] [2024-08-15 18:29:43,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:29:43,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:29:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:45,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:29:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:45,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-08-15 18:29:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:45,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-15 18:29:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:45,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-15 18:29:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-15 18:29:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-15 18:29:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-15 18:29:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-15 18:29:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-15 18:29:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-15 18:29:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-15 18:29:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-15 18:29:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-08-15 18:29:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-08-15 18:29:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-15 18:29:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-15 18:29:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-08-15 18:29:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-15 18:29:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-08-15 18:29:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-08-15 18:29:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-15 18:29:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-08-15 18:29:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-08-15 18:29:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-15 18:29:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-15 18:29:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-15 18:29:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-08-15 18:29:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-08-15 18:29:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-15 18:29:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-08-15 18:29:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-08-15 18:29:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-15 18:29:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-15 18:29:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-15 18:29:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-15 18:29:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-08-15 18:29:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-15 18:29:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-15 18:29:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-08-15 18:29:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-08-15 18:29:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-08-15 18:29:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-15 18:29:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2156 backedges. 230 proven. 206 refuted. 0 times theorem prover too weak. 1720 trivial. 0 not checked. [2024-08-15 18:29:46,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:29:46,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668910488] [2024-08-15 18:29:46,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668910488] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:29:46,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201090066] [2024-08-15 18:29:46,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:29:46,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:29:46,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:29:46,607 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-15 18:29:46,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-08-15 18:29:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:29:46,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 16 conjunts are in the unsatisfiable core [2024-08-15 18:29:46,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:29:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2156 backedges. 243 proven. 421 refuted. 0 times theorem prover too weak. 1492 trivial. 0 not checked. [2024-08-15 18:29:47,159 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:29:49,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2156 backedges. 243 proven. 442 refuted. 0 times theorem prover too weak. 1471 trivial. 0 not checked. [2024-08-15 18:29:49,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201090066] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:29:49,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:29:49,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 17] total 23 [2024-08-15 18:29:49,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962171667] [2024-08-15 18:29:49,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:29:49,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-08-15 18:29:49,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:29:49,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-08-15 18:29:49,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2024-08-15 18:29:49,924 INFO L87 Difference]: Start difference. First operand 1780 states and 8966 transitions. Second operand has 23 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 23 states have internal predecessors, (82), 19 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (33), 9 states have call predecessors, (33), 19 states have call successors, (33) [2024-08-15 18:29:51,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:29:51,106 INFO L93 Difference]: Finished difference Result 3532 states and 30405 transitions. [2024-08-15 18:29:51,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-15 18:29:51,110 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 23 states have internal predecessors, (82), 19 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (33), 9 states have call predecessors, (33), 19 states have call successors, (33) Word has length 283 [2024-08-15 18:29:51,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:29:51,161 INFO L225 Difference]: With dead ends: 3532 [2024-08-15 18:29:51,162 INFO L226 Difference]: Without dead ends: 965 [2024-08-15 18:29:51,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 634 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2024-08-15 18:29:51,168 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 42 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-08-15 18:29:51,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 677 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-08-15 18:29:51,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2024-08-15 18:29:51,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 879. [2024-08-15 18:29:51,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 567 states have (on average 1.1499118165784832) internal successors, (652), 613 states have internal predecessors, (652), 148 states have call successors, (148), 80 states have call predecessors, (148), 163 states have return successors, (368), 185 states have call predecessors, (368), 147 states have call successors, (368) [2024-08-15 18:29:51,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1168 transitions. [2024-08-15 18:29:51,396 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1168 transitions. Word has length 283 [2024-08-15 18:29:51,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:29:51,397 INFO L495 AbstractCegarLoop]: Abstraction has 879 states and 1168 transitions. [2024-08-15 18:29:51,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 23 states have internal predecessors, (82), 19 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (33), 9 states have call predecessors, (33), 19 states have call successors, (33) [2024-08-15 18:29:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1168 transitions. [2024-08-15 18:29:51,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-08-15 18:29:51,408 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:29:51,409 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:29:51,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-08-15 18:29:51,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-08-15 18:29:51,615 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:29:51,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:29:51,615 INFO L85 PathProgramCache]: Analyzing trace with hash 187106458, now seen corresponding path program 2 times [2024-08-15 18:29:51,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:29:51,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153716199] [2024-08-15 18:29:51,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:29:51,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:29:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:29:51,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-15 18:29:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:29:51,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-15 18:29:51,726 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-15 18:29:51,727 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-15 18:29:51,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-15 18:29:51,732 INFO L445 BasicCegarLoop]: Path program histogram: [2] [2024-08-15 18:29:51,737 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2024-08-15 18:29:51,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.08 06:29:51 BoogieIcfgContainer [2024-08-15 18:29:51,797 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-15 18:29:51,798 INFO L158 Benchmark]: Toolchain (without parser) took 9519.78ms. Allocated memory was 146.8MB in the beginning and 297.8MB in the end (delta: 151.0MB). Free memory was 87.6MB in the beginning and 177.3MB in the end (delta: -89.7MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. [2024-08-15 18:29:51,798 INFO L158 Benchmark]: Witness Parser took 0.21ms. Allocated memory is still 146.8MB. Free memory is still 106.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:29:51,800 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 146.8MB. Free memory is still 101.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:29:51,801 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.80ms. Allocated memory is still 146.8MB. Free memory was 87.2MB in the beginning and 75.7MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-08-15 18:29:51,803 INFO L158 Benchmark]: Boogie Preprocessor took 42.16ms. Allocated memory is still 146.8MB. Free memory was 75.7MB in the beginning and 73.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-15 18:29:51,803 INFO L158 Benchmark]: IcfgBuilder took 441.22ms. Allocated memory was 146.8MB in the beginning and 188.7MB in the end (delta: 41.9MB). Free memory was 73.9MB in the beginning and 154.9MB in the end (delta: -80.9MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-08-15 18:29:51,803 INFO L158 Benchmark]: TraceAbstraction took 8756.77ms. Allocated memory was 188.7MB in the beginning and 297.8MB in the end (delta: 109.1MB). Free memory was 153.8MB in the beginning and 177.3MB in the end (delta: -23.5MB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. [2024-08-15 18:29:51,805 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.21ms. Allocated memory is still 146.8MB. Free memory is still 106.9MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.20ms. Allocated memory is still 146.8MB. Free memory is still 101.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.80ms. Allocated memory is still 146.8MB. Free memory was 87.2MB in the beginning and 75.7MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.16ms. Allocated memory is still 146.8MB. Free memory was 75.7MB in the beginning and 73.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 441.22ms. Allocated memory was 146.8MB in the beginning and 188.7MB in the end (delta: 41.9MB). Free memory was 73.9MB in the beginning and 154.9MB in the end (delta: -80.9MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8756.77ms. Allocated memory was 188.7MB in the beginning and 297.8MB in the end (delta: 109.1MB). Free memory was 153.8MB in the beginning and 177.3MB in the end (delta: -23.5MB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 6; VAL [x=6] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [x=6] [L39] int result = fibo1(x); [L40] COND TRUE result == 8 VAL [x=6] [L41] reach_error() VAL [x=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 2, TraceHistogramMax: 21, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 677 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 619 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 620 IncrementalHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 58 mSDtfsCounter, 620 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 671 GetRequests, 634 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1780occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 1 MinimizatonAttempts, 86 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 744 NumberOfCodeBlocks, 744 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 846 ConstructedInterpolants, 0 QuantifiedInterpolants, 1162 SizeOfPredicates, 7 NumberOfNonLiveVariables, 648 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 3 InterpolantComputations, 0 PerfectInterpolantSequences, 5399/6468 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-08-15 18:29:51,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (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