/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-b8ad66e [2020-10-24 00:38:13,392 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:38:13,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:38:13,435 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:38:13,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:38:13,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:38:13,443 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:38:13,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:38:13,453 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:38:13,461 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:38:13,462 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:38:13,463 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:38:13,464 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:38:13,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:38:13,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:38:13,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:38:13,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:38:13,476 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:38:13,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:38:13,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:38:13,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:38:13,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:38:13,511 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:38:13,513 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:38:13,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:38:13,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:38:13,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:38:13,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:38:13,522 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:38:13,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:38:13,525 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:38:13,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:38:13,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:38:13,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:38:13,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:38:13,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:38:13,531 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:38:13,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:38:13,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:38:13,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:38:13,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:38:13,534 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 00:38:13,556 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:38:13,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:38:13,561 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:38:13,562 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:38:13,562 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:38:13,562 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:38:13,562 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:38:13,562 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:38:13,563 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:38:13,563 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:38:13,564 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:38:13,564 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:38:13,564 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:38:13,565 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:38:13,565 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:38:13,565 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:38:13,565 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:38:13,565 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:38:13,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:38:13,566 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:38:13,566 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:38:13,566 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:38:13,566 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-10-24 00:38:13,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:38:13,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:38:13,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:38:13,998 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:38:13,999 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:38:14,000 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci04.c [2020-10-24 00:38:14,072 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c279efb5/ba6dab86bcc240aeb2d1bede973d4072/FLAGe0c6dd55d [2020-10-24 00:38:14,664 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:38:14,665 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci04.c [2020-10-24 00:38:14,673 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c279efb5/ba6dab86bcc240aeb2d1bede973d4072/FLAGe0c6dd55d [2020-10-24 00:38:15,018 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c279efb5/ba6dab86bcc240aeb2d1bede973d4072 [2020-10-24 00:38:15,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:38:15,030 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:38:15,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:38:15,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:38:15,035 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:38:15,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:38:15" (1/1) ... [2020-10-24 00:38:15,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b33b144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:38:15, skipping insertion in model container [2020-10-24 00:38:15,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:38:15" (1/1) ... [2020-10-24 00:38:15,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:38:15,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:38:15,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:38:15,230 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:38:15,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:38:15,259 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:38:15,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:38:15 WrapperNode [2020-10-24 00:38:15,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:38:15,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:38:15,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:38:15,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:38:15,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:38:15" (1/1) ... [2020-10-24 00:38:15,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:38:15" (1/1) ... [2020-10-24 00:38:15,281 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:38:15" (1/1) ... [2020-10-24 00:38:15,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:38:15" (1/1) ... [2020-10-24 00:38:15,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:38:15" (1/1) ... [2020-10-24 00:38:15,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:38:15" (1/1) ... [2020-10-24 00:38:15,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:38:15" (1/1) ... [2020-10-24 00:38:15,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:38:15,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:38:15,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:38:15,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:38:15,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:38:15" (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-10-24 00:38:15,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:38:15,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:38:15,363 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:38:15,363 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-10-24 00:38:15,363 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:38:15,363 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:38:15,364 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:38:15,364 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:38:15,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:38:15,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 00:38:15,365 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-10-24 00:38:15,365 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:38:15,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:38:15,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:38:15,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:38:15,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:38:15,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:38:15,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:38:15,840 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:38:15,841 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:38:15,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:38:15 BoogieIcfgContainer [2020-10-24 00:38:15,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:38:15,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:38:15,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:38:15,854 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:38:15,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:38:15" (1/3) ... [2020-10-24 00:38:15,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@719f864e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:38:15, skipping insertion in model container [2020-10-24 00:38:15,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:38:15" (2/3) ... [2020-10-24 00:38:15,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@719f864e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:38:15, skipping insertion in model container [2020-10-24 00:38:15,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:38:15" (3/3) ... [2020-10-24 00:38:15,857 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2020-10-24 00:38:15,869 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:38:15,873 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:38:15,887 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:38:15,911 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:38:15,912 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:38:15,912 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:38:15,912 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:38:15,912 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:38:15,912 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:38:15,912 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:38:15,912 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:38:15,928 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-10-24 00:38:15,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-24 00:38:15,939 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:15,940 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-10-24 00:38:15,941 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:15,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:15,955 INFO L82 PathProgramCache]: Analyzing trace with hash 496375619, now seen corresponding path program 1 times [2020-10-24 00:38:15,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:15,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1208242018] [2020-10-24 00:38:15,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:16,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:16,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 00:38:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:16,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:38:16,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1208242018] [2020-10-24 00:38:16,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:38:16,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:38:16,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879450227] [2020-10-24 00:38:16,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:38:16,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:16,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:38:16,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:38:16,409 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 6 states. [2020-10-24 00:38:16,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:16,737 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2020-10-24 00:38:16,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 00:38:16,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-10-24 00:38:16,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:16,750 INFO L225 Difference]: With dead ends: 61 [2020-10-24 00:38:16,750 INFO L226 Difference]: Without dead ends: 39 [2020-10-24 00:38:16,754 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-10-24 00:38:16,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-24 00:38:16,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-10-24 00:38:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-24 00:38:16,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-10-24 00:38:16,811 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 27 [2020-10-24 00:38:16,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:16,812 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-10-24 00:38:16,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:38:16,812 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-10-24 00:38:16,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-24 00:38:16,815 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:16,815 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-10-24 00:38:16,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:38:16,816 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:16,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:16,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1977921721, now seen corresponding path program 1 times [2020-10-24 00:38:16,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:16,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2088933330] [2020-10-24 00:38:16,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:16,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:16,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 00:38:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:16,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:38:16,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2088933330] [2020-10-24 00:38:16,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:38:16,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:38:16,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453012340] [2020-10-24 00:38:16,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:38:16,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:16,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:38:16,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:38:16,947 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 6 states. [2020-10-24 00:38:17,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:17,214 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2020-10-24 00:38:17,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 00:38:17,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-10-24 00:38:17,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:17,218 INFO L225 Difference]: With dead ends: 48 [2020-10-24 00:38:17,218 INFO L226 Difference]: Without dead ends: 41 [2020-10-24 00:38:17,219 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-10-24 00:38:17,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-10-24 00:38:17,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2020-10-24 00:38:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-24 00:38:17,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-10-24 00:38:17,236 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 28 [2020-10-24 00:38:17,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:17,236 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-10-24 00:38:17,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:38:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-10-24 00:38:17,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-10-24 00:38:17,239 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:17,239 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-10-24 00:38:17,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:38:17,240 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:17,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:17,240 INFO L82 PathProgramCache]: Analyzing trace with hash -788452534, now seen corresponding path program 1 times [2020-10-24 00:38:17,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:17,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [314346044] [2020-10-24 00:38:17,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:17,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:17,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 00:38:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:17,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:17,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 00:38:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 00:38:17,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [314346044] [2020-10-24 00:38:17,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:38:17,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:38:17,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620726103] [2020-10-24 00:38:17,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:38:17,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:17,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:38:17,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:38:17,444 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2020-10-24 00:38:17,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:17,692 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2020-10-24 00:38:17,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:38:17,693 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2020-10-24 00:38:17,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:17,695 INFO L225 Difference]: With dead ends: 64 [2020-10-24 00:38:17,695 INFO L226 Difference]: Without dead ends: 41 [2020-10-24 00:38:17,696 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:38:17,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-10-24 00:38:17,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-10-24 00:38:17,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-24 00:38:17,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-10-24 00:38:17,709 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 44 [2020-10-24 00:38:17,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:17,710 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-10-24 00:38:17,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:38:17,710 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2020-10-24 00:38:17,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-24 00:38:17,712 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:17,712 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-10-24 00:38:17,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:38:17,712 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:17,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:17,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1354967602, now seen corresponding path program 1 times [2020-10-24 00:38:17,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:17,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2082531074] [2020-10-24 00:38:17,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:17,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:17,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 00:38:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:17,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:17,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:38:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-24 00:38:17,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2082531074] [2020-10-24 00:38:17,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:38:17,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:38:17,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443540529] [2020-10-24 00:38:17,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:38:17,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:17,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:38:17,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:38:17,860 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2020-10-24 00:38:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:18,215 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2020-10-24 00:38:18,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:38:18,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2020-10-24 00:38:18,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:18,219 INFO L225 Difference]: With dead ends: 68 [2020-10-24 00:38:18,219 INFO L226 Difference]: Without dead ends: 61 [2020-10-24 00:38:18,220 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-10-24 00:38:18,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-10-24 00:38:18,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-10-24 00:38:18,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-24 00:38:18,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-10-24 00:38:18,240 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 45 [2020-10-24 00:38:18,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:18,240 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-10-24 00:38:18,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:38:18,241 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-10-24 00:38:18,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-10-24 00:38:18,243 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:18,244 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-10-24 00:38:18,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:38:18,244 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:18,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:18,245 INFO L82 PathProgramCache]: Analyzing trace with hash 2028047931, now seen corresponding path program 2 times [2020-10-24 00:38:18,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:18,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [167447034] [2020-10-24 00:38:18,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:18,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:18,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 00:38:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:18,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:18,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:18,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:38:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:18,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:38:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:18,405 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-10-24 00:38:18,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [167447034] [2020-10-24 00:38:18,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:38:18,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:38:18,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537722280] [2020-10-24 00:38:18,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:38:18,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:18,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:38:18,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:38:18,408 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 8 states. [2020-10-24 00:38:18,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:18,846 INFO L93 Difference]: Finished difference Result 120 states and 163 transitions. [2020-10-24 00:38:18,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:38:18,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2020-10-24 00:38:18,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:18,849 INFO L225 Difference]: With dead ends: 120 [2020-10-24 00:38:18,849 INFO L226 Difference]: Without dead ends: 75 [2020-10-24 00:38:18,851 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:38:18,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-10-24 00:38:18,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2020-10-24 00:38:18,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-24 00:38:18,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2020-10-24 00:38:18,872 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 62 [2020-10-24 00:38:18,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:18,873 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2020-10-24 00:38:18,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:38:18,873 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2020-10-24 00:38:18,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-24 00:38:18,875 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:18,875 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-10-24 00:38:18,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:38:18,876 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:18,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:18,876 INFO L82 PathProgramCache]: Analyzing trace with hash -64263789, now seen corresponding path program 3 times [2020-10-24 00:38:18,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:18,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [948193570] [2020-10-24 00:38:18,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:18,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:18,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 00:38:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:18,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:18,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:19,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:38:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:19,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:38:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:19,019 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-10-24 00:38:19,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [948193570] [2020-10-24 00:38:19,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:38:19,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:38:19,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152561584] [2020-10-24 00:38:19,021 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:38:19,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:19,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:38:19,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:38:19,022 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand 8 states. [2020-10-24 00:38:19,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:19,490 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2020-10-24 00:38:19,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 00:38:19,493 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2020-10-24 00:38:19,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:19,495 INFO L225 Difference]: With dead ends: 98 [2020-10-24 00:38:19,495 INFO L226 Difference]: Without dead ends: 91 [2020-10-24 00:38:19,496 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-10-24 00:38:19,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-10-24 00:38:19,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2020-10-24 00:38:19,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-10-24 00:38:19,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2020-10-24 00:38:19,523 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 63 [2020-10-24 00:38:19,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:19,523 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2020-10-24 00:38:19,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:38:19,524 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2020-10-24 00:38:19,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-10-24 00:38:19,526 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:19,526 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-10-24 00:38:19,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:38:19,527 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:19,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:19,528 INFO L82 PathProgramCache]: Analyzing trace with hash -143796757, now seen corresponding path program 4 times [2020-10-24 00:38:19,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:19,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1394491304] [2020-10-24 00:38:19,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:19,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:19,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 00:38:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:19,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:19,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:19,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:19,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:38:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:19,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:38:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:19,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:38:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:19,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:19,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:19,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:19,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:38:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:19,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:38:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:19,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:38:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:19,831 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 36 proven. 197 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2020-10-24 00:38:19,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1394491304] [2020-10-24 00:38:19,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:38:19,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:38:19,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049818986] [2020-10-24 00:38:19,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:38:19,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:19,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:38:19,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:38:19,853 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 9 states. [2020-10-24 00:38:20,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:20,550 INFO L93 Difference]: Finished difference Result 148 states and 201 transitions. [2020-10-24 00:38:20,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:38:20,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2020-10-24 00:38:20,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:20,558 INFO L225 Difference]: With dead ends: 148 [2020-10-24 00:38:20,559 INFO L226 Difference]: Without dead ends: 141 [2020-10-24 00:38:20,562 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-10-24 00:38:20,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-10-24 00:38:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 129. [2020-10-24 00:38:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-10-24 00:38:20,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 179 transitions. [2020-10-24 00:38:20,638 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 179 transitions. Word has length 134 [2020-10-24 00:38:20,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:20,639 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 179 transitions. [2020-10-24 00:38:20,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:38:20,639 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 179 transitions. [2020-10-24 00:38:20,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-10-24 00:38:20,650 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:20,651 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-10-24 00:38:20,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:38:20,651 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:20,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:20,652 INFO L82 PathProgramCache]: Analyzing trace with hash 91119029, now seen corresponding path program 5 times [2020-10-24 00:38:20,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:20,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1535463660] [2020-10-24 00:38:20,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:20,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:20,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 00:38:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:20,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:20,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:20,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:20,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:20,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:38:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:20,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:38:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:20,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:38:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:20,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:21,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:38:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:21,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:38:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:21,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:21,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:21,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:21,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:21,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:38:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:21,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:38:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:21,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:38:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:21,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:21,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:38:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:21,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:38:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 465 proven. 132 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2020-10-24 00:38:21,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1535463660] [2020-10-24 00:38:21,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:38:21,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:38:21,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221919246] [2020-10-24 00:38:21,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:38:21,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:21,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:38:21,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:38:21,250 INFO L87 Difference]: Start difference. First operand 129 states and 179 transitions. Second operand 11 states. [2020-10-24 00:38:22,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:22,331 INFO L93 Difference]: Finished difference Result 430 states and 765 transitions. [2020-10-24 00:38:22,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 00:38:22,332 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 204 [2020-10-24 00:38:22,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:22,340 INFO L225 Difference]: With dead ends: 430 [2020-10-24 00:38:22,340 INFO L226 Difference]: Without dead ends: 159 [2020-10-24 00:38:22,346 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2020-10-24 00:38:22,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-10-24 00:38:22,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2020-10-24 00:38:22,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-10-24 00:38:22,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 188 transitions. [2020-10-24 00:38:22,406 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 188 transitions. Word has length 204 [2020-10-24 00:38:22,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:22,408 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 188 transitions. [2020-10-24 00:38:22,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:38:22,408 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 188 transitions. [2020-10-24 00:38:22,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-10-24 00:38:22,413 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:22,413 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-10-24 00:38:22,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:38:22,413 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:22,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:22,414 INFO L82 PathProgramCache]: Analyzing trace with hash -465623392, now seen corresponding path program 6 times [2020-10-24 00:38:22,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:22,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [766439530] [2020-10-24 00:38:22,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 00:38:22,441 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 00:38:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 00:38:22,464 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 00:38:22,522 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-24 00:38:22,523 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 00:38:22,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:38:22,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:38:22 BoogieIcfgContainer [2020-10-24 00:38:22,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 00:38:22,625 INFO L168 Benchmark]: Toolchain (without parser) took 7598.30 ms. Allocated memory was 153.1 MB in the beginning and 231.7 MB in the end (delta: 78.6 MB). Free memory was 129.9 MB in the beginning and 136.2 MB in the end (delta: -6.3 MB). Peak memory consumption was 73.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:38:22,625 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 153.1 MB. Free memory was 127.0 MB in the beginning and 126.9 MB in the end (delta: 107.3 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:38:22,627 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.67 ms. Allocated memory is still 153.1 MB. Free memory was 129.2 MB in the beginning and 119.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:38:22,628 INFO L168 Benchmark]: Boogie Preprocessor took 30.92 ms. Allocated memory is still 153.1 MB. Free memory was 119.9 MB in the beginning and 118.7 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-24 00:38:22,629 INFO L168 Benchmark]: RCFGBuilder took 553.43 ms. Allocated memory is still 153.1 MB. Free memory was 118.5 MB in the beginning and 104.7 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-10-24 00:38:22,633 INFO L168 Benchmark]: TraceAbstraction took 6771.69 ms. Allocated memory was 153.1 MB in the beginning and 231.7 MB in the end (delta: 78.6 MB). Free memory was 104.3 MB in the beginning and 136.2 MB in the end (delta: -31.9 MB). Peak memory consumption was 47.2 MB. Max. memory is 8.0 GB. [2020-10-24 00:38:22,640 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.25 ms. Allocated memory is still 153.1 MB. Free memory was 127.0 MB in the beginning and 126.9 MB in the end (delta: 107.3 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 228.67 ms. Allocated memory is still 153.1 MB. Free memory was 129.2 MB in the beginning and 119.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 30.92 ms. Allocated memory is still 153.1 MB. Free memory was 119.9 MB in the beginning and 118.7 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 553.43 ms. Allocated memory is still 153.1 MB. Free memory was 118.5 MB in the beginning and 104.7 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 6771.69 ms. Allocated memory was 153.1 MB in the beginning and 231.7 MB in the end (delta: 78.6 MB). Free memory was 104.3 MB in the beginning and 136.2 MB in the end (delta: -31.9 MB). Peak memory consumption was 47.2 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: 6.6s, OverallIterations: 9, TraceHistogramMax: 21, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 324 SDtfs, 459 SDslu, 430 SDs, 0 SdLazy, 1100 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.0s 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.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 32 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s 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...