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-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem12_label10_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 17:47:13,072 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 17:47:13,074 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 17:47:13,095 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 17:47:13,096 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 17:47:13,097 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 17:47:13,099 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 17:47:13,103 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 17:47:13,106 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 17:47:13,113 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 17:47:13,114 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 17:47:13,114 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 17:47:13,115 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 17:47:13,117 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 17:47:13,120 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 17:47:13,121 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 17:47:13,122 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 17:47:13,125 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 17:47:13,128 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 17:47:13,132 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 17:47:13,133 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 17:47:13,134 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 17:47:13,137 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 17:47:13,137 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 17:47:13,137 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 17:47:13,138 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 17:47:13,139 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 17:47:13,140 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 17:47:13,140 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 17:47:13,141 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 17:47:13,142 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 17:47:13,142 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 17:47:13,142 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 17:47:13,143 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 17:47:13,144 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 17:47:13,144 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 17:47:13,145 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 17:47:13,169 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 17:47:13,169 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 17:47:13,170 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 17:47:13,170 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 17:47:13,170 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 17:47:13,170 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 17:47:13,171 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 17:47:13,171 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 17:47:13,171 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 17:47:13,171 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 17:47:13,171 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 17:47:13,171 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 17:47:13,172 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 17:47:13,172 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 17:47:13,173 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 17:47:13,173 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 17:47:13,173 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 17:47:13,173 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 17:47:13,173 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 17:47:13,173 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 17:47:13,174 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 17:47:13,174 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 17:47:13,174 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 17:47:13,174 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 17:47:13,174 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 17:47:13,175 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 17:47:13,175 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 17:47:13,175 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 17:47:13,175 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 17:47:13,176 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 17:47:13,176 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 17:47:13,176 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 17:47:13,176 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 17:47:13,176 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 17:47:13,176 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 17:47:13,239 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 17:47:13,254 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 17:47:13,259 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 17:47:13,261 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 17:47:13,262 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 17:47:13,263 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label10_false-unreach-call.c [2018-11-07 17:47:13,333 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b61b0a6a0/ac9f8886a35c45fcacdf4d558b79a16c/FLAGc098a5a5c [2018-11-07 17:47:14,142 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 17:47:14,143 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label10_false-unreach-call.c [2018-11-07 17:47:14,178 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b61b0a6a0/ac9f8886a35c45fcacdf4d558b79a16c/FLAGc098a5a5c [2018-11-07 17:47:14,199 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b61b0a6a0/ac9f8886a35c45fcacdf4d558b79a16c [2018-11-07 17:47:14,213 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 17:47:14,215 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 17:47:14,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 17:47:14,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 17:47:14,221 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 17:47:14,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:47:14" (1/1) ... [2018-11-07 17:47:14,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae48c7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:14, skipping insertion in model container [2018-11-07 17:47:14,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:47:14" (1/1) ... [2018-11-07 17:47:14,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 17:47:14,399 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 17:47:15,665 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 17:47:15,670 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 17:47:16,317 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 17:47:16,355 INFO L193 MainTranslator]: Completed translation [2018-11-07 17:47:16,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:16 WrapperNode [2018-11-07 17:47:16,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 17:47:16,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 17:47:16,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 17:47:16,358 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 17:47:16,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:16" (1/1) ... [2018-11-07 17:47:16,737 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:16" (1/1) ... [2018-11-07 17:47:16,748 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 17:47:16,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 17:47:16,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 17:47:16,749 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 17:47:16,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:16" (1/1) ... [2018-11-07 17:47:16,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:16" (1/1) ... [2018-11-07 17:47:16,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:16" (1/1) ... [2018-11-07 17:47:16,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:16" (1/1) ... [2018-11-07 17:47:16,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:16" (1/1) ... [2018-11-07 17:47:16,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:16" (1/1) ... [2018-11-07 17:47:16,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:16" (1/1) ... [2018-11-07 17:47:16,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 17:47:16,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 17:47:16,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 17:47:16,980 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 17:47:16,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:16" (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 17:47:17,052 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 17:47:17,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 17:47:17,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 17:47:17,053 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-11-07 17:47:17,053 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-11-07 17:47:17,053 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-11-07 17:47:17,053 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-11-07 17:47:17,053 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-07 17:47:17,054 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-07 17:47:17,054 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 17:47:17,054 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 17:47:17,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 17:47:17,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 17:47:17,055 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 17:47:17,055 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 17:47:26,257 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 17:47:26,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:47:26 BoogieIcfgContainer [2018-11-07 17:47:26,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 17:47:26,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 17:47:26,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 17:47:26,263 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 17:47:26,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:47:14" (1/3) ... [2018-11-07 17:47:26,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360808a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:47:26, skipping insertion in model container [2018-11-07 17:47:26,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:16" (2/3) ... [2018-11-07 17:47:26,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360808a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:47:26, skipping insertion in model container [2018-11-07 17:47:26,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:47:26" (3/3) ... [2018-11-07 17:47:26,267 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label10_false-unreach-call.c [2018-11-07 17:47:26,277 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 17:47:26,288 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 17:47:26,307 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 17:47:26,357 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 17:47:26,358 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 17:47:26,358 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 17:47:26,358 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 17:47:26,358 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 17:47:26,358 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 17:47:26,358 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 17:47:26,359 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 17:47:26,418 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-11-07 17:47:26,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-07 17:47:26,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:47:26,426 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, 1] [2018-11-07 17:47:26,429 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:47:26,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:47:26,436 INFO L82 PathProgramCache]: Analyzing trace with hash -2120766700, now seen corresponding path program 1 times [2018-11-07 17:47:26,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:47:26,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:47:26,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:47:26,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:47:26,495 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:47:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:47:26,994 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 17:47:27,102 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 17:47:27,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:47:27,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 17:47:27,105 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:47:27,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 17:47:27,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 17:47:27,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 17:47:27,132 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 3 states. [2018-11-07 17:47:34,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:47:34,025 INFO L93 Difference]: Finished difference Result 2446 states and 4700 transitions. [2018-11-07 17:47:34,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 17:47:34,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-07 17:47:34,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:47:34,076 INFO L225 Difference]: With dead ends: 2446 [2018-11-07 17:47:34,076 INFO L226 Difference]: Without dead ends: 1604 [2018-11-07 17:47:34,094 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 17:47:34,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2018-11-07 17:47:34,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1604. [2018-11-07 17:47:34,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-11-07 17:47:34,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2861 transitions. [2018-11-07 17:47:34,278 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2861 transitions. Word has length 34 [2018-11-07 17:47:34,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:47:34,279 INFO L480 AbstractCegarLoop]: Abstraction has 1604 states and 2861 transitions. [2018-11-07 17:47:34,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 17:47:34,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2861 transitions. [2018-11-07 17:47:34,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-07 17:47:34,288 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:47:34,289 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, 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] [2018-11-07 17:47:34,289 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:47:34,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:47:34,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1037709290, now seen corresponding path program 1 times [2018-11-07 17:47:34,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:47:34,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:47:34,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:47:34,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:47:34,295 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:47:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:47:34,591 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:47:34,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:47:34,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 17:47:34,592 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:47:34,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 17:47:34,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 17:47:34,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 17:47:34,595 INFO L87 Difference]: Start difference. First operand 1604 states and 2861 transitions. Second operand 4 states. [2018-11-07 17:47:51,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:47:51,093 INFO L93 Difference]: Finished difference Result 6274 states and 11427 transitions. [2018-11-07 17:47:51,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 17:47:51,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-11-07 17:47:51,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:47:51,135 INFO L225 Difference]: With dead ends: 6274 [2018-11-07 17:47:51,135 INFO L226 Difference]: Without dead ends: 4676 [2018-11-07 17:47:51,146 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 17:47:51,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4676 states. [2018-11-07 17:47:51,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4676 to 4676. [2018-11-07 17:47:51,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4676 states. [2018-11-07 17:47:51,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4676 states to 4676 states and 7992 transitions. [2018-11-07 17:47:51,307 INFO L78 Accepts]: Start accepts. Automaton has 4676 states and 7992 transitions. Word has length 110 [2018-11-07 17:47:51,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:47:51,308 INFO L480 AbstractCegarLoop]: Abstraction has 4676 states and 7992 transitions. [2018-11-07 17:47:51,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 17:47:51,308 INFO L276 IsEmpty]: Start isEmpty. Operand 4676 states and 7992 transitions. [2018-11-07 17:47:51,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-07 17:47:51,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:47:51,314 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, 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] [2018-11-07 17:47:51,315 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:47:51,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:47:51,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1863697586, now seen corresponding path program 1 times [2018-11-07 17:47:51,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:47:51,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:47:51,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:47:51,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:47:51,317 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:47:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:47:51,507 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:47:51,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:47:51,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 17:47:51,508 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:47:51,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 17:47:51,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 17:47:51,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 17:47:51,509 INFO L87 Difference]: Start difference. First operand 4676 states and 7992 transitions. Second operand 5 states. [2018-11-07 17:47:59,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:47:59,348 INFO L93 Difference]: Finished difference Result 14214 states and 24823 transitions. [2018-11-07 17:47:59,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 17:47:59,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2018-11-07 17:47:59,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:47:59,420 INFO L225 Difference]: With dead ends: 14214 [2018-11-07 17:47:59,421 INFO L226 Difference]: Without dead ends: 9544 [2018-11-07 17:47:59,443 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 17:47:59,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9544 states. [2018-11-07 17:47:59,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9544 to 9456. [2018-11-07 17:47:59,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9456 states. [2018-11-07 17:47:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9456 states to 9456 states and 14962 transitions. [2018-11-07 17:47:59,751 INFO L78 Accepts]: Start accepts. Automaton has 9456 states and 14962 transitions. Word has length 114 [2018-11-07 17:47:59,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:47:59,751 INFO L480 AbstractCegarLoop]: Abstraction has 9456 states and 14962 transitions. [2018-11-07 17:47:59,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 17:47:59,752 INFO L276 IsEmpty]: Start isEmpty. Operand 9456 states and 14962 transitions. [2018-11-07 17:47:59,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-07 17:47:59,756 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:47:59,756 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, 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] [2018-11-07 17:47:59,756 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:47:59,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:47:59,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2138795989, now seen corresponding path program 1 times [2018-11-07 17:47:59,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:47:59,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:47:59,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:47:59,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:47:59,762 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:47:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:47:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:47:59,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:47:59,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 17:47:59,992 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:47:59,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 17:47:59,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 17:47:59,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 17:47:59,993 INFO L87 Difference]: Start difference. First operand 9456 states and 14962 transitions. Second operand 6 states. [2018-11-07 17:48:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:48:13,335 INFO L93 Difference]: Finished difference Result 23108 states and 36627 transitions. [2018-11-07 17:48:13,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 17:48:13,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-11-07 17:48:13,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:48:13,410 INFO L225 Difference]: With dead ends: 23108 [2018-11-07 17:48:13,415 INFO L226 Difference]: Without dead ends: 13658 [2018-11-07 17:48:13,451 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 17:48:13,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13658 states. [2018-11-07 17:48:13,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13658 to 13623. [2018-11-07 17:48:13,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13623 states. [2018-11-07 17:48:13,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13623 states to 13623 states and 20586 transitions. [2018-11-07 17:48:13,848 INFO L78 Accepts]: Start accepts. Automaton has 13623 states and 20586 transitions. Word has length 125 [2018-11-07 17:48:13,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:48:13,848 INFO L480 AbstractCegarLoop]: Abstraction has 13623 states and 20586 transitions. [2018-11-07 17:48:13,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 17:48:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand 13623 states and 20586 transitions. [2018-11-07 17:48:13,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-07 17:48:13,851 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:48:13,852 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, 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] [2018-11-07 17:48:13,853 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:48:13,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:48:13,853 INFO L82 PathProgramCache]: Analyzing trace with hash -46651346, now seen corresponding path program 1 times [2018-11-07 17:48:13,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:48:13,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:48:13,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:48:13,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:48:13,855 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:48:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:48:14,152 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 17:48:14,395 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:48:14,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:48:14,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 17:48:14,396 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:48:14,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 17:48:14,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 17:48:14,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 17:48:14,397 INFO L87 Difference]: Start difference. First operand 13623 states and 20586 transitions. Second operand 6 states. [2018-11-07 17:48:21,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:48:21,633 INFO L93 Difference]: Finished difference Result 37516 states and 60079 transitions. [2018-11-07 17:48:21,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 17:48:21,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2018-11-07 17:48:21,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:48:21,731 INFO L225 Difference]: With dead ends: 37516 [2018-11-07 17:48:21,731 INFO L226 Difference]: Without dead ends: 23899 [2018-11-07 17:48:21,768 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 17:48:21,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23899 states. [2018-11-07 17:48:22,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23899 to 23636. [2018-11-07 17:48:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23636 states. [2018-11-07 17:48:22,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23636 states to 23636 states and 36129 transitions. [2018-11-07 17:48:22,337 INFO L78 Accepts]: Start accepts. Automaton has 23636 states and 36129 transitions. Word has length 130 [2018-11-07 17:48:22,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:48:22,338 INFO L480 AbstractCegarLoop]: Abstraction has 23636 states and 36129 transitions. [2018-11-07 17:48:22,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 17:48:22,338 INFO L276 IsEmpty]: Start isEmpty. Operand 23636 states and 36129 transitions. [2018-11-07 17:48:22,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-07 17:48:22,341 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:48:22,341 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, 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] [2018-11-07 17:48:22,341 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:48:22,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:48:22,342 INFO L82 PathProgramCache]: Analyzing trace with hash -770376422, now seen corresponding path program 1 times [2018-11-07 17:48:22,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:48:22,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:48:22,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:48:22,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:48:22,343 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:48:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:48:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:48:22,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:48:22,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 17:48:22,643 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:48:22,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 17:48:22,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 17:48:22,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 17:48:22,644 INFO L87 Difference]: Start difference. First operand 23636 states and 36129 transitions. Second operand 5 states. [2018-11-07 17:48:35,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:48:35,802 INFO L93 Difference]: Finished difference Result 76278 states and 123942 transitions. [2018-11-07 17:48:35,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 17:48:35,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2018-11-07 17:48:35,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:48:36,015 INFO L225 Difference]: With dead ends: 76278 [2018-11-07 17:48:36,015 INFO L226 Difference]: Without dead ends: 52648 [2018-11-07 17:48:36,087 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-07 17:48:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52648 states. [2018-11-07 17:48:37,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52648 to 52210. [2018-11-07 17:48:37,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52210 states. [2018-11-07 17:48:37,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52210 states to 52210 states and 74179 transitions. [2018-11-07 17:48:37,197 INFO L78 Accepts]: Start accepts. Automaton has 52210 states and 74179 transitions. Word has length 156 [2018-11-07 17:48:37,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:48:37,197 INFO L480 AbstractCegarLoop]: Abstraction has 52210 states and 74179 transitions. [2018-11-07 17:48:37,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 17:48:37,198 INFO L276 IsEmpty]: Start isEmpty. Operand 52210 states and 74179 transitions. [2018-11-07 17:48:37,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-11-07 17:48:37,206 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:48:37,207 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:48:37,207 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:48:37,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:48:37,208 INFO L82 PathProgramCache]: Analyzing trace with hash -899924151, now seen corresponding path program 1 times [2018-11-07 17:48:37,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:48:37,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:48:37,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:48:37,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:48:37,209 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:48:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:48:37,518 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 17:48:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 54 proven. 75 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 17:48:37,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 17:48:37,925 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 17:48:37,927 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 236 with the following transitions: [2018-11-07 17:48:37,934 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2039], [2041], [2044], [2052], [2060], [2068], [2076], [2084], [2092], [2100], [2108], [2116], [2124], [2132], [2140], [2148], [2156], [2164], [2172], [2180], [2188], [2196], [2204], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2400], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2564], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-11-07 17:48:38,004 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 17:48:38,004 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 17:48:38,700 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 17:48:38,701 INFO L272 AbstractInterpreter]: Visited 126 different actions 126 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-11-07 17:48:38,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:48:38,747 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 17:48:39,357 INFO L227 lantSequenceWeakener]: Weakened 226 states. On average, predicates are now at 75.22% of their original sizes. [2018-11-07 17:48:39,357 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 17:48:39,869 INFO L415 sIntCurrentIteration]: We unified 234 AI predicates to 234 [2018-11-07 17:48:39,872 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 17:48:39,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 17:48:39,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 12 [2018-11-07 17:48:39,874 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:48:39,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 17:48:39,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 17:48:39,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-07 17:48:39,875 INFO L87 Difference]: Start difference. First operand 52210 states and 74179 transitions. Second operand 8 states. [2018-11-07 17:48:46,131 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 17:49:10,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:49:10,184 INFO L93 Difference]: Finished difference Result 105184 states and 149255 transitions. [2018-11-07 17:49:10,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 17:49:10,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 235 [2018-11-07 17:49:10,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:49:10,361 INFO L225 Difference]: With dead ends: 105184 [2018-11-07 17:49:10,362 INFO L226 Difference]: Without dead ends: 52980 [2018-11-07 17:49:10,479 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 236 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-07 17:49:10,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52980 states. [2018-11-07 17:49:12,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52980 to 52978. [2018-11-07 17:49:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52978 states. [2018-11-07 17:49:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52978 states to 52978 states and 74960 transitions. [2018-11-07 17:49:12,253 INFO L78 Accepts]: Start accepts. Automaton has 52978 states and 74960 transitions. Word has length 235 [2018-11-07 17:49:12,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:49:12,254 INFO L480 AbstractCegarLoop]: Abstraction has 52978 states and 74960 transitions. [2018-11-07 17:49:12,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 17:49:12,254 INFO L276 IsEmpty]: Start isEmpty. Operand 52978 states and 74960 transitions. [2018-11-07 17:49:12,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-11-07 17:49:12,263 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:49:12,263 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:49:12,263 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:49:12,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:49:12,264 INFO L82 PathProgramCache]: Analyzing trace with hash -235542819, now seen corresponding path program 1 times [2018-11-07 17:49:12,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:49:12,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:49:12,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:49:12,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:49:12,265 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:49:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:49:12,549 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-11-07 17:49:12,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:49:12,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 17:49:12,550 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:49:12,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 17:49:12,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 17:49:12,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 17:49:12,551 INFO L87 Difference]: Start difference. First operand 52978 states and 74960 transitions. Second operand 4 states. [2018-11-07 17:49:21,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:49:21,665 INFO L93 Difference]: Finished difference Result 144613 states and 229031 transitions. [2018-11-07 17:49:21,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 17:49:21,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 275 [2018-11-07 17:49:21,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:49:22,027 INFO L225 Difference]: With dead ends: 144613 [2018-11-07 17:49:22,027 INFO L226 Difference]: Without dead ends: 92409 [2018-11-07 17:49:22,190 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 17:49:22,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92409 states. [2018-11-07 17:49:24,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92409 to 92354. [2018-11-07 17:49:24,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92354 states. [2018-11-07 17:49:24,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92354 states to 92354 states and 140992 transitions. [2018-11-07 17:49:24,816 INFO L78 Accepts]: Start accepts. Automaton has 92354 states and 140992 transitions. Word has length 275 [2018-11-07 17:49:24,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:49:24,817 INFO L480 AbstractCegarLoop]: Abstraction has 92354 states and 140992 transitions. [2018-11-07 17:49:24,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 17:49:24,817 INFO L276 IsEmpty]: Start isEmpty. Operand 92354 states and 140992 transitions. [2018-11-07 17:49:24,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-11-07 17:49:24,834 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:49:24,835 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, 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, 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] [2018-11-07 17:49:24,835 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:49:24,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:49:24,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1501909032, now seen corresponding path program 1 times [2018-11-07 17:49:24,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:49:24,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:49:24,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:49:24,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:49:24,837 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:49:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:49:25,205 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-11-07 17:49:25,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:49:25,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 17:49:25,206 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:49:25,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 17:49:25,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 17:49:25,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 17:49:25,207 INFO L87 Difference]: Start difference. First operand 92354 states and 140992 transitions. Second operand 4 states. [2018-11-07 17:49:35,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:49:35,731 INFO L93 Difference]: Finished difference Result 264281 states and 425089 transitions. [2018-11-07 17:49:35,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 17:49:35,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2018-11-07 17:49:35,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:49:36,362 INFO L225 Difference]: With dead ends: 264281 [2018-11-07 17:49:36,362 INFO L226 Difference]: Without dead ends: 172701 [2018-11-07 17:49:36,615 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 17:49:36,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172701 states. [2018-11-07 17:49:39,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172701 to 171143. [2018-11-07 17:49:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171143 states. [2018-11-07 17:49:40,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171143 states to 171143 states and 251630 transitions. [2018-11-07 17:49:40,276 INFO L78 Accepts]: Start accepts. Automaton has 171143 states and 251630 transitions. Word has length 306 [2018-11-07 17:49:40,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:49:40,277 INFO L480 AbstractCegarLoop]: Abstraction has 171143 states and 251630 transitions. [2018-11-07 17:49:40,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 17:49:40,277 INFO L276 IsEmpty]: Start isEmpty. Operand 171143 states and 251630 transitions. [2018-11-07 17:49:40,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-11-07 17:49:40,384 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:49:40,385 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:49:40,385 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:49:40,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:49:40,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1223954820, now seen corresponding path program 1 times [2018-11-07 17:49:40,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:49:40,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:49:40,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:49:40,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:49:40,387 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:49:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:49:40,806 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 17:49:41,217 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 55 proven. 76 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-07 17:49:41,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 17:49:41,218 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 17:49:41,218 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 441 with the following transitions: [2018-11-07 17:49:41,219 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2039], [2041], [2044], [2052], [2060], [2068], [2076], [2084], [2092], [2100], [2108], [2116], [2124], [2132], [2140], [2148], [2156], [2164], [2172], [2180], [2188], [2196], [2204], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2664], [2665], [2669], [2673], [2677], [2681], [2685], [2689], [2693], [2697], [2701], [2705], [2709], [2713], [2717], [2721], [2725], [2729], [2733], [2737], [2741], [2745], [2749], [2753], [2757], [2761], [2765], [2769], [2773], [2777], [2781], [2785], [2789], [2793], [2797], [2801], [2805], [2809], [2813], [2817], [2821], [2825], [2829], [2833], [2837], [2841], [2845], [2849], [2853], [2857], [2861], [2865], [2869], [2873], [2877], [2881], [2885], [2889], [2893], [2897], [2901], [2905], [2909], [2913], [2917], [2921], [2925], [2929], [2933], [2937], [2941], [2945], [2949], [2953], [2957], [2961], [2965], [2969], [2973], [2977], [2981], [2985], [2989], [2993], [2997], [3001], [3005], [3009], [3013], [3017], [3021], [3025], [3029], [3033], [3037], [3041], [3045], [3049], [3053], [3057], [3061], [3065], [3069], [3073], [3077], [3081], [3085], [3089], [3093], [3097], [3101], [3105], [3109], [3113], [3117], [3120], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-11-07 17:49:41,232 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 17:49:41,235 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 17:49:41,429 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 17:49:43,111 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 17:49:43,111 INFO L272 AbstractInterpreter]: Visited 268 different actions 532 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-07 17:49:43,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:49:43,122 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 17:49:44,177 INFO L227 lantSequenceWeakener]: Weakened 149 states. On average, predicates are now at 75.68% of their original sizes. [2018-11-07 17:49:44,178 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 17:49:44,751 INFO L415 sIntCurrentIteration]: We unified 439 AI predicates to 439 [2018-11-07 17:49:44,752 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 17:49:44,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 17:49:44,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [6] total 28 [2018-11-07 17:49:44,752 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:49:44,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 17:49:44,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 17:49:44,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2018-11-07 17:49:44,754 INFO L87 Difference]: Start difference. First operand 171143 states and 251630 transitions. Second operand 24 states. Received shutdown request... [2018-11-07 17:50:46,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 17:50:46,815 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 17:50:46,819 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 17:50:46,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:50:46 BoogieIcfgContainer [2018-11-07 17:50:46,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 17:50:46,821 INFO L168 Benchmark]: Toolchain (without parser) took 212606.50 ms. Allocated memory was 1.5 GB in the beginning and 4.7 GB in the end (delta: 3.1 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -908.4 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-11-07 17:50:46,822 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 17:50:46,823 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2140.58 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: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-11-07 17:50:46,824 INFO L168 Benchmark]: Boogie Procedure Inliner took 391.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 805.3 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 54.6 MB. Max. memory is 7.1 GB. [2018-11-07 17:50:46,825 INFO L168 Benchmark]: Boogie Preprocessor took 230.71 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2018-11-07 17:50:46,825 INFO L168 Benchmark]: RCFGBuilder took 9278.35 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 1.6 GB in the end (delta: 644.3 MB). Peak memory consumption was 644.3 MB. Max. memory is 7.1 GB. [2018-11-07 17:50:46,826 INFO L168 Benchmark]: TraceAbstraction took 200560.75 ms. Allocated memory was 2.3 GB in the beginning and 4.7 GB in the end (delta: 2.3 GB). Free memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: -732.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-11-07 17:50:46,831 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 2140.58 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: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 391.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 805.3 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 54.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 230.71 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9278.35 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 1.6 GB in the end (delta: 644.3 MB). Peak memory consumption was 644.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 200560.75 ms. Allocated memory was 2.3 GB in the beginning and 4.7 GB in the end (delta: 2.3 GB). Free memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: -732.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 93). Cancelled while BasicCegarLoop was constructing difference of abstraction (171143states) and FLOYD_HOARE automaton (currently 23 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (40450 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 840 locations, 1 error locations. TIMEOUT Result, 200.4s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 179.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3172 SDtfs, 25573 SDslu, 1903 SDs, 0 SdLazy, 50279 SolverSat, 9845 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 98.5s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 745 GetRequests, 666 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171143occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.7s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9982408913738459 AbsIntWeakeningRatio, 0.08023774145616643 AbsIntAvgWeakeningVarsNumRemoved, 12.63744427934621 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 10.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 2439 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1925 NumberOfCodeBlocks, 1925 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1915 ConstructedInterpolants, 0 QuantifiedInterpolants, 1611850 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 639/790 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown