/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-simple/fibo_2calls_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:49:02,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:49:02,403 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:49:02,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:49:02,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:49:02,464 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:49:02,468 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:49:02,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:49:02,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:49:02,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:49:02,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:49:02,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:49:02,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:49:02,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:49:02,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:49:02,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:49:02,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:49:02,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:49:02,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:49:02,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:49:02,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:49:02,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:49:02,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:49:02,523 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:49:02,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:49:02,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:49:02,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:49:02,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:49:02,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:49:02,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:49:02,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:49:02,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:49:02,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:49:02,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:49:02,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:49:02,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:49:02,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:49:02,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:49:02,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:49:02,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:49:02,542 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:49:02,543 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:49:02,571 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:49:02,571 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:49:02,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:49:02,577 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:49:02,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:49:02,578 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:49:02,578 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:49:02,578 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:49:02,578 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:49:02,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:49:02,580 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:49:02,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:49:02,580 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:49:02,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:49:02,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:49:02,581 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:49:02,581 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:49:02,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:49:02,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:49:02,582 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:49:02,582 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:49:02,582 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:49:02,582 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:49:02,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:49:03,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:49:03,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:49:03,040 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:49:03,041 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:49:03,042 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_2-2.c [2020-10-24 00:49:03,142 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b01210506/acbf74f6e7eb40c99be54fc4addd3718/FLAG05746d34b [2020-10-24 00:49:03,974 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:49:03,975 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_2-2.c [2020-10-24 00:49:03,983 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b01210506/acbf74f6e7eb40c99be54fc4addd3718/FLAG05746d34b [2020-10-24 00:49:04,355 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b01210506/acbf74f6e7eb40c99be54fc4addd3718 [2020-10-24 00:49:04,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:49:04,367 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:49:04,369 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:49:04,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:49:04,378 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:49:04,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:49:04" (1/1) ... [2020-10-24 00:49:04,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f8031a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:04, skipping insertion in model container [2020-10-24 00:49:04,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:49:04" (1/1) ... [2020-10-24 00:49:04,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:49:04,415 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:49:04,654 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:49:04,667 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:49:04,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:49:04,711 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:49:04,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:04 WrapperNode [2020-10-24 00:49:04,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:49:04,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:49:04,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:49:04,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:49:04,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:04" (1/1) ... [2020-10-24 00:49:04,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:04" (1/1) ... [2020-10-24 00:49:04,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:04" (1/1) ... [2020-10-24 00:49:04,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:04" (1/1) ... [2020-10-24 00:49:04,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:04" (1/1) ... [2020-10-24 00:49:04,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:04" (1/1) ... [2020-10-24 00:49:04,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:04" (1/1) ... [2020-10-24 00:49:04,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:49:04,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:49:04,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:49:04,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:49:04,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:04" (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:49:04,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:49:04,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:49:04,852 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:49:04,852 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-10-24 00:49:04,852 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-10-24 00:49:04,852 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:49:04,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 00:49:04,853 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:49:04,853 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:49:04,853 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:49:04,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:49:04,853 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-10-24 00:49:04,854 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-10-24 00:49:04,854 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:49:04,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:49:04,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:49:04,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:49:04,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:49:04,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:49:04,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:49:05,236 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:49:05,237 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:49:05,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:49:05 BoogieIcfgContainer [2020-10-24 00:49:05,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:49:05,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:49:05,267 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:49:05,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:49:05,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:49:04" (1/3) ... [2020-10-24 00:49:05,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c49f99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:49:05, skipping insertion in model container [2020-10-24 00:49:05,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:04" (2/3) ... [2020-10-24 00:49:05,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c49f99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:49:05, skipping insertion in model container [2020-10-24 00:49:05,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:49:05" (3/3) ... [2020-10-24 00:49:05,290 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_2-2.c [2020-10-24 00:49:05,336 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:49:05,353 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:49:05,371 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:49:05,401 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:49:05,401 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:49:05,401 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:49:05,401 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:49:05,402 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:49:05,402 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:49:05,402 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:49:05,402 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:49:05,425 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-10-24 00:49:05,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-24 00:49:05,437 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:49:05,438 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] [2020-10-24 00:49:05,438 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:49:05,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:49:05,446 INFO L82 PathProgramCache]: Analyzing trace with hash 775886402, now seen corresponding path program 1 times [2020-10-24 00:49:05,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:49:05,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [170106824] [2020-10-24 00:49:05,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:49:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:05,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:49:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:05,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:49:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:05,879 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:49:05,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [170106824] [2020-10-24 00:49:05,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:49:05,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:49:05,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594146620] [2020-10-24 00:49:05,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:49:05,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:49:05,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:49:05,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:49:05,913 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 6 states. [2020-10-24 00:49:06,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:49:06,618 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2020-10-24 00:49:06,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 00:49:06,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-24 00:49:06,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:49:06,635 INFO L225 Difference]: With dead ends: 71 [2020-10-24 00:49:06,636 INFO L226 Difference]: Without dead ends: 51 [2020-10-24 00:49:06,640 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:49:06,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-24 00:49:06,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-10-24 00:49:06,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-24 00:49:06,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-10-24 00:49:06,773 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 25 [2020-10-24 00:49:06,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:49:06,775 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-10-24 00:49:06,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:49:06,775 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-10-24 00:49:06,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-24 00:49:06,784 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:49:06,784 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] [2020-10-24 00:49:06,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:49:06,786 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:49:06,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:49:06,789 INFO L82 PathProgramCache]: Analyzing trace with hash 478831265, now seen corresponding path program 1 times [2020-10-24 00:49:06,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:49:06,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [568269817] [2020-10-24 00:49:06,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:49:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:06,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:49:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:06,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:49:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:06,980 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:49:06,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [568269817] [2020-10-24 00:49:06,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:49:06,982 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:49:06,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205451327] [2020-10-24 00:49:06,984 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:49:06,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:49:06,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:49:06,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:49:06,986 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2020-10-24 00:49:07,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:49:07,517 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-10-24 00:49:07,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 00:49:07,518 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-10-24 00:49:07,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:49:07,521 INFO L225 Difference]: With dead ends: 60 [2020-10-24 00:49:07,521 INFO L226 Difference]: Without dead ends: 53 [2020-10-24 00:49:07,523 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-10-24 00:49:07,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-24 00:49:07,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-10-24 00:49:07,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-24 00:49:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-10-24 00:49:07,548 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 26 [2020-10-24 00:49:07,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:49:07,549 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-10-24 00:49:07,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:49:07,549 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-10-24 00:49:07,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-10-24 00:49:07,551 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:49:07,552 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:49:07,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:49:07,552 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:49:07,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:49:07,553 INFO L82 PathProgramCache]: Analyzing trace with hash -708858972, now seen corresponding path program 1 times [2020-10-24 00:49:07,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:49:07,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [263907007] [2020-10-24 00:49:07,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:49:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:07,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:49:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:07,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:49:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:07,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:49:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:07,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 00:49:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:07,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-24 00:49:07,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [263907007] [2020-10-24 00:49:07,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:49:07,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:49:07,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407564960] [2020-10-24 00:49:07,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:49:07,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:49:07,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:49:07,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:49:07,869 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 8 states. [2020-10-24 00:49:08,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:49:08,618 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2020-10-24 00:49:08,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:49:08,619 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2020-10-24 00:49:08,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:49:08,621 INFO L225 Difference]: With dead ends: 92 [2020-10-24 00:49:08,621 INFO L226 Difference]: Without dead ends: 55 [2020-10-24 00:49:08,623 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:49:08,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-10-24 00:49:08,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2020-10-24 00:49:08,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-24 00:49:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-10-24 00:49:08,642 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 42 [2020-10-24 00:49:08,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:49:08,642 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-10-24 00:49:08,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:49:08,643 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2020-10-24 00:49:08,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-10-24 00:49:08,645 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:49:08,645 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:49:08,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:49:08,646 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:49:08,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:49:08,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1629720462, now seen corresponding path program 1 times [2020-10-24 00:49:08,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:49:08,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [254596561] [2020-10-24 00:49:08,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:49:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:08,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:49:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:08,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:49:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:08,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:49:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:08,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:49:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 00:49:09,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [254596561] [2020-10-24 00:49:09,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:49:09,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:49:09,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551393742] [2020-10-24 00:49:09,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:49:09,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:49:09,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:49:09,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:49:09,033 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 10 states. [2020-10-24 00:49:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:49:10,381 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2020-10-24 00:49:10,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 00:49:10,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2020-10-24 00:49:10,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:49:10,390 INFO L225 Difference]: With dead ends: 75 [2020-10-24 00:49:10,390 INFO L226 Difference]: Without dead ends: 68 [2020-10-24 00:49:10,391 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2020-10-24 00:49:10,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-24 00:49:10,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2020-10-24 00:49:10,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-24 00:49:10,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2020-10-24 00:49:10,412 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 43 [2020-10-24 00:49:10,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:49:10,413 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2020-10-24 00:49:10,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:49:10,413 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2020-10-24 00:49:10,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-10-24 00:49:10,415 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:49:10,416 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:49:10,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:49:10,416 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:49:10,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:49:10,417 INFO L82 PathProgramCache]: Analyzing trace with hash -2122193092, now seen corresponding path program 1 times [2020-10-24 00:49:10,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:49:10,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2113857602] [2020-10-24 00:49:10,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:49:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:10,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:49:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:10,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:49:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:10,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:49:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:10,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:49:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:10,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 00:49:10,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2113857602] [2020-10-24 00:49:10,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:49:10,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:49:10,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766878563] [2020-10-24 00:49:10,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:49:10,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:49:10,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:49:10,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:49:10,656 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 8 states. [2020-10-24 00:49:11,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:49:11,582 INFO L93 Difference]: Finished difference Result 111 states and 139 transitions. [2020-10-24 00:49:11,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:49:11,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2020-10-24 00:49:11,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:49:11,588 INFO L225 Difference]: With dead ends: 111 [2020-10-24 00:49:11,588 INFO L226 Difference]: Without dead ends: 63 [2020-10-24 00:49:11,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:49:11,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-24 00:49:11,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-24 00:49:11,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-24 00:49:11,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2020-10-24 00:49:11,615 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 44 [2020-10-24 00:49:11,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:49:11,616 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2020-10-24 00:49:11,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:49:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2020-10-24 00:49:11,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-24 00:49:11,622 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:49:11,623 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:49:11,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:49:11,623 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:49:11,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:49:11,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1688308117, now seen corresponding path program 1 times [2020-10-24 00:49:11,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:49:11,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [929983087] [2020-10-24 00:49:11,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:49:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:11,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:49:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:11,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:49:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:11,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:49:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:11,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:49:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:11,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 00:49:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:11,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-24 00:49:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-24 00:49:11,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [929983087] [2020-10-24 00:49:11,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:49:11,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:49:11,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569209501] [2020-10-24 00:49:11,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:49:11,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:49:11,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:49:11,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:49:11,841 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 8 states. [2020-10-24 00:49:12,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:49:12,503 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2020-10-24 00:49:12,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:49:12,505 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2020-10-24 00:49:12,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:49:12,507 INFO L225 Difference]: With dead ends: 114 [2020-10-24 00:49:12,507 INFO L226 Difference]: Without dead ends: 65 [2020-10-24 00:49:12,508 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:49:12,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-10-24 00:49:12,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-10-24 00:49:12,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-24 00:49:12,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2020-10-24 00:49:12,526 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 59 [2020-10-24 00:49:12,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:49:12,527 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2020-10-24 00:49:12,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:49:12,527 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2020-10-24 00:49:12,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-24 00:49:12,529 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:49:12,530 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:12,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:49:12,530 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:49:12,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:49:12,531 INFO L82 PathProgramCache]: Analyzing trace with hash -439427312, now seen corresponding path program 1 times [2020-10-24 00:49:12,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:49:12,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [487603813] [2020-10-24 00:49:12,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:49:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:12,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:49:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:12,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:49:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:12,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:49:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:12,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:49:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:12,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:49:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:12,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:49:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:12,797 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-24 00:49:12,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [487603813] [2020-10-24 00:49:12,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:49:12,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:49:12,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440175956] [2020-10-24 00:49:12,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:49:12,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:49:12,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:49:12,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:49:12,801 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand 9 states. [2020-10-24 00:49:13,272 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2020-10-24 00:49:13,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:49:13,652 INFO L93 Difference]: Finished difference Result 116 states and 138 transitions. [2020-10-24 00:49:13,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 00:49:13,653 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2020-10-24 00:49:13,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:49:13,655 INFO L225 Difference]: With dead ends: 116 [2020-10-24 00:49:13,655 INFO L226 Difference]: Without dead ends: 65 [2020-10-24 00:49:13,656 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:49:13,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-10-24 00:49:13,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-10-24 00:49:13,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-24 00:49:13,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2020-10-24 00:49:13,674 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 60 [2020-10-24 00:49:13,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:49:13,675 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2020-10-24 00:49:13,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:49:13,675 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2020-10-24 00:49:13,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-24 00:49:13,676 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:49:13,677 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 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:49:13,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:49:13,677 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:49:13,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:49:13,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1841264646, now seen corresponding path program 1 times [2020-10-24 00:49:13,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:49:13,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1190846136] [2020-10-24 00:49:13,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:49:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:13,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:49:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:13,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:49:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:13,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:49:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:13,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:49:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:13,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:49:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:13,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:49:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:49:13,989 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-24 00:49:13,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1190846136] [2020-10-24 00:49:13,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:49:13,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:49:13,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123052859] [2020-10-24 00:49:13,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:49:13,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:49:13,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:49:13,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:49:13,993 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 9 states. [2020-10-24 00:49:14,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:49:14,796 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2020-10-24 00:49:14,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 00:49:14,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-10-24 00:49:14,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:49:14,798 INFO L225 Difference]: With dead ends: 65 [2020-10-24 00:49:14,799 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 00:49:14,800 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:49:14,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 00:49:14,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 00:49:14,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 00:49:14,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 00:49:14,804 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2020-10-24 00:49:14,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:49:14,804 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 00:49:14,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:49:14,805 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 00:49:14,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 00:49:14,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:49:14,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 00:49:15,972 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 13 [2020-10-24 00:49:16,269 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 20 [2020-10-24 00:49:16,585 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 13 [2020-10-24 00:49:16,728 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 13 [2020-10-24 00:49:16,924 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 17 [2020-10-24 00:49:17,107 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 17 [2020-10-24 00:49:17,655 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 18 [2020-10-24 00:49:17,854 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 6 [2020-10-24 00:49:18,106 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 15 [2020-10-24 00:49:18,611 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 18 [2020-10-24 00:49:19,236 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 15 [2020-10-24 00:49:19,459 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-10-24 00:49:19,459 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-10-24 00:49:19,459 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-10-24 00:49:19,460 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-10-24 00:49:19,460 INFO L277 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-10-24 00:49:19,460 INFO L277 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-10-24 00:49:19,460 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:49:19,460 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 00:49:19,460 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-10-24 00:49:19,461 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-10-24 00:49:19,461 INFO L277 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-10-24 00:49:19,461 INFO L277 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-10-24 00:49:19,461 INFO L277 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-10-24 00:49:19,461 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:49:19,461 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:49:19,461 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:49:19,461 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 00:49:19,462 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 00:49:19,462 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 37 44) the Hoare annotation is: true [2020-10-24 00:49:19,462 INFO L270 CegarLoopResult]: At program point mainEXIT(lines 37 44) the Hoare annotation is: (= main_~x~0 2) [2020-10-24 00:49:19,462 INFO L270 CegarLoopResult]: At program point mainFINAL(lines 37 44) the Hoare annotation is: (= main_~x~0 2) [2020-10-24 00:49:19,462 INFO L270 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: false [2020-10-24 00:49:19,462 INFO L270 CegarLoopResult]: At program point L40(lines 40 42) the Hoare annotation is: (and (<= main_~result~0 1) (= main_~x~0 2) (< 0 main_~result~0)) [2020-10-24 00:49:19,462 INFO L270 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: false [2020-10-24 00:49:19,462 INFO L270 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (= main_~x~0 2) [2020-10-24 00:49:19,463 INFO L270 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (and (<= 1 |main_#t~ret11|) (<= |main_#t~ret11| 1) (= main_~x~0 2)) [2020-10-24 00:49:19,463 INFO L270 CegarLoopResult]: At program point L40-2(lines 40 42) the Hoare annotation is: (= main_~x~0 2) [2020-10-24 00:49:19,463 INFO L270 CegarLoopResult]: At program point L39-2(line 39) the Hoare annotation is: (and (<= 1 |main_#t~ret11|) (<= |main_#t~ret11| 1) (= main_~x~0 2)) [2020-10-24 00:49:19,463 INFO L270 CegarLoopResult]: At program point L39-3(line 39) the Hoare annotation is: (and (<= 1 |main_#t~ret11|) (<= main_~result~0 1) (<= |main_#t~ret11| 1) (= main_~x~0 2) (< 0 main_~result~0)) [2020-10-24 00:49:19,463 INFO L277 CegarLoopResult]: At program point fibo2ENTRY(lines 19 27) the Hoare annotation is: true [2020-10-24 00:49:19,463 INFO L270 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 1 fibo2_~n)) [2020-10-24 00:49:19,464 INFO L270 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 1 fibo2_~n)) [2020-10-24 00:49:19,464 INFO L270 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (<= 1 |fibo2_#in~n|) (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 1)) [2020-10-24 00:49:19,464 INFO L270 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 1 fibo2_~n)) [2020-10-24 00:49:19,464 INFO L270 CegarLoopResult]: At program point L22(lines 22 26) the Hoare annotation is: (and (<= 1 |fibo2_#in~n|) (= fibo2_~n |fibo2_#in~n|)) [2020-10-24 00:49:19,464 INFO L270 CegarLoopResult]: At program point L25-3(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 1 fibo2_~n)) [2020-10-24 00:49:19,464 INFO L270 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 0)) [2020-10-24 00:49:19,464 INFO L270 CegarLoopResult]: At program point L25-4(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 1 fibo2_~n)) [2020-10-24 00:49:19,464 INFO L270 CegarLoopResult]: At program point L20(lines 20 26) the Hoare annotation is: (= fibo2_~n |fibo2_#in~n|) [2020-10-24 00:49:19,465 INFO L270 CegarLoopResult]: At program point L25-5(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 1 fibo2_~n)) [2020-10-24 00:49:19,465 INFO L270 CegarLoopResult]: At program point L25-6(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 1 fibo2_~n)) [2020-10-24 00:49:19,465 INFO L270 CegarLoopResult]: At program point fibo2FINAL(lines 19 27) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (or (and (<= 1 |fibo2_#in~n|) (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1)) (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|) (<= |fibo2_#in~n| 0)) (not (<= |fibo2_#in~n| 1)))) [2020-10-24 00:49:19,465 INFO L270 CegarLoopResult]: At program point fibo2EXIT(lines 19 27) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (or (and (<= 1 |fibo2_#in~n|) (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1)) (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|) (<= |fibo2_#in~n| 0)) (not (<= |fibo2_#in~n| 1)))) [2020-10-24 00:49:19,465 INFO L277 CegarLoopResult]: At program point fibo1ENTRY(lines 9 17) the Hoare annotation is: true [2020-10-24 00:49:19,465 INFO L270 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (< 1 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2020-10-24 00:49:19,466 INFO L270 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 1 |fibo1_#t~ret7|) (< 1 fibo1_~n) (<= |fibo1_#t~ret7| 1) .cse0) (and .cse0 (<= 3 |fibo1_#in~n|)))) [2020-10-24 00:49:19,466 INFO L270 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= |fibo1_#in~n| 1) (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2020-10-24 00:49:19,466 INFO L270 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 1 |fibo1_#t~ret7|) (< 1 fibo1_~n) (<= |fibo1_#t~ret7| 1) .cse0) (and .cse0 (<= 3 |fibo1_#in~n|)))) [2020-10-24 00:49:19,466 INFO L270 CegarLoopResult]: At program point L12(lines 12 16) the Hoare annotation is: (and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n)) [2020-10-24 00:49:19,467 INFO L270 CegarLoopResult]: At program point L15-3(line 15) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= 3 |fibo1_#in~n|)) (let ((.cse1 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (and (<= 1 |fibo1_#t~ret7|) (<= 1 .cse1) (< 1 fibo1_~n) (<= |fibo1_#t~ret7| 1) .cse0 (<= .cse1 1))))) [2020-10-24 00:49:19,467 INFO L270 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= |fibo1_#in~n| 0) (= fibo1_~n |fibo1_#in~n|)) [2020-10-24 00:49:19,467 INFO L270 CegarLoopResult]: At program point L15-4(line 15) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= 3 |fibo1_#in~n|)) (let ((.cse1 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (and (<= 1 |fibo1_#t~ret7|) (<= 1 .cse1) (< 1 fibo1_~n) (<= |fibo1_#t~ret7| 1) .cse0 (<= .cse1 1))))) [2020-10-24 00:49:19,467 INFO L270 CegarLoopResult]: At program point fibo1FINAL(lines 9 17) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= 3 |fibo1_#in~n|)) (and .cse0 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (and (<= |fibo1_#in~n| 1) .cse0))) [2020-10-24 00:49:19,467 INFO L270 CegarLoopResult]: At program point L10(lines 10 16) the Hoare annotation is: (= fibo1_~n |fibo1_#in~n|) [2020-10-24 00:49:19,467 INFO L270 CegarLoopResult]: At program point L15-5(line 15) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= 3 |fibo1_#in~n|)) (let ((.cse1 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (and (<= 1 |fibo1_#t~ret7|) (<= 1 .cse1) (< 1 fibo1_~n) (<= |fibo1_#t~ret7| 1) .cse0 (<= |fibo1_#res| 1) (<= .cse1 1) (<= 1 |fibo1_#res|))))) [2020-10-24 00:49:19,468 INFO L270 CegarLoopResult]: At program point L15-6(line 15) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= 3 |fibo1_#in~n|)) (and (< 1 fibo1_~n) .cse0 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)))) [2020-10-24 00:49:19,468 INFO L270 CegarLoopResult]: At program point fibo1EXIT(lines 9 17) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= 3 |fibo1_#in~n|)) (and .cse0 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (and (<= |fibo1_#in~n| 1) .cse0))) [2020-10-24 00:49:19,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:49:19 BoogieIcfgContainer [2020-10-24 00:49:19,491 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 00:49:19,493 INFO L168 Benchmark]: Toolchain (without parser) took 15132.25 ms. Allocated memory was 164.6 MB in the beginning and 238.0 MB in the end (delta: 73.4 MB). Free memory was 141.6 MB in the beginning and 123.4 MB in the end (delta: 18.1 MB). Peak memory consumption was 133.8 MB. Max. memory is 8.0 GB. [2020-10-24 00:49:19,494 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 125.8 MB. Free memory was 104.6 MB in the beginning and 104.5 MB in the end (delta: 71.7 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:49:19,495 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.71 ms. Allocated memory is still 164.6 MB. Free memory was 141.0 MB in the beginning and 131.7 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:49:19,496 INFO L168 Benchmark]: Boogie Preprocessor took 42.11 ms. Allocated memory is still 164.6 MB. Free memory was 131.5 MB in the beginning and 130.3 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-24 00:49:19,497 INFO L168 Benchmark]: RCFGBuilder took 483.47 ms. Allocated memory is still 164.6 MB. Free memory was 130.1 MB in the beginning and 114.8 MB in the end (delta: 15.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-10-24 00:49:19,498 INFO L168 Benchmark]: TraceAbstraction took 14225.23 ms. Allocated memory was 164.6 MB in the beginning and 238.0 MB in the end (delta: 73.4 MB). Free memory was 148.5 MB in the beginning and 123.4 MB in the end (delta: 25.1 MB). Peak memory consumption was 139.7 MB. Max. memory is 8.0 GB. [2020-10-24 00:49:19,501 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.21 ms. Allocated memory is still 125.8 MB. Free memory was 104.6 MB in the beginning and 104.5 MB in the end (delta: 71.7 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 342.71 ms. Allocated memory is still 164.6 MB. Free memory was 141.0 MB in the beginning and 131.7 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 42.11 ms. Allocated memory is still 164.6 MB. Free memory was 131.5 MB in the beginning and 130.3 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 483.47 ms. Allocated memory is still 164.6 MB. Free memory was 130.1 MB in the beginning and 114.8 MB in the end (delta: 15.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 14225.23 ms. Allocated memory was 164.6 MB in the beginning and 238.0 MB in the end (delta: 73.4 MB). Free memory was 148.5 MB in the beginning and 123.4 MB in the end (delta: 25.1 MB). Peak memory consumption was 139.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 37]: Procedure Contract for main Derived contract for procedure main: x == 2 - ProcedureContractResult [Line: 19]: Procedure Contract for fibo2 Derived contract for procedure fibo2: n == \old(n) && ((((1 <= \old(n) && 1 <= \result) && \result <= 1) || ((\result <= 0 && 0 <= \result) && \old(n) <= 0)) || !(\old(n) <= 1)) - ProcedureContractResult [Line: 9]: Procedure Contract for fibo1 Derived contract for procedure fibo1: ((n == \old(n) && 3 <= \old(n)) || ((n == \old(n) && \result <= 1) && 1 <= \result)) || (\old(n) <= 1 && n == \old(n)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 9.4s, OverallIterations: 8, TraceHistogramMax: 3, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 383 SDtfs, 480 SDslu, 635 SDs, 0 SdLazy, 1490 SolverSat, 150 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=6, 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, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 57 LocationsWithAnnotation, 407 PreInvPairs, 557 NumberOfFragments, 491 HoareAnnotationTreeSize, 407 FomulaSimplifications, 12105 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 57 FomulaSimplificationsInter, 3562 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 352 ConstructedInterpolants, 0 QuantifiedInterpolants, 40272 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 42/67 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 correct! Received shutdown request...