./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 ae007674 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-ae00767 [2021-12-28 00:58:50,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 00:58:50,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 00:58:50,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 00:58:50,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 00:58:50,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 00:58:50,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 00:58:50,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 00:58:50,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 00:58:50,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 00:58:50,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 00:58:50,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 00:58:50,256 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 00:58:50,258 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 00:58:50,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 00:58:50,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 00:58:50,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 00:58:50,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 00:58:50,267 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 00:58:50,271 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 00:58:50,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 00:58:50,273 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 00:58:50,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 00:58:50,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 00:58:50,280 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 00:58:50,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 00:58:50,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 00:58:50,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 00:58:50,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 00:58:50,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 00:58:50,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 00:58:50,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 00:58:50,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 00:58:50,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 00:58:50,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 00:58:50,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 00:58:50,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 00:58:50,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 00:58:50,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 00:58:50,289 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 00:58:50,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 00:58:50,290 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-28 00:58:50,318 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 00:58:50,318 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 00:58:50,319 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 00:58:50,319 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 00:58:50,320 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 00:58:50,320 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 00:58:50,321 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 00:58:50,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 00:58:50,321 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 00:58:50,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 00:58:50,322 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 00:58:50,323 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 00:58:50,323 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 00:58:50,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 00:58:50,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 00:58:50,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 00:58:50,323 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 00:58:50,323 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 00:58:50,324 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 00:58:50,324 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 00:58:50,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 00:58:50,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 00:58:50,324 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 00:58:50,324 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 00:58:50,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 00:58:50,325 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 00:58:50,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 00:58:50,325 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 00:58:50,325 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 00:58:50,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 00:58:50,325 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 00:58:50,326 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 00:58:50,326 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 00:58:50,326 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-28 00:58:50,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 00:58:50,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 00:58:50,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 00:58:50,620 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 00:58:50,620 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 00:58:50,621 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci05.c [2021-12-28 00:58:50,675 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/307c139d7/92b8ff1aecc74fbdad85c186672103ba/FLAGf417c197b [2021-12-28 00:58:51,043 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 00:58:51,043 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2021-12-28 00:58:51,048 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/307c139d7/92b8ff1aecc74fbdad85c186672103ba/FLAGf417c197b [2021-12-28 00:58:51,482 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/307c139d7/92b8ff1aecc74fbdad85c186672103ba [2021-12-28 00:58:51,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 00:58:51,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 00:58:51,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 00:58:51,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 00:58:51,488 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 00:58:51,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 12:58:51" (1/1) ... [2021-12-28 00:58:51,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4849e878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:51, skipping insertion in model container [2021-12-28 00:58:51,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 12:58:51" (1/1) ... [2021-12-28 00:58:51,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 00:58:51,503 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 00:58:51,593 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-28 00:58:51,595 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 00:58:51,601 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 00:58:51,609 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-28 00:58:51,610 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 00:58:51,618 INFO L208 MainTranslator]: Completed translation [2021-12-28 00:58:51,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:51 WrapperNode [2021-12-28 00:58:51,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 00:58:51,620 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 00:58:51,620 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 00:58:51,620 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 00:58:51,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:51" (1/1) ... [2021-12-28 00:58:51,638 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:51" (1/1) ... [2021-12-28 00:58:51,649 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2021-12-28 00:58:51,650 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 00:58:51,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 00:58:51,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 00:58:51,651 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 00:58:51,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:51" (1/1) ... [2021-12-28 00:58:51,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:51" (1/1) ... [2021-12-28 00:58:51,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:51" (1/1) ... [2021-12-28 00:58:51,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:51" (1/1) ... [2021-12-28 00:58:51,674 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:51" (1/1) ... [2021-12-28 00:58:51,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:51" (1/1) ... [2021-12-28 00:58:51,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:51" (1/1) ... [2021-12-28 00:58:51,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 00:58:51,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 00:58:51,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 00:58:51,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 00:58:51,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:51" (1/1) ... [2021-12-28 00:58:51,701 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 00:58:51,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 00:58:51,745 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-28 00:58:51,782 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-28 00:58:51,792 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2021-12-28 00:58:51,792 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2021-12-28 00:58:51,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 00:58:51,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 00:58:51,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 00:58:51,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 00:58:51,845 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 00:58:51,846 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 00:58:51,917 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 00:58:51,921 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 00:58:51,921 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-28 00:58:51,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 12:58:51 BoogieIcfgContainer [2021-12-28 00:58:51,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 00:58:51,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 00:58:51,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 00:58:51,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 00:58:51,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 12:58:51" (1/3) ... [2021-12-28 00:58:51,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570a297e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 12:58:51, skipping insertion in model container [2021-12-28 00:58:51,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:51" (2/3) ... [2021-12-28 00:58:51,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570a297e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 12:58:51, skipping insertion in model container [2021-12-28 00:58:51,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 12:58:51" (3/3) ... [2021-12-28 00:58:51,937 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2021-12-28 00:58:51,941 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 00:58:51,941 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-28 00:58:52,016 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 00:58:52,026 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-28 00:58:52,027 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-28 00:58:52,045 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-28 00:58:52,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-28 00:58:52,053 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:58:52,054 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 00:58:52,054 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:58:52,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:58:52,062 INFO L85 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2021-12-28 00:58:52,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:58:52,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605972228] [2021-12-28 00:58:52,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:52,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:58:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:52,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 00:58:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:52,259 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-28 00:58:52,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 00:58:52,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605972228] [2021-12-28 00:58:52,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605972228] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 00:58:52,261 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 00:58:52,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 00:58:52,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327813769] [2021-12-28 00:58:52,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 00:58:52,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 00:58:52,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 00:58:52,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 00:58:52,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 00:58:52,296 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-28 00:58:52,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 00:58:52,360 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2021-12-28 00:58:52,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 00:58:52,362 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-28 00:58:52,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 00:58:52,372 INFO L225 Difference]: With dead ends: 31 [2021-12-28 00:58:52,372 INFO L226 Difference]: Without dead ends: 18 [2021-12-28 00:58:52,375 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-28 00:58:52,378 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-28 00:58:52,379 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-28 00:58:52,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-12-28 00:58:52,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-12-28 00:58:52,408 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-28 00:58:52,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-12-28 00:58:52,411 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2021-12-28 00:58:52,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 00:58:52,411 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-28 00:58:52,412 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-28 00:58:52,412 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-12-28 00:58:52,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-28 00:58:52,413 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:58:52,413 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 00:58:52,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 00:58:52,414 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:58:52,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:58:52,416 INFO L85 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2021-12-28 00:58:52,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:58:52,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119601002] [2021-12-28 00:58:52,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:52,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:58:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:52,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 00:58:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:52,483 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-28 00:58:52,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 00:58:52,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119601002] [2021-12-28 00:58:52,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119601002] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 00:58:52,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 00:58:52,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 00:58:52,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182295152] [2021-12-28 00:58:52,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 00:58:52,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 00:58:52,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 00:58:52,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 00:58:52,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 00:58:52,487 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-28 00:58:52,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 00:58:52,529 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-12-28 00:58:52,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 00:58:52,530 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-28 00:58:52,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 00:58:52,530 INFO L225 Difference]: With dead ends: 24 [2021-12-28 00:58:52,532 INFO L226 Difference]: Without dead ends: 20 [2021-12-28 00:58:52,532 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-28 00:58:52,533 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-28 00:58:52,545 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-28 00:58:52,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-28 00:58:52,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-12-28 00:58:52,553 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-28 00:58:52,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-12-28 00:58:52,554 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2021-12-28 00:58:52,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 00:58:52,555 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-28 00:58:52,555 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-28 00:58:52,555 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-12-28 00:58:52,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-28 00:58:52,556 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:58:52,556 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-28 00:58:52,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 00:58:52,556 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:58:52,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:58:52,557 INFO L85 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2021-12-28 00:58:52,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:58:52,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766565789] [2021-12-28 00:58:52,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:52,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:58:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:52,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 00:58:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:52,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:52,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 00:58:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:52,630 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-28 00:58:52,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 00:58:52,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766565789] [2021-12-28 00:58:52,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766565789] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 00:58:52,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139040262] [2021-12-28 00:58:52,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:52,632 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:58:52,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 00:58:52,633 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-28 00:58:52,634 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-28 00:58:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:52,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 00:58:52,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 00:58:52,814 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-28 00:58:52,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 00:58:52,981 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-28 00:58:52,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139040262] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 00:58:52,982 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 00:58:52,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2021-12-28 00:58:52,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005475318] [2021-12-28 00:58:52,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 00:58:52,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 00:58:52,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 00:58:52,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 00:58:52,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-12-28 00:58:52,984 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-28 00:58:53,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 00:58:53,170 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2021-12-28 00:58:53,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 00:58:53,170 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-28 00:58:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 00:58:53,171 INFO L225 Difference]: With dead ends: 46 [2021-12-28 00:58:53,172 INFO L226 Difference]: Without dead ends: 29 [2021-12-28 00:58:53,172 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-28 00:58:53,173 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-28 00:58:53,174 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-28 00:58:53,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-28 00:58:53,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-28 00:58:53,179 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-28 00:58:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2021-12-28 00:58:53,180 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 23 [2021-12-28 00:58:53,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 00:58:53,180 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2021-12-28 00:58:53,181 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-28 00:58:53,182 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2021-12-28 00:58:53,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-28 00:58:53,184 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:58:53,184 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-28 00:58:53,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-28 00:58:53,398 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-28 00:58:53,399 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:58:53,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:58:53,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1937134450, now seen corresponding path program 1 times [2021-12-28 00:58:53,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:58:53,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173037185] [2021-12-28 00:58:53,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:53,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:58:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 00:58:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:58:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 00:58:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:58:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:58:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,606 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-28 00:58:53,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 00:58:53,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173037185] [2021-12-28 00:58:53,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173037185] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 00:58:53,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818408931] [2021-12-28 00:58:53,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:53,607 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:58:53,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 00:58:53,636 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-28 00:58:53,639 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-28 00:58:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-28 00:58:53,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 00:58:53,861 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-28 00:58:53,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 00:58:54,166 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-28 00:58:54,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818408931] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 00:58:54,166 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 00:58:54,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2021-12-28 00:58:54,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661886116] [2021-12-28 00:58:54,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 00:58:54,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-28 00:58:54,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 00:58:54,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-28 00:58:54,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2021-12-28 00:58:54,168 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-28 00:58:54,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 00:58:54,322 INFO L93 Difference]: Finished difference Result 73 states and 123 transitions. [2021-12-28 00:58:54,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 00:58:54,322 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-28 00:58:54,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 00:58:54,324 INFO L225 Difference]: With dead ends: 73 [2021-12-28 00:58:54,324 INFO L226 Difference]: Without dead ends: 44 [2021-12-28 00:58:54,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2021-12-28 00:58:54,325 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 00:58:54,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 94 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 00:58:54,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-28 00:58:54,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-12-28 00:58:54,333 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-28 00:58:54,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 66 transitions. [2021-12-28 00:58:54,338 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 66 transitions. Word has length 65 [2021-12-28 00:58:54,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 00:58:54,341 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 66 transitions. [2021-12-28 00:58:54,342 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-28 00:58:54,342 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 66 transitions. [2021-12-28 00:58:54,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-12-28 00:58:54,345 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:58:54,346 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-28 00:58:54,378 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-28 00:58:54,577 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-28 00:58:54,578 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:58:54,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:58:54,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1389805118, now seen corresponding path program 2 times [2021-12-28 00:58:54,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:58:54,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118535697] [2021-12-28 00:58:54,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:54,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:58:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 00:58:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:58:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 00:58:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 00:58:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:58:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-28 00:58:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:58:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 00:58:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 00:58:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:58:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 00:58:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 00:58:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:58:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,886 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-28 00:58:54,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 00:58:54,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118535697] [2021-12-28 00:58:54,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118535697] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 00:58:54,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70887391] [2021-12-28 00:58:54,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 00:58:54,887 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:58:54,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 00:58:54,888 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-28 00:58:54,949 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-28 00:58:54,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-28 00:58:54,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 00:58:54,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-28 00:58:54,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 00:58:55,246 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-28 00:58:55,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 00:58:55,934 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-28 00:58:55,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70887391] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 00:58:55,934 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 00:58:55,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 23 [2021-12-28 00:58:55,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472622927] [2021-12-28 00:58:55,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 00:58:55,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-28 00:58:55,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 00:58:55,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-28 00:58:55,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2021-12-28 00:58:55,936 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-28 00:58:56,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 00:58:56,220 INFO L93 Difference]: Finished difference Result 119 states and 223 transitions. [2021-12-28 00:58:56,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-28 00:58:56,220 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-28 00:58:56,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 00:58:56,222 INFO L225 Difference]: With dead ends: 119 [2021-12-28 00:58:56,222 INFO L226 Difference]: Without dead ends: 76 [2021-12-28 00:58:56,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=515, Invalid=1291, Unknown=0, NotChecked=0, Total=1806 [2021-12-28 00:58:56,224 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 148 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 00:58:56,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 109 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 00:58:56,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-28 00:58:56,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2021-12-28 00:58:56,231 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-28 00:58:56,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 105 transitions. [2021-12-28 00:58:56,232 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 105 transitions. Word has length 171 [2021-12-28 00:58:56,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 00:58:56,233 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 105 transitions. [2021-12-28 00:58:56,233 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-28 00:58:56,233 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 105 transitions. [2021-12-28 00:58:56,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2021-12-28 00:58:56,239 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:58:56,239 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-28 00:58:56,259 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-28 00:58:56,440 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-28 00:58:56,440 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:58:56,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:58:56,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1020156483, now seen corresponding path program 3 times [2021-12-28 00:58:56,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:58:56,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050110603] [2021-12-28 00:58:56,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:56,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:58:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 00:58:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:58:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 00:58:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 00:58:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:58:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 00:58:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:58:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 00:58:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-28 00:58:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:58:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 00:58:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 00:58:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:58:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-28 00:58:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:56,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:57,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:57,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:57,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:58:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:57,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 00:58:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:57,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 00:58:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:57,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:57,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:58:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:57,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 00:58:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:57,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:57,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:57,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:58:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:57,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 00:58:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:57,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-28 00:58:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:57,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:57,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:57,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:57,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:58:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:57,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 00:58:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:57,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 00:58:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:57,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:57,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:58:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:57,099 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-28 00:58:57,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 00:58:57,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050110603] [2021-12-28 00:58:57,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050110603] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 00:58:57,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617994911] [2021-12-28 00:58:57,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-28 00:58:57,100 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:58:57,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 00:58:57,116 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-28 00:58:57,152 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-28 00:58:57,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2021-12-28 00:58:57,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 00:58:57,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-28 00:58:57,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 00:58:57,839 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-28 00:58:57,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 00:58:59,636 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-28 00:58:59,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617994911] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 00:58:59,636 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 00:58:59,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11, 17] total 33 [2021-12-28 00:58:59,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100163334] [2021-12-28 00:58:59,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 00:58:59,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-28 00:58:59,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 00:58:59,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-28 00:58:59,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2021-12-28 00:58:59,641 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-28 00:59:00,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 00:59:00,011 INFO L93 Difference]: Finished difference Result 172 states and 339 transitions. [2021-12-28 00:59:00,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-28 00:59:00,012 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-28 00:59:00,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 00:59:00,018 INFO L225 Difference]: With dead ends: 172 [2021-12-28 00:59:00,018 INFO L226 Difference]: Without dead ends: 109 [2021-12-28 00:59:00,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 794 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=654, Invalid=1896, Unknown=0, NotChecked=0, Total=2550 [2021-12-28 00:59:00,022 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 187 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 00:59:00,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 172 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 00:59:00,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-28 00:59:00,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2021-12-28 00:59:00,058 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-28 00:59:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2021-12-28 00:59:00,060 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 126 transitions. Word has length 351 [2021-12-28 00:59:00,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 00:59:00,061 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 126 transitions. [2021-12-28 00:59:00,061 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-28 00:59:00,061 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2021-12-28 00:59:00,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2021-12-28 00:59:00,069 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:59:00,070 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-28 00:59:00,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-28 00:59:00,283 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-28 00:59:00,283 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:59:00,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:59:00,284 INFO L85 PathProgramCache]: Analyzing trace with hash -4939658, now seen corresponding path program 4 times [2021-12-28 00:59:00,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:59:00,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172735917] [2021-12-28 00:59:00,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:59:00,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:59:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 00:59:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:59:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 00:59:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 00:59:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:59:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 00:59:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:59:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 00:59:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-28 00:59:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:59:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 00:59:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 00:59:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:59:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-28 00:59:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:59:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 00:59:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 00:59:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:59:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 00:59:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:59:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 00:59:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-28 00:59:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:00,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:59:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 00:59:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 00:59:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:59:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 00:59:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:59:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 00:59:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-28 00:59:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:59:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 00:59:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 00:59:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:59:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-28 00:59:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:59:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 00:59:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 00:59:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:59:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:01,217 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-28 00:59:01,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 00:59:01,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172735917] [2021-12-28 00:59:01,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172735917] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 00:59:01,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116018801] [2021-12-28 00:59:01,218 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-28 00:59:01,218 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:59:01,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 00:59:01,244 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-28 00:59:01,263 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-28 00:59:01,400 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-28 00:59:01,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 00:59:01,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-28 00:59:01,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 00:59:02,089 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-28 00:59:02,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 00:59:05,508 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-28 00:59:05,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116018801] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 00:59:05,508 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 00:59:05,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19, 31] total 45 [2021-12-28 00:59:05,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100737650] [2021-12-28 00:59:05,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 00:59:05,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-28 00:59:05,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 00:59:05,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-28 00:59:05,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1527, Unknown=0, NotChecked=0, Total=1980 [2021-12-28 00:59:05,511 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-28 00:59:05,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 00:59:05,961 INFO L93 Difference]: Finished difference Result 217 states and 398 transitions. [2021-12-28 00:59:05,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-12-28 00:59:05,962 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-28 00:59:05,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 00:59:05,981 INFO L225 Difference]: With dead ends: 217 [2021-12-28 00:59:05,981 INFO L226 Difference]: Without dead ends: 129 [2021-12-28 00:59:05,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1269 GetRequests, 1197 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1241, Invalid=3871, Unknown=0, NotChecked=0, Total=5112 [2021-12-28 00:59:05,983 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 244 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 502 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 502 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 00:59:05,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 268 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [502 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 00:59:05,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-28 00:59:05,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 109. [2021-12-28 00:59:05,996 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-28 00:59:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 153 transitions. [2021-12-28 00:59:05,998 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 153 transitions. Word has length 528 [2021-12-28 00:59:06,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 00:59:06,013 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 153 transitions. [2021-12-28 00:59:06,014 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-28 00:59:06,014 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 153 transitions. [2021-12-28 00:59:06,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2021-12-28 00:59:06,018 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:59:06,018 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-28 00:59:06,055 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-28 00:59:06,235 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-28 00:59:06,236 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:59:06,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:59:06,237 INFO L85 PathProgramCache]: Analyzing trace with hash 670316307, now seen corresponding path program 5 times [2021-12-28 00:59:06,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:59:06,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743859295] [2021-12-28 00:59:06,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:59:06,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:59:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 00:59:06,273 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 00:59:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 00:59:06,339 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 00:59:06,340 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-28 00:59:06,340 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-28 00:59:06,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 00:59:06,344 INFO L732 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2021-12-28 00:59:06,346 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 00:59:06,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 12:59:06 BoogieIcfgContainer [2021-12-28 00:59:06,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 00:59:06,423 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 00:59:06,423 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 00:59:06,423 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 00:59:06,424 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 12:58:51" (3/4) ... [2021-12-28 00:59:06,425 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-28 00:59:06,470 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 00:59:06,470 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 00:59:06,471 INFO L158 Benchmark]: Toolchain (without parser) took 14986.41ms. Allocated memory was 50.3MB in the beginning and 205.5MB in the end (delta: 155.2MB). Free memory was 28.3MB in the beginning and 99.4MB in the end (delta: -71.1MB). Peak memory consumption was 83.2MB. Max. memory is 16.1GB. [2021-12-28 00:59:06,471 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 50.3MB. Free memory was 31.9MB in the beginning and 31.8MB in the end (delta: 33.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 00:59:06,471 INFO L158 Benchmark]: CACSL2BoogieTranslator took 133.67ms. Allocated memory is still 50.3MB. Free memory was 28.1MB in the beginning and 29.9MB in the end (delta: -1.8MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2021-12-28 00:59:06,471 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.26ms. Allocated memory is still 50.3MB. Free memory was 29.9MB in the beginning and 28.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 00:59:06,472 INFO L158 Benchmark]: Boogie Preprocessor took 30.20ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 28.5MB in the beginning and 45.2MB in the end (delta: -16.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 00:59:06,472 INFO L158 Benchmark]: RCFGBuilder took 241.46ms. Allocated memory is still 60.8MB. Free memory was 45.2MB in the beginning and 36.7MB in the end (delta: 8.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-28 00:59:06,472 INFO L158 Benchmark]: TraceAbstraction took 14498.58ms. Allocated memory was 60.8MB in the beginning and 205.5MB in the end (delta: 144.7MB). Free memory was 36.1MB in the beginning and 109.9MB in the end (delta: -73.8MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. [2021-12-28 00:59:06,472 INFO L158 Benchmark]: Witness Printer took 47.43ms. Allocated memory is still 205.5MB. Free memory was 109.9MB in the beginning and 99.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-28 00:59:06,473 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.17ms. Allocated memory is still 50.3MB. Free memory was 31.9MB in the beginning and 31.8MB in the end (delta: 33.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 133.67ms. Allocated memory is still 50.3MB. Free memory was 28.1MB in the beginning and 29.9MB in the end (delta: -1.8MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.26ms. Allocated memory is still 50.3MB. Free memory was 29.9MB in the beginning and 28.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.20ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 28.5MB in the beginning and 45.2MB in the end (delta: -16.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 241.46ms. Allocated memory is still 60.8MB. Free memory was 45.2MB in the beginning and 36.7MB in the end (delta: 8.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 14498.58ms. Allocated memory was 60.8MB in the beginning and 205.5MB in the end (delta: 144.7MB). Free memory was 36.1MB in the beginning and 109.9MB in the end (delta: -73.8MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. * Witness Printer took 47.43ms. Allocated memory is still 205.5MB. Free memory was 109.9MB in the beginning and 99.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: 14.3s, OverallIterations: 8, TraceHistogramMax: 77, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 700 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 683 mSDsluCounter, 782 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 641 mSDsCounter, 1155 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1781 IncrementalHoareTripleChecker+Invalid, 2936 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1155 mSolverCounterUnsat, 141 mSDtfsCounter, 1781 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.3s 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.4s SatisfiabilityAnalysisTime, 10.3s 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-28 00:59:06,505 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