./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_10-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_10-1.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 acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 13:18:01,271 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 13:18:01,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 13:18:01,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 13:18:01,327 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 13:18:01,329 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 13:18:01,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 13:18:01,339 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 13:18:01,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 13:18:01,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 13:18:01,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 13:18:01,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 13:18:01,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 13:18:01,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 13:18:01,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 13:18:01,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 13:18:01,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 13:18:01,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 13:18:01,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 13:18:01,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 13:18:01,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 13:18:01,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 13:18:01,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 13:18:01,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 13:18:01,369 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 13:18:01,369 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 13:18:01,369 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 13:18:01,371 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 13:18:01,371 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 13:18:01,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 13:18:01,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 13:18:01,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 13:18:01,374 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 13:18:01,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 13:18:01,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 13:18:01,377 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 13:18:01,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 13:18:01,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 13:18:01,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 13:18:01,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 13:18:01,379 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 13:18:01,380 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 13:18:01,411 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 13:18:01,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 13:18:01,412 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 13:18:01,412 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 13:18:01,413 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 13:18:01,413 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 13:18:01,414 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 13:18:01,414 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 13:18:01,414 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 13:18:01,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 13:18:01,415 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 13:18:01,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 13:18:01,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 13:18:01,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 13:18:01,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 13:18:01,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 13:18:01,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 13:18:01,416 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 13:18:01,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 13:18:01,416 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 13:18:01,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 13:18:01,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 13:18:01,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 13:18:01,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 13:18:01,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 13:18:01,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 13:18:01,418 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 13:18:01,419 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 13:18:01,419 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 13:18:01,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 13:18:01,419 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 13:18:01,420 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 13:18:01,420 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 13:18:01,420 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 13:18:01,420 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 -> acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 [2021-12-21 13:18:01,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 13:18:01,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 13:18:01,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 13:18:01,694 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 13:18:01,695 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 13:18:01,696 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_10-1.c [2021-12-21 13:18:01,757 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4390689c/955be41f5c504906b82712b7254abb51/FLAG925272010 [2021-12-21 13:18:02,193 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 13:18:02,193 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2021-12-21 13:18:02,202 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4390689c/955be41f5c504906b82712b7254abb51/FLAG925272010 [2021-12-21 13:18:02,609 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4390689c/955be41f5c504906b82712b7254abb51 [2021-12-21 13:18:02,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 13:18:02,612 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 13:18:02,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 13:18:02,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 13:18:02,617 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 13:18:02,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:18:02" (1/1) ... [2021-12-21 13:18:02,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@349a349f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:18:02, skipping insertion in model container [2021-12-21 13:18:02,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:18:02" (1/1) ... [2021-12-21 13:18:02,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 13:18:02,635 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 13:18:02,769 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_10-1.c[743,756] [2021-12-21 13:18:02,772 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 13:18:02,779 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 13:18:02,791 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_10-1.c[743,756] [2021-12-21 13:18:02,796 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 13:18:02,809 INFO L208 MainTranslator]: Completed translation [2021-12-21 13:18:02,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:18:02 WrapperNode [2021-12-21 13:18:02,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 13:18:02,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 13:18:02,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 13:18:02,810 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 13:18:02,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:18:02" (1/1) ... [2021-12-21 13:18:02,823 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:18:02" (1/1) ... [2021-12-21 13:18:02,837 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2021-12-21 13:18:02,838 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 13:18:02,839 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 13:18:02,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 13:18:02,839 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 13:18:02,846 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:18:02" (1/1) ... [2021-12-21 13:18:02,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:18:02" (1/1) ... [2021-12-21 13:18:02,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:18:02" (1/1) ... [2021-12-21 13:18:02,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:18:02" (1/1) ... [2021-12-21 13:18:02,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:18:02" (1/1) ... [2021-12-21 13:18:02,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:18:02" (1/1) ... [2021-12-21 13:18:02,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:18:02" (1/1) ... [2021-12-21 13:18:02,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 13:18:02,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 13:18:02,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 13:18:02,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 13:18:02,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:18:02" (1/1) ... [2021-12-21 13:18:02,872 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 13:18:02,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:18:02,897 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-21 13:18:02,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-21 13:18:02,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 13:18:02,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 13:18:02,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 13:18:02,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 13:18:02,936 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2021-12-21 13:18:02,936 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2021-12-21 13:18:02,995 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 13:18:02,997 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 13:18:03,113 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 13:18:03,119 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 13:18:03,120 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-21 13:18:03,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:18:03 BoogieIcfgContainer [2021-12-21 13:18:03,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 13:18:03,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 13:18:03,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 13:18:03,126 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 13:18:03,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 01:18:02" (1/3) ... [2021-12-21 13:18:03,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1e1b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:18:03, skipping insertion in model container [2021-12-21 13:18:03,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:18:02" (2/3) ... [2021-12-21 13:18:03,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1e1b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:18:03, skipping insertion in model container [2021-12-21 13:18:03,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:18:03" (3/3) ... [2021-12-21 13:18:03,130 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2021-12-21 13:18:03,135 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 13:18:03,136 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 13:18:03,186 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 13:18:03,194 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 13:18:03,195 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 13:18:03,213 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) [2021-12-21 13:18:03,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-21 13:18:03,229 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:18:03,229 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:18:03,230 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:18:03,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:18:03,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2021-12-21 13:18:03,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:18:03,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951421105] [2021-12-21 13:18:03,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:18:03,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:18:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:03,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:18:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 13:18:03,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:18:03,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951421105] [2021-12-21 13:18:03,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951421105] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 13:18:03,501 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 13:18:03,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 13:18:03,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093088008] [2021-12-21 13:18:03,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 13:18:03,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 13:18:03,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:18:03,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 13:18:03,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 13:18:03,552 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) [2021-12-21 13:18:03,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:18:03,612 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2021-12-21 13:18:03,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 13:18:03,615 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 [2021-12-21 13:18:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:18:03,622 INFO L225 Difference]: With dead ends: 34 [2021-12-21 13:18:03,623 INFO L226 Difference]: Without dead ends: 18 [2021-12-21 13:18:03,625 INFO L932 BasicCegarLoop]: 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 [2021-12-21 13:18:03,631 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 13:18:03,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 78 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 13:18:03,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-12-21 13:18:03,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-12-21 13:18:03,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-21 13:18:03,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-12-21 13:18:03,672 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2021-12-21 13:18:03,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:18:03,673 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-21 13:18:03,673 INFO L471 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) [2021-12-21 13:18:03,674 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-12-21 13:18:03,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-21 13:18:03,675 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:18:03,676 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:18:03,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 13:18:03,677 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:18:03,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:18:03,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2021-12-21 13:18:03,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:18:03,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019402831] [2021-12-21 13:18:03,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:18:03,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:18:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:03,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:18:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 13:18:03,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:18:03,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019402831] [2021-12-21 13:18:03,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019402831] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 13:18:03,791 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 13:18:03,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 13:18:03,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828220491] [2021-12-21 13:18:03,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 13:18:03,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 13:18:03,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:18:03,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 13:18:03,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 13:18:03,801 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) [2021-12-21 13:18:03,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:18:03,823 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-12-21 13:18:03,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 13:18:03,824 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 [2021-12-21 13:18:03,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:18:03,825 INFO L225 Difference]: With dead ends: 24 [2021-12-21 13:18:03,825 INFO L226 Difference]: Without dead ends: 20 [2021-12-21 13:18:03,828 INFO L932 BasicCegarLoop]: 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 [2021-12-21 13:18:03,830 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 13:18:03,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 13:18:03,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-21 13:18:03,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-12-21 13:18:03,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-21 13:18:03,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-12-21 13:18:03,845 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2021-12-21 13:18:03,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:18:03,847 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-21 13:18:03,848 INFO L471 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) [2021-12-21 13:18:03,848 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-12-21 13:18:03,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-21 13:18:03,850 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:18:03,851 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:18:03,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 13:18:03,851 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:18:03,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:18:03,860 INFO L85 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2021-12-21 13:18:03,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:18:03,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998607306] [2021-12-21 13:18:03,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:18:03,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:18:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:03,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:18:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:03,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:04,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 13:18:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:04,017 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 13:18:04,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:18:04,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998607306] [2021-12-21 13:18:04,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998607306] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:18:04,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773610411] [2021-12-21 13:18:04,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:18:04,022 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:18:04,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:18:04,029 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:18:04,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 13:18:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:04,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 13:18:04,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:18:04,178 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 13:18:04,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:18:04,359 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 13:18:04,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773610411] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:18:04,360 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:18:04,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2021-12-21 13:18:04,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876885619] [2021-12-21 13:18:04,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:18:04,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-21 13:18:04,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:18:04,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-21 13:18:04,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-12-21 13:18:04,362 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) [2021-12-21 13:18:04,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:18:04,444 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2021-12-21 13:18:04,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 13:18:04,444 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 [2021-12-21 13:18:04,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:18:04,445 INFO L225 Difference]: With dead ends: 35 [2021-12-21 13:18:04,445 INFO L226 Difference]: Without dead ends: 20 [2021-12-21 13:18:04,446 INFO L932 BasicCegarLoop]: 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 [2021-12-21 13:18:04,447 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 41 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 13:18:04,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 50 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 13:18:04,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-21 13:18:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-12-21 13:18:04,452 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) [2021-12-21 13:18:04,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2021-12-21 13:18:04,453 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2021-12-21 13:18:04,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:18:04,453 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-12-21 13:18:04,454 INFO L471 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) [2021-12-21 13:18:04,454 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2021-12-21 13:18:04,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-21 13:18:04,455 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:18:04,455 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:18:04,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-21 13:18:04,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:18:04,678 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:18:04,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:18:04,679 INFO L85 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2021-12-21 13:18:04,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:18:04,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223369035] [2021-12-21 13:18:04,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:18:04,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:18:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:04,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:18:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:04,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:04,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:04,792 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 13:18:04,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:18:04,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223369035] [2021-12-21 13:18:04,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223369035] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:18:04,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666288794] [2021-12-21 13:18:04,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:18:04,794 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:18:04,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:18:04,795 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:18:04,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 13:18:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:04,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 13:18:04,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:18:04,909 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 13:18:04,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:18:05,080 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 13:18:05,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666288794] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:18:05,081 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:18:05,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2021-12-21 13:18:05,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369309677] [2021-12-21 13:18:05,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:18:05,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 13:18:05,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:18:05,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 13:18:05,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-12-21 13:18:05,086 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) [2021-12-21 13:18:05,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:18:05,158 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2021-12-21 13:18:05,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 13:18:05,158 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 [2021-12-21 13:18:05,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:18:05,160 INFO L225 Difference]: With dead ends: 38 [2021-12-21 13:18:05,160 INFO L226 Difference]: Without dead ends: 34 [2021-12-21 13:18:05,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-12-21 13:18:05,161 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 13:18:05,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 63 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 13:18:05,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-21 13:18:05,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-12-21 13:18:05,168 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) [2021-12-21 13:18:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2021-12-21 13:18:05,169 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2021-12-21 13:18:05,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:18:05,169 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2021-12-21 13:18:05,170 INFO L471 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) [2021-12-21 13:18:05,170 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2021-12-21 13:18:05,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 13:18:05,171 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:18:05,171 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:18:05,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-21 13:18:05,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-21 13:18:05,392 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:18:05,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:18:05,392 INFO L85 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2021-12-21 13:18:05,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:18:05,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401000393] [2021-12-21 13:18:05,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:18:05,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:18:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:05,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:18:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:05,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:05,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:05,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:05,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:05,519 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-21 13:18:05,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:18:05,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401000393] [2021-12-21 13:18:05,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401000393] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:18:05,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611952559] [2021-12-21 13:18:05,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 13:18:05,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:18:05,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:18:05,524 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:18:05,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-21 13:18:05,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 13:18:05,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 13:18:05,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 13:18:05,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:18:05,736 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-21 13:18:05,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:18:06,103 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-21 13:18:06,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611952559] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:18:06,104 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:18:06,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2021-12-21 13:18:06,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418743404] [2021-12-21 13:18:06,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:18:06,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-21 13:18:06,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:18:06,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-21 13:18:06,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-12-21 13:18:06,106 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) [2021-12-21 13:18:06,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:18:06,262 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2021-12-21 13:18:06,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 13:18:06,263 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 [2021-12-21 13:18:06,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:18:06,265 INFO L225 Difference]: With dead ends: 69 [2021-12-21 13:18:06,265 INFO L226 Difference]: Without dead ends: 38 [2021-12-21 13:18:06,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2021-12-21 13:18:06,267 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 57 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 13:18:06,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 78 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 13:18:06,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-21 13:18:06,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-12-21 13:18:06,274 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) [2021-12-21 13:18:06,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2021-12-21 13:18:06,276 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2021-12-21 13:18:06,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:18:06,276 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2021-12-21 13:18:06,276 INFO L471 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) [2021-12-21 13:18:06,276 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2021-12-21 13:18:06,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-21 13:18:06,278 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:18:06,278 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:18:06,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-21 13:18:06,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:18:06,484 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:18:06,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:18:06,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2015531204, now seen corresponding path program 3 times [2021-12-21 13:18:06,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:18:06,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111931907] [2021-12-21 13:18:06,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:18:06,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:18:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:06,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:18:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:06,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:06,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:06,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:06,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:06,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:06,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:06,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:06,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:06,643 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-12-21 13:18:06,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:18:06,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111931907] [2021-12-21 13:18:06,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111931907] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:18:06,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613675159] [2021-12-21 13:18:06,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 13:18:06,644 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:18:06,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:18:06,645 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:18:06,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-21 13:18:06,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-21 13:18:06,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 13:18:06,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 13:18:06,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:18:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-12-21 13:18:06,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:18:07,340 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 29 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2021-12-21 13:18:07,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613675159] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:18:07,341 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:18:07,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 17 [2021-12-21 13:18:07,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718032331] [2021-12-21 13:18:07,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:18:07,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-21 13:18:07,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:18:07,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-21 13:18:07,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-12-21 13:18:07,343 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) [2021-12-21 13:18:07,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:18:07,492 INFO L93 Difference]: Finished difference Result 85 states and 124 transitions. [2021-12-21 13:18:07,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 13:18:07,492 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 [2021-12-21 13:18:07,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:18:07,497 INFO L225 Difference]: With dead ends: 85 [2021-12-21 13:18:07,497 INFO L226 Difference]: Without dead ends: 50 [2021-12-21 13:18:07,501 INFO L932 BasicCegarLoop]: 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 [2021-12-21 13:18:07,504 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 75 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 13:18:07,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 69 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 13:18:07,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-21 13:18:07,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2021-12-21 13:18:07,516 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) [2021-12-21 13:18:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2021-12-21 13:18:07,519 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 65 [2021-12-21 13:18:07,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:18:07,521 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2021-12-21 13:18:07,521 INFO L471 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) [2021-12-21 13:18:07,521 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2021-12-21 13:18:07,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-12-21 13:18:07,528 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:18:07,529 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:18:07,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-21 13:18:07,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:18:07,729 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:18:07,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:18:07,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1033750100, now seen corresponding path program 4 times [2021-12-21 13:18:07,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:18:07,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770167724] [2021-12-21 13:18:07,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:18:07,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:18:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:07,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:18:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:07,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:07,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:07,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:07,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:07,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:07,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:07,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:07,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:07,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:07,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:18:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:07,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:07,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:07,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:07,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:08,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:08,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:08,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:08,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:08,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:08,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:18:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2021-12-21 13:18:08,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:18:08,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770167724] [2021-12-21 13:18:08,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770167724] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:18:08,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112579723] [2021-12-21 13:18:08,028 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-21 13:18:08,028 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:18:08,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:18:08,032 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:18:08,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-21 13:18:08,092 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-21 13:18:08,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 13:18:08,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-21 13:18:08,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:18:08,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2021-12-21 13:18:08,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:18:09,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 403 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2021-12-21 13:18:09,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112579723] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:18:09,288 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:18:09,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 13] total 20 [2021-12-21 13:18:09,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922202802] [2021-12-21 13:18:09,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:18:09,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-21 13:18:09,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:18:09,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-21 13:18:09,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2021-12-21 13:18:09,290 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) [2021-12-21 13:18:09,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:18:09,454 INFO L93 Difference]: Finished difference Result 117 states and 176 transitions. [2021-12-21 13:18:09,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 13:18:09,459 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 [2021-12-21 13:18:09,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:18:09,465 INFO L225 Difference]: With dead ends: 117 [2021-12-21 13:18:09,465 INFO L226 Difference]: Without dead ends: 113 [2021-12-21 13:18:09,466 INFO L932 BasicCegarLoop]: 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 [2021-12-21 13:18:09,466 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 132 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 13:18:09,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 71 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 13:18:09,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-21 13:18:09,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2021-12-21 13:18:09,482 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) [2021-12-21 13:18:09,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2021-12-21 13:18:09,484 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 147 [2021-12-21 13:18:09,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:18:09,485 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2021-12-21 13:18:09,485 INFO L471 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) [2021-12-21 13:18:09,486 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2021-12-21 13:18:09,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-12-21 13:18:09,488 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:18:09,488 INFO L514 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:18:09,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-21 13:18:09,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:18:09,692 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:18:09,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:18:09,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1022210831, now seen corresponding path program 5 times [2021-12-21 13:18:09,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:18:09,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850052049] [2021-12-21 13:18:09,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:18:09,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:18:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:09,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:18:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:09,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:09,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:09,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:09,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:09,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:09,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:09,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:09,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:09,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:09,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:09,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:18:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:10,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:10,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:10,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:10,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:10,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 13:18:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:10,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:10,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:10,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:10,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:10,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:10,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:10,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:10,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:10,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:10,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:18:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:10,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:10,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:10,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:10,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:10,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 403 proven. 706 refuted. 0 times theorem prover too weak. 1471 trivial. 0 not checked. [2021-12-21 13:18:10,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:18:10,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850052049] [2021-12-21 13:18:10,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850052049] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:18:10,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439576826] [2021-12-21 13:18:10,212 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-21 13:18:10,212 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:18:10,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:18:10,216 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) [2021-12-21 13:18:10,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-21 13:18:10,325 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2021-12-21 13:18:10,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 13:18:10,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-21 13:18:10,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:18:10,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 630 proven. 571 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2021-12-21 13:18:10,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:18:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 632 proven. 605 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2021-12-21 13:18:12,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439576826] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:18:12,553 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:18:12,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 21] total 34 [2021-12-21 13:18:12,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955291241] [2021-12-21 13:18:12,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:18:12,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-21 13:18:12,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:18:12,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-21 13:18:12,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=868, Unknown=0, NotChecked=0, Total=1122 [2021-12-21 13:18:12,555 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) [2021-12-21 13:18:13,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:18:13,031 INFO L93 Difference]: Finished difference Result 193 states and 365 transitions. [2021-12-21 13:18:13,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-21 13:18:13,033 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 [2021-12-21 13:18:13,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:18:13,034 INFO L225 Difference]: With dead ends: 193 [2021-12-21 13:18:13,035 INFO L226 Difference]: Without dead ends: 95 [2021-12-21 13:18:13,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 473 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=650, Invalid=2002, Unknown=0, NotChecked=0, Total=2652 [2021-12-21 13:18:13,037 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 203 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 13:18:13,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 174 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 13:18:13,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-21 13:18:13,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2021-12-21 13:18:13,046 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) [2021-12-21 13:18:13,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2021-12-21 13:18:13,047 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 215 [2021-12-21 13:18:13,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:18:13,048 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2021-12-21 13:18:13,048 INFO L471 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) [2021-12-21 13:18:13,048 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2021-12-21 13:18:13,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2021-12-21 13:18:13,051 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:18:13,051 INFO L514 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:18:13,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-21 13:18:13,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:18:13,274 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:18:13,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:18:13,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1099173212, now seen corresponding path program 6 times [2021-12-21 13:18:13,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:18:13,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147402101] [2021-12-21 13:18:13,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:18:13,275 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:18:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:18:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:18:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 13:18:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-21 13:18:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:18:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:13,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2021-12-21 13:18:13,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:18:13,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147402101] [2021-12-21 13:18:13,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147402101] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:18:13,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152298480] [2021-12-21 13:18:13,779 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-21 13:18:13,779 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:18:13,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:18:13,781 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:18:13,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-21 13:18:13,892 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2021-12-21 13:18:13,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 13:18:13,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-21 13:18:13,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:18:14,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 331 proven. 821 refuted. 0 times theorem prover too weak. 3416 trivial. 0 not checked. [2021-12-21 13:18:14,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:18:15,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 335 proven. 857 refuted. 0 times theorem prover too weak. 3376 trivial. 0 not checked. [2021-12-21 13:18:15,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152298480] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:18:15,786 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:18:15,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 15] total 25 [2021-12-21 13:18:15,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563642919] [2021-12-21 13:18:15,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:18:15,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-21 13:18:15,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:18:15,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-21 13:18:15,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2021-12-21 13:18:15,788 INFO L87 Difference]: Start difference. First operand 84 states and 113 transitions. Second operand has 25 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 25 states have internal predecessors, (65), 20 states have call successors, (23), 1 states have call predecessors, (23), 8 states have return successors, (32), 16 states have call predecessors, (32), 20 states have call successors, (32) [2021-12-21 13:18:15,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:18:15,991 INFO L93 Difference]: Finished difference Result 266 states and 398 transitions. [2021-12-21 13:18:15,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 13:18:15,992 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 25 states have internal predecessors, (65), 20 states have call successors, (23), 1 states have call predecessors, (23), 8 states have return successors, (32), 16 states have call predecessors, (32), 20 states have call successors, (32) Word has length 283 [2021-12-21 13:18:15,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:18:15,995 INFO L225 Difference]: With dead ends: 266 [2021-12-21 13:18:15,995 INFO L226 Difference]: Without dead ends: 262 [2021-12-21 13:18:15,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=213, Invalid=437, Unknown=0, NotChecked=0, Total=650 [2021-12-21 13:18:15,996 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 170 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 13:18:15,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 103 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 13:18:15,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-12-21 13:18:16,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 247. [2021-12-21 13:18:16,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 170 states have (on average 1.035294117647059) internal successors, (176), 165 states have internal predecessors, (176), 52 states have call successors, (52), 31 states have call predecessors, (52), 24 states have return successors, (140), 50 states have call predecessors, (140), 52 states have call successors, (140) [2021-12-21 13:18:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 368 transitions. [2021-12-21 13:18:16,022 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 368 transitions. Word has length 283 [2021-12-21 13:18:16,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:18:16,023 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 368 transitions. [2021-12-21 13:18:16,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 25 states have internal predecessors, (65), 20 states have call successors, (23), 1 states have call predecessors, (23), 8 states have return successors, (32), 16 states have call predecessors, (32), 20 states have call successors, (32) [2021-12-21 13:18:16,023 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 368 transitions. [2021-12-21 13:18:16,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2021-12-21 13:18:16,031 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:18:16,031 INFO L514 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:18:16,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-21 13:18:16,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:18:16,255 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:18:16,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:18:16,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1042599522, now seen corresponding path program 7 times [2021-12-21 13:18:16,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:18:16,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970792456] [2021-12-21 13:18:16,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:18:16,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:18:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:16,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:18:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:16,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:16,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:16,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:16,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:16,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:16,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:16,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:16,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:16,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:16,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:16,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:16,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:16,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:18:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:16,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:16,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:16,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:16,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 13:18:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-21 13:18:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:18:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-21 13:18:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:18:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 13:18:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-21 13:18:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,435 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2818 proven. 2810 refuted. 0 times theorem prover too weak. 10779 trivial. 0 not checked. [2021-12-21 13:18:17,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:18:17,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970792456] [2021-12-21 13:18:17,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970792456] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:18:17,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266516230] [2021-12-21 13:18:17,436 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-21 13:18:17,436 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:18:17,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:18:17,438 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:18:17,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-21 13:18:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:17,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-21 13:18:17,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:18:18,383 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 386 proven. 2689 refuted. 0 times theorem prover too weak. 13332 trivial. 0 not checked. [2021-12-21 13:18:18,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:18:21,371 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 386 proven. 2766 refuted. 0 times theorem prover too weak. 13255 trivial. 0 not checked. [2021-12-21 13:18:21,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266516230] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:18:21,372 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:18:21,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 12, 19] total 38 [2021-12-21 13:18:21,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347665726] [2021-12-21 13:18:21,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:18:21,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-21 13:18:21,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:18:21,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-21 13:18:21,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1077, Unknown=0, NotChecked=0, Total=1406 [2021-12-21 13:18:21,375 INFO L87 Difference]: Start difference. First operand 247 states and 368 transitions. Second operand has 38 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 38 states have internal predecessors, (92), 30 states have call successors, (33), 1 states have call predecessors, (33), 14 states have return successors, (50), 25 states have call predecessors, (50), 30 states have call successors, (50) [2021-12-21 13:18:22,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:18:22,015 INFO L93 Difference]: Finished difference Result 388 states and 667 transitions. [2021-12-21 13:18:22,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-12-21 13:18:22,016 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 38 states have internal predecessors, (92), 30 states have call successors, (33), 1 states have call predecessors, (33), 14 states have return successors, (50), 25 states have call predecessors, (50), 30 states have call successors, (50) Word has length 528 [2021-12-21 13:18:22,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:18:22,019 INFO L225 Difference]: With dead ends: 388 [2021-12-21 13:18:22,019 INFO L226 Difference]: Without dead ends: 152 [2021-12-21 13:18:22,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1266 GetRequests, 1207 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=873, Invalid=2787, Unknown=0, NotChecked=0, Total=3660 [2021-12-21 13:18:22,022 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 223 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 13:18:22,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 230 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 13:18:22,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-21 13:18:22,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 122. [2021-12-21 13:18:22,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 87 states have (on average 1.0344827586206897) internal successors, (90), 85 states have internal predecessors, (90), 24 states have call successors, (24), 19 states have call predecessors, (24), 10 states have return successors, (58), 17 states have call predecessors, (58), 24 states have call successors, (58) [2021-12-21 13:18:22,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2021-12-21 13:18:22,034 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 528 [2021-12-21 13:18:22,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:18:22,034 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2021-12-21 13:18:22,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 38 states have internal predecessors, (92), 30 states have call successors, (33), 1 states have call predecessors, (33), 14 states have return successors, (50), 25 states have call predecessors, (50), 30 states have call successors, (50) [2021-12-21 13:18:22,035 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2021-12-21 13:18:22,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2021-12-21 13:18:22,054 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:18:22,055 INFO L514 BasicCegarLoop]: trace histogram [125, 125, 101, 62, 62, 62, 62, 62, 62, 62, 39, 24, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:18:22,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-21 13:18:22,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-21 13:18:22,272 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:18:22,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:18:22,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1121911956, now seen corresponding path program 8 times [2021-12-21 13:18:22,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:18:22,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183794513] [2021-12-21 13:18:22,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:18:22,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:18:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:22,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:18:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:18:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 13:18:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-21 13:18:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:18:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-21 13:18:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:18:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 13:18:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2021-12-21 13:18:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:23,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:18:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 13:18:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-21 13:18:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:18:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-21 13:18:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:18:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:24,401 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 5753 proven. 5825 refuted. 0 times theorem prover too weak. 32036 trivial. 0 not checked. [2021-12-21 13:18:24,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:18:24,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183794513] [2021-12-21 13:18:24,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183794513] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:18:24,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334409707] [2021-12-21 13:18:24,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 13:18:24,402 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:18:24,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:18:24,408 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:18:24,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-21 13:18:24,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 13:18:24,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 13:18:24,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 1922 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-21 13:18:24,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:18:25,783 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 699 proven. 5145 refuted. 0 times theorem prover too weak. 37770 trivial. 0 not checked. [2021-12-21 13:18:25,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:18:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 699 proven. 5245 refuted. 0 times theorem prover too weak. 37670 trivial. 0 not checked. [2021-12-21 13:18:30,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334409707] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:18:30,328 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:18:30,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 13, 21] total 42 [2021-12-21 13:18:30,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321835716] [2021-12-21 13:18:30,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:18:30,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-21 13:18:30,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:18:30,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-21 13:18:30,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=1306, Unknown=0, NotChecked=0, Total=1722 [2021-12-21 13:18:30,332 INFO L87 Difference]: Start difference. First operand 122 states and 172 transitions. Second operand has 42 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 42 states have internal predecessors, (101), 33 states have call successors, (36), 1 states have call predecessors, (36), 16 states have return successors, (56), 29 states have call predecessors, (56), 33 states have call successors, (56) [2021-12-21 13:18:31,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:18:31,155 INFO L93 Difference]: Finished difference Result 270 states and 462 transitions. [2021-12-21 13:18:31,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-12-21 13:18:31,156 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 42 states have internal predecessors, (101), 33 states have call successors, (36), 1 states have call predecessors, (36), 16 states have return successors, (56), 29 states have call predecessors, (56), 33 states have call successors, (56) Word has length 855 [2021-12-21 13:18:31,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:18:31,160 INFO L225 Difference]: With dead ends: 270 [2021-12-21 13:18:31,160 INFO L226 Difference]: Without dead ends: 163 [2021-12-21 13:18:31,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2026 GetRequests, 1957 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1442 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1113, Invalid=3579, Unknown=0, NotChecked=0, Total=4692 [2021-12-21 13:18:31,163 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 369 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 13:18:31,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 224 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-21 13:18:31,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-21 13:18:31,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 139. [2021-12-21 13:18:31,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 97 states have internal predecessors, (102), 28 states have call successors, (28), 22 states have call predecessors, (28), 11 states have return successors, (71), 19 states have call predecessors, (71), 28 states have call successors, (71) [2021-12-21 13:18:31,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 201 transitions. [2021-12-21 13:18:31,186 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 201 transitions. Word has length 855 [2021-12-21 13:18:31,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:18:31,187 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 201 transitions. [2021-12-21 13:18:31,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 42 states have internal predecessors, (101), 33 states have call successors, (36), 1 states have call predecessors, (36), 16 states have return successors, (56), 29 states have call predecessors, (56), 33 states have call successors, (56) [2021-12-21 13:18:31,187 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 201 transitions. [2021-12-21 13:18:31,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1564 [2021-12-21 13:18:31,200 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:18:31,200 INFO L514 BasicCegarLoop]: trace histogram [229, 229, 185, 114, 114, 114, 114, 114, 114, 114, 71, 44, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:18:31,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-21 13:18:31,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:18:31,401 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:18:31,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:18:31,401 INFO L85 PathProgramCache]: Analyzing trace with hash 35450340, now seen corresponding path program 9 times [2021-12-21 13:18:31,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:18:31,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218117933] [2021-12-21 13:18:31,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:18:31,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:18:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:32,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:18:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:33,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:33,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:33,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:33,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:33,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:33,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:33,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:33,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:33,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:18:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 13:18:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-21 13:18:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:18:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-21 13:18:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:18:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 13:18:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2021-12-21 13:18:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:18:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 13:18:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-21 13:18:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:18:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2021-12-21 13:18:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:34,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:18:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 13:18:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-21 13:18:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:18:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-21 13:18:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:18:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 13:18:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2021-12-21 13:18:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:18:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 13:18:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 636 [2021-12-21 13:18:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:18:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 13:18:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:18:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:18:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:18:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:18:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:18:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 147208 backedges. 13165 proven. 14022 refuted. 0 times theorem prover too weak. 120021 trivial. 0 not checked. [2021-12-21 13:18:35,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:18:35,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218117933] [2021-12-21 13:18:35,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218117933] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:18:35,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886701637] [2021-12-21 13:18:35,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 13:18:35,797 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:18:35,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:18:35,800 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:18:35,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-21 13:18:36,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 108 check-sat command(s) [2021-12-21 13:18:36,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 13:18:36,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 2088 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-21 13:18:36,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:18:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 147208 backedges. 10746 proven. 1070 refuted. 0 times theorem prover too weak. 135392 trivial. 0 not checked. [2021-12-21 13:18:38,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:18:44,157 INFO L134 CoverageAnalysis]: Checked inductivity of 147208 backedges. 10746 proven. 1120 refuted. 0 times theorem prover too weak. 135342 trivial. 0 not checked. [2021-12-21 13:18:44,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886701637] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:18:44,157 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:18:44,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 14, 21] total 48 [2021-12-21 13:18:44,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202384832] [2021-12-21 13:18:44,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:18:44,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-21 13:18:44,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:18:44,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-21 13:18:44,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=1755, Unknown=0, NotChecked=0, Total=2256 [2021-12-21 13:18:44,162 INFO L87 Difference]: Start difference. First operand 139 states and 201 transitions. Second operand has 48 states, 47 states have (on average 2.425531914893617) internal successors, (114), 48 states have internal predecessors, (114), 29 states have call successors, (41), 1 states have call predecessors, (41), 19 states have return successors, (62), 42 states have call predecessors, (62), 29 states have call successors, (62) [2021-12-21 13:18:45,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:18:45,190 INFO L93 Difference]: Finished difference Result 319 states and 564 transitions. [2021-12-21 13:18:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-12-21 13:18:45,190 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.425531914893617) internal successors, (114), 48 states have internal predecessors, (114), 29 states have call successors, (41), 1 states have call predecessors, (41), 19 states have return successors, (62), 42 states have call predecessors, (62), 29 states have call successors, (62) Word has length 1563 [2021-12-21 13:18:45,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:18:45,194 INFO L225 Difference]: With dead ends: 319 [2021-12-21 13:18:45,195 INFO L226 Difference]: Without dead ends: 195 [2021-12-21 13:18:45,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3665 GetRequests, 3580 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2140 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1446, Invalid=5360, Unknown=0, NotChecked=0, Total=6806 [2021-12-21 13:18:45,198 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 376 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 624 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 624 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-21 13:18:45,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [378 Valid, 279 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [624 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-21 13:18:45,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-12-21 13:18:45,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 157. [2021-12-21 13:18:45,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 112 states have (on average 1.0267857142857142) internal successors, (115), 110 states have internal predecessors, (115), 33 states have call successors, (33), 26 states have call predecessors, (33), 11 states have return successors, (84), 20 states have call predecessors, (84), 33 states have call successors, (84) [2021-12-21 13:18:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 232 transitions. [2021-12-21 13:18:45,216 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 232 transitions. Word has length 1563 [2021-12-21 13:18:45,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:18:45,217 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 232 transitions. [2021-12-21 13:18:45,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.425531914893617) internal successors, (114), 48 states have internal predecessors, (114), 29 states have call successors, (41), 1 states have call predecessors, (41), 19 states have return successors, (62), 42 states have call predecessors, (62), 29 states have call successors, (62) [2021-12-21 13:18:45,217 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 232 transitions. [2021-12-21 13:18:45,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2021-12-21 13:18:45,227 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:18:45,227 INFO L514 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:18:45,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-21 13:18:45,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-21 13:18:45,443 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:18:45,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:18:45,444 INFO L85 PathProgramCache]: Analyzing trace with hash 15284780, now seen corresponding path program 10 times [2021-12-21 13:18:45,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:18:45,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512539256] [2021-12-21 13:18:45,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:18:45,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:18:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 13:18:45,626 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 13:18:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 13:18:46,072 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 13:18:46,072 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 13:18:46,073 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-21 13:18:46,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-21 13:18:46,078 INFO L732 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1] [2021-12-21 13:18:46,083 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 13:18:46,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 01:18:46 BoogieIcfgContainer [2021-12-21 13:18:46,229 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 13:18:46,229 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 13:18:46,229 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 13:18:46,229 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 13:18:46,230 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:18:03" (3/4) ... [2021-12-21 13:18:46,231 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-21 13:18:46,372 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 13:18:46,372 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 13:18:46,373 INFO L158 Benchmark]: Toolchain (without parser) took 43760.63ms. Allocated memory was 94.4MB in the beginning and 509.6MB in the end (delta: 415.2MB). Free memory was 58.7MB in the beginning and 297.8MB in the end (delta: -239.1MB). Peak memory consumption was 176.7MB. Max. memory is 16.1GB. [2021-12-21 13:18:46,373 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 94.4MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 13:18:46,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.87ms. Allocated memory is still 94.4MB. Free memory was 58.4MB in the beginning and 70.3MB in the end (delta: -11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 13:18:46,374 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.84ms. Allocated memory is still 94.4MB. Free memory was 70.3MB in the beginning and 68.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 13:18:46,374 INFO L158 Benchmark]: Boogie Preprocessor took 24.18ms. Allocated memory is still 94.4MB. Free memory was 68.9MB in the beginning and 67.9MB in the end (delta: 963.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 13:18:46,375 INFO L158 Benchmark]: RCFGBuilder took 258.05ms. Allocated memory is still 94.4MB. Free memory was 67.9MB in the beginning and 59.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 13:18:46,375 INFO L158 Benchmark]: TraceAbstraction took 43105.41ms. Allocated memory was 94.4MB in the beginning and 509.6MB in the end (delta: 415.2MB). Free memory was 58.8MB in the beginning and 324.0MB in the end (delta: -265.2MB). Peak memory consumption was 300.9MB. Max. memory is 16.1GB. [2021-12-21 13:18:46,375 INFO L158 Benchmark]: Witness Printer took 143.57ms. Allocated memory is still 509.6MB. Free memory was 324.0MB in the beginning and 297.8MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2021-12-21 13:18:46,377 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.22ms. Allocated memory is still 94.4MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.87ms. Allocated memory is still 94.4MB. Free memory was 58.4MB in the beginning and 70.3MB in the end (delta: -11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.84ms. Allocated memory is still 94.4MB. Free memory was 70.3MB in the beginning and 68.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.18ms. Allocated memory is still 94.4MB. Free memory was 68.9MB in the beginning and 67.9MB in the end (delta: 963.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 258.05ms. Allocated memory is still 94.4MB. Free memory was 67.9MB in the beginning and 59.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 43105.41ms. Allocated memory was 94.4MB in the beginning and 509.6MB in the end (delta: 415.2MB). Free memory was 58.8MB in the beginning and 324.0MB in the end (delta: -265.2MB). Peak memory consumption was 300.9MB. Max. memory is 16.1GB. * Witness Printer took 143.57ms. Allocated memory is still 509.6MB. Free memory was 324.0MB in the beginning and 297.8MB in the end (delta: 26.2MB). Peak memory consumption was 27.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 = 10; VAL [x=10] [L27] CALL, EXPR fibo(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L8] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L10] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) 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); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L13] CALL, EXPR fibo(n-2) 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-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=9, fibo(n-1)=21, n=9] [L13] CALL, EXPR fibo(n-2) 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); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=9, fibo(n-1)=21, fibo(n-2)=13, n=9] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=10, fibo(n-1)=34, n=10] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) 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); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L13] CALL, EXPR fibo(n-2) 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-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=10, fibo(n-1)=34, fibo(n-2)=21, n=10] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) VAL [fibo(x)=55, x=10] [L27] int result = fibo(x); [L28] COND TRUE result == 55 VAL [result=55, x=10] [L29] reach_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.9s, OverallIterations: 13, TraceHistogramMax: 229, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.1s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1740 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1671 mSDsluCounter, 1496 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1222 mSDsCounter, 2321 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3146 IncrementalHoareTripleChecker+Invalid, 5467 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2321 mSolverCounterUnsat, 274 mSDtfsCounter, 3146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8889 GetRequests, 8504 SyntacticMatches, 17 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6064 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=9, InterpolantAutomatonStates: 250, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 132 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 33.3s InterpolantComputationTime, 8710 NumberOfCodeBlocks, 7850 NumberOfCodeBlocksAsserted, 178 NumberOfCheckSat, 11209 ConstructedInterpolants, 0 QuantifiedInterpolants, 15460 SizeOfPredicates, 57 NumberOfNonLiveVariables, 6571 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 600612/647382 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-21 13:18:46,442 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