./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_7-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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-simple/fibo_7-2.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 40add90db9f8d501baba3978de407d6383e788a1a5fafc7225d7676b58d18c84 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 05:08:05,542 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 05:08:05,544 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 05:08:05,576 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 05:08:05,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 05:08:05,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 05:08:05,580 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 05:08:05,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 05:08:05,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 05:08:05,595 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 05:08:05,596 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 05:08:05,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 05:08:05,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 05:08:05,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 05:08:05,602 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 05:08:05,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 05:08:05,605 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 05:08:05,606 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 05:08:05,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 05:08:05,612 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 05:08:05,613 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 05:08:05,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 05:08:05,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 05:08:05,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 05:08:05,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 05:08:05,623 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 05:08:05,623 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 05:08:05,623 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 05:08:05,624 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 05:08:05,624 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 05:08:05,626 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 05:08:05,626 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 05:08:05,628 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 05:08:05,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 05:08:05,631 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 05:08:05,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 05:08:05,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 05:08:05,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 05:08:05,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 05:08:05,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 05:08:05,633 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 05:08:05,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 05:08:05,635 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 05:08:05,661 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 05:08:05,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 05:08:05,662 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 05:08:05,662 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 05:08:05,663 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 05:08:05,663 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 05:08:05,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 05:08:05,664 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 05:08:05,664 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 05:08:05,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 05:08:05,665 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 05:08:05,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 05:08:05,666 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 05:08:05,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 05:08:05,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 05:08:05,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 05:08:05,666 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 05:08:05,666 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 05:08:05,666 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 05:08:05,667 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 05:08:05,667 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 05:08:05,667 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 05:08:05,667 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 05:08:05,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 05:08:05,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 05:08:05,668 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 05:08:05,668 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 05:08:05,668 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 05:08:05,668 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 05:08:05,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 05:08:05,669 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 05:08:05,669 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 05:08:05,669 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 05:08:05,669 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 -> 40add90db9f8d501baba3978de407d6383e788a1a5fafc7225d7676b58d18c84 [2022-07-21 05:08:05,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 05:08:05,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 05:08:05,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 05:08:05,970 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 05:08:05,971 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 05:08:05,972 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_7-2.c [2022-07-21 05:08:06,025 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be254711b/31f0217f2ce840cb91e421e25c3ed194/FLAG50c68d46e [2022-07-21 05:08:06,366 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 05:08:06,366 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2022-07-21 05:08:06,370 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be254711b/31f0217f2ce840cb91e421e25c3ed194/FLAG50c68d46e [2022-07-21 05:08:06,378 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be254711b/31f0217f2ce840cb91e421e25c3ed194 [2022-07-21 05:08:06,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 05:08:06,381 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 05:08:06,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 05:08:06,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 05:08:06,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 05:08:06,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:08:06" (1/1) ... [2022-07-21 05:08:06,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a492b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:06, skipping insertion in model container [2022-07-21 05:08:06,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:08:06" (1/1) ... [2022-07-21 05:08:06,391 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 05:08:06,405 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 05:08:06,521 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-simple/fibo_7-2.c[741,754] [2022-07-21 05:08:06,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 05:08:06,534 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 05:08:06,544 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-simple/fibo_7-2.c[741,754] [2022-07-21 05:08:06,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 05:08:06,583 INFO L208 MainTranslator]: Completed translation [2022-07-21 05:08:06,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:06 WrapperNode [2022-07-21 05:08:06,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 05:08:06,591 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 05:08:06,591 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 05:08:06,591 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 05:08:06,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:06" (1/1) ... [2022-07-21 05:08:06,600 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:06" (1/1) ... [2022-07-21 05:08:06,609 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-07-21 05:08:06,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 05:08:06,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 05:08:06,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 05:08:06,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 05:08:06,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:06" (1/1) ... [2022-07-21 05:08:06,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:06" (1/1) ... [2022-07-21 05:08:06,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:06" (1/1) ... [2022-07-21 05:08:06,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:06" (1/1) ... [2022-07-21 05:08:06,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:06" (1/1) ... [2022-07-21 05:08:06,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:06" (1/1) ... [2022-07-21 05:08:06,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:06" (1/1) ... [2022-07-21 05:08:06,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 05:08:06,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 05:08:06,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 05:08:06,624 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 05:08:06,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:06" (1/1) ... [2022-07-21 05:08:06,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 05:08:06,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:06,644 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) [2022-07-21 05:08:06,661 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 [2022-07-21 05:08:06,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 05:08:06,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 05:08:06,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 05:08:06,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 05:08:06,671 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2022-07-21 05:08:06,672 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2022-07-21 05:08:06,719 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 05:08:06,720 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 05:08:06,809 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 05:08:06,812 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 05:08:06,813 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 05:08:06,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:08:06 BoogieIcfgContainer [2022-07-21 05:08:06,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 05:08:06,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 05:08:06,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 05:08:06,817 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 05:08:06,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:08:06" (1/3) ... [2022-07-21 05:08:06,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a1e876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:08:06, skipping insertion in model container [2022-07-21 05:08:06,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:06" (2/3) ... [2022-07-21 05:08:06,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a1e876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:08:06, skipping insertion in model container [2022-07-21 05:08:06,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:08:06" (3/3) ... [2022-07-21 05:08:06,819 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2022-07-21 05:08:06,829 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 05:08:06,829 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 05:08:06,870 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 05:08:06,877 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3e084093, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@127e8816 [2022-07-21 05:08:06,877 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 05:08:06,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 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) [2022-07-21 05:08:06,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 05:08:06,888 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:06,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:06,889 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:06,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:06,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2022-07-21 05:08:06,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:06,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184621861] [2022-07-21 05:08:06,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:06,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 05:08:07,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:07,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184621861] [2022-07-21 05:08:07,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184621861] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:08:07,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:08:07,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 05:08:07,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276076186] [2022-07-21 05:08:07,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:08:07,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 05:08:07,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:07,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 05:08:07,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:08:07,149 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 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), 4 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) [2022-07-21 05:08:07,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:07,197 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-07-21 05:08:07,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 05:08:07,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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 [2022-07-21 05:08:07,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:07,204 INFO L225 Difference]: With dead ends: 34 [2022-07-21 05:08:07,205 INFO L226 Difference]: Without dead ends: 18 [2022-07-21 05:08:07,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:08:07,211 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:08:07,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 75 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:08:07,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-21 05:08:07,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-21 05:08:07,240 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) [2022-07-21 05:08:07,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-07-21 05:08:07,242 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2022-07-21 05:08:07,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:07,243 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-07-21 05:08:07,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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) [2022-07-21 05:08:07,244 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-07-21 05:08:07,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 05:08:07,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:07,245 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:07,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 05:08:07,246 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:07,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:07,246 INFO L85 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2022-07-21 05:08:07,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:07,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140806994] [2022-07-21 05:08:07,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:07,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 05:08:07,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:07,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140806994] [2022-07-21 05:08:07,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140806994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:08:07,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:08:07,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 05:08:07,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906533165] [2022-07-21 05:08:07,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:08:07,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 05:08:07,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:07,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 05:08:07,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:08:07,329 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), 4 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) [2022-07-21 05:08:07,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:07,352 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-07-21 05:08:07,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 05:08:07,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 [2022-07-21 05:08:07,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:07,354 INFO L225 Difference]: With dead ends: 24 [2022-07-21 05:08:07,354 INFO L226 Difference]: Without dead ends: 20 [2022-07-21 05:08:07,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:08:07,358 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:08:07,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:08:07,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-21 05:08:07,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-07-21 05:08:07,363 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) [2022-07-21 05:08:07,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-07-21 05:08:07,365 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2022-07-21 05:08:07,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:07,367 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-07-21 05:08:07,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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) [2022-07-21 05:08:07,367 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-07-21 05:08:07,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-21 05:08:07,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:07,369 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:07,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 05:08:07,369 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:07,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:07,372 INFO L85 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2022-07-21 05:08:07,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:07,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52010317] [2022-07-21 05:08:07,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:07,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 05:08:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,448 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 05:08:07,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:07,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52010317] [2022-07-21 05:08:07,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52010317] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:08:07,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754727975] [2022-07-21 05:08:07,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:07,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:07,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:07,450 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) [2022-07-21 05:08:07,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 05:08:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 05:08:07,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:08:07,570 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 05:08:07,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:08:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 05:08:07,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754727975] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:08:07,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:08:07,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2022-07-21 05:08:07,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755634518] [2022-07-21 05:08:07,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:08:07,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 05:08:07,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:07,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 05:08:07,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-21 05:08:07,730 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 05:08:07,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:07,809 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-07-21 05:08:07,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 05:08:07,810 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2022-07-21 05:08:07,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:07,811 INFO L225 Difference]: With dead ends: 35 [2022-07-21 05:08:07,811 INFO L226 Difference]: Without dead ends: 20 [2022-07-21 05:08:07,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2022-07-21 05:08:07,813 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 41 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:08:07,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 48 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:08:07,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-21 05:08:07,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-21 05:08:07,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-21 05:08:07,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-07-21 05:08:07,819 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2022-07-21 05:08:07,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:07,819 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-21 05:08:07,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 05:08:07,820 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-07-21 05:08:07,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 05:08:07,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:07,821 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:07,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 05:08:08,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:08,037 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:08,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:08,038 INFO L85 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2022-07-21 05:08:08,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:08,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677103080] [2022-07-21 05:08:08,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:08,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 05:08:08,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:08,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677103080] [2022-07-21 05:08:08,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677103080] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:08:08,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171604170] [2022-07-21 05:08:08,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:08,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:08,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:08,122 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) [2022-07-21 05:08:08,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 05:08:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 05:08:08,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:08:08,191 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 05:08:08,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:08:08,323 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 05:08:08,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171604170] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:08:08,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:08:08,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2022-07-21 05:08:08,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537227519] [2022-07-21 05:08:08,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:08:08,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 05:08:08,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:08,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 05:08:08,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-21 05:08:08,330 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-21 05:08:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:08,407 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2022-07-21 05:08:08,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 05:08:08,407 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 24 [2022-07-21 05:08:08,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:08,409 INFO L225 Difference]: With dead ends: 38 [2022-07-21 05:08:08,409 INFO L226 Difference]: Without dead ends: 34 [2022-07-21 05:08:08,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-21 05:08:08,410 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:08:08,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 62 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:08:08,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-21 05:08:08,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-21 05:08:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-07-21 05:08:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-07-21 05:08:08,415 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2022-07-21 05:08:08,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:08,416 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2022-07-21 05:08:08,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-21 05:08:08,416 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2022-07-21 05:08:08,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-21 05:08:08,417 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:08,417 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:08,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 05:08:08,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-21 05:08:08,638 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:08,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:08,638 INFO L85 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2022-07-21 05:08:08,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:08,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213388886] [2022-07-21 05:08:08,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:08,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,761 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-21 05:08:08,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:08,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213388886] [2022-07-21 05:08:08,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213388886] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:08:08,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615087411] [2022-07-21 05:08:08,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 05:08:08,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:08,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:08,763 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) [2022-07-21 05:08:08,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 05:08:08,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 05:08:08,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:08:08,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 05:08:08,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:08:08,883 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-21 05:08:08,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:08:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-21 05:08:09,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615087411] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:08:09,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:08:09,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2022-07-21 05:08:09,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852333182] [2022-07-21 05:08:09,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:08:09,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-21 05:08:09,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:09,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-21 05:08:09,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-07-21 05:08:09,084 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2022-07-21 05:08:09,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:09,214 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2022-07-21 05:08:09,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 05:08:09,214 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) Word has length 37 [2022-07-21 05:08:09,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:09,215 INFO L225 Difference]: With dead ends: 69 [2022-07-21 05:08:09,215 INFO L226 Difference]: Without dead ends: 38 [2022-07-21 05:08:09,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2022-07-21 05:08:09,216 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 57 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:08:09,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 77 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:08:09,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-21 05:08:09,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-21 05:08:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-21 05:08:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-07-21 05:08:09,221 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2022-07-21 05:08:09,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:09,222 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-07-21 05:08:09,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2022-07-21 05:08:09,222 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-07-21 05:08:09,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 05:08:09,223 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:09,223 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:09,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 05:08:09,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:09,441 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:09,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:09,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2015531204, now seen corresponding path program 3 times [2022-07-21 05:08:09,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:09,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870260979] [2022-07-21 05:08:09,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:09,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:09,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:09,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:09,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:09,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:09,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:09,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:09,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:08:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:09,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:09,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:09,641 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-21 05:08:09,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:09,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870260979] [2022-07-21 05:08:09,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870260979] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:08:09,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063211197] [2022-07-21 05:08:09,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 05:08:09,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:09,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:09,656 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) [2022-07-21 05:08:09,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 05:08:09,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-21 05:08:09,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:08:09,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 05:08:09,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:08:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-21 05:08:09,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:08:09,994 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 29 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-07-21 05:08:09,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063211197] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:08:09,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:08:09,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 17 [2022-07-21 05:08:09,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808080875] [2022-07-21 05:08:09,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:08:09,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-21 05:08:09,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:09,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-21 05:08:09,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-07-21 05:08:09,996 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) [2022-07-21 05:08:10,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:10,092 INFO L93 Difference]: Finished difference Result 85 states and 124 transitions. [2022-07-21 05:08:10,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 05:08:10,093 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) Word has length 65 [2022-07-21 05:08:10,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:10,094 INFO L225 Difference]: With dead ends: 85 [2022-07-21 05:08:10,095 INFO L226 Difference]: Without dead ends: 50 [2022-07-21 05:08:10,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 138 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2022-07-21 05:08:10,097 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 75 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:08:10,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 67 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:08:10,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-21 05:08:10,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-07-21 05:08:10,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2022-07-21 05:08:10,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-07-21 05:08:10,103 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 65 [2022-07-21 05:08:10,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:10,103 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2022-07-21 05:08:10,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) [2022-07-21 05:08:10,104 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-07-21 05:08:10,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-21 05:08:10,107 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:10,107 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:10,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 05:08:10,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:10,324 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:10,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:10,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1033750100, now seen corresponding path program 4 times [2022-07-21 05:08:10,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:10,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940382533] [2022-07-21 05:08:10,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:10,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:10,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:10,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:10,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:10,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:10,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:10,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:10,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:10,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:08:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:10,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:10,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:10,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:08:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:10,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:10,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:10,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:10,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:10,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:10,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:10,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:08:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:10,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:10,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:10,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:08:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:10,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2022-07-21 05:08:10,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:10,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940382533] [2022-07-21 05:08:10,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940382533] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:08:10,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785532178] [2022-07-21 05:08:10,602 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 05:08:10,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:10,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:10,603 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) [2022-07-21 05:08:10,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 05:08:10,659 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 05:08:10,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:08:10,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 05:08:10,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:08:10,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2022-07-21 05:08:10,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:08:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 403 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2022-07-21 05:08:11,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785532178] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:08:11,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:08:11,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 13] total 20 [2022-07-21 05:08:11,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584362650] [2022-07-21 05:08:11,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:08:11,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 05:08:11,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:11,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 05:08:11,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2022-07-21 05:08:11,313 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) [2022-07-21 05:08:11,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:11,449 INFO L93 Difference]: Finished difference Result 117 states and 176 transitions. [2022-07-21 05:08:11,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 05:08:11,450 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) Word has length 147 [2022-07-21 05:08:11,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:11,457 INFO L225 Difference]: With dead ends: 117 [2022-07-21 05:08:11,457 INFO L226 Difference]: Without dead ends: 113 [2022-07-21 05:08:11,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2022-07-21 05:08:11,459 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 132 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:08:11,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 70 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:08:11,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-21 05:08:11,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2022-07-21 05:08:11,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 68 states have internal predecessors, (82), 21 states have call successors, (21), 9 states have call predecessors, (21), 13 states have return successors, (56), 26 states have call predecessors, (56), 21 states have call successors, (56) [2022-07-21 05:08:11,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2022-07-21 05:08:11,486 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 147 [2022-07-21 05:08:11,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:11,487 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2022-07-21 05:08:11,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) [2022-07-21 05:08:11,488 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2022-07-21 05:08:11,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-21 05:08:11,494 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:11,494 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:11,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 05:08:11,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:11,709 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:11,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:11,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1022210831, now seen corresponding path program 5 times [2022-07-21 05:08:11,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:11,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680269558] [2022-07-21 05:08:11,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:11,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:11,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:11,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:11,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:11,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:11,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:11,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:11,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:11,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:11,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:08:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:11,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:11,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:11,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:08:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:11,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:11,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:11,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:11,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:11,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 05:08:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:08:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:08:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 403 proven. 706 refuted. 0 times theorem prover too weak. 1471 trivial. 0 not checked. [2022-07-21 05:08:12,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:12,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680269558] [2022-07-21 05:08:12,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680269558] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:08:12,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454648843] [2022-07-21 05:08:12,132 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 05:08:12,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:12,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:12,133 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:08:12,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 05:08:12,212 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-07-21 05:08:12,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:08:12,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-21 05:08:12,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:08:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 630 proven. 571 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2022-07-21 05:08:12,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:08:13,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 632 proven. 605 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2022-07-21 05:08:13,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454648843] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:08:13,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:08:13,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 21] total 34 [2022-07-21 05:08:13,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626837835] [2022-07-21 05:08:13,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:08:13,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-21 05:08:13,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:13,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-21 05:08:13,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=868, Unknown=0, NotChecked=0, Total=1122 [2022-07-21 05:08:13,779 INFO L87 Difference]: Start difference. First operand 104 states and 159 transitions. Second operand has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 34 states have internal predecessors, (91), 24 states have call successors, (31), 1 states have call predecessors, (31), 13 states have return successors, (42), 21 states have call predecessors, (42), 24 states have call successors, (42) [2022-07-21 05:08:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:14,254 INFO L93 Difference]: Finished difference Result 193 states and 365 transitions. [2022-07-21 05:08:14,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-21 05:08:14,256 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 34 states have internal predecessors, (91), 24 states have call successors, (31), 1 states have call predecessors, (31), 13 states have return successors, (42), 21 states have call predecessors, (42), 24 states have call successors, (42) Word has length 215 [2022-07-21 05:08:14,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:14,257 INFO L225 Difference]: With dead ends: 193 [2022-07-21 05:08:14,257 INFO L226 Difference]: Without dead ends: 95 [2022-07-21 05:08:14,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 473 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=650, Invalid=2002, Unknown=0, NotChecked=0, Total=2652 [2022-07-21 05:08:14,275 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 203 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 05:08:14,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 172 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 05:08:14,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-21 05:08:14,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2022-07-21 05:08:14,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 58 states have internal predecessors, (62), 15 states have call successors, (15), 12 states have call predecessors, (15), 8 states have return successors, (36), 13 states have call predecessors, (36), 15 states have call successors, (36) [2022-07-21 05:08:14,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2022-07-21 05:08:14,284 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 215 [2022-07-21 05:08:14,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:14,284 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2022-07-21 05:08:14,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 34 states have internal predecessors, (91), 24 states have call successors, (31), 1 states have call predecessors, (31), 13 states have return successors, (42), 21 states have call predecessors, (42), 24 states have call successors, (42) [2022-07-21 05:08:14,285 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2022-07-21 05:08:14,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-07-21 05:08:14,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:14,288 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:14,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 05:08:14,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:14,513 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:14,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:14,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1099173212, now seen corresponding path program 6 times [2022-07-21 05:08:14,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:14,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699874192] [2022-07-21 05:08:14,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:14,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 05:08:14,552 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 05:08:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 05:08:14,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 05:08:14,610 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 05:08:14,611 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 05:08:14,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 05:08:14,614 INFO L356 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2022-07-21 05:08:14,616 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 05:08:14,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 05:08:14 BoogieIcfgContainer [2022-07-21 05:08:14,705 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 05:08:14,705 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 05:08:14,706 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 05:08:14,706 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 05:08:14,706 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:08:06" (3/4) ... [2022-07-21 05:08:14,707 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 05:08:14,786 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 05:08:14,786 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 05:08:14,786 INFO L158 Benchmark]: Toolchain (without parser) took 8405.34ms. Allocated memory was 48.2MB in the beginning and 132.1MB in the end (delta: 83.9MB). Free memory was 23.9MB in the beginning and 76.3MB in the end (delta: -52.4MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2022-07-21 05:08:14,786 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 48.2MB. Free memory was 30.4MB in the beginning and 30.4MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 05:08:14,786 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.20ms. Allocated memory was 48.2MB in the beginning and 62.9MB in the end (delta: 14.7MB). Free memory was 23.7MB in the beginning and 47.5MB in the end (delta: -23.9MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-07-21 05:08:14,787 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.16ms. Allocated memory is still 62.9MB. Free memory was 47.5MB in the beginning and 46.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 05:08:14,787 INFO L158 Benchmark]: Boogie Preprocessor took 12.92ms. Allocated memory is still 62.9MB. Free memory was 46.1MB in the beginning and 45.2MB in the end (delta: 935.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 05:08:14,787 INFO L158 Benchmark]: RCFGBuilder took 190.65ms. Allocated memory is still 62.9MB. Free memory was 45.2MB in the beginning and 36.8MB in the end (delta: 8.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 05:08:14,787 INFO L158 Benchmark]: TraceAbstraction took 7889.88ms. Allocated memory was 62.9MB in the beginning and 132.1MB in the end (delta: 69.2MB). Free memory was 36.4MB in the beginning and 83.6MB in the end (delta: -47.2MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2022-07-21 05:08:14,788 INFO L158 Benchmark]: Witness Printer took 80.36ms. Allocated memory is still 132.1MB. Free memory was 83.6MB in the beginning and 76.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-21 05:08:14,789 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.16ms. Allocated memory is still 48.2MB. Free memory was 30.4MB in the beginning and 30.4MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.20ms. Allocated memory was 48.2MB in the beginning and 62.9MB in the end (delta: 14.7MB). Free memory was 23.7MB in the beginning and 47.5MB in the end (delta: -23.9MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.16ms. Allocated memory is still 62.9MB. Free memory was 47.5MB in the beginning and 46.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 12.92ms. Allocated memory is still 62.9MB. Free memory was 46.1MB in the beginning and 45.2MB in the end (delta: 935.6kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 190.65ms. Allocated memory is still 62.9MB. Free memory was 45.2MB in the beginning and 36.8MB in the end (delta: 8.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7889.88ms. Allocated memory was 62.9MB in the beginning and 132.1MB in the end (delta: 69.2MB). Free memory was 36.4MB in the beginning and 83.6MB in the end (delta: -47.2MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Witness Printer took 80.36ms. Allocated memory is still 132.1MB. Free memory was 83.6MB in the beginning and 76.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. 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: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 7; VAL [x=7] [L27] CALL, EXPR fibo(x) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) VAL [fibo(x)=13, x=7] [L27] int result = fibo(x); [L28] COND TRUE result == 13 VAL [result=13, x=7] [L29] reach_error() VAL [result=13, x=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 9, TraceHistogramMax: 41, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 580 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 533 mSDsluCounter, 645 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 498 mSDsCounter, 561 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 894 IncrementalHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 561 mSolverCounterUnsat, 147 mSDtfsCounter, 894 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1269 GetRequests, 1121 SyntacticMatches, 11 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=7, InterpolantAutomatonStates: 94, 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, 8 MinimizatonAttempts, 25 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1326 NumberOfCodeBlocks, 1240 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1534 ConstructedInterpolants, 0 QuantifiedInterpolants, 2986 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1024 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 8721/11991 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! [2022-07-21 05:08:14,830 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