./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b 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_2calls_10-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad793266928b7f31f4ee1b23974468bb9f6761486c9c1aae6fbee8a7b7aca3db --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 14:48:40,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 14:48:40,112 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 14:48:40,146 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 14:48:40,146 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 14:48:40,147 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 14:48:40,147 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 14:48:40,149 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 14:48:40,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 14:48:40,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 14:48:40,151 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 14:48:40,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 14:48:40,152 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 14:48:40,152 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 14:48:40,153 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 14:48:40,154 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 14:48:40,155 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 14:48:40,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 14:48:40,169 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 14:48:40,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 14:48:40,179 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 14:48:40,180 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 14:48:40,181 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 14:48:40,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 14:48:40,183 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 14:48:40,183 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 14:48:40,183 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 14:48:40,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 14:48:40,184 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 14:48:40,185 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 14:48:40,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 14:48:40,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 14:48:40,186 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 14:48:40,187 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 14:48:40,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 14:48:40,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 14:48:40,188 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 14:48:40,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 14:48:40,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 14:48:40,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 14:48:40,189 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 14:48:40,190 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 14:48:40,204 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 14:48:40,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 14:48:40,205 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 14:48:40,205 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 14:48:40,205 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 14:48:40,205 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 14:48:40,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 14:48:40,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 14:48:40,206 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 14:48:40,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 14:48:40,207 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 14:48:40,207 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 14:48:40,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 14:48:40,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 14:48:40,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 14:48:40,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 14:48:40,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 14:48:40,208 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 14:48:40,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 14:48:40,208 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 14:48:40,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 14:48:40,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 14:48:40,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 14:48:40,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 14:48:40,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 14:48:40,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 14:48:40,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 14:48:40,209 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 14:48:40,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 14:48:40,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 14:48:40,210 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 14:48:40,210 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 14:48:40,210 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 14:48:40,210 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 14:48:40,210 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 -> ad793266928b7f31f4ee1b23974468bb9f6761486c9c1aae6fbee8a7b7aca3db [2021-12-14 14:48:40,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 14:48:40,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 14:48:40,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 14:48:40,396 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 14:48:40,396 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 14:48:40,397 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2021-12-14 14:48:40,448 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82b92382a/b5e54afdb0864a4485972d6cc8b67264/FLAGca0399c2e [2021-12-14 14:48:40,767 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 14:48:40,768 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2021-12-14 14:48:40,777 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82b92382a/b5e54afdb0864a4485972d6cc8b67264/FLAGca0399c2e [2021-12-14 14:48:41,195 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82b92382a/b5e54afdb0864a4485972d6cc8b67264 [2021-12-14 14:48:41,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 14:48:41,198 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 14:48:41,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 14:48:41,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 14:48:41,208 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 14:48:41,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:48:41" (1/1) ... [2021-12-14 14:48:41,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a9d318d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:48:41, skipping insertion in model container [2021-12-14 14:48:41,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:48:41" (1/1) ... [2021-12-14 14:48:41,214 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 14:48:41,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 14:48:41,309 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_2calls_10-2.c[949,962] [2021-12-14 14:48:41,312 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 14:48:41,318 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 14:48:41,332 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_2calls_10-2.c[949,962] [2021-12-14 14:48:41,333 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 14:48:41,343 INFO L208 MainTranslator]: Completed translation [2021-12-14 14:48:41,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:48:41 WrapperNode [2021-12-14 14:48:41,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 14:48:41,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 14:48:41,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 14:48:41,361 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 14:48:41,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:48:41" (1/1) ... [2021-12-14 14:48:41,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:48:41" (1/1) ... [2021-12-14 14:48:41,386 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2021-12-14 14:48:41,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 14:48:41,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 14:48:41,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 14:48:41,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 14:48:41,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:48:41" (1/1) ... [2021-12-14 14:48:41,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:48:41" (1/1) ... [2021-12-14 14:48:41,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:48:41" (1/1) ... [2021-12-14 14:48:41,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:48:41" (1/1) ... [2021-12-14 14:48:41,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:48:41" (1/1) ... [2021-12-14 14:48:41,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:48:41" (1/1) ... [2021-12-14 14:48:41,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:48:41" (1/1) ... [2021-12-14 14:48:41,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 14:48:41,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 14:48:41,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 14:48:41,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 14:48:41,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:48:41" (1/1) ... [2021-12-14 14:48:41,429 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 14:48:41,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:48:41,446 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-14 14:48:41,448 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-14 14:48:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 14:48:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 14:48:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2021-12-14 14:48:41,471 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2021-12-14 14:48:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2021-12-14 14:48:41,471 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2021-12-14 14:48:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 14:48:41,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 14:48:41,510 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 14:48:41,511 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 14:48:41,600 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 14:48:41,604 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 14:48:41,605 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-14 14:48:41,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:48:41 BoogieIcfgContainer [2021-12-14 14:48:41,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 14:48:41,607 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 14:48:41,607 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 14:48:41,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 14:48:41,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 02:48:41" (1/3) ... [2021-12-14 14:48:41,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54320dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:48:41, skipping insertion in model container [2021-12-14 14:48:41,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:48:41" (2/3) ... [2021-12-14 14:48:41,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54320dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:48:41, skipping insertion in model container [2021-12-14 14:48:41,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:48:41" (3/3) ... [2021-12-14 14:48:41,616 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10-2.c [2021-12-14 14:48:41,620 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 14:48:41,620 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 14:48:41,655 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 14:48:41,682 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-14 14:48:41,682 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 14:48:41,693 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-14 14:48:41,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 14:48:41,699 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:48:41,699 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:48:41,699 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:48:41,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:48:41,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2021-12-14 14:48:41,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:48:41,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60263531] [2021-12-14 14:48:41,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:48:41,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:48:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:41,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:48:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:41,855 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-14 14:48:41,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:48:41,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60263531] [2021-12-14 14:48:41,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60263531] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:48:41,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:48:41,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 14:48:41,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655387414] [2021-12-14 14:48:41,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:48:41,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 14:48:41,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:48:41,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 14:48:41,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 14:48:41,880 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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-14 14:48:41,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:48:41,908 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2021-12-14 14:48:41,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 14:48:41,910 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-14 14:48:41,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:48:41,915 INFO L225 Difference]: With dead ends: 43 [2021-12-14 14:48:41,916 INFO L226 Difference]: Without dead ends: 27 [2021-12-14 14:48:41,918 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-14 14:48:41,920 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 126 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-14 14:48:41,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 126 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 14:48:41,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-14 14:48:41,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-14 14:48:41,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-14 14:48:41,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2021-12-14 14:48:41,946 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2021-12-14 14:48:41,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:48:41,947 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-12-14 14:48:41,947 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-14 14:48:41,947 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2021-12-14 14:48:41,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 14:48:41,948 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:48:41,948 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:48:41,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 14:48:41,949 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:48:41,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:48:41,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2021-12-14 14:48:41,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:48:41,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631976476] [2021-12-14 14:48:41,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:48:41,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:48:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:41,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:48:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:42,015 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-14 14:48:42,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:48:42,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631976476] [2021-12-14 14:48:42,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631976476] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:48:42,016 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:48:42,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 14:48:42,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668838694] [2021-12-14 14:48:42,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:48:42,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 14:48:42,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:48:42,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 14:48:42,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 14:48:42,020 INFO L87 Difference]: Start difference. First operand 27 states and 34 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-14 14:48:42,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:48:42,045 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2021-12-14 14:48:42,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 14:48:42,045 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-14 14:48:42,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:48:42,046 INFO L225 Difference]: With dead ends: 33 [2021-12-14 14:48:42,046 INFO L226 Difference]: Without dead ends: 29 [2021-12-14 14:48:42,047 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-14 14:48:42,048 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 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-14 14:48:42,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 14:48:42,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-14 14:48:42,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-12-14 14:48:42,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-14 14:48:42,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2021-12-14 14:48:42,052 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2021-12-14 14:48:42,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:48:42,053 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-12-14 14:48:42,053 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-14 14:48:42,053 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2021-12-14 14:48:42,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 14:48:42,053 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:48:42,053 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:48:42,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 14:48:42,054 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:48:42,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:48:42,054 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2021-12-14 14:48:42,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:48:42,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022964] [2021-12-14 14:48:42,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:48:42,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:48:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:42,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:48:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:42,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:42,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 14:48:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:42,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 14:48:42,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:48:42,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022964] [2021-12-14 14:48:42,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022964] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:48:42,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711170094] [2021-12-14 14:48:42,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:48:42,139 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:48:42,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:48:42,141 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-14 14:48:42,181 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-14 14:48:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:42,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 14:48:42,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:48:42,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 14:48:42,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:48:42,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 14:48:42,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711170094] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:48:42,494 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:48:42,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2021-12-14 14:48:42,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793474106] [2021-12-14 14:48:42,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:48:42,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 14:48:42,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:48:42,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 14:48:42,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-14 14:48:42,496 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 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-14 14:48:42,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:48:42,618 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2021-12-14 14:48:42,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 14:48:42,619 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 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-14 14:48:42,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:48:42,620 INFO L225 Difference]: With dead ends: 55 [2021-12-14 14:48:42,620 INFO L226 Difference]: Without dead ends: 31 [2021-12-14 14:48:42,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2021-12-14 14:48:42,621 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 14:48:42,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 141 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 14:48:42,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-14 14:48:42,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2021-12-14 14:48:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-14 14:48:42,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2021-12-14 14:48:42,627 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2021-12-14 14:48:42,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:48:42,628 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2021-12-14 14:48:42,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 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-14 14:48:42,628 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2021-12-14 14:48:42,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 14:48:42,629 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:48:42,629 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:48:42,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 14:48:42,850 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-14 14:48:42,850 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:48:42,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:48:42,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2021-12-14 14:48:42,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:48:42,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958690137] [2021-12-14 14:48:42,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:48:42,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:48:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:42,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:48:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:42,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:42,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:42,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 14:48:42,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:48:42,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958690137] [2021-12-14 14:48:42,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958690137] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:48:42,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802995119] [2021-12-14 14:48:42,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:48:42,935 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:48:42,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:48:42,936 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-14 14:48:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:42,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 14:48:42,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:48:42,976 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-14 14:48:43,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 14:48:43,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:48:43,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 14:48:43,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802995119] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:48:43,177 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:48:43,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2021-12-14 14:48:43,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641881192] [2021-12-14 14:48:43,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:48:43,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 14:48:43,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:48:43,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 14:48:43,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-12-14 14:48:43,179 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 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-14 14:48:43,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:48:43,329 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2021-12-14 14:48:43,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 14:48:43,330 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 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-14 14:48:43,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:48:43,331 INFO L225 Difference]: With dead ends: 51 [2021-12-14 14:48:43,332 INFO L226 Difference]: Without dead ends: 47 [2021-12-14 14:48:43,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-12-14 14:48:43,333 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 14:48:43,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 120 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 14:48:43,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-14 14:48:43,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2021-12-14 14:48:43,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2021-12-14 14:48:43,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2021-12-14 14:48:43,340 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2021-12-14 14:48:43,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:48:43,340 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2021-12-14 14:48:43,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 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-14 14:48:43,341 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2021-12-14 14:48:43,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-14 14:48:43,342 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:48:43,342 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:48:43,359 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-14 14:48:43,558 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-14 14:48:43,558 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:48:43,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:48:43,558 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2021-12-14 14:48:43,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:48:43,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013687690] [2021-12-14 14:48:43,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:48:43,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:48:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:43,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:48:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:43,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:43,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:43,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 14:48:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:43,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 14:48:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 14:48:43,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:48:43,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013687690] [2021-12-14 14:48:43,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013687690] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:48:43,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103399019] [2021-12-14 14:48:43,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:48:43,643 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:48:43,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:48:43,644 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-14 14:48:43,653 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-14 14:48:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:43,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 14:48:43,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:48:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 14:48:43,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:48:44,040 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 14:48:44,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103399019] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:48:44,040 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:48:44,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2021-12-14 14:48:44,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272499163] [2021-12-14 14:48:44,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:48:44,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 14:48:44,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:48:44,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 14:48:44,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-12-14 14:48:44,041 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-14 14:48:44,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:48:44,194 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2021-12-14 14:48:44,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 14:48:44,195 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2021-12-14 14:48:44,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:48:44,196 INFO L225 Difference]: With dead ends: 105 [2021-12-14 14:48:44,196 INFO L226 Difference]: Without dead ends: 63 [2021-12-14 14:48:44,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2021-12-14 14:48:44,197 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 65 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 14:48:44,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 118 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 14:48:44,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-14 14:48:44,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-12-14 14:48:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2021-12-14 14:48:44,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2021-12-14 14:48:44,205 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2021-12-14 14:48:44,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:48:44,205 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2021-12-14 14:48:44,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-14 14:48:44,205 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2021-12-14 14:48:44,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 14:48:44,206 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:48:44,206 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:48:44,223 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-14 14:48:44,423 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-14 14:48:44,423 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:48:44,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:48:44,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2021-12-14 14:48:44,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:48:44,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013624914] [2021-12-14 14:48:44,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:48:44,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:48:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:44,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:48:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:44,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:44,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:44,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:44,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-14 14:48:44,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:48:44,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013624914] [2021-12-14 14:48:44,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013624914] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:48:44,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503672684] [2021-12-14 14:48:44,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:48:44,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:48:44,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:48:44,505 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-14 14:48:44,506 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-14 14:48:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:44,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 14:48:44,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:48:44,626 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 14:48:44,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:48:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 14:48:44,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503672684] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:48:44,862 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:48:44,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2021-12-14 14:48:44,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441163599] [2021-12-14 14:48:44,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:48:44,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-14 14:48:44,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:48:44,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-14 14:48:44,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-12-14 14:48:44,863 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-14 14:48:45,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:48:45,144 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2021-12-14 14:48:45,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 14:48:45,144 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 37 [2021-12-14 14:48:45,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:48:45,151 INFO L225 Difference]: With dead ends: 177 [2021-12-14 14:48:45,152 INFO L226 Difference]: Without dead ends: 117 [2021-12-14 14:48:45,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2021-12-14 14:48:45,156 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 60 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 14:48:45,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 276 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 14:48:45,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-14 14:48:45,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2021-12-14 14:48:45,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 69 states have internal predecessors, (80), 21 states have call successors, (21), 7 states have call predecessors, (21), 15 states have return successors, (65), 26 states have call predecessors, (65), 21 states have call successors, (65) [2021-12-14 14:48:45,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2021-12-14 14:48:45,168 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2021-12-14 14:48:45,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:48:45,168 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2021-12-14 14:48:45,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-14 14:48:45,168 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2021-12-14 14:48:45,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-14 14:48:45,170 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:48:45,171 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:48:45,187 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-14 14:48:45,387 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-14 14:48:45,387 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:48:45,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:48:45,387 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2021-12-14 14:48:45,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:48:45,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549123519] [2021-12-14 14:48:45,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:48:45,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:48:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:45,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:48:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:45,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:45,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:45,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:45,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:45,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:45,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 14:48:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:45,497 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-14 14:48:45,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:48:45,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549123519] [2021-12-14 14:48:45,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549123519] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:48:45,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125309121] [2021-12-14 14:48:45,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:48:45,498 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:48:45,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:48:45,499 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-14 14:48:45,500 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-14 14:48:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:45,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 14:48:45,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:48:45,640 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-14 14:48:45,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:48:46,033 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-14 14:48:46,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125309121] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:48:46,033 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:48:46,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2021-12-14 14:48:46,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942797908] [2021-12-14 14:48:46,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:48:46,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-14 14:48:46,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:48:46,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-14 14:48:46,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-12-14 14:48:46,035 INFO L87 Difference]: Start difference. First operand 103 states and 166 transitions. Second operand has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2021-12-14 14:48:46,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:48:46,357 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2021-12-14 14:48:46,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-14 14:48:46,357 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) Word has length 51 [2021-12-14 14:48:46,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:48:46,359 INFO L225 Difference]: With dead ends: 255 [2021-12-14 14:48:46,359 INFO L226 Difference]: Without dead ends: 155 [2021-12-14 14:48:46,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2021-12-14 14:48:46,361 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 76 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 14:48:46,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 280 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 14:48:46,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-14 14:48:46,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2021-12-14 14:48:46,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (66), 27 states have call predecessors, (66), 24 states have call successors, (66) [2021-12-14 14:48:46,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2021-12-14 14:48:46,373 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2021-12-14 14:48:46,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:48:46,373 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2021-12-14 14:48:46,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2021-12-14 14:48:46,374 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2021-12-14 14:48:46,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-14 14:48:46,376 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:48:46,376 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:48:46,401 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-14 14:48:46,595 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-14 14:48:46,596 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:48:46,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:48:46,596 INFO L85 PathProgramCache]: Analyzing trace with hash -586612948, now seen corresponding path program 1 times [2021-12-14 14:48:46,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:48:46,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197528145] [2021-12-14 14:48:46,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:48:46,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:48:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:46,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:48:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:46,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:46,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:46,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:46,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:46,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:46,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:46,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:48:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:46,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 14:48:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:46,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:46,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:46,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:46,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:46,756 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-12-14 14:48:46,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:48:46,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197528145] [2021-12-14 14:48:46,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197528145] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:48:46,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333752086] [2021-12-14 14:48:46,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:48:46,756 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:48:46,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:48:46,769 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-14 14:48:46,769 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-14 14:48:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:46,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 14:48:46,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:48:47,038 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 92 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2021-12-14 14:48:47,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:48:47,638 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 102 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-12-14 14:48:47,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333752086] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:48:47,639 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:48:47,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 24 [2021-12-14 14:48:47,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944622733] [2021-12-14 14:48:47,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:48:47,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-14 14:48:47,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:48:47,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-14 14:48:47,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2021-12-14 14:48:47,640 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand has 24 states, 22 states have (on average 3.5) internal successors, (77), 24 states have internal predecessors, (77), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) [2021-12-14 14:48:47,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:48:47,957 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2021-12-14 14:48:47,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-14 14:48:47,957 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.5) internal successors, (77), 24 states have internal predecessors, (77), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) Word has length 93 [2021-12-14 14:48:47,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:48:47,958 INFO L225 Difference]: With dead ends: 240 [2021-12-14 14:48:47,958 INFO L226 Difference]: Without dead ends: 107 [2021-12-14 14:48:47,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2021-12-14 14:48:47,960 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 111 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 14:48:47,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 270 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 14:48:47,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-14 14:48:47,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2021-12-14 14:48:47,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 58 states have internal predecessors, (67), 14 states have call successors, (14), 8 states have call predecessors, (14), 12 states have return successors, (35), 17 states have call predecessors, (35), 14 states have call successors, (35) [2021-12-14 14:48:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2021-12-14 14:48:47,966 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 93 [2021-12-14 14:48:47,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:48:47,966 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2021-12-14 14:48:47,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.5) internal successors, (77), 24 states have internal predecessors, (77), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) [2021-12-14 14:48:47,966 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2021-12-14 14:48:47,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-12-14 14:48:47,967 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:48:47,967 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:48:47,985 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-14 14:48:48,187 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-14 14:48:48,188 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:48:48,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:48:48,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1129417830, now seen corresponding path program 1 times [2021-12-14 14:48:48,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:48:48,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735575655] [2021-12-14 14:48:48,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:48:48,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:48:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:48,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:48:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:48,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:48,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:48,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:48,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:48,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:48,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:48,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:48,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:48:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:48,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 14:48:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:48,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:48,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:48,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:48,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:48,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:48,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:48:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:48,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-14 14:48:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:48,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:48,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:48,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:48,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:48,444 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 73 proven. 135 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2021-12-14 14:48:48,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:48:48,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735575655] [2021-12-14 14:48:48,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735575655] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:48:48,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628565277] [2021-12-14 14:48:48,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:48:48,445 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:48:48,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:48:48,446 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-14 14:48:48,447 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-14 14:48:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:48,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-14 14:48:48,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:48:48,758 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 36 proven. 211 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2021-12-14 14:48:48,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:48:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 36 proven. 227 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2021-12-14 14:48:49,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628565277] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:48:49,700 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:48:49,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 26 [2021-12-14 14:48:49,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366334976] [2021-12-14 14:48:49,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:48:49,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-14 14:48:49,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:48:49,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-14 14:48:49,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2021-12-14 14:48:49,702 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2021-12-14 14:48:50,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:48:50,117 INFO L93 Difference]: Finished difference Result 214 states and 372 transitions. [2021-12-14 14:48:50,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-14 14:48:50,118 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) Word has length 148 [2021-12-14 14:48:50,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:48:50,119 INFO L225 Difference]: With dead ends: 214 [2021-12-14 14:48:50,119 INFO L226 Difference]: Without dead ends: 134 [2021-12-14 14:48:50,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=1285, Unknown=0, NotChecked=0, Total=1560 [2021-12-14 14:48:50,121 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 108 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 14:48:50,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 313 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 14:48:50,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-14 14:48:50,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2021-12-14 14:48:50,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 78 states have internal predecessors, (93), 20 states have call successors, (20), 11 states have call predecessors, (20), 16 states have return successors, (56), 24 states have call predecessors, (56), 20 states have call successors, (56) [2021-12-14 14:48:50,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2021-12-14 14:48:50,128 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 148 [2021-12-14 14:48:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:48:50,128 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2021-12-14 14:48:50,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2021-12-14 14:48:50,129 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2021-12-14 14:48:50,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-12-14 14:48:50,130 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:48:50,130 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 17, 16, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:48:50,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-14 14:48:50,361 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-14 14:48:50,361 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:48:50,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:48:50,362 INFO L85 PathProgramCache]: Analyzing trace with hash -399650163, now seen corresponding path program 2 times [2021-12-14 14:48:50,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:48:50,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226659062] [2021-12-14 14:48:50,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:48:50,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:48:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:48:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:48:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:48:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 14:48:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-14 14:48:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:48:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:48:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 14:48:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 169 proven. 360 refuted. 0 times theorem prover too weak. 1503 trivial. 0 not checked. [2021-12-14 14:48:50,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:48:50,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226659062] [2021-12-14 14:48:50,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226659062] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:48:50,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110979901] [2021-12-14 14:48:50,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 14:48:50,730 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:48:50,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:48:50,731 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-14 14:48:50,732 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-14 14:48:50,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 14:48:50,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 14:48:50,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-14 14:48:50,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:48:51,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 79 proven. 543 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2021-12-14 14:48:51,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:48:52,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 79 proven. 567 refuted. 0 times theorem prover too weak. 1386 trivial. 0 not checked. [2021-12-14 14:48:52,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110979901] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:48:52,727 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:48:52,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 28 [2021-12-14 14:48:52,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897316835] [2021-12-14 14:48:52,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:48:52,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-14 14:48:52,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:48:52,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-14 14:48:52,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2021-12-14 14:48:52,729 INFO L87 Difference]: Start difference. First operand 114 states and 169 transitions. Second operand has 28 states, 26 states have (on average 3.5) internal successors, (91), 28 states have internal predecessors, (91), 22 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (37), 14 states have call predecessors, (37), 22 states have call successors, (37) [2021-12-14 14:48:53,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:48:53,233 INFO L93 Difference]: Finished difference Result 260 states and 447 transitions. [2021-12-14 14:48:53,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-14 14:48:53,234 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.5) internal successors, (91), 28 states have internal predecessors, (91), 22 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (37), 14 states have call predecessors, (37), 22 states have call successors, (37) Word has length 271 [2021-12-14 14:48:53,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:48:53,236 INFO L225 Difference]: With dead ends: 260 [2021-12-14 14:48:53,236 INFO L226 Difference]: Without dead ends: 155 [2021-12-14 14:48:53,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 606 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=342, Invalid=1638, Unknown=0, NotChecked=0, Total=1980 [2021-12-14 14:48:53,238 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 127 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 14:48:53,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 361 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 14:48:53,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-14 14:48:53,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2021-12-14 14:48:53,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 101 states have (on average 1.2376237623762376) internal successors, (125), 99 states have internal predecessors, (125), 26 states have call successors, (26), 18 states have call predecessors, (26), 17 states have return successors, (73), 27 states have call predecessors, (73), 26 states have call successors, (73) [2021-12-14 14:48:53,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 224 transitions. [2021-12-14 14:48:53,248 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 224 transitions. Word has length 271 [2021-12-14 14:48:53,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:48:53,249 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 224 transitions. [2021-12-14 14:48:53,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.5) internal successors, (91), 28 states have internal predecessors, (91), 22 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (37), 14 states have call predecessors, (37), 22 states have call successors, (37) [2021-12-14 14:48:53,249 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 224 transitions. [2021-12-14 14:48:53,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2021-12-14 14:48:53,253 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:48:53,253 INFO L514 BasicCegarLoop]: trace histogram [30, 30, 25, 25, 22, 22, 15, 15, 15, 15, 15, 15, 15, 12, 12, 12, 12, 12, 12, 12, 10, 8, 7, 3, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:48:53,273 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-14 14:48:53,467 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-14 14:48:53,467 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:48:53,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:48:53,468 INFO L85 PathProgramCache]: Analyzing trace with hash -854779469, now seen corresponding path program 3 times [2021-12-14 14:48:53,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:48:53,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278474480] [2021-12-14 14:48:53,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:48:53,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:48:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:48:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:48:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:48:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-14 14:48:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-14 14:48:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:48:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:48:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2021-12-14 14:48:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:48:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:48:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:48:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:53,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4086 backedges. 245 proven. 607 refuted. 0 times theorem prover too weak. 3234 trivial. 0 not checked. [2021-12-14 14:48:53,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:48:53,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278474480] [2021-12-14 14:48:53,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278474480] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:48:53,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481904956] [2021-12-14 14:48:53,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 14:48:53,927 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:48:53,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:48:53,928 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-14 14:48:53,959 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-14 14:48:54,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2021-12-14 14:48:54,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 14:48:54,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 14:48:54,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:48:54,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4086 backedges. 726 proven. 42 refuted. 0 times theorem prover too weak. 3318 trivial. 0 not checked. [2021-12-14 14:48:54,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:48:55,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4086 backedges. 726 proven. 43 refuted. 0 times theorem prover too weak. 3317 trivial. 0 not checked. [2021-12-14 14:48:55,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481904956] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:48:55,774 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:48:55,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 26 [2021-12-14 14:48:55,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171204076] [2021-12-14 14:48:55,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:48:55,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-14 14:48:55,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:48:55,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-14 14:48:55,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2021-12-14 14:48:55,776 INFO L87 Difference]: Start difference. First operand 145 states and 224 transitions. Second operand has 26 states, 25 states have (on average 3.44) internal successors, (86), 26 states have internal predecessors, (86), 15 states have call successors, (26), 1 states have call predecessors, (26), 9 states have return successors, (32), 16 states have call predecessors, (32), 15 states have call successors, (32) [2021-12-14 14:48:56,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:48:56,071 INFO L93 Difference]: Finished difference Result 308 states and 520 transitions. [2021-12-14 14:48:56,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-14 14:48:56,072 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.44) internal successors, (86), 26 states have internal predecessors, (86), 15 states have call successors, (26), 1 states have call predecessors, (26), 9 states have return successors, (32), 16 states have call predecessors, (32), 15 states have call successors, (32) Word has length 378 [2021-12-14 14:48:56,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:48:56,074 INFO L225 Difference]: With dead ends: 308 [2021-12-14 14:48:56,074 INFO L226 Difference]: Without dead ends: 168 [2021-12-14 14:48:56,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 888 GetRequests, 853 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=991, Unknown=0, NotChecked=0, Total=1190 [2021-12-14 14:48:56,080 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 91 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 14:48:56,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 302 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 14:48:56,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-12-14 14:48:56,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2021-12-14 14:48:56,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 116 states have (on average 1.1379310344827587) internal successors, (132), 112 states have internal predecessors, (132), 32 states have call successors, (32), 24 states have call predecessors, (32), 16 states have return successors, (79), 28 states have call predecessors, (79), 32 states have call successors, (79) [2021-12-14 14:48:56,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2021-12-14 14:48:56,091 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 378 [2021-12-14 14:48:56,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:48:56,091 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2021-12-14 14:48:56,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.44) internal successors, (86), 26 states have internal predecessors, (86), 15 states have call successors, (26), 1 states have call predecessors, (26), 9 states have return successors, (32), 16 states have call predecessors, (32), 15 states have call successors, (32) [2021-12-14 14:48:56,091 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2021-12-14 14:48:56,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2021-12-14 14:48:56,097 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:48:56,097 INFO L514 BasicCegarLoop]: trace histogram [45, 45, 42, 42, 37, 34, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 16, 12, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:48:56,117 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-14 14:48:56,313 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-14 14:48:56,313 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:48:56,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:48:56,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1952053737, now seen corresponding path program 4 times [2021-12-14 14:48:56,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:48:56,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185006071] [2021-12-14 14:48:56,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:48:56,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:48:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:48:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:48:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:48:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:48:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 14:48:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:48:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:48:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:48:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2021-12-14 14:48:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:56,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:48:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:48:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:48:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 14:48:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:48:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:48:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:48:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:48:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:48:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:48:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:48:57,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10395 backedges. 367 proven. 1344 refuted. 0 times theorem prover too weak. 8684 trivial. 0 not checked. [2021-12-14 14:48:57,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:48:57,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185006071] [2021-12-14 14:48:57,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185006071] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:48:57,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616968182] [2021-12-14 14:48:57,100 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 14:48:57,100 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:48:57,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:48:57,110 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-14 14:48:57,140 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-14 14:48:57,286 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 14:48:57,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 14:48:57,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-14 14:48:57,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:48:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10395 backedges. 201 proven. 1550 refuted. 0 times theorem prover too weak. 8644 trivial. 0 not checked. [2021-12-14 14:48:57,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 10395 backedges. 201 proven. 1583 refuted. 0 times theorem prover too weak. 8611 trivial. 0 not checked. [2021-12-14 14:49:00,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616968182] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:00,612 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:00,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 19] total 33 [2021-12-14 14:49:00,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328325397] [2021-12-14 14:49:00,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:00,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-14 14:49:00,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:00,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-14 14:49:00,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2021-12-14 14:49:00,614 INFO L87 Difference]: Start difference. First operand 165 states and 243 transitions. Second operand has 33 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 33 states have internal predecessors, (103), 27 states have call successors, (34), 1 states have call predecessors, (34), 13 states have return successors, (44), 18 states have call predecessors, (44), 27 states have call successors, (44) [2021-12-14 14:49:01,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:01,209 INFO L93 Difference]: Finished difference Result 382 states and 633 transitions. [2021-12-14 14:49:01,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-14 14:49:01,209 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 33 states have internal predecessors, (103), 27 states have call successors, (34), 1 states have call predecessors, (34), 13 states have return successors, (44), 18 states have call predecessors, (44), 27 states have call successors, (44) Word has length 597 [2021-12-14 14:49:01,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:01,211 INFO L225 Difference]: With dead ends: 382 [2021-12-14 14:49:01,211 INFO L226 Difference]: Without dead ends: 220 [2021-12-14 14:49:01,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1403 GetRequests, 1352 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=437, Invalid=2319, Unknown=0, NotChecked=0, Total=2756 [2021-12-14 14:49:01,213 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 128 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:01,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 413 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 14:49:01,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-12-14 14:49:01,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 200. [2021-12-14 14:49:01,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 140 states have (on average 1.1428571428571428) internal successors, (160), 137 states have internal predecessors, (160), 41 states have call successors, (41), 30 states have call predecessors, (41), 18 states have return successors, (101), 32 states have call predecessors, (101), 41 states have call successors, (101) [2021-12-14 14:49:01,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 302 transitions. [2021-12-14 14:49:01,224 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 302 transitions. Word has length 597 [2021-12-14 14:49:01,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:01,225 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 302 transitions. [2021-12-14 14:49:01,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 33 states have internal predecessors, (103), 27 states have call successors, (34), 1 states have call predecessors, (34), 13 states have return successors, (44), 18 states have call predecessors, (44), 27 states have call successors, (44) [2021-12-14 14:49:01,225 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 302 transitions. [2021-12-14 14:49:01,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 801 [2021-12-14 14:49:01,237 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:01,238 INFO L514 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 47, 47, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 18, 18, 12, 11, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:01,257 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-14 14:49:01,455 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-14 14:49:01,455 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:01,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:01,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1941284234, now seen corresponding path program 5 times [2021-12-14 14:49:01,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:01,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362920967] [2021-12-14 14:49:01,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:01,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:01,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:01,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:49:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-14 14:49:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2021-12-14 14:49:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:49:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-14 14:49:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2021-12-14 14:49:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 554 [2021-12-14 14:49:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:49:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-14 14:49:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:02,700 INFO L134 CoverageAnalysis]: Checked inductivity of 18866 backedges. 678 proven. 2278 refuted. 0 times theorem prover too weak. 15910 trivial. 0 not checked. [2021-12-14 14:49:02,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:02,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362920967] [2021-12-14 14:49:02,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362920967] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:49:02,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038215366] [2021-12-14 14:49:02,701 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-14 14:49:02,701 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:02,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:02,702 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:49:02,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-14 14:49:02,922 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2021-12-14 14:49:02,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 14:49:02,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-14 14:49:02,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:49:03,780 INFO L134 CoverageAnalysis]: Checked inductivity of 18866 backedges. 10301 proven. 414 refuted. 0 times theorem prover too weak. 8151 trivial. 0 not checked. [2021-12-14 14:49:03,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:07,348 INFO L134 CoverageAnalysis]: Checked inductivity of 18866 backedges. 1631 proven. 1673 refuted. 0 times theorem prover too weak. 15562 trivial. 0 not checked. [2021-12-14 14:49:07,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038215366] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:07,348 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:07,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 21] total 41 [2021-12-14 14:49:07,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567722669] [2021-12-14 14:49:07,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:07,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-14 14:49:07,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:07,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-14 14:49:07,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1417, Unknown=0, NotChecked=0, Total=1640 [2021-12-14 14:49:07,351 INFO L87 Difference]: Start difference. First operand 200 states and 302 transitions. Second operand has 41 states, 41 states have (on average 3.2195121951219514) internal successors, (132), 41 states have internal predecessors, (132), 29 states have call successors, (42), 2 states have call predecessors, (42), 17 states have return successors, (54), 26 states have call predecessors, (54), 29 states have call successors, (54) [2021-12-14 14:49:08,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:08,154 INFO L93 Difference]: Finished difference Result 441 states and 709 transitions. [2021-12-14 14:49:08,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-14 14:49:08,156 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.2195121951219514) internal successors, (132), 41 states have internal predecessors, (132), 29 states have call successors, (42), 2 states have call predecessors, (42), 17 states have return successors, (54), 26 states have call predecessors, (54), 29 states have call successors, (54) Word has length 800 [2021-12-14 14:49:08,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:08,158 INFO L225 Difference]: With dead ends: 441 [2021-12-14 14:49:08,158 INFO L226 Difference]: Without dead ends: 239 [2021-12-14 14:49:08,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1872 GetRequests, 1812 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1095 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=513, Invalid=3027, Unknown=0, NotChecked=0, Total=3540 [2021-12-14 14:49:08,160 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 131 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:08,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 772 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-14 14:49:08,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-12-14 14:49:08,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 224. [2021-12-14 14:49:08,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 160 states have (on average 1.05) internal successors, (168), 154 states have internal predecessors, (168), 45 states have call successors, (45), 37 states have call predecessors, (45), 18 states have return successors, (106), 32 states have call predecessors, (106), 45 states have call successors, (106) [2021-12-14 14:49:08,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 319 transitions. [2021-12-14 14:49:08,176 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 319 transitions. Word has length 800 [2021-12-14 14:49:08,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:08,177 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 319 transitions. [2021-12-14 14:49:08,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.2195121951219514) internal successors, (132), 41 states have internal predecessors, (132), 29 states have call successors, (42), 2 states have call predecessors, (42), 17 states have return successors, (54), 26 states have call predecessors, (54), 29 states have call successors, (54) [2021-12-14 14:49:08,177 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 319 transitions. [2021-12-14 14:49:08,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2021-12-14 14:49:08,180 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:08,180 INFO L514 BasicCegarLoop]: trace histogram [48, 48, 45, 45, 38, 37, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 22, 22, 22, 22, 15, 14, 11, 7, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:08,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-14 14:49:08,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-14 14:49:08,398 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:08,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:08,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1548197760, now seen corresponding path program 6 times [2021-12-14 14:49:08,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:08,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283570427] [2021-12-14 14:49:08,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:08,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:08,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:08,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:08,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:08,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:08,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:08,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:08,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:08,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:08,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:08,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:08,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:08,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:49:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-14 14:49:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:49:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2021-12-14 14:49:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2021-12-14 14:49:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:49:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 11869 backedges. 1049 proven. 1539 refuted. 0 times theorem prover too weak. 9281 trivial. 0 not checked. [2021-12-14 14:49:09,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:09,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283570427] [2021-12-14 14:49:09,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283570427] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:49:09,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434182675] [2021-12-14 14:49:09,343 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-14 14:49:09,343 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:09,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:09,344 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:49:09,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-14 14:49:09,572 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2021-12-14 14:49:09,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 14:49:09,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-14 14:49:09,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:49:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 11869 backedges. 483 proven. 1404 refuted. 0 times theorem prover too weak. 9982 trivial. 0 not checked. [2021-12-14 14:49:10,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 11869 backedges. 485 proven. 1435 refuted. 0 times theorem prover too weak. 9949 trivial. 0 not checked. [2021-12-14 14:49:12,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434182675] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:12,889 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:12,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13, 19] total 43 [2021-12-14 14:49:12,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23866745] [2021-12-14 14:49:12,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:12,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-14 14:49:12,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:12,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-14 14:49:12,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1542, Unknown=0, NotChecked=0, Total=1806 [2021-12-14 14:49:12,891 INFO L87 Difference]: Start difference. First operand 224 states and 319 transitions. Second operand has 43 states, 42 states have (on average 2.8333333333333335) internal successors, (119), 43 states have internal predecessors, (119), 29 states have call successors, (37), 1 states have call predecessors, (37), 20 states have return successors, (50), 30 states have call predecessors, (50), 29 states have call successors, (50) [2021-12-14 14:49:14,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:14,065 INFO L93 Difference]: Finished difference Result 552 states and 888 transitions. [2021-12-14 14:49:14,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-12-14 14:49:14,065 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.8333333333333335) internal successors, (119), 43 states have internal predecessors, (119), 29 states have call successors, (37), 1 states have call predecessors, (37), 20 states have return successors, (50), 30 states have call predecessors, (50), 29 states have call successors, (50) Word has length 637 [2021-12-14 14:49:14,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:14,068 INFO L225 Difference]: With dead ends: 552 [2021-12-14 14:49:14,068 INFO L226 Difference]: Without dead ends: 324 [2021-12-14 14:49:14,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1517 GetRequests, 1439 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1871 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=841, Invalid=5165, Unknown=0, NotChecked=0, Total=6006 [2021-12-14 14:49:14,073 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 228 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:14,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 532 Invalid, 1866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-14 14:49:14,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-12-14 14:49:14,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 248. [2021-12-14 14:49:14,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 177 states have (on average 1.0451977401129944) internal successors, (185), 171 states have internal predecessors, (185), 50 states have call successors, (50), 41 states have call predecessors, (50), 20 states have return successors, (117), 35 states have call predecessors, (117), 50 states have call successors, (117) [2021-12-14 14:49:14,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 352 transitions. [2021-12-14 14:49:14,085 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 352 transitions. Word has length 637 [2021-12-14 14:49:14,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:14,085 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 352 transitions. [2021-12-14 14:49:14,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.8333333333333335) internal successors, (119), 43 states have internal predecessors, (119), 29 states have call successors, (37), 1 states have call predecessors, (37), 20 states have return successors, (50), 30 states have call predecessors, (50), 29 states have call successors, (50) [2021-12-14 14:49:14,085 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 352 transitions. [2021-12-14 14:49:14,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2021-12-14 14:49:14,091 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:14,092 INFO L514 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 62, 60, 38, 38, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 37, 25, 22, 15, 14, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:14,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-14 14:49:14,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-14 14:49:14,307 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:14,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:14,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1161748685, now seen corresponding path program 7 times [2021-12-14 14:49:14,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:14,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766333728] [2021-12-14 14:49:14,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:14,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:14,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:49:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-14 14:49:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-14 14:49:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:49:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-14 14:49:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 568 [2021-12-14 14:49:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:49:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2021-12-14 14:49:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:49:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-14 14:49:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:15,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:16,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:16,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:16,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:16,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:16,006 INFO L134 CoverageAnalysis]: Checked inductivity of 31637 backedges. 1986 proven. 3188 refuted. 0 times theorem prover too weak. 26463 trivial. 0 not checked. [2021-12-14 14:49:16,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:16,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766333728] [2021-12-14 14:49:16,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766333728] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:49:16,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709253056] [2021-12-14 14:49:16,007 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-14 14:49:16,007 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:16,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:16,008 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:49:16,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-14 14:49:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:16,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 2315 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-14 14:49:16,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:49:17,428 INFO L134 CoverageAnalysis]: Checked inductivity of 31637 backedges. 1449 proven. 2506 refuted. 0 times theorem prover too weak. 27682 trivial. 0 not checked. [2021-12-14 14:49:17,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:22,179 INFO L134 CoverageAnalysis]: Checked inductivity of 31637 backedges. 1451 proven. 2556 refuted. 0 times theorem prover too weak. 27630 trivial. 0 not checked. [2021-12-14 14:49:22,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709253056] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:22,179 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:22,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 15, 23] total 48 [2021-12-14 14:49:22,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523211967] [2021-12-14 14:49:22,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:22,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-14 14:49:22,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:22,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-14 14:49:22,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1955, Unknown=0, NotChecked=0, Total=2256 [2021-12-14 14:49:22,182 INFO L87 Difference]: Start difference. First operand 248 states and 352 transitions. Second operand has 48 states, 46 states have (on average 2.8043478260869565) internal successors, (129), 48 states have internal predecessors, (129), 36 states have call successors, (43), 1 states have call predecessors, (43), 20 states have return successors, (60), 32 states have call predecessors, (60), 36 states have call successors, (60) [2021-12-14 14:49:23,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:23,315 INFO L93 Difference]: Finished difference Result 535 states and 870 transitions. [2021-12-14 14:49:23,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-12-14 14:49:23,316 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 2.8043478260869565) internal successors, (129), 48 states have internal predecessors, (129), 36 states have call successors, (43), 1 states have call predecessors, (43), 20 states have return successors, (60), 32 states have call predecessors, (60), 36 states have call successors, (60) Word has length 1032 [2021-12-14 14:49:23,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:23,318 INFO L225 Difference]: With dead ends: 535 [2021-12-14 14:49:23,318 INFO L226 Difference]: Without dead ends: 270 [2021-12-14 14:49:23,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2419 GetRequests, 2345 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1719 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=708, Invalid=4694, Unknown=0, NotChecked=0, Total=5402 [2021-12-14 14:49:23,321 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 199 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 1890 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 1890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:23,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 969 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 1890 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-14 14:49:23,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-12-14 14:49:23,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 246. [2021-12-14 14:49:23,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 175 states have (on average 1.0457142857142858) internal successors, (183), 170 states have internal predecessors, (183), 51 states have call successors, (51), 41 states have call predecessors, (51), 19 states have return successors, (69), 34 states have call predecessors, (69), 51 states have call successors, (69) [2021-12-14 14:49:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 303 transitions. [2021-12-14 14:49:23,330 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 303 transitions. Word has length 1032 [2021-12-14 14:49:23,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:23,330 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 303 transitions. [2021-12-14 14:49:23,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 2.8043478260869565) internal successors, (129), 48 states have internal predecessors, (129), 36 states have call successors, (43), 1 states have call predecessors, (43), 20 states have return successors, (60), 32 states have call predecessors, (60), 36 states have call successors, (60) [2021-12-14 14:49:23,331 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 303 transitions. [2021-12-14 14:49:23,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2021-12-14 14:49:23,336 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:23,337 INFO L514 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 61, 61, 38, 38, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 37, 24, 23, 15, 14, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:23,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-14 14:49:23,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-14 14:49:23,551 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:23,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:23,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1241761113, now seen corresponding path program 8 times [2021-12-14 14:49:23,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:23,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734489537] [2021-12-14 14:49:23,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:23,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:23,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:49:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-14 14:49:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-14 14:49:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:49:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2021-12-14 14:49:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:49:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-14 14:49:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2021-12-14 14:49:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:24,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:49:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-14 14:49:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 31636 backedges. 2682 proven. 2990 refuted. 0 times theorem prover too weak. 25964 trivial. 0 not checked. [2021-12-14 14:49:25,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:25,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734489537] [2021-12-14 14:49:25,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734489537] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:49:25,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058995258] [2021-12-14 14:49:25,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 14:49:25,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:25,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:25,202 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:49:25,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-14 14:49:25,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 14:49:25,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 14:49:25,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 2315 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-14 14:49:25,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:49:26,567 INFO L134 CoverageAnalysis]: Checked inductivity of 31636 backedges. 2426 proven. 749 refuted. 0 times theorem prover too weak. 28461 trivial. 0 not checked. [2021-12-14 14:49:26,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 31636 backedges. 2432 proven. 776 refuted. 0 times theorem prover too weak. 28428 trivial. 0 not checked. [2021-12-14 14:49:30,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058995258] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:30,063 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:30,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 13, 19] total 44 [2021-12-14 14:49:30,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633800747] [2021-12-14 14:49:30,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:30,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-12-14 14:49:30,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:30,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-14 14:49:30,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1619, Unknown=0, NotChecked=0, Total=1892 [2021-12-14 14:49:30,066 INFO L87 Difference]: Start difference. First operand 246 states and 303 transitions. Second operand has 44 states, 43 states have (on average 2.6511627906976742) internal successors, (114), 44 states have internal predecessors, (114), 32 states have call successors, (39), 1 states have call predecessors, (39), 17 states have return successors, (56), 32 states have call predecessors, (56), 32 states have call successors, (56) [2021-12-14 14:49:30,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:30,810 INFO L93 Difference]: Finished difference Result 300 states and 372 transitions. [2021-12-14 14:49:30,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-12-14 14:49:30,819 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.6511627906976742) internal successors, (114), 44 states have internal predecessors, (114), 32 states have call successors, (39), 1 states have call predecessors, (39), 17 states have return successors, (56), 32 states have call predecessors, (56), 32 states have call successors, (56) Word has length 1032 [2021-12-14 14:49:30,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:30,821 INFO L225 Difference]: With dead ends: 300 [2021-12-14 14:49:30,821 INFO L226 Difference]: Without dead ends: 284 [2021-12-14 14:49:30,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2418 GetRequests, 2352 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1371 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=598, Invalid=3692, Unknown=0, NotChecked=0, Total=4290 [2021-12-14 14:49:30,823 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 220 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:30,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 733 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 14:49:30,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-12-14 14:49:30,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 251. [2021-12-14 14:49:30,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 178 states have (on average 1.0449438202247192) internal successors, (186), 173 states have internal predecessors, (186), 52 states have call successors, (52), 41 states have call predecessors, (52), 20 states have return successors, (65), 36 states have call predecessors, (65), 52 states have call successors, (65) [2021-12-14 14:49:30,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 303 transitions. [2021-12-14 14:49:30,832 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 303 transitions. Word has length 1032 [2021-12-14 14:49:30,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:30,833 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 303 transitions. [2021-12-14 14:49:30,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.6511627906976742) internal successors, (114), 44 states have internal predecessors, (114), 32 states have call successors, (39), 1 states have call predecessors, (39), 17 states have return successors, (56), 32 states have call predecessors, (56), 32 states have call successors, (56) [2021-12-14 14:49:30,834 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 303 transitions. [2021-12-14 14:49:30,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2021-12-14 14:49:30,841 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:30,841 INFO L514 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 72, 71, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 28, 27, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:30,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-14 14:49:31,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:31,060 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:31,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:31,060 INFO L85 PathProgramCache]: Analyzing trace with hash -553145382, now seen corresponding path program 9 times [2021-12-14 14:49:31,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:31,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805059639] [2021-12-14 14:49:31,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:31,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 14:49:31,185 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 14:49:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 14:49:31,483 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 14:49:31,483 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 14:49:31,484 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 14:49:31,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-14 14:49:31,487 INFO L732 BasicCegarLoop]: Path program histogram: [9, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:31,491 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 14:49:31,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 02:49:31 BoogieIcfgContainer [2021-12-14 14:49:31,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 14:49:31,630 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 14:49:31,630 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 14:49:31,630 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 14:49:31,630 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:48:41" (3/4) ... [2021-12-14 14:49:31,632 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 14:49:31,743 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 14:49:31,743 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 14:49:31,743 INFO L158 Benchmark]: Toolchain (without parser) took 50544.98ms. Allocated memory was 86.0MB in the beginning and 654.3MB in the end (delta: 568.3MB). Free memory was 57.3MB in the beginning and 290.2MB in the end (delta: -232.9MB). Peak memory consumption was 337.0MB. Max. memory is 16.1GB. [2021-12-14 14:49:31,744 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 86.0MB. Free memory was 64.0MB in the beginning and 63.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 14:49:31,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 154.30ms. Allocated memory is still 86.0MB. Free memory was 57.1MB in the beginning and 66.5MB in the end (delta: -9.4MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2021-12-14 14:49:31,745 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.64ms. Allocated memory is still 86.0MB. Free memory was 66.5MB in the beginning and 65.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 14:49:31,745 INFO L158 Benchmark]: Boogie Preprocessor took 35.49ms. Allocated memory is still 86.0MB. Free memory was 65.1MB in the beginning and 64.3MB in the end (delta: 805.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 14:49:31,745 INFO L158 Benchmark]: RCFGBuilder took 183.24ms. Allocated memory is still 86.0MB. Free memory was 64.3MB in the beginning and 55.4MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 14:49:31,745 INFO L158 Benchmark]: TraceAbstraction took 50022.47ms. Allocated memory was 86.0MB in the beginning and 654.3MB in the end (delta: 568.3MB). Free memory was 54.9MB in the beginning and 318.8MB in the end (delta: -263.9MB). Peak memory consumption was 303.9MB. Max. memory is 16.1GB. [2021-12-14 14:49:31,746 INFO L158 Benchmark]: Witness Printer took 113.10ms. Allocated memory is still 654.3MB. Free memory was 318.8MB in the beginning and 290.2MB in the end (delta: 28.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2021-12-14 14:49:31,748 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.18ms. Allocated memory is still 86.0MB. Free memory was 64.0MB in the beginning and 63.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 154.30ms. Allocated memory is still 86.0MB. Free memory was 57.1MB in the beginning and 66.5MB in the end (delta: -9.4MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.64ms. Allocated memory is still 86.0MB. Free memory was 66.5MB in the beginning and 65.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.49ms. Allocated memory is still 86.0MB. Free memory was 65.1MB in the beginning and 64.3MB in the end (delta: 805.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 183.24ms. Allocated memory is still 86.0MB. Free memory was 64.3MB in the beginning and 55.4MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 50022.47ms. Allocated memory was 86.0MB in the beginning and 654.3MB in the end (delta: 568.3MB). Free memory was 54.9MB in the beginning and 318.8MB in the end (delta: -263.9MB). Peak memory consumption was 303.9MB. Max. memory is 16.1GB. * Witness Printer took 113.10ms. Allocated memory is still 654.3MB. Free memory was 318.8MB in the beginning and 290.2MB in the end (delta: 28.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 10; VAL [x=10] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=10] [L10] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L12] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=9] [L20] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L22] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=9, fibo1(n-1)=21, n=9] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=7] [L10] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L12] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=9, fibo1(n-1)=21, fibo1(n-2)=13, n=9] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=10, fibo2(n-1)=34, n=10] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=8] [L20] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L22] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=7] [L10] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L12] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=8, fibo1(n-1)=13, n=8] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=8, fibo1(n-1)=13, fibo1(n-2)=8, n=8] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=10, fibo2(n-1)=34, fibo2(n-2)=21, n=10] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=55, x=10] [L39] int result = fibo1(x); [L40] COND TRUE result == 55 VAL [result=55, x=10] [L41] reach_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.8s, OverallIterations: 17, TraceHistogramMax: 89, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.1s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1693 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1612 mSDsluCounter, 5851 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5297 mSDsCounter, 2159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10485 IncrementalHoareTripleChecker+Invalid, 12644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2159 mSolverCounterUnsat, 554 mSDtfsCounter, 10485 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12244 GetRequests, 11653 SyntacticMatches, 17 SemanticMatches, 574 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8012 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=16, InterpolantAutomatonStates: 429, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 290 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 36.3s InterpolantComputationTime, 11548 NumberOfCodeBlocks, 10597 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 15454 ConstructedInterpolants, 0 QuantifiedInterpolants, 20364 SizeOfPredicates, 80 NumberOfNonLiveVariables, 9565 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 44 InterpolantComputations, 2 PerfectInterpolantSequences, 304999/334089 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-14 14:49:31,796 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