./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 Calling Ultimate with: /usr/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/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Fibonacci05.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 13:17:37,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 13:17:37,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 13:17:37,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 13:17:37,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 13:17:37,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 13:17:37,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 13:17:37,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 13:17:37,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 13:17:37,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 13:17:37,846 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 13:17:37,847 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 13:17:37,848 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 13:17:37,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 13:17:37,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 13:17:37,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 13:17:37,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 13:17:37,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 13:17:37,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 13:17:37,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 13:17:37,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 13:17:37,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 13:17:37,867 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 13:17:37,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 13:17:37,874 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 13:17:37,875 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 13:17:37,875 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 13:17:37,876 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 13:17:37,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 13:17:37,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 13:17:37,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 13:17:37,879 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 13:17:37,880 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 13:17:37,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 13:17:37,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 13:17:37,883 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 13:17:37,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 13:17:37,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 13:17:37,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 13:17:37,885 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 13:17:37,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 13:17:37,887 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 13:17:37,919 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 13:17:37,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 13:17:37,920 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 13:17:37,920 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 13:17:37,921 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 13:17:37,921 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 13:17:37,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 13:17:37,922 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 13:17:37,922 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 13:17:37,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 13:17:37,923 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 13:17:37,924 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 13:17:37,924 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 13:17:37,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 13:17:37,924 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 13:17:37,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 13:17:37,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 13:17:37,925 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 13:17:37,925 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 13:17:37,925 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 13:17:37,925 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 13:17:37,926 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 13:17:37,926 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 13:17:37,926 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 13:17:37,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 13:17:37,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 13:17:37,927 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 13:17:37,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 13:17:37,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 13:17:37,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 13:17:37,928 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 13:17:37,928 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 13:17:37,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 13:17:37,929 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 13:17:37,929 INFO L138 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/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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd [2021-12-21 13:17:38,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 13:17:38,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 13:17:38,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 13:17:38,205 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 13:17:38,205 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 13:17:38,206 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci05.c [2021-12-21 13:17:38,277 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66478599a/026470d2634b4f2da74ae48ad03b5f40/FLAGbc74e8380 [2021-12-21 13:17:38,652 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 13:17:38,652 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2021-12-21 13:17:38,657 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66478599a/026470d2634b4f2da74ae48ad03b5f40/FLAGbc74e8380 [2021-12-21 13:17:39,070 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66478599a/026470d2634b4f2da74ae48ad03b5f40 [2021-12-21 13:17:39,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 13:17:39,073 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 13:17:39,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 13:17:39,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 13:17:39,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 13:17:39,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:17:39" (1/1) ... [2021-12-21 13:17:39,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c2d49bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:17:39, skipping insertion in model container [2021-12-21 13:17:39,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:17:39" (1/1) ... [2021-12-21 13:17:39,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 13:17:39,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 13:17:39,239 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2021-12-21 13:17:39,242 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 13:17:39,249 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 13:17:39,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2021-12-21 13:17:39,262 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 13:17:39,272 INFO L208 MainTranslator]: Completed translation [2021-12-21 13:17:39,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:17:39 WrapperNode [2021-12-21 13:17:39,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 13:17:39,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 13:17:39,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 13:17:39,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 13:17:39,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:17:39" (1/1) ... [2021-12-21 13:17:39,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:17:39" (1/1) ... [2021-12-21 13:17:39,297 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2021-12-21 13:17:39,297 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 13:17:39,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 13:17:39,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 13:17:39,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 13:17:39,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:17:39" (1/1) ... [2021-12-21 13:17:39,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:17:39" (1/1) ... [2021-12-21 13:17:39,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:17:39" (1/1) ... [2021-12-21 13:17:39,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:17:39" (1/1) ... [2021-12-21 13:17:39,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:17:39" (1/1) ... [2021-12-21 13:17:39,323 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:17:39" (1/1) ... [2021-12-21 13:17:39,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:17:39" (1/1) ... [2021-12-21 13:17:39,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 13:17:39,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 13:17:39,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 13:17:39,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 13:17:39,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:17:39" (1/1) ... [2021-12-21 13:17:39,335 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 13:17:39,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:17:39,357 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-21 13:17:39,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-21 13:17:39,381 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2021-12-21 13:17:39,382 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2021-12-21 13:17:39,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 13:17:39,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 13:17:39,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 13:17:39,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 13:17:39,424 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 13:17:39,425 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 13:17:39,562 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 13:17:39,572 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 13:17:39,574 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-21 13:17:39,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:17:39 BoogieIcfgContainer [2021-12-21 13:17:39,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 13:17:39,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 13:17:39,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 13:17:39,582 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 13:17:39,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 01:17:39" (1/3) ... [2021-12-21 13:17:39,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac764d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:17:39, skipping insertion in model container [2021-12-21 13:17:39,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:17:39" (2/3) ... [2021-12-21 13:17:39,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac764d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:17:39, skipping insertion in model container [2021-12-21 13:17:39,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:17:39" (3/3) ... [2021-12-21 13:17:39,585 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2021-12-21 13:17:39,590 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 13:17:39,590 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 13:17:39,637 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 13:17:39,645 INFO L339 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 13:17:39,646 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 13:17:39,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 13:17:39,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-21 13:17:39,668 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:17:39,669 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:17:39,670 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:17:39,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:17:39,675 INFO L85 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2021-12-21 13:17:39,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:17:39,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245083632] [2021-12-21 13:17:39,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:17:39,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:17:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:39,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:17:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 13:17:39,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:17:39,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245083632] [2021-12-21 13:17:39,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245083632] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 13:17:39,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 13:17:39,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 13:17:39,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400347139] [2021-12-21 13:17:39,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 13:17:39,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 13:17:39,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:17:39,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 13:17:39,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 13:17:39,904 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 13:17:39,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:17:39,966 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2021-12-21 13:17:39,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 13:17:39,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-12-21 13:17:39,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:17:39,976 INFO L225 Difference]: With dead ends: 31 [2021-12-21 13:17:39,976 INFO L226 Difference]: Without dead ends: 18 [2021-12-21 13:17:39,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 13:17:39,986 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 13:17:39,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 41 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 13:17:40,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-12-21 13:17:40,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-12-21 13:17:40,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-21 13:17:40,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-12-21 13:17:40,025 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2021-12-21 13:17:40,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:17:40,026 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-21 13:17:40,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 13:17:40,026 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-12-21 13:17:40,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-21 13:17:40,028 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:17:40,028 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:17:40,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 13:17:40,030 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:17:40,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:17:40,033 INFO L85 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2021-12-21 13:17:40,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:17:40,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270030021] [2021-12-21 13:17:40,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:17:40,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:17:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:40,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:17:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:40,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 13:17:40,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:17:40,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270030021] [2021-12-21 13:17:40,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270030021] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 13:17:40,157 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 13:17:40,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 13:17:40,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241267901] [2021-12-21 13:17:40,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 13:17:40,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 13:17:40,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:17:40,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 13:17:40,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 13:17:40,161 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 13:17:40,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:17:40,221 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-12-21 13:17:40,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 13:17:40,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-12-21 13:17:40,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:17:40,224 INFO L225 Difference]: With dead ends: 24 [2021-12-21 13:17:40,224 INFO L226 Difference]: Without dead ends: 20 [2021-12-21 13:17:40,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 13:17:40,226 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 13:17:40,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 33 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 13:17:40,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-21 13:17:40,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-12-21 13:17:40,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-21 13:17:40,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-12-21 13:17:40,232 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2021-12-21 13:17:40,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:17:40,232 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-21 13:17:40,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 13:17:40,233 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-12-21 13:17:40,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-21 13:17:40,234 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:17:40,235 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:17:40,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 13:17:40,235 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:17:40,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:17:40,244 INFO L85 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2021-12-21 13:17:40,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:17:40,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002899667] [2021-12-21 13:17:40,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:17:40,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:17:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:40,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:17:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:40,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:40,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 13:17:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 13:17:40,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:17:40,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002899667] [2021-12-21 13:17:40,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002899667] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:17:40,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952917888] [2021-12-21 13:17:40,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:17:40,333 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:17:40,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:17:40,340 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) [2021-12-21 13:17:40,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 13:17:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:40,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 13:17:40,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:17:40,548 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 13:17:40,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:17:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 13:17:40,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952917888] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:17:40,742 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:17:40,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2021-12-21 13:17:40,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073602874] [2021-12-21 13:17:40,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:17:40,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 13:17:40,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:17:40,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 13:17:40,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-12-21 13:17:40,745 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2021-12-21 13:17:40,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:17:40,907 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2021-12-21 13:17:40,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 13:17:40,908 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 23 [2021-12-21 13:17:40,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:17:40,909 INFO L225 Difference]: With dead ends: 46 [2021-12-21 13:17:40,910 INFO L226 Difference]: Without dead ends: 29 [2021-12-21 13:17:40,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2021-12-21 13:17:40,912 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 13:17:40,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 65 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 13:17:40,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-21 13:17:40,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-21 13:17:40,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2021-12-21 13:17:40,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2021-12-21 13:17:40,920 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 23 [2021-12-21 13:17:40,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:17:40,920 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2021-12-21 13:17:40,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2021-12-21 13:17:40,921 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2021-12-21 13:17:40,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-21 13:17:40,923 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:17:40,923 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:17:40,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-21 13:17:41,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:17:41,139 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:17:41,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:17:41,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1937134450, now seen corresponding path program 1 times [2021-12-21 13:17:41,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:17:41,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277369211] [2021-12-21 13:17:41,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:17:41,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:17:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:41,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:17:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:41,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:41,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:41,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:41,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:17:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:41,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:41,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:41,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:41,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:41,478 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-21 13:17:41,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:17:41,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277369211] [2021-12-21 13:17:41,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277369211] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:17:41,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868541042] [2021-12-21 13:17:41,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:17:41,479 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:17:41,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:17:41,480 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:17:41,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 13:17:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:41,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 13:17:41,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:17:41,695 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2021-12-21 13:17:41,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:17:42,109 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-12-21 13:17:42,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868541042] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:17:42,110 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:17:42,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2021-12-21 13:17:42,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995969711] [2021-12-21 13:17:42,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:17:42,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-21 13:17:42,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:17:42,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-21 13:17:42,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2021-12-21 13:17:42,113 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2021-12-21 13:17:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:17:42,331 INFO L93 Difference]: Finished difference Result 73 states and 123 transitions. [2021-12-21 13:17:42,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 13:17:42,332 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 65 [2021-12-21 13:17:42,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:17:42,334 INFO L225 Difference]: With dead ends: 73 [2021-12-21 13:17:42,334 INFO L226 Difference]: Without dead ends: 44 [2021-12-21 13:17:42,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2021-12-21 13:17:42,336 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 13:17:42,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 94 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 13:17:42,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-21 13:17:42,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-12-21 13:17:42,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (24), 9 states have call predecessors, (24), 7 states have call successors, (24) [2021-12-21 13:17:42,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 66 transitions. [2021-12-21 13:17:42,345 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 66 transitions. Word has length 65 [2021-12-21 13:17:42,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:17:42,345 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 66 transitions. [2021-12-21 13:17:42,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2021-12-21 13:17:42,346 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 66 transitions. [2021-12-21 13:17:42,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-12-21 13:17:42,350 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:17:42,351 INFO L514 BasicCegarLoop]: trace histogram [25, 25, 17, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:17:42,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-21 13:17:42,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-21 13:17:42,575 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:17:42,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:17:42,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1389805118, now seen corresponding path program 2 times [2021-12-21 13:17:42,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:17:42,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051395] [2021-12-21 13:17:42,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:17:42,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:17:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:17:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:17:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 13:17:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-21 13:17:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:17:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 13:17:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:17:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 13:17:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:42,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 253 proven. 368 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2021-12-21 13:17:42,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:17:42,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051395] [2021-12-21 13:17:42,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051395] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:17:42,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546680046] [2021-12-21 13:17:42,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 13:17:42,945 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:17:42,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:17:42,946 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:17:42,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-21 13:17:43,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 13:17:43,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 13:17:43,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-21 13:17:43,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:17:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 459 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2021-12-21 13:17:43,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:17:44,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 485 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2021-12-21 13:17:44,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546680046] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:17:44,450 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:17:44,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 23 [2021-12-21 13:17:44,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625053487] [2021-12-21 13:17:44,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:17:44,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-21 13:17:44,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:17:44,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-21 13:17:44,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2021-12-21 13:17:44,452 INFO L87 Difference]: Start difference. First operand 44 states and 66 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2021-12-21 13:17:45,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:17:45,003 INFO L93 Difference]: Finished difference Result 119 states and 223 transitions. [2021-12-21 13:17:45,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-21 13:17:45,004 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) Word has length 171 [2021-12-21 13:17:45,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:17:45,006 INFO L225 Difference]: With dead ends: 119 [2021-12-21 13:17:45,007 INFO L226 Difference]: Without dead ends: 76 [2021-12-21 13:17:45,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=515, Invalid=1291, Unknown=0, NotChecked=0, Total=1806 [2021-12-21 13:17:45,013 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 148 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 13:17:45,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 109 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 13:17:45,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-21 13:17:45,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2021-12-21 13:17:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 12 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (37), 13 states have call predecessors, (37), 12 states have call successors, (37) [2021-12-21 13:17:45,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 105 transitions. [2021-12-21 13:17:45,037 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 105 transitions. Word has length 171 [2021-12-21 13:17:45,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:17:45,039 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 105 transitions. [2021-12-21 13:17:45,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2021-12-21 13:17:45,039 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 105 transitions. [2021-12-21 13:17:45,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2021-12-21 13:17:45,055 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:17:45,056 INFO L514 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:17:45,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-21 13:17:45,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:17:45,263 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:17:45,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:17:45,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1020156483, now seen corresponding path program 3 times [2021-12-21 13:17:45,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:17:45,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560300861] [2021-12-21 13:17:45,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:17:45,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:17:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:17:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:17:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:17:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:17:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:17:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 13:17:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:17:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:17:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-21 13:17:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:17:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:45,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:17:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:46,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:46,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:46,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:17:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:46,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:46,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:46,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:46,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:17:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:46,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 13:17:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:46,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:46,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:46,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:46,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:46,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:17:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:46,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:17:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:46,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:46,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:46,087 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 844 proven. 1612 refuted. 0 times theorem prover too weak. 4664 trivial. 0 not checked. [2021-12-21 13:17:46,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:17:46,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560300861] [2021-12-21 13:17:46,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560300861] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:17:46,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300668516] [2021-12-21 13:17:46,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 13:17:46,088 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:17:46,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:17:46,089 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:17:46,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-21 13:17:46,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2021-12-21 13:17:46,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 13:17:46,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-21 13:17:46,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:17:46,769 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1491 refuted. 0 times theorem prover too weak. 5415 trivial. 0 not checked. [2021-12-21 13:17:46,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:17:48,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1548 refuted. 0 times theorem prover too weak. 5358 trivial. 0 not checked. [2021-12-21 13:17:48,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300668516] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:17:48,876 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:17:48,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11, 17] total 33 [2021-12-21 13:17:48,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723187053] [2021-12-21 13:17:48,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:17:48,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-21 13:17:48,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:17:48,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-21 13:17:48,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2021-12-21 13:17:48,880 INFO L87 Difference]: Start difference. First operand 66 states and 105 transitions. Second operand has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) [2021-12-21 13:17:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:17:49,381 INFO L93 Difference]: Finished difference Result 172 states and 339 transitions. [2021-12-21 13:17:49,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-21 13:17:49,382 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) Word has length 351 [2021-12-21 13:17:49,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:17:49,385 INFO L225 Difference]: With dead ends: 172 [2021-12-21 13:17:49,385 INFO L226 Difference]: Without dead ends: 109 [2021-12-21 13:17:49,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 794 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=654, Invalid=1896, Unknown=0, NotChecked=0, Total=2550 [2021-12-21 13:17:49,391 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 187 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 13:17:49,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 172 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 13:17:49,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-21 13:17:49,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2021-12-21 13:17:49,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.109375) internal successors, (71), 62 states have internal predecessors, (71), 17 states have call successors, (17), 12 states have call predecessors, (17), 9 states have return successors, (38), 16 states have call predecessors, (38), 17 states have call successors, (38) [2021-12-21 13:17:49,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2021-12-21 13:17:49,404 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 126 transitions. Word has length 351 [2021-12-21 13:17:49,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:17:49,405 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 126 transitions. [2021-12-21 13:17:49,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) [2021-12-21 13:17:49,406 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2021-12-21 13:17:49,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2021-12-21 13:17:49,413 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:17:49,413 INFO L514 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:17:49,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-21 13:17:49,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:17:49,636 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:17:49,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:17:49,636 INFO L85 PathProgramCache]: Analyzing trace with hash -4939658, now seen corresponding path program 4 times [2021-12-21 13:17:49,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:17:49,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910417879] [2021-12-21 13:17:49,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:17:49,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:17:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:49,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:17:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:17:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:17:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:17:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:50,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:17:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 13:17:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:17:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:17:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-21 13:17:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:17:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:17:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:17:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:17:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-21 13:17:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:17:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:17:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:17:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:17:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 13:17:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:17:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:17:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-21 13:17:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:17:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:17:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:17:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:17:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:17:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2818 proven. 2810 refuted. 0 times theorem prover too weak. 10779 trivial. 0 not checked. [2021-12-21 13:17:50,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:17:50,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910417879] [2021-12-21 13:17:50,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910417879] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:17:50,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900163942] [2021-12-21 13:17:50,827 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-21 13:17:50,828 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:17:50,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:17:50,829 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:17:50,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-21 13:17:51,003 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-21 13:17:51,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 13:17:51,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-21 13:17:51,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:17:51,795 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1939 proven. 3346 refuted. 0 times theorem prover too weak. 11122 trivial. 0 not checked. [2021-12-21 13:17:51,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:17:56,004 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1939 proven. 3454 refuted. 0 times theorem prover too weak. 11014 trivial. 0 not checked. [2021-12-21 13:17:56,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900163942] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:17:56,005 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:17:56,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19, 31] total 45 [2021-12-21 13:17:56,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990859500] [2021-12-21 13:17:56,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:17:56,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-21 13:17:56,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:17:56,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-21 13:17:56,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1527, Unknown=0, NotChecked=0, Total=1980 [2021-12-21 13:17:56,009 INFO L87 Difference]: Start difference. First operand 91 states and 126 transitions. Second operand has 45 states, 45 states have (on average 2.688888888888889) internal successors, (121), 45 states have internal predecessors, (121), 39 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (64), 26 states have call predecessors, (64), 39 states have call successors, (64) [2021-12-21 13:17:56,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:17:56,792 INFO L93 Difference]: Finished difference Result 217 states and 398 transitions. [2021-12-21 13:17:56,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-12-21 13:17:56,793 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.688888888888889) internal successors, (121), 45 states have internal predecessors, (121), 39 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (64), 26 states have call predecessors, (64), 39 states have call successors, (64) Word has length 528 [2021-12-21 13:17:56,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:17:56,796 INFO L225 Difference]: With dead ends: 217 [2021-12-21 13:17:56,797 INFO L226 Difference]: Without dead ends: 129 [2021-12-21 13:17:56,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1269 GetRequests, 1197 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1241, Invalid=3871, Unknown=0, NotChecked=0, Total=5112 [2021-12-21 13:17:56,800 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 244 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 502 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 502 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 13:17:56,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 268 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [502 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-21 13:17:56,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-21 13:17:56,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 109. [2021-12-21 13:17:56,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 75 states have internal predecessors, (81), 21 states have call successors, (21), 17 states have call predecessors, (21), 9 states have return successors, (51), 16 states have call predecessors, (51), 21 states have call successors, (51) [2021-12-21 13:17:56,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 153 transitions. [2021-12-21 13:17:56,816 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 153 transitions. Word has length 528 [2021-12-21 13:17:56,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:17:56,817 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 153 transitions. [2021-12-21 13:17:56,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.688888888888889) internal successors, (121), 45 states have internal predecessors, (121), 39 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (64), 26 states have call predecessors, (64), 39 states have call successors, (64) [2021-12-21 13:17:56,817 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 153 transitions. [2021-12-21 13:17:56,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2021-12-21 13:17:56,824 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:17:56,824 INFO L514 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:17:56,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-21 13:17:57,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:17:57,052 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:17:57,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:17:57,052 INFO L85 PathProgramCache]: Analyzing trace with hash 670316307, now seen corresponding path program 5 times [2021-12-21 13:17:57,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:17:57,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781868855] [2021-12-21 13:17:57,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:17:57,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:17:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 13:17:57,123 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 13:17:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 13:17:57,228 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 13:17:57,228 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 13:17:57,229 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-21 13:17:57,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 13:17:57,233 INFO L732 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2021-12-21 13:17:57,236 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 13:17:57,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 01:17:57 BoogieIcfgContainer [2021-12-21 13:17:57,359 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 13:17:57,360 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 13:17:57,360 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 13:17:57,360 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 13:17:57,361 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:17:39" (3/4) ... [2021-12-21 13:17:57,362 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-21 13:17:57,452 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 13:17:57,452 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 13:17:57,453 INFO L158 Benchmark]: Toolchain (without parser) took 18379.52ms. Allocated memory was 107.0MB in the beginning and 226.5MB in the end (delta: 119.5MB). Free memory was 75.5MB in the beginning and 81.4MB in the end (delta: -5.9MB). Peak memory consumption was 113.3MB. Max. memory is 16.1GB. [2021-12-21 13:17:57,453 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory was 54.9MB in the beginning and 54.8MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 13:17:57,453 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.29ms. Allocated memory is still 107.0MB. Free memory was 75.2MB in the beginning and 84.0MB in the end (delta: -8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 13:17:57,454 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.65ms. Allocated memory is still 107.0MB. Free memory was 84.0MB in the beginning and 83.0MB in the end (delta: 949.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 13:17:57,454 INFO L158 Benchmark]: Boogie Preprocessor took 29.23ms. Allocated memory is still 107.0MB. Free memory was 83.0MB in the beginning and 81.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 13:17:57,454 INFO L158 Benchmark]: RCFGBuilder took 248.44ms. Allocated memory is still 107.0MB. Free memory was 81.9MB in the beginning and 72.9MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 13:17:57,455 INFO L158 Benchmark]: TraceAbstraction took 17781.55ms. Allocated memory was 107.0MB in the beginning and 226.5MB in the end (delta: 119.5MB). Free memory was 72.6MB in the beginning and 91.9MB in the end (delta: -19.4MB). Peak memory consumption was 103.3MB. Max. memory is 16.1GB. [2021-12-21 13:17:57,455 INFO L158 Benchmark]: Witness Printer took 92.49ms. Allocated memory is still 226.5MB. Free memory was 91.9MB in the beginning and 81.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-21 13:17:57,457 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory was 54.9MB in the beginning and 54.8MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.29ms. Allocated memory is still 107.0MB. Free memory was 75.2MB in the beginning and 84.0MB in the end (delta: -8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.65ms. Allocated memory is still 107.0MB. Free memory was 84.0MB in the beginning and 83.0MB in the end (delta: 949.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.23ms. Allocated memory is still 107.0MB. Free memory was 83.0MB in the beginning and 81.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 248.44ms. Allocated memory is still 107.0MB. Free memory was 81.9MB in the beginning and 72.9MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17781.55ms. Allocated memory was 107.0MB in the beginning and 226.5MB in the end (delta: 119.5MB). Free memory was 72.6MB in the beginning and 91.9MB in the end (delta: -19.4MB). Peak memory consumption was 103.3MB. Max. memory is 16.1GB. * Witness Printer took 92.49ms. Allocated memory is still 226.5MB. Free memory was 91.9MB in the beginning and 81.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.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: 33]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L33] reach_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.6s, OverallIterations: 8, TraceHistogramMax: 77, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 698 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 683 mSDsluCounter, 782 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 641 mSDsCounter, 1159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1795 IncrementalHoareTripleChecker+Invalid, 2954 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1159 mSolverCounterUnsat, 141 mSDtfsCounter, 1795 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2787 GetRequests, 2573 SyntacticMatches, 5 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2730 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=7, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 50 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.7s InterpolantComputationTime, 2757 NumberOfCodeBlocks, 2580 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3418 ConstructedInterpolants, 0 QuantifiedInterpolants, 5479 SizeOfPredicates, 31 NumberOfNonLiveVariables, 2170 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 60175/75984 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! [2021-12-21 13:17:57,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE