java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label11_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 00:09:11,312 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 00:09:11,319 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 00:09:11,338 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 00:09:11,338 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 00:09:11,339 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 00:09:11,341 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 00:09:11,344 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 00:09:11,346 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 00:09:11,347 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 00:09:11,356 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 00:09:11,356 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 00:09:11,359 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 00:09:11,360 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 00:09:11,361 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 00:09:11,364 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 00:09:11,366 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 00:09:11,370 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 00:09:11,375 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 00:09:11,376 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 00:09:11,380 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 00:09:11,382 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 00:09:11,384 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 00:09:11,385 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 00:09:11,385 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 00:09:11,386 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 00:09:11,387 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 00:09:11,390 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 00:09:11,391 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 00:09:11,392 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 00:09:11,392 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 00:09:11,393 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 00:09:11,393 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 00:09:11,393 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 00:09:11,396 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 00:09:11,397 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 00:09:11,398 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 00:09:11,426 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 00:09:11,427 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 00:09:11,428 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 00:09:11,428 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 00:09:11,428 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 00:09:11,428 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 00:09:11,430 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 00:09:11,430 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 00:09:11,430 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 00:09:11,430 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 00:09:11,431 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 00:09:11,431 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 00:09:11,432 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 00:09:11,433 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 00:09:11,433 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 00:09:11,433 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 00:09:11,433 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 00:09:11,434 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 00:09:11,434 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 00:09:11,434 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 00:09:11,434 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 00:09:11,434 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 00:09:11,436 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 00:09:11,436 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 00:09:11,436 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 00:09:11,436 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 00:09:11,437 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 00:09:11,437 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 00:09:11,437 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 00:09:11,437 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 00:09:11,438 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 00:09:11,438 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 00:09:11,438 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 00:09:11,438 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 00:09:11,508 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 00:09:11,525 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 00:09:11,530 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 00:09:11,531 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 00:09:11,532 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 00:09:11,533 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label11_false-unreach-call.c [2018-11-07 00:09:11,607 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a17bb97f/106226e8a0f6430291bc9aed344a61ab/FLAG23b1e4b8d [2018-11-07 00:09:12,489 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 00:09:12,490 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label11_false-unreach-call.c [2018-11-07 00:09:12,524 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a17bb97f/106226e8a0f6430291bc9aed344a61ab/FLAG23b1e4b8d [2018-11-07 00:09:12,541 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a17bb97f/106226e8a0f6430291bc9aed344a61ab [2018-11-07 00:09:12,553 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 00:09:12,557 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 00:09:12,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 00:09:12,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 00:09:12,563 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 00:09:12,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:09:12" (1/1) ... [2018-11-07 00:09:12,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2156c2c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:12, skipping insertion in model container [2018-11-07 00:09:12,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:09:12" (1/1) ... [2018-11-07 00:09:12,579 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 00:09:12,772 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 00:09:14,225 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 00:09:14,230 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 00:09:15,020 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 00:09:15,059 INFO L193 MainTranslator]: Completed translation [2018-11-07 00:09:15,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:15 WrapperNode [2018-11-07 00:09:15,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 00:09:15,061 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 00:09:15,061 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 00:09:15,061 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 00:09:15,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:15" (1/1) ... [2018-11-07 00:09:15,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:15" (1/1) ... [2018-11-07 00:09:15,445 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 00:09:15,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 00:09:15,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 00:09:15,446 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 00:09:15,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:15" (1/1) ... [2018-11-07 00:09:15,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:15" (1/1) ... [2018-11-07 00:09:15,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:15" (1/1) ... [2018-11-07 00:09:15,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:15" (1/1) ... [2018-11-07 00:09:15,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:15" (1/1) ... [2018-11-07 00:09:15,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:15" (1/1) ... [2018-11-07 00:09:15,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:15" (1/1) ... [2018-11-07 00:09:15,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 00:09:15,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 00:09:15,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 00:09:15,837 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 00:09:15,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09: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 [2018-11-07 00:09:15,912 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 00:09:15,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 00:09:15,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 00:09:15,913 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-11-07 00:09:15,913 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-11-07 00:09:15,914 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-11-07 00:09:15,914 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-11-07 00:09:15,914 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-07 00:09:15,914 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-07 00:09:15,915 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 00:09:15,915 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 00:09:15,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 00:09:15,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 00:09:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 00:09:15,918 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 00:09:25,795 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 00:09:25,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:09:25 BoogieIcfgContainer [2018-11-07 00:09:25,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 00:09:25,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 00:09:25,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 00:09:25,800 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 00:09:25,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:09:12" (1/3) ... [2018-11-07 00:09:25,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58548ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:09:25, skipping insertion in model container [2018-11-07 00:09:25,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:15" (2/3) ... [2018-11-07 00:09:25,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58548ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:09:25, skipping insertion in model container [2018-11-07 00:09:25,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:09:25" (3/3) ... [2018-11-07 00:09:25,804 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label11_false-unreach-call.c [2018-11-07 00:09:25,814 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 00:09:25,824 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 00:09:25,842 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 00:09:25,895 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 00:09:25,895 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 00:09:25,895 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 00:09:25,895 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 00:09:25,896 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 00:09:25,896 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 00:09:25,896 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 00:09:25,896 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 00:09:25,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-11-07 00:09:25,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-07 00:09:25,956 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:09:25,957 INFO L375 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, 1, 1, 1, 1, 1] [2018-11-07 00:09:25,959 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:09:25,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:09:25,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1219828101, now seen corresponding path program 1 times [2018-11-07 00:09:25,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:09:26,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:09:26,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:09:26,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:09:26,017 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:09:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:09:26,483 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 00:09:26,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 00:09:26,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 00:09:26,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 00:09:26,618 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:09:26,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 00:09:26,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 00:09:26,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 00:09:26,644 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 3 states. [2018-11-07 00:09:35,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:09:35,738 INFO L93 Difference]: Finished difference Result 3093 states and 5715 transitions. [2018-11-07 00:09:35,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 00:09:35,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-07 00:09:35,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:09:35,778 INFO L225 Difference]: With dead ends: 3093 [2018-11-07 00:09:35,778 INFO L226 Difference]: Without dead ends: 1971 [2018-11-07 00:09:35,791 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 00:09:35,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2018-11-07 00:09:35,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1957. [2018-11-07 00:09:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1957 states. [2018-11-07 00:09:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 3535 transitions. [2018-11-07 00:09:35,953 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 3535 transitions. Word has length 33 [2018-11-07 00:09:35,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:09:35,953 INFO L480 AbstractCegarLoop]: Abstraction has 1957 states and 3535 transitions. [2018-11-07 00:09:35,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 00:09:35,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 3535 transitions. [2018-11-07 00:09:35,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-07 00:09:35,961 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:09:35,961 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2018-11-07 00:09:35,962 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:09:35,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:09:35,962 INFO L82 PathProgramCache]: Analyzing trace with hash -591456748, now seen corresponding path program 1 times [2018-11-07 00:09:35,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:09:35,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:09:35,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:09:35,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:09:35,964 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:09:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:09:36,576 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 00:09:36,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 00:09:36,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 00:09:36,577 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:09:36,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 00:09:36,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 00:09:36,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 00:09:36,580 INFO L87 Difference]: Start difference. First operand 1957 states and 3535 transitions. Second operand 6 states. [2018-11-07 00:09:48,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:09:48,565 INFO L93 Difference]: Finished difference Result 5627 states and 10356 transitions. [2018-11-07 00:09:48,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 00:09:48,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2018-11-07 00:09:48,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:09:48,591 INFO L225 Difference]: With dead ends: 5627 [2018-11-07 00:09:48,591 INFO L226 Difference]: Without dead ends: 3676 [2018-11-07 00:09:48,599 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 00:09:48,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2018-11-07 00:09:48,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 3643. [2018-11-07 00:09:48,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2018-11-07 00:09:48,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5987 transitions. [2018-11-07 00:09:48,704 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5987 transitions. Word has length 116 [2018-11-07 00:09:48,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:09:48,705 INFO L480 AbstractCegarLoop]: Abstraction has 3643 states and 5987 transitions. [2018-11-07 00:09:48,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 00:09:48,705 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5987 transitions. [2018-11-07 00:09:48,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-07 00:09:48,710 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:09:48,710 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 00:09:48,710 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:09:48,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:09:48,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1715426756, now seen corresponding path program 1 times [2018-11-07 00:09:48,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:09:48,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:09:48,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:09:48,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:09:48,712 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:09:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:09:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 00:09:48,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 00:09:48,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 00:09:48,974 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:09:48,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 00:09:48,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 00:09:48,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 00:09:48,976 INFO L87 Difference]: Start difference. First operand 3643 states and 5987 transitions. Second operand 5 states. [2018-11-07 00:09:58,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:09:58,839 INFO L93 Difference]: Finished difference Result 10950 states and 18501 transitions. [2018-11-07 00:09:58,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 00:09:58,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-11-07 00:09:58,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:09:58,884 INFO L225 Difference]: With dead ends: 10950 [2018-11-07 00:09:58,885 INFO L226 Difference]: Without dead ends: 7313 [2018-11-07 00:09:58,900 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 00:09:58,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7313 states. [2018-11-07 00:09:59,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7313 to 7125. [2018-11-07 00:09:59,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7125 states. [2018-11-07 00:09:59,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7125 states to 7125 states and 10916 transitions. [2018-11-07 00:09:59,094 INFO L78 Accepts]: Start accepts. Automaton has 7125 states and 10916 transitions. Word has length 132 [2018-11-07 00:09:59,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:09:59,095 INFO L480 AbstractCegarLoop]: Abstraction has 7125 states and 10916 transitions. [2018-11-07 00:09:59,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 00:09:59,095 INFO L276 IsEmpty]: Start isEmpty. Operand 7125 states and 10916 transitions. [2018-11-07 00:09:59,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-07 00:09:59,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:09:59,104 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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] [2018-11-07 00:09:59,105 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:09:59,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:09:59,105 INFO L82 PathProgramCache]: Analyzing trace with hash 733942032, now seen corresponding path program 1 times [2018-11-07 00:09:59,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:09:59,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:09:59,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:09:59,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:09:59,107 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:09:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:09:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 00:09:59,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 00:09:59,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 00:09:59,455 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:09:59,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 00:09:59,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 00:09:59,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 00:09:59,457 INFO L87 Difference]: Start difference. First operand 7125 states and 10916 transitions. Second operand 6 states. [2018-11-07 00:10:09,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:10:09,561 INFO L93 Difference]: Finished difference Result 19746 states and 31234 transitions. [2018-11-07 00:10:09,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 00:10:09,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 169 [2018-11-07 00:10:09,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:10:09,627 INFO L225 Difference]: With dead ends: 19746 [2018-11-07 00:10:09,627 INFO L226 Difference]: Without dead ends: 12627 [2018-11-07 00:10:09,664 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 00:10:09,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12627 states. [2018-11-07 00:10:09,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12627 to 12425. [2018-11-07 00:10:09,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12425 states. [2018-11-07 00:10:09,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12425 states to 12425 states and 18001 transitions. [2018-11-07 00:10:09,982 INFO L78 Accepts]: Start accepts. Automaton has 12425 states and 18001 transitions. Word has length 169 [2018-11-07 00:10:09,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:10:09,983 INFO L480 AbstractCegarLoop]: Abstraction has 12425 states and 18001 transitions. [2018-11-07 00:10:09,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 00:10:09,983 INFO L276 IsEmpty]: Start isEmpty. Operand 12425 states and 18001 transitions. [2018-11-07 00:10:09,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-07 00:10:09,988 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:10:09,988 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 00:10:09,989 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:10:09,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:10:09,989 INFO L82 PathProgramCache]: Analyzing trace with hash -925652143, now seen corresponding path program 1 times [2018-11-07 00:10:09,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:10:09,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:10:09,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:10:09,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:10:09,991 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:10:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:10:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 00:10:10,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 00:10:10,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 00:10:10,544 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:10:10,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 00:10:10,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 00:10:10,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 00:10:10,547 INFO L87 Difference]: Start difference. First operand 12425 states and 18001 transitions. Second operand 6 states. [2018-11-07 00:10:25,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:10:25,416 INFO L93 Difference]: Finished difference Result 42950 states and 69413 transitions. [2018-11-07 00:10:25,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 00:10:25,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 191 [2018-11-07 00:10:25,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:10:25,585 INFO L225 Difference]: With dead ends: 42950 [2018-11-07 00:10:25,586 INFO L226 Difference]: Without dead ends: 30531 [2018-11-07 00:10:25,663 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-07 00:10:25,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30531 states. [2018-11-07 00:10:26,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30531 to 30292. [2018-11-07 00:10:26,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30292 states. [2018-11-07 00:10:26,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30292 states to 30292 states and 43885 transitions. [2018-11-07 00:10:26,883 INFO L78 Accepts]: Start accepts. Automaton has 30292 states and 43885 transitions. Word has length 191 [2018-11-07 00:10:26,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:10:26,884 INFO L480 AbstractCegarLoop]: Abstraction has 30292 states and 43885 transitions. [2018-11-07 00:10:26,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 00:10:26,884 INFO L276 IsEmpty]: Start isEmpty. Operand 30292 states and 43885 transitions. [2018-11-07 00:10:26,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-07 00:10:26,892 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:10:26,893 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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] [2018-11-07 00:10:26,893 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:10:26,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:10:26,893 INFO L82 PathProgramCache]: Analyzing trace with hash -112957127, now seen corresponding path program 1 times [2018-11-07 00:10:26,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:10:26,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:10:26,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:10:26,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:10:26,895 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:10:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:10:27,253 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 00:10:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 00:10:27,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 00:10:27,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 00:10:27,748 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:10:27,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 00:10:27,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 00:10:27,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 00:10:27,750 INFO L87 Difference]: Start difference. First operand 30292 states and 43885 transitions. Second operand 6 states. [2018-11-07 00:10:38,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:10:38,351 INFO L93 Difference]: Finished difference Result 73822 states and 115947 transitions. [2018-11-07 00:10:38,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 00:10:38,352 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 214 [2018-11-07 00:10:38,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:10:38,516 INFO L225 Difference]: With dead ends: 73822 [2018-11-07 00:10:38,516 INFO L226 Difference]: Without dead ends: 43536 [2018-11-07 00:10:38,629 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 00:10:38,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43536 states. [2018-11-07 00:10:39,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43536 to 43223. [2018-11-07 00:10:39,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43223 states. [2018-11-07 00:10:39,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43223 states to 43223 states and 61334 transitions. [2018-11-07 00:10:39,669 INFO L78 Accepts]: Start accepts. Automaton has 43223 states and 61334 transitions. Word has length 214 [2018-11-07 00:10:39,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:10:39,669 INFO L480 AbstractCegarLoop]: Abstraction has 43223 states and 61334 transitions. [2018-11-07 00:10:39,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 00:10:39,670 INFO L276 IsEmpty]: Start isEmpty. Operand 43223 states and 61334 transitions. [2018-11-07 00:10:39,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-11-07 00:10:39,684 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:10:39,684 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 00:10:39,685 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:10:39,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:10:39,685 INFO L82 PathProgramCache]: Analyzing trace with hash -2047447143, now seen corresponding path program 1 times [2018-11-07 00:10:39,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:10:39,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:10:39,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:10:39,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:10:39,692 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:10:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:10:40,050 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 52 proven. 94 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 00:10:40,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 00:10:40,050 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 00:10:40,051 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 239 with the following transitions: [2018-11-07 00:10:40,060 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2791], [2793], [2796], [2804], [2812], [2820], [2828], [2836], [2844], [2852], [2860], [2868], [2876], [2884], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3257], [3258], [3262], [3266], [3270], [3274], [3278], [3282], [3285], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-11-07 00:10:40,171 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 00:10:40,171 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 00:10:45,548 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 00:10:46,076 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 00:10:46,077 INFO L272 AbstractInterpreter]: Visited 111 different actions 111 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-11-07 00:10:46,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:10:46,121 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 00:10:50,838 INFO L227 lantSequenceWeakener]: Weakened 217 states. On average, predicates are now at 71.35% of their original sizes. [2018-11-07 00:10:50,838 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 00:10:52,261 INFO L415 sIntCurrentIteration]: We unified 237 AI predicates to 237 [2018-11-07 00:10:52,262 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 00:10:52,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 00:10:52,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-11-07 00:10:52,263 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:10:52,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 00:10:52,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 00:10:52,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-07 00:10:52,264 INFO L87 Difference]: Start difference. First operand 43223 states and 61334 transitions. Second operand 11 states. Received shutdown request... [2018-11-07 00:13:02,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 00:13:02,161 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 00:13:02,167 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 00:13:02,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:13:02 BoogieIcfgContainer [2018-11-07 00:13:02,168 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 00:13:02,169 INFO L168 Benchmark]: Toolchain (without parser) took 229614.65 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-11-07 00:13:02,170 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 00:13:02,171 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2502.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-11-07 00:13:02,172 INFO L168 Benchmark]: Boogie Procedure Inliner took 384.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 809.5 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 67.7 MB. Max. memory is 7.1 GB. [2018-11-07 00:13:02,173 INFO L168 Benchmark]: Boogie Preprocessor took 390.46 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 36.4 MB). Peak memory consumption was 36.4 MB. Max. memory is 7.1 GB. [2018-11-07 00:13:02,173 INFO L168 Benchmark]: RCFGBuilder took 9959.53 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 162.0 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 25.6 MB). Peak memory consumption was 662.5 MB. Max. memory is 7.1 GB. [2018-11-07 00:13:02,175 INFO L168 Benchmark]: TraceAbstraction took 216370.95 ms. Allocated memory was 2.5 GB in the beginning and 4.2 GB in the end (delta: 1.7 GB). Free memory was 2.2 GB in the beginning and 2.8 GB in the end (delta: -581.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-11-07 00:13:02,180 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2502.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 384.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 809.5 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 67.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 390.46 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 36.4 MB). Peak memory consumption was 36.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9959.53 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 162.0 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 25.6 MB). Peak memory consumption was 662.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 216370.95 ms. Allocated memory was 2.5 GB in the beginning and 4.2 GB in the end (delta: 1.7 GB). Free memory was 2.2 GB in the beginning and 2.8 GB in the end (delta: -581.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 90). Cancelled while BasicCegarLoop was constructing difference of abstraction (43223states) and FLOYD_HOARE automaton (currently 10 states, 11 states before enhancement),while ReachableStatesComputation was computing reachable states (5113 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 1120 locations, 1 error locations. TIMEOUT Result, 216.2s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 197.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2793 SDtfs, 23940 SDslu, 3158 SDs, 0 SdLazy, 35297 SolverSat, 9016 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 144.1s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 297 GetRequests, 243 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43223occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.0s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9959104186952289 AbsIntWeakeningRatio, 0.11392405063291139 AbsIntAvgWeakeningVarsNumRemoved, 38.278481012658226 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 989 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1093 NumberOfCodeBlocks, 1093 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1086 ConstructedInterpolants, 0 QuantifiedInterpolants, 892043 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 187/281 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown