./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 eb692b52 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-?-eb692b5 [2022-07-19 17:27:52,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 17:27:52,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 17:27:52,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 17:27:52,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 17:27:52,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 17:27:52,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 17:27:52,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 17:27:52,417 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 17:27:52,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 17:27:52,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 17:27:52,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 17:27:52,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 17:27:52,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 17:27:52,425 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 17:27:52,427 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 17:27:52,427 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 17:27:52,428 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 17:27:52,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 17:27:52,434 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 17:27:52,435 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 17:27:52,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 17:27:52,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 17:27:52,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 17:27:52,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 17:27:52,442 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 17:27:52,443 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 17:27:52,443 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 17:27:52,444 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 17:27:52,444 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 17:27:52,445 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 17:27:52,445 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 17:27:52,446 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 17:27:52,447 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 17:27:52,447 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 17:27:52,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 17:27:52,448 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 17:27:52,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 17:27:52,449 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 17:27:52,449 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 17:27:52,449 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 17:27:52,451 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 17:27:52,452 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 17:27:52,474 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 17:27:52,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 17:27:52,474 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 17:27:52,474 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 17:27:52,475 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 17:27:52,475 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 17:27:52,476 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 17:27:52,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 17:27:52,476 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 17:27:52,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 17:27:52,477 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 17:27:52,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 17:27:52,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 17:27:52,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 17:27:52,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 17:27:52,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 17:27:52,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 17:27:52,478 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 17:27:52,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 17:27:52,478 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 17:27:52,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 17:27:52,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 17:27:52,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 17:27:52,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 17:27:52,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:27:52,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 17:27:52,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 17:27:52,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 17:27:52,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 17:27:52,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 17:27:52,480 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 17:27:52,480 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 17:27:52,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 17:27:52,481 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 [2022-07-19 17:27:52,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 17:27:52,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 17:27:52,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 17:27:52,671 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 17:27:52,672 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 17:27:52,672 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 [2022-07-19 17:27:52,717 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dc0b2972/5c33a1e011bb4e3aacdedd058334631c/FLAGc64773e58 [2022-07-19 17:27:53,093 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 17:27:53,094 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2022-07-19 17:27:53,097 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dc0b2972/5c33a1e011bb4e3aacdedd058334631c/FLAGc64773e58 [2022-07-19 17:27:53,107 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dc0b2972/5c33a1e011bb4e3aacdedd058334631c [2022-07-19 17:27:53,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 17:27:53,110 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 17:27:53,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 17:27:53,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 17:27:53,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 17:27:53,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:27:53" (1/1) ... [2022-07-19 17:27:53,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a4571e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:53, skipping insertion in model container [2022-07-19 17:27:53,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:27:53" (1/1) ... [2022-07-19 17:27:53,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 17:27:53,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 17:27:53,250 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] [2022-07-19 17:27:53,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:27:53,257 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 17:27:53,267 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] [2022-07-19 17:27:53,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:27:53,276 INFO L208 MainTranslator]: Completed translation [2022-07-19 17:27:53,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:53 WrapperNode [2022-07-19 17:27:53,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 17:27:53,277 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 17:27:53,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 17:27:53,278 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 17:27:53,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:53" (1/1) ... [2022-07-19 17:27:53,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:53" (1/1) ... [2022-07-19 17:27:53,297 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-07-19 17:27:53,298 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 17:27:53,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 17:27:53,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 17:27:53,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 17:27:53,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:53" (1/1) ... [2022-07-19 17:27:53,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:53" (1/1) ... [2022-07-19 17:27:53,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:53" (1/1) ... [2022-07-19 17:27:53,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:53" (1/1) ... [2022-07-19 17:27:53,306 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:53" (1/1) ... [2022-07-19 17:27:53,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:53" (1/1) ... [2022-07-19 17:27:53,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:53" (1/1) ... [2022-07-19 17:27:53,308 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 17:27:53,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 17:27:53,309 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 17:27:53,309 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 17:27:53,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:53" (1/1) ... [2022-07-19 17:27:53,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:27:53,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:27:53,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 17:27:53,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 17:27:53,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 17:27:53,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 17:27:53,375 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2022-07-19 17:27:53,375 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2022-07-19 17:27:53,375 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2022-07-19 17:27:53,375 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2022-07-19 17:27:53,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 17:27:53,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 17:27:53,412 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 17:27:53,413 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 17:27:53,480 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 17:27:53,484 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 17:27:53,484 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 17:27:53,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:27:53 BoogieIcfgContainer [2022-07-19 17:27:53,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 17:27:53,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 17:27:53,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 17:27:53,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 17:27:53,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 05:27:53" (1/3) ... [2022-07-19 17:27:53,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60782464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:27:53, skipping insertion in model container [2022-07-19 17:27:53,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:53" (2/3) ... [2022-07-19 17:27:53,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60782464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:27:53, skipping insertion in model container [2022-07-19 17:27:53,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:27:53" (3/3) ... [2022-07-19 17:27:53,493 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10-2.c [2022-07-19 17:27:53,508 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 17:27:53,509 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 17:27:53,546 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 17:27:53,551 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@726da7a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2d210601 [2022-07-19 17:27:53,551 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 17:27:53,554 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) [2022-07-19 17:27:53,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-19 17:27:53,559 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:53,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:27:53,575 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:53,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:53,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2022-07-19 17:27:53,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:53,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897399778] [2022-07-19 17:27:53,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:53,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:53,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:27:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:53,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:27:53,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:27:53,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897399778] [2022-07-19 17:27:53,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897399778] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:27:53,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:27:53,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 17:27:53,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349755236] [2022-07-19 17:27:53,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:27:53,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:27:53,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:53,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:27:53,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:27:53,817 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) [2022-07-19 17:27:53,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:53,852 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-07-19 17:27:53,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 17:27:53,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-07-19 17:27:53,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:53,866 INFO L225 Difference]: With dead ends: 43 [2022-07-19 17:27:53,866 INFO L226 Difference]: Without dead ends: 27 [2022-07-19 17:27:53,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:27:53,871 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:27:53,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 123 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:27:53,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-19 17:27:53,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-19 17:27:53,896 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) [2022-07-19 17:27:53,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-07-19 17:27:53,898 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2022-07-19 17:27:53,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:53,898 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-07-19 17:27:53,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 17:27:53,899 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-07-19 17:27:53,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 17:27:53,900 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:53,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:27:53,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 17:27:53,901 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:53,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:53,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2022-07-19 17:27:53,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:53,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502199906] [2022-07-19 17:27:53,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:53,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:53,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:27:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:53,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:27:53,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:27:53,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502199906] [2022-07-19 17:27:53,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502199906] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:27:53,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:27:53,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 17:27:53,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713567376] [2022-07-19 17:27:53,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:27:53,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:27:53,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:53,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:27:53,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:27:53,966 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) [2022-07-19 17:27:54,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:54,008 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-07-19 17:27:54,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 17:27:54,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-07-19 17:27:54,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:54,009 INFO L225 Difference]: With dead ends: 33 [2022-07-19 17:27:54,009 INFO L226 Difference]: Without dead ends: 29 [2022-07-19 17:27:54,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:27:54,010 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:27:54,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:27:54,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-19 17:27:54,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-07-19 17:27:54,015 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) [2022-07-19 17:27:54,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-07-19 17:27:54,016 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2022-07-19 17:27:54,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:54,017 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-07-19 17:27:54,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 17:27:54,017 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-07-19 17:27:54,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-19 17:27:54,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:54,020 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:27:54,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 17:27:54,020 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:54,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:54,021 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2022-07-19 17:27:54,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:54,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480465966] [2022-07-19 17:27:54,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:54,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:54,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:27:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:54,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:54,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 17:27:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 17:27:54,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:27:54,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480465966] [2022-07-19 17:27:54,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480465966] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:27:54,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747706253] [2022-07-19 17:27:54,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:54,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:54,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:27:54,125 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:27:54,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 17:27:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:54,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 17:27:54,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:27:54,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 17:27:54,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:27:54,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 17:27:54,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747706253] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:27:54,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:27:54,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2022-07-19 17:27:54,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047111895] [2022-07-19 17:27:54,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:27:54,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 17:27:54,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:54,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 17:27:54,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:27:54,468 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) [2022-07-19 17:27:54,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:54,591 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2022-07-19 17:27:54,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 17:27:54,591 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 [2022-07-19 17:27:54,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:54,592 INFO L225 Difference]: With dead ends: 55 [2022-07-19 17:27:54,592 INFO L226 Difference]: Without dead ends: 31 [2022-07-19 17:27:54,593 INFO L412 NwaCegarLoop]: 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 [2022-07-19 17:27:54,593 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:27:54,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 112 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:27:54,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-19 17:27:54,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-07-19 17:27:54,598 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) [2022-07-19 17:27:54,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-07-19 17:27:54,599 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2022-07-19 17:27:54,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:54,599 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-07-19 17:27:54,599 INFO L496 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) [2022-07-19 17:27:54,600 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-07-19 17:27:54,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 17:27:54,615 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:54,616 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:27:54,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 17:27:54,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:54,832 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:54,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:54,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2022-07-19 17:27:54,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:54,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522291587] [2022-07-19 17:27:54,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:54,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:54,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:27:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:54,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:54,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:54,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 17:27:54,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:27:54,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522291587] [2022-07-19 17:27:54,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522291587] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:27:54,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140892607] [2022-07-19 17:27:54,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:54,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:54,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:27:54,917 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:27:54,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 17:27:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:54,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 17:27:54,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:27:54,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 17:27:54,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:27:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 17:27:55,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140892607] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:27:55,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:27:55,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-07-19 17:27:55,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311144810] [2022-07-19 17:27:55,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:27:55,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 17:27:55,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:55,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 17:27:55,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:27:55,139 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) [2022-07-19 17:27:55,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:55,257 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2022-07-19 17:27:55,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 17:27:55,258 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 [2022-07-19 17:27:55,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:55,259 INFO L225 Difference]: With dead ends: 51 [2022-07-19 17:27:55,259 INFO L226 Difference]: Without dead ends: 47 [2022-07-19 17:27:55,260 INFO L412 NwaCegarLoop]: 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 [2022-07-19 17:27:55,261 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:27:55,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 92 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:27:55,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-19 17:27:55,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-07-19 17:27:55,281 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) [2022-07-19 17:27:55,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2022-07-19 17:27:55,282 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2022-07-19 17:27:55,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:55,282 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-07-19 17:27:55,282 INFO L496 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) [2022-07-19 17:27:55,282 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-07-19 17:27:55,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 17:27:55,284 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:55,285 INFO L195 NwaCegarLoop]: 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] [2022-07-19 17:27:55,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 17:27:55,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-19 17:27:55,485 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:55,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:55,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2022-07-19 17:27:55,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:55,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201084271] [2022-07-19 17:27:55,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:55,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:55,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:27:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:55,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:55,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:55,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 17:27:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:55,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 17:27:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:55,578 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 17:27:55,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:27:55,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201084271] [2022-07-19 17:27:55,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201084271] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:27:55,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075405989] [2022-07-19 17:27:55,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:55,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:55,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:27:55,586 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:27:55,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 17:27:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:55,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 17:27:55,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:27:55,698 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 17:27:55,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:27:55,931 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 17:27:55,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075405989] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:27:55,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:27:55,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2022-07-19 17:27:55,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269494399] [2022-07-19 17:27:55,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:27:55,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 17:27:55,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:55,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 17:27:55,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-07-19 17:27:55,933 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) [2022-07-19 17:27:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:56,119 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2022-07-19 17:27:56,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 17:27:56,120 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 [2022-07-19 17:27:56,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:56,121 INFO L225 Difference]: With dead ends: 105 [2022-07-19 17:27:56,121 INFO L226 Difference]: Without dead ends: 63 [2022-07-19 17:27:56,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2022-07-19 17:27:56,123 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 65 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:27:56,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 95 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:27:56,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-19 17:27:56,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-07-19 17:27:56,129 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) [2022-07-19 17:27:56,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2022-07-19 17:27:56,131 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2022-07-19 17:27:56,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:56,135 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2022-07-19 17:27:56,135 INFO L496 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) [2022-07-19 17:27:56,136 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2022-07-19 17:27:56,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 17:27:56,139 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:56,139 INFO L195 NwaCegarLoop]: 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] [2022-07-19 17:27:56,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-19 17:27:56,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:56,355 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:56,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:56,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2022-07-19 17:27:56,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:56,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888476777] [2022-07-19 17:27:56,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:56,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:56,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:27:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:56,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:56,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:56,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:56,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 17:27:56,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:27:56,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888476777] [2022-07-19 17:27:56,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888476777] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:27:56,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358696715] [2022-07-19 17:27:56,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:56,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:56,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:27:56,468 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:27:56,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 17:27:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:56,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 17:27:56,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:27:56,577 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 17:27:56,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:27:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 17:27:56,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358696715] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:27:56,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:27:56,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2022-07-19 17:27:56,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316524991] [2022-07-19 17:27:56,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:27:56,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 17:27:56,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:56,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 17:27:56,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-07-19 17:27:56,794 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) [2022-07-19 17:27:57,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:57,094 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2022-07-19 17:27:57,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 17:27:57,094 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 [2022-07-19 17:27:57,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:57,096 INFO L225 Difference]: With dead ends: 177 [2022-07-19 17:27:57,097 INFO L226 Difference]: Without dead ends: 117 [2022-07-19 17:27:57,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2022-07-19 17:27:57,107 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 60 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 17:27:57,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 222 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 17:27:57,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-19 17:27:57,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2022-07-19 17:27:57,124 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) [2022-07-19 17:27:57,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2022-07-19 17:27:57,126 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2022-07-19 17:27:57,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:57,126 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2022-07-19 17:27:57,126 INFO L496 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) [2022-07-19 17:27:57,126 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2022-07-19 17:27:57,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-19 17:27:57,132 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:57,132 INFO L195 NwaCegarLoop]: 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] [2022-07-19 17:27:57,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 17:27:57,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:57,347 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:57,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:57,348 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2022-07-19 17:27:57,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:57,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103475955] [2022-07-19 17:27:57,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:57,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:57,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:27:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:57,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:57,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:57,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:57,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:57,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:57,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 17:27:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:57,457 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-19 17:27:57,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:27:57,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103475955] [2022-07-19 17:27:57,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103475955] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:27:57,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976337877] [2022-07-19 17:27:57,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:57,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:57,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:27:57,459 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:27:57,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 17:27:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:57,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 17:27:57,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:27:57,560 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 17:27:57,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:27:57,904 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 17:27:57,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976337877] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:27:57,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:27:57,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2022-07-19 17:27:57,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047745743] [2022-07-19 17:27:57,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:27:57,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-19 17:27:57,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:57,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-19 17:27:57,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-07-19 17:27:57,906 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) [2022-07-19 17:27:58,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:58,276 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2022-07-19 17:27:58,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-19 17:27:58,277 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 [2022-07-19 17:27:58,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:58,281 INFO L225 Difference]: With dead ends: 255 [2022-07-19 17:27:58,281 INFO L226 Difference]: Without dead ends: 155 [2022-07-19 17:27:58,283 INFO L412 NwaCegarLoop]: 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 [2022-07-19 17:27:58,283 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 76 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 17:27:58,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 227 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 17:27:58,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-19 17:27:58,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2022-07-19 17:27:58,307 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) [2022-07-19 17:27:58,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2022-07-19 17:27:58,309 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2022-07-19 17:27:58,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:58,309 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2022-07-19 17:27:58,309 INFO L496 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) [2022-07-19 17:27:58,309 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2022-07-19 17:27:58,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-19 17:27:58,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:58,321 INFO L195 NwaCegarLoop]: 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] [2022-07-19 17:27:58,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 17:27:58,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:58,535 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:58,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:58,536 INFO L85 PathProgramCache]: Analyzing trace with hash -586612948, now seen corresponding path program 1 times [2022-07-19 17:27:58,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:58,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617279704] [2022-07-19 17:27:58,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:58,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:58,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:27:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:58,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:58,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:58,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:58,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:58,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:58,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:58,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:58,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:27:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:58,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:58,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:58,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:58,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:58,732 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-19 17:27:58,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:27:58,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617279704] [2022-07-19 17:27:58,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617279704] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:27:58,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894144995] [2022-07-19 17:27:58,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:58,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:58,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:27:58,742 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:27:58,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 17:27:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:58,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 17:27:58,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:27:58,910 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 92 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-19 17:27:58,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:27:59,459 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 102 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-19 17:27:59,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894144995] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:27:59,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:27:59,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 24 [2022-07-19 17:27:59,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524619809] [2022-07-19 17:27:59,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:27:59,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-19 17:27:59,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:59,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-19 17:27:59,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2022-07-19 17:27:59,461 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) [2022-07-19 17:27:59,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:59,827 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2022-07-19 17:27:59,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-19 17:27:59,828 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 [2022-07-19 17:27:59,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:59,829 INFO L225 Difference]: With dead ends: 240 [2022-07-19 17:27:59,829 INFO L226 Difference]: Without dead ends: 107 [2022-07-19 17:27:59,830 INFO L412 NwaCegarLoop]: 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 [2022-07-19 17:27:59,831 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 111 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 17:27:59,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 209 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 17:27:59,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-19 17:27:59,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2022-07-19 17:27:59,837 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) [2022-07-19 17:27:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2022-07-19 17:27:59,838 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 93 [2022-07-19 17:27:59,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:59,838 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2022-07-19 17:27:59,838 INFO L496 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) [2022-07-19 17:27:59,839 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2022-07-19 17:27:59,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-19 17:27:59,840 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:59,840 INFO L195 NwaCegarLoop]: 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] [2022-07-19 17:27:59,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 17:28:00,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:28:00,056 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:28:00,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:28:00,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1129417830, now seen corresponding path program 1 times [2022-07-19 17:28:00,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:28:00,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210014526] [2022-07-19 17:28:00,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:28:00,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:28:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:00,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:28:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:00,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:00,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:00,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:00,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:00,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:00,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:00,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:00,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:00,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:28:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:00,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:00,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:00,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:00,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:00,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:00,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:00,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-19 17:28:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:00,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:00,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:00,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:00,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:00,262 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 73 proven. 135 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2022-07-19 17:28:00,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:28:00,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210014526] [2022-07-19 17:28:00,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210014526] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:28:00,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465167904] [2022-07-19 17:28:00,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:28:00,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:28:00,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:28:00,264 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) [2022-07-19 17:28:00,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 17:28:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:00,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-19 17:28:00,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:28:00,436 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 36 proven. 211 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2022-07-19 17:28:00,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:28:01,282 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 36 proven. 227 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-07-19 17:28:01,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465167904] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:28:01,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:28:01,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 26 [2022-07-19 17:28:01,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137941494] [2022-07-19 17:28:01,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:28:01,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-19 17:28:01,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:28:01,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-19 17:28:01,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2022-07-19 17:28:01,284 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) [2022-07-19 17:28:01,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:28:01,727 INFO L93 Difference]: Finished difference Result 214 states and 372 transitions. [2022-07-19 17:28:01,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-19 17:28:01,728 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 [2022-07-19 17:28:01,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:28:01,729 INFO L225 Difference]: With dead ends: 214 [2022-07-19 17:28:01,729 INFO L226 Difference]: Without dead ends: 134 [2022-07-19 17:28:01,730 INFO L412 NwaCegarLoop]: 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 [2022-07-19 17:28:01,730 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 108 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 17:28:01,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 235 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 17:28:01,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-19 17:28:01,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2022-07-19 17:28:01,736 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) [2022-07-19 17:28:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2022-07-19 17:28:01,737 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 148 [2022-07-19 17:28:01,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:28:01,738 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2022-07-19 17:28:01,738 INFO L496 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) [2022-07-19 17:28:01,738 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2022-07-19 17:28:01,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-07-19 17:28:01,740 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:28:01,740 INFO L195 NwaCegarLoop]: 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] [2022-07-19 17:28:01,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 17:28:01,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:28:01,959 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:28:01,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:28:01,959 INFO L85 PathProgramCache]: Analyzing trace with hash -399650163, now seen corresponding path program 2 times [2022-07-19 17:28:01,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:28:01,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748692406] [2022-07-19 17:28:01,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:28:01,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:28:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:28:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 17:28:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-19 17:28:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 17:28:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:02,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 169 proven. 360 refuted. 0 times theorem prover too weak. 1503 trivial. 0 not checked. [2022-07-19 17:28:02,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:28:02,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748692406] [2022-07-19 17:28:02,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748692406] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:28:02,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158536421] [2022-07-19 17:28:02,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 17:28:02,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:28:02,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:28:02,289 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) [2022-07-19 17:28:02,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 17:28:02,404 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 17:28:02,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:28:02,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-19 17:28:02,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:28:02,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 79 proven. 543 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2022-07-19 17:28:02,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:28:03,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 79 proven. 567 refuted. 0 times theorem prover too weak. 1386 trivial. 0 not checked. [2022-07-19 17:28:03,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158536421] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:28:03,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:28:03,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 28 [2022-07-19 17:28:03,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062791605] [2022-07-19 17:28:03,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:28:03,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-19 17:28:03,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:28:03,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-19 17:28:03,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2022-07-19 17:28:03,887 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) [2022-07-19 17:28:04,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:28:04,440 INFO L93 Difference]: Finished difference Result 260 states and 447 transitions. [2022-07-19 17:28:04,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-19 17:28:04,441 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 [2022-07-19 17:28:04,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:28:04,443 INFO L225 Difference]: With dead ends: 260 [2022-07-19 17:28:04,443 INFO L226 Difference]: Without dead ends: 155 [2022-07-19 17:28:04,445 INFO L412 NwaCegarLoop]: 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 [2022-07-19 17:28:04,445 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 127 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 17:28:04,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 273 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 17:28:04,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-19 17:28:04,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2022-07-19 17:28:04,458 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) [2022-07-19 17:28:04,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 224 transitions. [2022-07-19 17:28:04,461 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 224 transitions. Word has length 271 [2022-07-19 17:28:04,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:28:04,462 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 224 transitions. [2022-07-19 17:28:04,462 INFO L496 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) [2022-07-19 17:28:04,462 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 224 transitions. [2022-07-19 17:28:04,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2022-07-19 17:28:04,467 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:28:04,468 INFO L195 NwaCegarLoop]: 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] [2022-07-19 17:28:04,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-19 17:28:04,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-19 17:28:04,683 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:28:04,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:28:04,684 INFO L85 PathProgramCache]: Analyzing trace with hash -854779469, now seen corresponding path program 3 times [2022-07-19 17:28:04,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:28:04,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288085735] [2022-07-19 17:28:04,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:28:04,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:28:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:04,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:28:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:04,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:04,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:04,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:04,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:04,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:04,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:04,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:04,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:04,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:04,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:04,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:04,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:04,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 17:28:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-19 17:28:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-07-19 17:28:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:28:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:05,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4086 backedges. 245 proven. 607 refuted. 0 times theorem prover too weak. 3234 trivial. 0 not checked. [2022-07-19 17:28:05,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:28:05,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288085735] [2022-07-19 17:28:05,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288085735] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:28:05,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757061606] [2022-07-19 17:28:05,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 17:28:05,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:28:05,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:28:05,103 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) [2022-07-19 17:28:05,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-19 17:28:05,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-19 17:28:05,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:28:05,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 17:28:05,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:28:05,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4086 backedges. 726 proven. 42 refuted. 0 times theorem prover too weak. 3318 trivial. 0 not checked. [2022-07-19 17:28:05,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:28:06,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4086 backedges. 726 proven. 43 refuted. 0 times theorem prover too weak. 3317 trivial. 0 not checked. [2022-07-19 17:28:06,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757061606] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:28:06,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:28:06,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 26 [2022-07-19 17:28:06,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168466997] [2022-07-19 17:28:06,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:28:06,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-19 17:28:06,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:28:06,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-19 17:28:06,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2022-07-19 17:28:06,277 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) [2022-07-19 17:28:06,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:28:06,612 INFO L93 Difference]: Finished difference Result 308 states and 520 transitions. [2022-07-19 17:28:06,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-19 17:28:06,613 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 [2022-07-19 17:28:06,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:28:06,614 INFO L225 Difference]: With dead ends: 308 [2022-07-19 17:28:06,614 INFO L226 Difference]: Without dead ends: 168 [2022-07-19 17:28:06,616 INFO L412 NwaCegarLoop]: 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 [2022-07-19 17:28:06,616 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 91 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 17:28:06,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 246 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 17:28:06,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-19 17:28:06,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2022-07-19 17:28:06,622 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) [2022-07-19 17:28:06,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2022-07-19 17:28:06,624 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 378 [2022-07-19 17:28:06,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:28:06,624 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2022-07-19 17:28:06,624 INFO L496 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) [2022-07-19 17:28:06,624 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2022-07-19 17:28:06,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2022-07-19 17:28:06,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:28:06,630 INFO L195 NwaCegarLoop]: 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] [2022-07-19 17:28:06,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 17:28:06,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:28:06,831 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:28:06,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:28:06,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1952053737, now seen corresponding path program 4 times [2022-07-19 17:28:06,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:28:06,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002724646] [2022-07-19 17:28:06,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:28:06,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:28:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:28:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:28:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-19 17:28:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:28:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-07-19 17:28:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:28:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-19 17:28:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:28:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:07,648 INFO L134 CoverageAnalysis]: Checked inductivity of 10395 backedges. 367 proven. 1344 refuted. 0 times theorem prover too weak. 8684 trivial. 0 not checked. [2022-07-19 17:28:07,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:28:07,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002724646] [2022-07-19 17:28:07,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002724646] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:28:07,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599335514] [2022-07-19 17:28:07,649 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 17:28:07,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:28:07,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:28:07,650 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) [2022-07-19 17:28:07,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-19 17:28:07,829 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 17:28:07,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:28:07,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-19 17:28:07,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:28:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 10395 backedges. 201 proven. 1550 refuted. 0 times theorem prover too weak. 8644 trivial. 0 not checked. [2022-07-19 17:28:07,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:28:10,304 INFO L134 CoverageAnalysis]: Checked inductivity of 10395 backedges. 201 proven. 1583 refuted. 0 times theorem prover too weak. 8611 trivial. 0 not checked. [2022-07-19 17:28:10,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599335514] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:28:10,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:28:10,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 19] total 33 [2022-07-19 17:28:10,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27924634] [2022-07-19 17:28:10,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:28:10,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-19 17:28:10,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:28:10,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-19 17:28:10,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2022-07-19 17:28:10,307 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) [2022-07-19 17:28:10,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:28:10,985 INFO L93 Difference]: Finished difference Result 382 states and 633 transitions. [2022-07-19 17:28:10,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-19 17:28:10,986 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 [2022-07-19 17:28:10,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:28:10,988 INFO L225 Difference]: With dead ends: 382 [2022-07-19 17:28:10,988 INFO L226 Difference]: Without dead ends: 220 [2022-07-19 17:28:10,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1403 GetRequests, 1352 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=437, Invalid=2319, Unknown=0, NotChecked=0, Total=2756 [2022-07-19 17:28:10,989 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 128 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 17:28:10,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 316 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 17:28:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-19 17:28:10,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 200. [2022-07-19 17:28:10,998 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) [2022-07-19 17:28:10,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 302 transitions. [2022-07-19 17:28:11,000 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 302 transitions. Word has length 597 [2022-07-19 17:28:11,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:28:11,001 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 302 transitions. [2022-07-19 17:28:11,001 INFO L496 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) [2022-07-19 17:28:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 302 transitions. [2022-07-19 17:28:11,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 801 [2022-07-19 17:28:11,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:28:11,014 INFO L195 NwaCegarLoop]: 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] [2022-07-19 17:28:11,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-19 17:28:11,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-19 17:28:11,227 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:28:11,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:28:11,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1941284234, now seen corresponding path program 5 times [2022-07-19 17:28:11,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:28:11,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944131339] [2022-07-19 17:28:11,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:28:11,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:28:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:11,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:28:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:11,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:11,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:11,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:11,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:11,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:11,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:11,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:11,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:11,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:11,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:11,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:11,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:28:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 17:28:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-07-19 17:28:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:28:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 17:28:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-07-19 17:28:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 554 [2022-07-19 17:28:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:28:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 17:28:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:12,430 INFO L134 CoverageAnalysis]: Checked inductivity of 18866 backedges. 678 proven. 2278 refuted. 0 times theorem prover too weak. 15910 trivial. 0 not checked. [2022-07-19 17:28:12,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:28:12,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944131339] [2022-07-19 17:28:12,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944131339] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:28:12,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341737279] [2022-07-19 17:28:12,430 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 17:28:12,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:28:12,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:28:12,432 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) [2022-07-19 17:28:12,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-19 17:28:12,666 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2022-07-19 17:28:12,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:28:12,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-19 17:28:12,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:28:12,857 INFO L134 CoverageAnalysis]: Checked inductivity of 18866 backedges. 10301 proven. 414 refuted. 0 times theorem prover too weak. 8151 trivial. 0 not checked. [2022-07-19 17:28:12,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:28:15,919 INFO L134 CoverageAnalysis]: Checked inductivity of 18866 backedges. 1631 proven. 1673 refuted. 0 times theorem prover too weak. 15562 trivial. 0 not checked. [2022-07-19 17:28:15,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341737279] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:28:15,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:28:15,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 21] total 41 [2022-07-19 17:28:15,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245339419] [2022-07-19 17:28:15,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:28:15,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-19 17:28:15,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:28:15,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-19 17:28:15,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1417, Unknown=0, NotChecked=0, Total=1640 [2022-07-19 17:28:15,922 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) [2022-07-19 17:28:16,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:28:16,814 INFO L93 Difference]: Finished difference Result 441 states and 709 transitions. [2022-07-19 17:28:16,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-19 17:28:16,814 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 [2022-07-19 17:28:16,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:28:16,816 INFO L225 Difference]: With dead ends: 441 [2022-07-19 17:28:16,816 INFO L226 Difference]: Without dead ends: 239 [2022-07-19 17:28:16,818 INFO L412 NwaCegarLoop]: 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 [2022-07-19 17:28:16,818 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 131 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 17:28:16,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 598 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1608 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 17:28:16,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-19 17:28:16,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 224. [2022-07-19 17:28:16,827 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) [2022-07-19 17:28:16,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 319 transitions. [2022-07-19 17:28:16,833 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 319 transitions. Word has length 800 [2022-07-19 17:28:16,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:28:16,834 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 319 transitions. [2022-07-19 17:28:16,834 INFO L496 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) [2022-07-19 17:28:16,834 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 319 transitions. [2022-07-19 17:28:16,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2022-07-19 17:28:16,837 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:28:16,837 INFO L195 NwaCegarLoop]: 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] [2022-07-19 17:28:16,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-19 17:28:17,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-19 17:28:17,045 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:28:17,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:28:17,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1548197760, now seen corresponding path program 6 times [2022-07-19 17:28:17,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:28:17,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126976575] [2022-07-19 17:28:17,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:28:17,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:28:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:28:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:28:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 17:28:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:28:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2022-07-19 17:28:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-07-19 17:28:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:28:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 11869 backedges. 1049 proven. 1539 refuted. 0 times theorem prover too weak. 9281 trivial. 0 not checked. [2022-07-19 17:28:17,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:28:17,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126976575] [2022-07-19 17:28:17,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126976575] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:28:17,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038075979] [2022-07-19 17:28:17,947 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-19 17:28:17,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:28:17,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:28:17,948 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) [2022-07-19 17:28:17,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-19 17:28:18,202 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2022-07-19 17:28:18,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:28:18,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-19 17:28:18,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:28:18,371 INFO L134 CoverageAnalysis]: Checked inductivity of 11869 backedges. 483 proven. 1404 refuted. 0 times theorem prover too weak. 9982 trivial. 0 not checked. [2022-07-19 17:28:18,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:28:20,526 INFO L134 CoverageAnalysis]: Checked inductivity of 11869 backedges. 485 proven. 1435 refuted. 0 times theorem prover too weak. 9949 trivial. 0 not checked. [2022-07-19 17:28:20,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038075979] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:28:20,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:28:20,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13, 19] total 43 [2022-07-19 17:28:20,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930222426] [2022-07-19 17:28:20,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:28:20,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-19 17:28:20,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:28:20,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-19 17:28:20,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1542, Unknown=0, NotChecked=0, Total=1806 [2022-07-19 17:28:20,529 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) [2022-07-19 17:28:21,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:28:21,747 INFO L93 Difference]: Finished difference Result 552 states and 888 transitions. [2022-07-19 17:28:21,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-07-19 17:28:21,748 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 [2022-07-19 17:28:21,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:28:21,752 INFO L225 Difference]: With dead ends: 552 [2022-07-19 17:28:21,753 INFO L226 Difference]: Without dead ends: 324 [2022-07-19 17:28:21,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1517 GetRequests, 1439 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1871 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=841, Invalid=5165, Unknown=0, NotChecked=0, Total=6006 [2022-07-19 17:28:21,755 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 228 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 1997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 17:28:21,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 412 Invalid, 1997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 1580 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 17:28:21,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-07-19 17:28:21,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 248. [2022-07-19 17:28:21,773 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) [2022-07-19 17:28:21,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 352 transitions. [2022-07-19 17:28:21,774 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 352 transitions. Word has length 637 [2022-07-19 17:28:21,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:28:21,775 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 352 transitions. [2022-07-19 17:28:21,775 INFO L496 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) [2022-07-19 17:28:21,775 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 352 transitions. [2022-07-19 17:28:21,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1578 [2022-07-19 17:28:21,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:28:21,792 INFO L195 NwaCegarLoop]: trace histogram [117, 117, 114, 114, 94, 93, 58, 58, 58, 58, 58, 58, 58, 57, 57, 57, 57, 57, 57, 57, 36, 36, 24, 20, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:28:21,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-19 17:28:22,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-19 17:28:22,011 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:28:22,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:28:22,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1484512937, now seen corresponding path program 7 times [2022-07-19 17:28:22,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:28:22,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86485529] [2022-07-19 17:28:22,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:28:22,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:28:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:28:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:28:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 17:28:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-19 17:28:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:23,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2022-07-19 17:28:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:28:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 17:28:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-19 17:28:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 786 [2022-07-19 17:28:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:28:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 17:28:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-19 17:28:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2022-07-19 17:28:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:28:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 17:28:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-19 17:28:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 74553 backedges. 1264 proven. 6049 refuted. 0 times theorem prover too weak. 67240 trivial. 0 not checked. [2022-07-19 17:28:24,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:28:24,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86485529] [2022-07-19 17:28:24,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86485529] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:28:24,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527078835] [2022-07-19 17:28:24,666 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-19 17:28:24,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:28:24,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:28:24,667 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) [2022-07-19 17:28:24,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-19 17:28:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:25,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 3525 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-19 17:28:25,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:28:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 74553 backedges. 1140 proven. 3811 refuted. 0 times theorem prover too weak. 69602 trivial. 0 not checked. [2022-07-19 17:28:25,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:28:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 74553 backedges. 1144 proven. 3840 refuted. 0 times theorem prover too weak. 69569 trivial. 0 not checked. [2022-07-19 17:28:29,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527078835] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:28:29,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:28:29,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13, 19] total 38 [2022-07-19 17:28:29,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931780657] [2022-07-19 17:28:29,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:28:29,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-19 17:28:29,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:28:29,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-19 17:28:29,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1194, Unknown=0, NotChecked=0, Total=1406 [2022-07-19 17:28:29,310 INFO L87 Difference]: Start difference. First operand 248 states and 352 transitions. Second operand has 38 states, 37 states have (on average 2.972972972972973) internal successors, (110), 38 states have internal predecessors, (110), 29 states have call successors, (37), 1 states have call predecessors, (37), 15 states have return successors, (52), 26 states have call predecessors, (52), 29 states have call successors, (52) [2022-07-19 17:28:30,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:28:30,278 INFO L93 Difference]: Finished difference Result 505 states and 735 transitions. [2022-07-19 17:28:30,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-19 17:28:30,278 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.972972972972973) internal successors, (110), 38 states have internal predecessors, (110), 29 states have call successors, (37), 1 states have call predecessors, (37), 15 states have return successors, (52), 26 states have call predecessors, (52), 29 states have call successors, (52) Word has length 1577 [2022-07-19 17:28:30,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:28:30,281 INFO L225 Difference]: With dead ends: 505 [2022-07-19 17:28:30,281 INFO L226 Difference]: Without dead ends: 267 [2022-07-19 17:28:30,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3665 GetRequests, 3602 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=577, Invalid=3329, Unknown=0, NotChecked=0, Total=3906 [2022-07-19 17:28:30,284 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 138 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 1840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 17:28:30,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 502 Invalid, 1840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1632 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 17:28:30,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-07-19 17:28:30,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 240. [2022-07-19 17:28:30,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 171 states have (on average 1.0467836257309941) internal successors, (179), 165 states have internal predecessors, (179), 48 states have call successors, (48), 39 states have call predecessors, (48), 20 states have return successors, (106), 35 states have call predecessors, (106), 48 states have call successors, (106) [2022-07-19 17:28:30,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 333 transitions. [2022-07-19 17:28:30,297 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 333 transitions. Word has length 1577 [2022-07-19 17:28:30,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:28:30,298 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 333 transitions. [2022-07-19 17:28:30,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.972972972972973) internal successors, (110), 38 states have internal predecessors, (110), 29 states have call successors, (37), 1 states have call predecessors, (37), 15 states have return successors, (52), 26 states have call predecessors, (52), 29 states have call successors, (52) [2022-07-19 17:28:30,299 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 333 transitions. [2022-07-19 17:28:30,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2022-07-19 17:28:30,307 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:28:30,307 INFO L195 NwaCegarLoop]: 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] [2022-07-19 17:28:30,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-19 17:28:30,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-19 17:28:30,527 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:28:30,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:28:30,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1161748685, now seen corresponding path program 8 times [2022-07-19 17:28:30,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:28:30,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77224811] [2022-07-19 17:28:30,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:28:30,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:28:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:30,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:28:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:28:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 17:28:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-19 17:28:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:28:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 17:28:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 568 [2022-07-19 17:28:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:28:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:31,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2022-07-19 17:28:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:28:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 17:28:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:32,088 INFO L134 CoverageAnalysis]: Checked inductivity of 31637 backedges. 1986 proven. 3188 refuted. 0 times theorem prover too weak. 26463 trivial. 0 not checked. [2022-07-19 17:28:32,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:28:32,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77224811] [2022-07-19 17:28:32,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77224811] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:28:32,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545233473] [2022-07-19 17:28:32,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 17:28:32,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:28:32,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:28:32,090 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) [2022-07-19 17:28:32,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-19 17:28:32,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 17:28:32,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:28:32,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 2315 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-19 17:28:32,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:28:32,709 INFO L134 CoverageAnalysis]: Checked inductivity of 31637 backedges. 1449 proven. 2506 refuted. 0 times theorem prover too weak. 27682 trivial. 0 not checked. [2022-07-19 17:28:32,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:28:36,665 INFO L134 CoverageAnalysis]: Checked inductivity of 31637 backedges. 1451 proven. 2556 refuted. 0 times theorem prover too weak. 27630 trivial. 0 not checked. [2022-07-19 17:28:36,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545233473] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:28:36,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:28:36,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 15, 23] total 48 [2022-07-19 17:28:36,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388055805] [2022-07-19 17:28:36,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:28:36,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-19 17:28:36,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:28:36,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-19 17:28:36,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1955, Unknown=0, NotChecked=0, Total=2256 [2022-07-19 17:28:36,668 INFO L87 Difference]: Start difference. First operand 240 states and 333 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) [2022-07-19 17:28:37,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:28:37,805 INFO L93 Difference]: Finished difference Result 516 states and 827 transitions. [2022-07-19 17:28:37,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-07-19 17:28:37,816 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 [2022-07-19 17:28:37,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:28:37,818 INFO L225 Difference]: With dead ends: 516 [2022-07-19 17:28:37,818 INFO L226 Difference]: Without dead ends: 263 [2022-07-19 17:28:37,821 INFO L412 NwaCegarLoop]: 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 [2022-07-19 17:28:37,821 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 174 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 2068 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 2353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 2068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 17:28:37,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 743 Invalid, 2353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 2068 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 17:28:37,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-19 17:28:37,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 246. [2022-07-19 17:28:37,830 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) [2022-07-19 17:28:37,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 303 transitions. [2022-07-19 17:28:37,832 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 303 transitions. Word has length 1032 [2022-07-19 17:28:37,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:28:37,832 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 303 transitions. [2022-07-19 17:28:37,832 INFO L496 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) [2022-07-19 17:28:37,833 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 303 transitions. [2022-07-19 17:28:37,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2022-07-19 17:28:37,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:28:37,838 INFO L195 NwaCegarLoop]: 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] [2022-07-19 17:28:37,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-19 17:28:38,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:28:38,051 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:28:38,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:28:38,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1241761113, now seen corresponding path program 9 times [2022-07-19 17:28:38,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:28:38,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818300204] [2022-07-19 17:28:38,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:28:38,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:28:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:38,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:28:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:38,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:38,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:38,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:28:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 17:28:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-19 17:28:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:28:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-07-19 17:28:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:28:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 17:28:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2022-07-19 17:28:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:28:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 17:28:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:28:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:28:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:28:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:28:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:28:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:28:39,595 INFO L134 CoverageAnalysis]: Checked inductivity of 31636 backedges. 2682 proven. 2990 refuted. 0 times theorem prover too weak. 25964 trivial. 0 not checked. [2022-07-19 17:28:39,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:28:39,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818300204] [2022-07-19 17:28:39,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818300204] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:28:39,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512725637] [2022-07-19 17:28:39,595 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 17:28:39,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:28:39,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:28:39,597 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:28:39,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-19 17:28:39,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2022-07-19 17:28:39,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:28:39,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 17:28:39,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:28:40,029 INFO L134 CoverageAnalysis]: Checked inductivity of 31636 backedges. 1705 proven. 257 refuted. 0 times theorem prover too weak. 29674 trivial. 0 not checked. [2022-07-19 17:28:40,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:28:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 31636 backedges. 1705 proven. 271 refuted. 0 times theorem prover too weak. 29660 trivial. 0 not checked. [2022-07-19 17:28:42,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512725637] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:28:42,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:28:42,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 10, 13] total 43 [2022-07-19 17:28:42,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386187382] [2022-07-19 17:28:42,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:28:42,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-19 17:28:42,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:28:42,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-19 17:28:42,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1555, Unknown=0, NotChecked=0, Total=1806 [2022-07-19 17:28:42,038 INFO L87 Difference]: Start difference. First operand 246 states and 303 transitions. Second operand has 43 states, 42 states have (on average 2.5238095238095237) internal successors, (106), 43 states have internal predecessors, (106), 23 states have call successors, (34), 1 states have call predecessors, (34), 19 states have return successors, (48), 37 states have call predecessors, (48), 23 states have call successors, (48) [2022-07-19 17:28:42,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:28:42,936 INFO L93 Difference]: Finished difference Result 312 states and 386 transitions. [2022-07-19 17:28:42,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-07-19 17:28:42,937 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.5238095238095237) internal successors, (106), 43 states have internal predecessors, (106), 23 states have call successors, (34), 1 states have call predecessors, (34), 19 states have return successors, (48), 37 states have call predecessors, (48), 23 states have call successors, (48) Word has length 1032 [2022-07-19 17:28:42,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:28:42,939 INFO L225 Difference]: With dead ends: 312 [2022-07-19 17:28:42,939 INFO L226 Difference]: Without dead ends: 300 [2022-07-19 17:28:42,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2422 GetRequests, 2353 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1528 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=606, Invalid=4086, Unknown=0, NotChecked=0, Total=4692 [2022-07-19 17:28:42,941 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 203 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 17:28:42,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 541 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 17:28:42,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-07-19 17:28:42,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 263. [2022-07-19 17:28:42,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 187 states have (on average 1.0481283422459893) internal successors, (196), 182 states have internal predecessors, (196), 55 states have call successors, (55), 44 states have call predecessors, (55), 20 states have return successors, (68), 36 states have call predecessors, (68), 55 states have call successors, (68) [2022-07-19 17:28:42,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 319 transitions. [2022-07-19 17:28:42,952 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 319 transitions. Word has length 1032 [2022-07-19 17:28:42,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:28:42,954 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 319 transitions. [2022-07-19 17:28:42,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.5238095238095237) internal successors, (106), 43 states have internal predecessors, (106), 23 states have call successors, (34), 1 states have call predecessors, (34), 19 states have return successors, (48), 37 states have call predecessors, (48), 23 states have call successors, (48) [2022-07-19 17:28:42,954 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 319 transitions. [2022-07-19 17:28:42,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2022-07-19 17:28:42,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:28:42,962 INFO L195 NwaCegarLoop]: 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] [2022-07-19 17:28:42,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-19 17:28:43,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-19 17:28:43,179 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:28:43,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:28:43,180 INFO L85 PathProgramCache]: Analyzing trace with hash -553145382, now seen corresponding path program 10 times [2022-07-19 17:28:43,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:28:43,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150034520] [2022-07-19 17:28:43,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:28:43,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:28:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 17:28:43,329 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 17:28:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 17:28:43,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 17:28:43,644 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 17:28:43,645 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 17:28:43,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 17:28:43,649 INFO L356 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:28:43,653 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 17:28:43,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 05:28:43 BoogieIcfgContainer [2022-07-19 17:28:43,796 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 17:28:43,796 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 17:28:43,796 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 17:28:43,796 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 17:28:43,797 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:27:53" (3/4) ... [2022-07-19 17:28:43,798 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 17:28:43,934 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 17:28:43,934 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 17:28:43,934 INFO L158 Benchmark]: Toolchain (without parser) took 50824.05ms. Allocated memory was 90.2MB in the beginning and 901.8MB in the end (delta: 811.6MB). Free memory was 59.7MB in the beginning and 845.0MB in the end (delta: -785.3MB). Peak memory consumption was 453.2MB. Max. memory is 16.1GB. [2022-07-19 17:28:43,935 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 90.2MB. Free memory is still 46.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 17:28:43,935 INFO L158 Benchmark]: CACSL2BoogieTranslator took 165.35ms. Allocated memory is still 90.2MB. Free memory was 59.5MB in the beginning and 66.5MB in the end (delta: -7.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 17:28:43,935 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.18ms. Allocated memory is still 90.2MB. Free memory was 66.5MB in the beginning and 65.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 17:28:43,935 INFO L158 Benchmark]: Boogie Preprocessor took 10.49ms. Allocated memory is still 90.2MB. Free memory was 65.1MB in the beginning and 64.1MB in the end (delta: 918.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 17:28:43,936 INFO L158 Benchmark]: RCFGBuilder took 176.58ms. Allocated memory is still 90.2MB. Free memory was 64.1MB in the beginning and 55.2MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 17:28:43,936 INFO L158 Benchmark]: TraceAbstraction took 50309.06ms. Allocated memory was 90.2MB in the beginning and 750.8MB in the end (delta: 660.6MB). Free memory was 54.6MB in the beginning and 291.5MB in the end (delta: -236.9MB). Peak memory consumption was 424.6MB. Max. memory is 16.1GB. [2022-07-19 17:28:43,936 INFO L158 Benchmark]: Witness Printer took 138.02ms. Allocated memory was 750.8MB in the beginning and 901.8MB in the end (delta: 151.0MB). Free memory was 291.5MB in the beginning and 845.0MB in the end (delta: -553.5MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2022-07-19 17:28:43,937 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 90.2MB. Free memory is still 46.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 165.35ms. Allocated memory is still 90.2MB. Free memory was 59.5MB in the beginning and 66.5MB in the end (delta: -7.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.18ms. Allocated memory is still 90.2MB. Free memory was 66.5MB in the beginning and 65.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 10.49ms. Allocated memory is still 90.2MB. Free memory was 65.1MB in the beginning and 64.1MB in the end (delta: 918.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 176.58ms. Allocated memory is still 90.2MB. Free memory was 64.1MB in the beginning and 55.2MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 50309.06ms. Allocated memory was 90.2MB in the beginning and 750.8MB in the end (delta: 660.6MB). Free memory was 54.6MB in the beginning and 291.5MB in the end (delta: -236.9MB). Peak memory consumption was 424.6MB. Max. memory is 16.1GB. * Witness Printer took 138.02ms. Allocated memory was 750.8MB in the beginning and 901.8MB in the end (delta: 151.0MB). Free memory was 291.5MB in the beginning and 845.0MB in the end (delta: -553.5MB). Peak memory consumption was 23.2MB. 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: 50.1s, OverallIterations: 18, TraceHistogramMax: 117, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.1s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1797 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1708 mSDsluCounter, 5068 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4473 mSDsCounter, 2302 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13385 IncrementalHoareTripleChecker+Invalid, 15687 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2302 mSolverCounterUnsat, 595 mSDtfsCounter, 13385 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15913 GetRequests, 15256 SyntacticMatches, 19 SemanticMatches, 638 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9262 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred in iteration=17, InterpolantAutomatonStates: 485, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 314 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 33.9s InterpolantComputationTime, 14702 NumberOfCodeBlocks, 13031 NumberOfCodeBlocksAsserted, 112 NumberOfCheckSat, 20182 ConstructedInterpolants, 0 QuantifiedInterpolants, 25622 SizeOfPredicates, 85 NumberOfNonLiveVariables, 11489 ConjunctsInSsa, 200 ConjunctsInUnsatCore, 47 InterpolantComputations, 2 PerfectInterpolantSequences, 515955/557748 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-19 17:28:43,975 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