/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci04.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 04:50:29,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 04:50:29,336 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 04:50:29,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 04:50:29,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 04:50:29,404 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 04:50:29,408 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 04:50:29,415 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 04:50:29,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 04:50:29,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 04:50:29,426 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 04:50:29,427 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 04:50:29,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 04:50:29,431 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 04:50:29,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 04:50:29,435 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 04:50:29,436 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 04:50:29,439 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 04:50:29,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 04:50:29,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 04:50:29,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 04:50:29,459 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 04:50:29,460 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 04:50:29,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 04:50:29,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 04:50:29,472 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 04:50:29,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 04:50:29,474 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 04:50:29,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 04:50:29,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 04:50:29,476 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 04:50:29,477 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 04:50:29,479 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 04:50:29,480 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 04:50:29,481 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 04:50:29,482 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 04:50:29,483 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 04:50:29,483 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 04:50:29,483 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 04:50:29,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 04:50:29,485 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 04:50:29,486 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 04:50:29,508 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 04:50:29,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 04:50:29,513 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 04:50:29,513 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 04:50:29,513 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 04:50:29,513 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 04:50:29,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 04:50:29,514 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 04:50:29,514 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 04:50:29,514 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 04:50:29,515 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 04:50:29,515 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 04:50:29,516 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 04:50:29,516 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 04:50:29,516 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 04:50:29,516 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 04:50:29,517 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 04:50:29,517 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 04:50:29,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 04:50:29,517 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 04:50:29,517 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 04:50:29,518 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 04:50:29,518 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 04:50:29,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 04:50:29,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 04:50:29,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 04:50:29,988 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 04:50:29,989 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 04:50:29,990 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci04.c [2020-11-07 04:50:30,075 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d77ef277/bd7841be38824345a267e48c3ff132ea/FLAG30e71710f [2020-11-07 04:50:30,723 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 04:50:30,723 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci04.c [2020-11-07 04:50:30,732 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d77ef277/bd7841be38824345a267e48c3ff132ea/FLAG30e71710f [2020-11-07 04:50:31,104 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d77ef277/bd7841be38824345a267e48c3ff132ea [2020-11-07 04:50:31,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 04:50:31,117 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 04:50:31,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 04:50:31,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 04:50:31,129 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 04:50:31,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:50:31" (1/1) ... [2020-11-07 04:50:31,134 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37a1bf39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:31, skipping insertion in model container [2020-11-07 04:50:31,134 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:50:31" (1/1) ... [2020-11-07 04:50:31,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 04:50:31,162 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 04:50:31,391 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 04:50:31,403 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 04:50:31,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 04:50:31,439 INFO L208 MainTranslator]: Completed translation [2020-11-07 04:50:31,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:31 WrapperNode [2020-11-07 04:50:31,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 04:50:31,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 04:50:31,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 04:50:31,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 04:50:31,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:31" (1/1) ... [2020-11-07 04:50:31,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:31" (1/1) ... [2020-11-07 04:50:31,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:31" (1/1) ... [2020-11-07 04:50:31,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:31" (1/1) ... [2020-11-07 04:50:31,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:31" (1/1) ... [2020-11-07 04:50:31,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:31" (1/1) ... [2020-11-07 04:50:31,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:31" (1/1) ... [2020-11-07 04:50:31,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 04:50:31,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 04:50:31,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 04:50:31,478 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 04:50:31,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 04:50:31,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 04:50:31,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 04:50:31,558 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 04:50:31,559 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-11-07 04:50:31,559 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 04:50:31,559 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 04:50:31,559 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 04:50:31,559 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 04:50:31,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 04:50:31,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 04:50:31,560 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-11-07 04:50:31,560 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 04:50:31,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 04:50:31,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 04:50:31,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 04:50:31,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 04:50:31,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 04:50:31,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 04:50:31,818 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 04:50:31,818 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 04:50:31,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:50:31 BoogieIcfgContainer [2020-11-07 04:50:31,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 04:50:31,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 04:50:31,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 04:50:31,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 04:50:31,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:50:31" (1/3) ... [2020-11-07 04:50:31,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7919e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:50:31, skipping insertion in model container [2020-11-07 04:50:31,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:31" (2/3) ... [2020-11-07 04:50:31,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7919e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:50:31, skipping insertion in model container [2020-11-07 04:50:31,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:50:31" (3/3) ... [2020-11-07 04:50:31,847 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2020-11-07 04:50:31,895 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 04:50:31,898 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 04:50:31,930 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 04:50:31,979 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 04:50:31,984 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 04:50:31,984 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 04:50:31,984 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 04:50:31,984 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 04:50:31,984 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 04:50:31,985 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 04:50:31,985 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 04:50:32,012 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-11-07 04:50:32,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-07 04:50:32,028 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:32,030 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1] [2020-11-07 04:50:32,031 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:32,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:32,049 INFO L82 PathProgramCache]: Analyzing trace with hash 496375619, now seen corresponding path program 1 times [2020-11-07 04:50:32,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:32,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1215418112] [2020-11-07 04:50:32,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:32,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:32,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 04:50:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:32,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 04:50:32,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1215418112] [2020-11-07 04:50:32,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 04:50:32,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 04:50:32,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306160334] [2020-11-07 04:50:32,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 04:50:32,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:32,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 04:50:32,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 04:50:32,493 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 6 states. [2020-11-07 04:50:33,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:33,009 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2020-11-07 04:50:33,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 04:50:33,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-11-07 04:50:33,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:33,022 INFO L225 Difference]: With dead ends: 61 [2020-11-07 04:50:33,023 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 04:50:33,027 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 04:50:33,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 04:50:33,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-11-07 04:50:33,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 04:50:33,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-11-07 04:50:33,089 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 27 [2020-11-07 04:50:33,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:33,090 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-11-07 04:50:33,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 04:50:33,090 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-11-07 04:50:33,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-07 04:50:33,092 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:33,093 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2020-11-07 04:50:33,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 04:50:33,093 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:33,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:33,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1977921721, now seen corresponding path program 1 times [2020-11-07 04:50:33,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:33,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [823415059] [2020-11-07 04:50:33,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:33,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:33,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 04:50:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:33,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 04:50:33,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [823415059] [2020-11-07 04:50:33,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 04:50:33,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 04:50:33,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283606023] [2020-11-07 04:50:33,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 04:50:33,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:33,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 04:50:33,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 04:50:33,253 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 6 states. [2020-11-07 04:50:33,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:33,549 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2020-11-07 04:50:33,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 04:50:33,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-11-07 04:50:33,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:33,552 INFO L225 Difference]: With dead ends: 48 [2020-11-07 04:50:33,552 INFO L226 Difference]: Without dead ends: 41 [2020-11-07 04:50:33,553 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 04:50:33,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-11-07 04:50:33,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2020-11-07 04:50:33,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 04:50:33,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-11-07 04:50:33,570 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 28 [2020-11-07 04:50:33,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:33,572 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-11-07 04:50:33,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 04:50:33,572 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-11-07 04:50:33,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-07 04:50:33,574 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:33,575 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:33,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 04:50:33,575 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:33,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:33,576 INFO L82 PathProgramCache]: Analyzing trace with hash -788452534, now seen corresponding path program 1 times [2020-11-07 04:50:33,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:33,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [102815188] [2020-11-07 04:50:33,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:33,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:33,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 04:50:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:33,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:33,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 04:50:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:33,839 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 04:50:33,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [102815188] [2020-11-07 04:50:33,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:33,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 04:50:33,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962404573] [2020-11-07 04:50:33,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 04:50:33,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:33,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 04:50:33,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 04:50:33,849 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2020-11-07 04:50:34,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:34,182 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2020-11-07 04:50:34,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 04:50:34,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2020-11-07 04:50:34,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:34,186 INFO L225 Difference]: With dead ends: 64 [2020-11-07 04:50:34,186 INFO L226 Difference]: Without dead ends: 41 [2020-11-07 04:50:34,189 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-11-07 04:50:34,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-11-07 04:50:34,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-11-07 04:50:34,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-11-07 04:50:34,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-11-07 04:50:34,219 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 44 [2020-11-07 04:50:34,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:34,220 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-11-07 04:50:34,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 04:50:34,221 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2020-11-07 04:50:34,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-07 04:50:34,226 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:34,226 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:34,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 04:50:34,226 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:34,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:34,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1354967602, now seen corresponding path program 1 times [2020-11-07 04:50:34,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:34,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [261681117] [2020-11-07 04:50:34,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 04:50:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,456 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 04:50:34,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [261681117] [2020-11-07 04:50:34,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:34,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 04:50:34,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787615760] [2020-11-07 04:50:34,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 04:50:34,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:34,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 04:50:34,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 04:50:34,459 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2020-11-07 04:50:34,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:34,812 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2020-11-07 04:50:34,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 04:50:34,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2020-11-07 04:50:34,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:34,815 INFO L225 Difference]: With dead ends: 68 [2020-11-07 04:50:34,815 INFO L226 Difference]: Without dead ends: 61 [2020-11-07 04:50:34,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-11-07 04:50:34,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-11-07 04:50:34,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-11-07 04:50:34,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-07 04:50:34,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-11-07 04:50:34,837 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 45 [2020-11-07 04:50:34,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:34,837 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-11-07 04:50:34,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 04:50:34,838 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-11-07 04:50:34,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-07 04:50:34,840 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:34,841 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:34,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 04:50:34,841 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:34,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:34,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2028047931, now seen corresponding path program 2 times [2020-11-07 04:50:34,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:34,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2125874469] [2020-11-07 04:50:34,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 04:50:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-07 04:50:35,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2125874469] [2020-11-07 04:50:35,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:35,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 04:50:35,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975552951] [2020-11-07 04:50:35,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 04:50:35,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:35,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 04:50:35,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 04:50:35,035 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 8 states. [2020-11-07 04:50:35,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:35,483 INFO L93 Difference]: Finished difference Result 120 states and 163 transitions. [2020-11-07 04:50:35,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 04:50:35,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2020-11-07 04:50:35,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:35,486 INFO L225 Difference]: With dead ends: 120 [2020-11-07 04:50:35,486 INFO L226 Difference]: Without dead ends: 75 [2020-11-07 04:50:35,488 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 04:50:35,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-11-07 04:50:35,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2020-11-07 04:50:35,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-07 04:50:35,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2020-11-07 04:50:35,515 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 62 [2020-11-07 04:50:35,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:35,516 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2020-11-07 04:50:35,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 04:50:35,516 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2020-11-07 04:50:35,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-07 04:50:35,522 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:35,522 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:35,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 04:50:35,523 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:35,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:35,526 INFO L82 PathProgramCache]: Analyzing trace with hash -64263789, now seen corresponding path program 3 times [2020-11-07 04:50:35,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:35,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [340234975] [2020-11-07 04:50:35,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:35,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:35,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 04:50:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:35,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:35,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:35,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:35,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:35,764 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-07 04:50:35,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [340234975] [2020-11-07 04:50:35,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:35,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 04:50:35,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518172961] [2020-11-07 04:50:35,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 04:50:35,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:35,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 04:50:35,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 04:50:35,767 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand 8 states. [2020-11-07 04:50:36,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:36,338 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2020-11-07 04:50:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 04:50:36,342 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2020-11-07 04:50:36,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:36,347 INFO L225 Difference]: With dead ends: 98 [2020-11-07 04:50:36,347 INFO L226 Difference]: Without dead ends: 91 [2020-11-07 04:50:36,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-11-07 04:50:36,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-11-07 04:50:36,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2020-11-07 04:50:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-11-07 04:50:36,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2020-11-07 04:50:36,407 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 63 [2020-11-07 04:50:36,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:36,408 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2020-11-07 04:50:36,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 04:50:36,408 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2020-11-07 04:50:36,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-07 04:50:36,411 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:36,411 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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] [2020-11-07 04:50:36,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 04:50:36,412 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:36,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:36,418 INFO L82 PathProgramCache]: Analyzing trace with hash -143796757, now seen corresponding path program 4 times [2020-11-07 04:50:36,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:36,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2060140630] [2020-11-07 04:50:36,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:36,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:36,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 04:50:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:36,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:36,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:36,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:36,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:36,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:36,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:50:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:36,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:36,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:36,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:36,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:36,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:36,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:50:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:36,839 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 36 proven. 197 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2020-11-07 04:50:36,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2060140630] [2020-11-07 04:50:36,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:36,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 04:50:36,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38330540] [2020-11-07 04:50:36,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 04:50:36,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:36,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 04:50:36,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 04:50:36,846 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 9 states. [2020-11-07 04:50:37,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:37,500 INFO L93 Difference]: Finished difference Result 148 states and 201 transitions. [2020-11-07 04:50:37,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 04:50:37,502 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2020-11-07 04:50:37,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:37,507 INFO L225 Difference]: With dead ends: 148 [2020-11-07 04:50:37,507 INFO L226 Difference]: Without dead ends: 141 [2020-11-07 04:50:37,508 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-11-07 04:50:37,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-11-07 04:50:37,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 129. [2020-11-07 04:50:37,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-11-07 04:50:37,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 179 transitions. [2020-11-07 04:50:37,555 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 179 transitions. Word has length 134 [2020-11-07 04:50:37,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:37,556 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 179 transitions. [2020-11-07 04:50:37,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 04:50:37,556 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 179 transitions. [2020-11-07 04:50:37,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-11-07 04:50:37,560 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:37,560 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:37,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 04:50:37,560 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:37,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:37,561 INFO L82 PathProgramCache]: Analyzing trace with hash 91119029, now seen corresponding path program 5 times [2020-11-07 04:50:37,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:37,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1742370481] [2020-11-07 04:50:37,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:37,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:37,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 04:50:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:37,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:37,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:37,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:37,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:37,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:37,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:37,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:50:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:37,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:37,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:37,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:50:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:37,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:37,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:38,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:38,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:38,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:38,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 04:50:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:38,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 04:50:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:38,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 04:50:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:38,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 04:50:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:38,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:50:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:38,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 465 proven. 132 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2020-11-07 04:50:38,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1742370481] [2020-11-07 04:50:38,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:38,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 04:50:38,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546311610] [2020-11-07 04:50:38,189 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 04:50:38,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:38,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 04:50:38,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-11-07 04:50:38,190 INFO L87 Difference]: Start difference. First operand 129 states and 179 transitions. Second operand 11 states. [2020-11-07 04:50:39,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:39,312 INFO L93 Difference]: Finished difference Result 430 states and 765 transitions. [2020-11-07 04:50:39,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 04:50:39,312 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 204 [2020-11-07 04:50:39,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:39,318 INFO L225 Difference]: With dead ends: 430 [2020-11-07 04:50:39,318 INFO L226 Difference]: Without dead ends: 159 [2020-11-07 04:50:39,325 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2020-11-07 04:50:39,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-11-07 04:50:39,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2020-11-07 04:50:39,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-11-07 04:50:39,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 188 transitions. [2020-11-07 04:50:39,401 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 188 transitions. Word has length 204 [2020-11-07 04:50:39,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:39,405 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 188 transitions. [2020-11-07 04:50:39,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 04:50:39,405 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 188 transitions. [2020-11-07 04:50:39,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-11-07 04:50:39,411 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:39,411 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:39,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 04:50:39,411 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:39,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:39,412 INFO L82 PathProgramCache]: Analyzing trace with hash -465623392, now seen corresponding path program 6 times [2020-11-07 04:50:39,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:39,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1381729470] [2020-11-07 04:50:39,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 04:50:39,445 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 04:50:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 04:50:39,487 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 04:50:39,562 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 04:50:39,562 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 04:50:39,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 04:50:39,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:50:39 BoogieIcfgContainer [2020-11-07 04:50:39,686 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 04:50:39,695 INFO L168 Benchmark]: Toolchain (without parser) took 8577.38 ms. Allocated memory was 152.0 MB in the beginning and 219.2 MB in the end (delta: 67.1 MB). Free memory was 128.0 MB in the beginning and 125.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 69.5 MB. Max. memory is 8.0 GB. [2020-11-07 04:50:39,697 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 125.8 MB. Free memory is still 98.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 04:50:39,699 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.33 ms. Allocated memory is still 152.0 MB. Free memory was 127.3 MB in the beginning and 118.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 04:50:39,700 INFO L168 Benchmark]: Boogie Preprocessor took 34.93 ms. Allocated memory is still 152.0 MB. Free memory was 118.1 MB in the beginning and 116.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 04:50:39,701 INFO L168 Benchmark]: RCFGBuilder took 343.74 ms. Allocated memory is still 152.0 MB. Free memory was 116.7 MB in the beginning and 128.8 MB in the end (delta: -12.0 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2020-11-07 04:50:39,704 INFO L168 Benchmark]: TraceAbstraction took 7862.91 ms. Allocated memory was 152.0 MB in the beginning and 219.2 MB in the end (delta: 67.1 MB). Free memory was 128.4 MB in the beginning and 125.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 69.5 MB. Max. memory is 8.0 GB. [2020-11-07 04:50:39,714 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.22 ms. Allocated memory is still 125.8 MB. Free memory is still 98.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 316.33 ms. Allocated memory is still 152.0 MB. Free memory was 127.3 MB in the beginning and 118.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 34.93 ms. Allocated memory is still 152.0 MB. Free memory was 118.1 MB in the beginning and 116.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 343.74 ms. Allocated memory is still 152.0 MB. Free memory was 116.7 MB in the beginning and 128.8 MB in the end (delta: -12.0 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 7862.91 ms. Allocated memory was 152.0 MB in the beginning and 219.2 MB in the end (delta: 67.1 MB). Free memory was 128.4 MB in the beginning and 125.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 69.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L30] int x = __VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=5, x=5] [L31] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L19] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L21] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L19] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L21] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L24] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=4, \result=3, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L24] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=5, \result=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L31] RET, EXPR fibonacci(x) VAL [fibonacci(x)=5, x=5] [L31] int result = fibonacci(x); VAL [fibonacci(x)=5, result=5, x=5] [L32] COND FALSE !(x != 5 || result == 3) VAL [result=5, x=5] [L35] CALL reach_error() [L3] __assert_fail("0", "Fibonacci04.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.5s, OverallIterations: 9, TraceHistogramMax: 21, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 324 SDtfs, 459 SDslu, 430 SDs, 0 SdLazy, 1100 SolverSat, 241 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 32 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 758 NumberOfCodeBlocks, 758 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 599 ConstructedInterpolants, 0 QuantifiedInterpolants, 132465 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 1558/1932 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! Received shutdown request...