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/Problem10_label36_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 20:04:05,502 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 20:04:05,504 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 20:04:05,516 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 20:04:05,516 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 20:04:05,517 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 20:04:05,518 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 20:04:05,520 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 20:04:05,522 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 20:04:05,523 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 20:04:05,523 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 20:04:05,524 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 20:04:05,525 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 20:04:05,528 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 20:04:05,533 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 20:04:05,534 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 20:04:05,534 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 20:04:05,539 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 20:04:05,545 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 20:04:05,547 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 20:04:05,548 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 20:04:05,549 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 20:04:05,551 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 20:04:05,551 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 20:04:05,551 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 20:04:05,552 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 20:04:05,553 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 20:04:05,554 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 20:04:05,555 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 20:04:05,556 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 20:04:05,556 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 20:04:05,557 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 20:04:05,557 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 20:04:05,557 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 20:04:05,558 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 20:04:05,559 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 20:04:05,559 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 20:04:05,574 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 20:04:05,575 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 20:04:05,575 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 20:04:05,576 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 20:04:05,576 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 20:04:05,576 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 20:04:05,576 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 20:04:05,576 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 20:04:05,577 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 20:04:05,577 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 20:04:05,577 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 20:04:05,577 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 20:04:05,577 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 20:04:05,578 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 20:04:05,578 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 20:04:05,578 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 20:04:05,579 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 20:04:05,579 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 20:04:05,579 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 20:04:05,579 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 20:04:05,579 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 20:04:05,580 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 20:04:05,580 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 20:04:05,580 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 20:04:05,580 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 20:04:05,580 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:04:05,581 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 20:04:05,581 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 20:04:05,581 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 20:04:05,581 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 20:04:05,581 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 20:04:05,582 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 20:04:05,582 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 20:04:05,582 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 20:04:05,582 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 20:04:05,640 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 20:04:05,651 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 20:04:05,654 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 20:04:05,656 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 20:04:05,656 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 20:04:05,657 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label36_true-unreach-call.c [2018-11-07 20:04:05,713 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cf40d398/aa8b1e2352274416baf3ed3febda24c8/FLAGbad66ba8c [2018-11-07 20:04:06,261 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 20:04:06,262 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label36_true-unreach-call.c [2018-11-07 20:04:06,275 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cf40d398/aa8b1e2352274416baf3ed3febda24c8/FLAGbad66ba8c [2018-11-07 20:04:06,291 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cf40d398/aa8b1e2352274416baf3ed3febda24c8 [2018-11-07 20:04:06,303 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 20:04:06,304 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 20:04:06,306 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 20:04:06,306 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 20:04:06,310 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 20:04:06,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:04:06" (1/1) ... [2018-11-07 20:04:06,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@304470ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:06, skipping insertion in model container [2018-11-07 20:04:06,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:04:06" (1/1) ... [2018-11-07 20:04:06,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 20:04:06,404 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 20:04:06,817 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:04:06,822 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 20:04:07,025 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:04:07,046 INFO L193 MainTranslator]: Completed translation [2018-11-07 20:04:07,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:07 WrapperNode [2018-11-07 20:04:07,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 20:04:07,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 20:04:07,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 20:04:07,048 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 20:04:07,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:07" (1/1) ... [2018-11-07 20:04:07,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:07" (1/1) ... [2018-11-07 20:04:07,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 20:04:07,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 20:04:07,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 20:04:07,220 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 20:04:07,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:07" (1/1) ... [2018-11-07 20:04:07,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:07" (1/1) ... [2018-11-07 20:04:07,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:07" (1/1) ... [2018-11-07 20:04:07,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:07" (1/1) ... [2018-11-07 20:04:07,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:07" (1/1) ... [2018-11-07 20:04:07,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:07" (1/1) ... [2018-11-07 20:04:07,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:07" (1/1) ... [2018-11-07 20:04:07,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 20:04:07,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 20:04:07,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 20:04:07,333 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 20:04:07,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:07" (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 20:04:07,406 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 20:04:07,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 20:04:07,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 20:04:07,407 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 20:04:07,407 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 20:04:07,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 20:04:07,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 20:04:07,408 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 20:04:07,409 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 20:04:10,932 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 20:04:10,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:04:10 BoogieIcfgContainer [2018-11-07 20:04:10,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 20:04:10,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 20:04:10,935 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 20:04:10,938 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 20:04:10,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:04:06" (1/3) ... [2018-11-07 20:04:10,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aef9cee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:04:10, skipping insertion in model container [2018-11-07 20:04:10,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:07" (2/3) ... [2018-11-07 20:04:10,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aef9cee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:04:10, skipping insertion in model container [2018-11-07 20:04:10,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:04:10" (3/3) ... [2018-11-07 20:04:10,942 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label36_true-unreach-call.c [2018-11-07 20:04:10,953 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 20:04:10,961 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 20:04:10,980 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 20:04:11,019 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 20:04:11,020 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 20:04:11,020 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 20:04:11,020 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 20:04:11,020 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 20:04:11,022 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 20:04:11,022 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 20:04:11,023 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 20:04:11,051 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-07 20:04:11,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-07 20:04:11,061 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:04:11,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:04:11,065 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:04:11,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:11,070 INFO L82 PathProgramCache]: Analyzing trace with hash -7982076, now seen corresponding path program 1 times [2018-11-07 20:04:11,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:04:11,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:11,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:04:11,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:11,128 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:04:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:04:11,460 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:04:11,513 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 20:04:11,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:04:11,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 20:04:11,518 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:04:11,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:04:11,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:04:11,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:04:11,546 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-11-07 20:04:13,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:04:13,081 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-11-07 20:04:13,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:04:13,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-07 20:04:13,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:04:13,102 INFO L225 Difference]: With dead ends: 574 [2018-11-07 20:04:13,103 INFO L226 Difference]: Without dead ends: 356 [2018-11-07 20:04:13,110 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:04:13,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-07 20:04:13,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-11-07 20:04:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-07 20:04:13,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 609 transitions. [2018-11-07 20:04:13,225 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 609 transitions. Word has length 46 [2018-11-07 20:04:13,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:04:13,226 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 609 transitions. [2018-11-07 20:04:13,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:04:13,226 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 609 transitions. [2018-11-07 20:04:13,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 20:04:13,236 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:04:13,236 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, 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] [2018-11-07 20:04:13,237 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:04:13,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:13,237 INFO L82 PathProgramCache]: Analyzing trace with hash -443611109, now seen corresponding path program 1 times [2018-11-07 20:04:13,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:04:13,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:13,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:04:13,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:13,240 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:04:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:04:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:04:13,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:04:13,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 20:04:13,666 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:04:13,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 20:04:13,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 20:04:13,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 20:04:13,671 INFO L87 Difference]: Start difference. First operand 356 states and 609 transitions. Second operand 5 states. [2018-11-07 20:04:16,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:04:16,278 INFO L93 Difference]: Finished difference Result 1288 states and 2312 transitions. [2018-11-07 20:04:16,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 20:04:16,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2018-11-07 20:04:16,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:04:16,289 INFO L225 Difference]: With dead ends: 1288 [2018-11-07 20:04:16,289 INFO L226 Difference]: Without dead ends: 938 [2018-11-07 20:04:16,293 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 20:04:16,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-11-07 20:04:16,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 923. [2018-11-07 20:04:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-11-07 20:04:16,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1440 transitions. [2018-11-07 20:04:16,362 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1440 transitions. Word has length 129 [2018-11-07 20:04:16,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:04:16,363 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1440 transitions. [2018-11-07 20:04:16,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 20:04:16,363 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1440 transitions. [2018-11-07 20:04:16,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-07 20:04:16,372 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:04:16,372 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, 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 20:04:16,376 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:04:16,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:16,376 INFO L82 PathProgramCache]: Analyzing trace with hash -205231877, now seen corresponding path program 1 times [2018-11-07 20:04:16,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:04:16,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:16,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:04:16,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:16,379 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:04:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:04:16,723 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:04:16,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:04:16,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:04:16,724 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:04:16,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:04:16,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:04:16,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:04:16,726 INFO L87 Difference]: Start difference. First operand 923 states and 1440 transitions. Second operand 6 states. [2018-11-07 20:04:20,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:04:20,404 INFO L93 Difference]: Finished difference Result 2531 states and 4077 transitions. [2018-11-07 20:04:20,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:04:20,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2018-11-07 20:04:20,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:04:20,418 INFO L225 Difference]: With dead ends: 2531 [2018-11-07 20:04:20,418 INFO L226 Difference]: Without dead ends: 1614 [2018-11-07 20:04:20,425 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 20:04:20,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2018-11-07 20:04:20,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1583. [2018-11-07 20:04:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2018-11-07 20:04:20,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2316 transitions. [2018-11-07 20:04:20,493 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2316 transitions. Word has length 145 [2018-11-07 20:04:20,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:04:20,494 INFO L480 AbstractCegarLoop]: Abstraction has 1583 states and 2316 transitions. [2018-11-07 20:04:20,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:04:20,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2316 transitions. [2018-11-07 20:04:20,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-07 20:04:20,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:04:20,501 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, 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] [2018-11-07 20:04:20,501 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:04:20,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:20,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1849309771, now seen corresponding path program 1 times [2018-11-07 20:04:20,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:04:20,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:20,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:04:20,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:20,505 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:04:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:04:20,817 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:04:20,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:04:20,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:04:20,817 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:04:20,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:04:20,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:04:20,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:04:20,819 INFO L87 Difference]: Start difference. First operand 1583 states and 2316 transitions. Second operand 6 states. [2018-11-07 20:04:22,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:04:22,113 INFO L93 Difference]: Finished difference Result 3500 states and 5310 transitions. [2018-11-07 20:04:22,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:04:22,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 169 [2018-11-07 20:04:22,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:04:22,128 INFO L225 Difference]: With dead ends: 3500 [2018-11-07 20:04:22,129 INFO L226 Difference]: Without dead ends: 1923 [2018-11-07 20:04:22,136 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 20:04:22,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2018-11-07 20:04:22,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1882. [2018-11-07 20:04:22,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1882 states. [2018-11-07 20:04:22,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2674 transitions. [2018-11-07 20:04:22,201 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2674 transitions. Word has length 169 [2018-11-07 20:04:22,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:04:22,202 INFO L480 AbstractCegarLoop]: Abstraction has 1882 states and 2674 transitions. [2018-11-07 20:04:22,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:04:22,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2674 transitions. [2018-11-07 20:04:22,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-07 20:04:22,210 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:04:22,210 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, 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, 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 20:04:22,210 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:04:22,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:22,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1437431884, now seen corresponding path program 1 times [2018-11-07 20:04:22,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:04:22,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:22,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:04:22,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:22,212 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:04:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:04:22,719 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 147 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:04:22,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:04:22,720 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:04:22,722 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 201 with the following transitions: [2018-11-07 20:04:22,725 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [269], [271], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [546], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 20:04:22,802 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:04:22,802 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:04:23,259 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:04:23,757 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:04:23,759 INFO L272 AbstractInterpreter]: Visited 91 different actions 260 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:04:23,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:23,800 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:04:24,348 INFO L227 lantSequenceWeakener]: Weakened 57 states. On average, predicates are now at 75.64% of their original sizes. [2018-11-07 20:04:24,349 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:04:25,390 INFO L415 sIntCurrentIteration]: We unified 199 AI predicates to 199 [2018-11-07 20:04:25,391 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:04:25,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:04:25,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [6] total 25 [2018-11-07 20:04:25,392 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:04:25,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 20:04:25,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 20:04:25,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-11-07 20:04:25,394 INFO L87 Difference]: Start difference. First operand 1882 states and 2674 transitions. Second operand 21 states. [2018-11-07 20:05:02,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:05:02,944 INFO L93 Difference]: Finished difference Result 4580 states and 6618 transitions. [2018-11-07 20:05:02,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 20:05:02,944 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 200 [2018-11-07 20:05:02,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:05:02,960 INFO L225 Difference]: With dead ends: 4580 [2018-11-07 20:05:02,960 INFO L226 Difference]: Without dead ends: 2704 [2018-11-07 20:05:02,969 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 217 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=279, Invalid=1203, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 20:05:02,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2018-11-07 20:05:03,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2475. [2018-11-07 20:05:03,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2018-11-07 20:05:03,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3324 transitions. [2018-11-07 20:05:03,041 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3324 transitions. Word has length 200 [2018-11-07 20:05:03,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:05:03,041 INFO L480 AbstractCegarLoop]: Abstraction has 2475 states and 3324 transitions. [2018-11-07 20:05:03,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 20:05:03,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3324 transitions. [2018-11-07 20:05:03,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-07 20:05:03,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:05:03,047 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:05:03,048 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:05:03,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:05:03,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1363120665, now seen corresponding path program 1 times [2018-11-07 20:05:03,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:05:03,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:05:03,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:05:03,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:05:03,050 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:05:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:05:03,396 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 20:05:03,702 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 156 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:05:03,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:05:03,703 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:05:03,703 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 210 with the following transitions: [2018-11-07 20:05:03,703 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [269], [271], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [546], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 20:05:03,708 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:05:03,708 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:05:03,796 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:05:04,101 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:05:04,101 INFO L272 AbstractInterpreter]: Visited 91 different actions 516 times. Merged at 5 different actions 25 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:05:04,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:05:04,107 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:05:04,359 INFO L227 lantSequenceWeakener]: Weakened 206 states. On average, predicates are now at 73.27% of their original sizes. [2018-11-07 20:05:04,360 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:05:04,539 INFO L415 sIntCurrentIteration]: We unified 208 AI predicates to 208 [2018-11-07 20:05:04,539 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:05:04,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:05:04,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2018-11-07 20:05:04,540 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:05:04,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 20:05:04,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 20:05:04,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 20:05:04,541 INFO L87 Difference]: Start difference. First operand 2475 states and 3324 transitions. Second operand 10 states. [2018-11-07 20:05:16,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:05:16,104 INFO L93 Difference]: Finished difference Result 5741 states and 8004 transitions. [2018-11-07 20:05:16,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 20:05:16,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 209 [2018-11-07 20:05:16,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:05:16,122 INFO L225 Difference]: With dead ends: 5741 [2018-11-07 20:05:16,122 INFO L226 Difference]: Without dead ends: 3568 [2018-11-07 20:05:16,135 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 216 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:05:16,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3568 states. [2018-11-07 20:05:16,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3568 to 3546. [2018-11-07 20:05:16,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3546 states. [2018-11-07 20:05:16,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3546 states to 3546 states and 4668 transitions. [2018-11-07 20:05:16,226 INFO L78 Accepts]: Start accepts. Automaton has 3546 states and 4668 transitions. Word has length 209 [2018-11-07 20:05:16,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:05:16,226 INFO L480 AbstractCegarLoop]: Abstraction has 3546 states and 4668 transitions. [2018-11-07 20:05:16,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 20:05:16,227 INFO L276 IsEmpty]: Start isEmpty. Operand 3546 states and 4668 transitions. [2018-11-07 20:05:16,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-07 20:05:16,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:05:16,237 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:05:16,238 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:05:16,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:05:16,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1079627665, now seen corresponding path program 1 times [2018-11-07 20:05:16,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:05:16,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:05:16,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:05:16,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:05:16,240 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:05:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:05:16,497 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 159 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:05:16,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:05:16,497 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:05:16,497 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 246 with the following transitions: [2018-11-07 20:05:16,498 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [269], [271], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [546], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 20:05:16,502 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:05:16,502 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:05:16,603 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:05:16,693 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:05:16,693 INFO L272 AbstractInterpreter]: Visited 124 different actions 244 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:05:16,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:05:16,696 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:05:17,006 INFO L227 lantSequenceWeakener]: Weakened 57 states. On average, predicates are now at 77.22% of their original sizes. [2018-11-07 20:05:17,007 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:05:17,516 INFO L415 sIntCurrentIteration]: We unified 244 AI predicates to 244 [2018-11-07 20:05:17,517 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:05:17,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:05:17,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [6] total 27 [2018-11-07 20:05:17,518 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:05:17,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 20:05:17,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 20:05:17,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2018-11-07 20:05:17,519 INFO L87 Difference]: Start difference. First operand 3546 states and 4668 transitions. Second operand 23 states. [2018-11-07 20:05:35,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:05:35,315 INFO L93 Difference]: Finished difference Result 8497 states and 11623 transitions. [2018-11-07 20:05:35,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 20:05:35,315 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 245 [2018-11-07 20:05:35,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:05:35,339 INFO L225 Difference]: With dead ends: 8497 [2018-11-07 20:05:35,339 INFO L226 Difference]: Without dead ends: 5253 [2018-11-07 20:05:35,355 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 269 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=417, Invalid=1839, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 20:05:35,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5253 states. [2018-11-07 20:05:35,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5253 to 4974. [2018-11-07 20:05:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4974 states. [2018-11-07 20:05:35,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4974 states to 4974 states and 6405 transitions. [2018-11-07 20:05:35,499 INFO L78 Accepts]: Start accepts. Automaton has 4974 states and 6405 transitions. Word has length 245 [2018-11-07 20:05:35,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:05:35,500 INFO L480 AbstractCegarLoop]: Abstraction has 4974 states and 6405 transitions. [2018-11-07 20:05:35,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 20:05:35,500 INFO L276 IsEmpty]: Start isEmpty. Operand 4974 states and 6405 transitions. [2018-11-07 20:05:35,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-11-07 20:05:35,518 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:05:35,518 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:05:35,518 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:05:35,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:05:35,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1118123420, now seen corresponding path program 1 times [2018-11-07 20:05:35,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:05:35,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:05:35,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:05:35,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:05:35,520 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:05:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:05:35,935 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 20:05:36,281 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 193 proven. 72 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-07 20:05:36,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:05:36,282 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:05:36,282 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 283 with the following transitions: [2018-11-07 20:05:36,282 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [269], [271], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [546], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 20:05:36,285 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:05:36,285 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:05:36,351 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:05:37,110 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:05:37,110 INFO L272 AbstractInterpreter]: Visited 92 different actions 450 times. Merged at 7 different actions 34 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 20:05:37,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:05:37,148 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:05:37,397 INFO L227 lantSequenceWeakener]: Weakened 279 states. On average, predicates are now at 73.16% of their original sizes. [2018-11-07 20:05:37,397 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:05:37,496 INFO L415 sIntCurrentIteration]: We unified 281 AI predicates to 281 [2018-11-07 20:05:37,497 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:05:37,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:05:37,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2018-11-07 20:05:37,497 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:05:37,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 20:05:37,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 20:05:37,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 20:05:37,498 INFO L87 Difference]: Start difference. First operand 4974 states and 6405 transitions. Second operand 10 states. [2018-11-07 20:05:45,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:05:45,185 INFO L93 Difference]: Finished difference Result 11117 states and 14600 transitions. [2018-11-07 20:05:45,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 20:05:45,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 282 [2018-11-07 20:05:45,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:05:45,214 INFO L225 Difference]: With dead ends: 11117 [2018-11-07 20:05:45,214 INFO L226 Difference]: Without dead ends: 6743 [2018-11-07 20:05:45,231 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 289 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:05:45,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6743 states. [2018-11-07 20:05:45,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6743 to 6692. [2018-11-07 20:05:45,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6692 states. [2018-11-07 20:05:45,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6692 states to 6692 states and 8484 transitions. [2018-11-07 20:05:45,404 INFO L78 Accepts]: Start accepts. Automaton has 6692 states and 8484 transitions. Word has length 282 [2018-11-07 20:05:45,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:05:45,405 INFO L480 AbstractCegarLoop]: Abstraction has 6692 states and 8484 transitions. [2018-11-07 20:05:45,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 20:05:45,405 INFO L276 IsEmpty]: Start isEmpty. Operand 6692 states and 8484 transitions. [2018-11-07 20:05:45,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-11-07 20:05:45,428 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:05:45,428 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:05:45,429 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:05:45,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:05:45,429 INFO L82 PathProgramCache]: Analyzing trace with hash 203582095, now seen corresponding path program 1 times [2018-11-07 20:05:45,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:05:45,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:05:45,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:05:45,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:05:45,433 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:05:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:05:45,773 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:05:45,922 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 123 proven. 154 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-07 20:05:45,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:05:45,922 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:05:45,922 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 288 with the following transitions: [2018-11-07 20:05:45,922 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [269], [271], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [535], [539], [543], [546], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 20:05:45,925 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:05:45,925 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:05:45,987 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:05:46,113 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:05:46,114 INFO L272 AbstractInterpreter]: Visited 92 different actions 273 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 20:05:46,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:05:46,118 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:05:46,344 INFO L227 lantSequenceWeakener]: Weakened 284 states. On average, predicates are now at 75.54% of their original sizes. [2018-11-07 20:05:46,344 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:05:46,416 INFO L415 sIntCurrentIteration]: We unified 286 AI predicates to 286 [2018-11-07 20:05:46,417 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:05:46,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:05:46,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2018-11-07 20:05:46,417 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:05:46,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 20:05:46,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 20:05:46,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 20:05:46,418 INFO L87 Difference]: Start difference. First operand 6692 states and 8484 transitions. Second operand 10 states. [2018-11-07 20:05:53,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:05:53,697 INFO L93 Difference]: Finished difference Result 16032 states and 20768 transitions. [2018-11-07 20:05:53,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 20:05:53,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 287 [2018-11-07 20:05:53,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:05:53,733 INFO L225 Difference]: With dead ends: 16032 [2018-11-07 20:05:53,733 INFO L226 Difference]: Without dead ends: 9940 [2018-11-07 20:05:53,756 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 294 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:05:53,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9940 states. [2018-11-07 20:05:53,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9940 to 9842. [2018-11-07 20:05:53,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9842 states. [2018-11-07 20:05:53,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9842 states to 9842 states and 12399 transitions. [2018-11-07 20:05:53,974 INFO L78 Accepts]: Start accepts. Automaton has 9842 states and 12399 transitions. Word has length 287 [2018-11-07 20:05:53,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:05:53,974 INFO L480 AbstractCegarLoop]: Abstraction has 9842 states and 12399 transitions. [2018-11-07 20:05:53,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 20:05:53,975 INFO L276 IsEmpty]: Start isEmpty. Operand 9842 states and 12399 transitions. [2018-11-07 20:05:53,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-11-07 20:05:53,999 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:05:53,999 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:05:53,999 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:05:53,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:05:54,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1415671875, now seen corresponding path program 1 times [2018-11-07 20:05:54,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:05:54,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:05:54,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:05:54,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:05:54,001 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:05:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:05:54,288 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:05:55,205 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 123 proven. 159 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-07 20:05:55,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:05:55,206 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:05:55,206 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 298 with the following transitions: [2018-11-07 20:05:55,206 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [269], [271], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [546], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 20:05:55,208 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:05:55,209 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:05:55,296 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:05:55,696 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:05:55,696 INFO L272 AbstractInterpreter]: Visited 98 different actions 479 times. Merged at 8 different actions 37 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 20:05:55,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:05:55,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:05:55,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:05:55,735 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 20:05:55,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:05:55,751 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:05:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:05:55,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:05:56,188 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 318 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 20:05:56,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:05:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 200 proven. 82 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-07 20:05:57,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 20:05:57,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 20:05:57,207 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 20:05:57,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 20:05:57,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 20:05:57,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 20:05:57,209 INFO L87 Difference]: Start difference. First operand 9842 states and 12399 transitions. Second operand 11 states. [2018-11-07 20:06:02,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:06:02,187 INFO L93 Difference]: Finished difference Result 18891 states and 24873 transitions. [2018-11-07 20:06:02,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 20:06:02,197 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 297 [2018-11-07 20:06:02,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:06:02,215 INFO L225 Difference]: With dead ends: 18891 [2018-11-07 20:06:02,216 INFO L226 Difference]: Without dead ends: 5194 [2018-11-07 20:06:02,251 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 601 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-11-07 20:06:02,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5194 states. [2018-11-07 20:06:02,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5194 to 4384. [2018-11-07 20:06:02,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4384 states. [2018-11-07 20:06:02,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4384 states to 4384 states and 5118 transitions. [2018-11-07 20:06:02,390 INFO L78 Accepts]: Start accepts. Automaton has 4384 states and 5118 transitions. Word has length 297 [2018-11-07 20:06:02,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:06:02,390 INFO L480 AbstractCegarLoop]: Abstraction has 4384 states and 5118 transitions. [2018-11-07 20:06:02,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 20:06:02,390 INFO L276 IsEmpty]: Start isEmpty. Operand 4384 states and 5118 transitions. [2018-11-07 20:06:02,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-11-07 20:06:02,401 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:06:02,402 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 20:06:02,402 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:06:02,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:06:02,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1303501515, now seen corresponding path program 1 times [2018-11-07 20:06:02,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:06:02,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:06:02,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:06:02,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:06:02,404 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:06:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:06:02,922 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-11-07 20:06:02,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:06:02,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:06:02,923 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:06:02,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:06:02,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:06:02,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:06:02,924 INFO L87 Difference]: Start difference. First operand 4384 states and 5118 transitions. Second operand 4 states. [2018-11-07 20:06:05,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:06:05,391 INFO L93 Difference]: Finished difference Result 9363 states and 10974 transitions. [2018-11-07 20:06:05,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:06:05,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2018-11-07 20:06:05,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:06:05,393 INFO L225 Difference]: With dead ends: 9363 [2018-11-07 20:06:05,393 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 20:06:05,403 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 20:06:05,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 20:06:05,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 20:06:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 20:06:05,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 20:06:05,404 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 333 [2018-11-07 20:06:05,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:06:05,405 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 20:06:05,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:06:05,405 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 20:06:05,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 20:06:05,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 20:06:05,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:05,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:05,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:05,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:05,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:05,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:05,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:05,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:05,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:05,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:05,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:05,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:05,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:05,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:05,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:05,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:05,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:05,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:05,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:05,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:05,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,095 WARN L179 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 296 DAG size of output: 226 [2018-11-07 20:06:06,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:06:06,422 WARN L179 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 179 [2018-11-07 20:06:07,069 WARN L179 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2018-11-07 20:06:07,556 WARN L179 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 47 [2018-11-07 20:06:09,137 WARN L179 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 291 DAG size of output: 47 [2018-11-07 20:06:09,887 WARN L179 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 62 [2018-11-07 20:06:11,228 WARN L179 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 192 DAG size of output: 65 [2018-11-07 20:06:11,231 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 20:06:11,231 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a19~0)| ~a19~0) (= |old(~a10~0)| ~a10~0) (= ~a1~0 |old(~a1~0)|)) [2018-11-07 20:06:11,231 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 20:06:11,231 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-11-07 20:06:11,232 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,232 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,232 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,232 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,232 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,232 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,232 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-11-07 20:06:11,232 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-11-07 20:06:11,233 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-07 20:06:11,233 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-07 20:06:11,233 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-07 20:06:11,233 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-07 20:06:11,233 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-07 20:06:11,233 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-07 20:06:11,233 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-11-07 20:06:11,233 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-11-07 20:06:11,234 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-11-07 20:06:11,234 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,234 INFO L425 ceAbstractionStarter]: For program point L138(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,234 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,234 INFO L425 ceAbstractionStarter]: For program point L72(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,234 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,234 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-11-07 20:06:11,234 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-11-07 20:06:11,234 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-11-07 20:06:11,235 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-11-07 20:06:11,235 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-07 20:06:11,235 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-07 20:06:11,235 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-07 20:06:11,235 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-07 20:06:11,235 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-07 20:06:11,235 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-11-07 20:06:11,235 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-11-07 20:06:11,236 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-11-07 20:06:11,236 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-11-07 20:06:11,236 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-11-07 20:06:11,236 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,236 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,236 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,236 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,236 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,236 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-11-07 20:06:11,237 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-07 20:06:11,237 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-07 20:06:11,237 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-07 20:06:11,237 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-07 20:06:11,237 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-07 20:06:11,237 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-11-07 20:06:11,237 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-11-07 20:06:11,237 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-11-07 20:06:11,238 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-11-07 20:06:11,238 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,238 INFO L425 ceAbstractionStarter]: For program point L144(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,238 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,238 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,238 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,238 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-11-07 20:06:11,238 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-11-07 20:06:11,239 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-11-07 20:06:11,239 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-07 20:06:11,239 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-07 20:06:11,239 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-07 20:06:11,239 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-07 20:06:11,239 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-07 20:06:11,239 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-11-07 20:06:11,239 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-11-07 20:06:11,239 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-11-07 20:06:11,240 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-11-07 20:06:11,240 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-11-07 20:06:11,240 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,240 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,240 INFO L425 ceAbstractionStarter]: For program point L114(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,240 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,240 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,240 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-07 20:06:11,241 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-07 20:06:11,241 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-07 20:06:11,241 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-07 20:06:11,241 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-07 20:06:11,241 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-11-07 20:06:11,241 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-11-07 20:06:11,241 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-11-07 20:06:11,241 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-11-07 20:06:11,241 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,242 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,242 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,242 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,242 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,242 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,242 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,242 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-11-07 20:06:11,242 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-11-07 20:06:11,243 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-11-07 20:06:11,243 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-11-07 20:06:11,243 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-07 20:06:11,243 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-07 20:06:11,243 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-07 20:06:11,243 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-07 20:06:11,243 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-07 20:06:11,243 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-11-07 20:06:11,244 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-11-07 20:06:11,244 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-11-07 20:06:11,244 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-11-07 20:06:11,244 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,244 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,244 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,244 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,244 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,244 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-07 20:06:11,245 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,245 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-11-07 20:06:11,245 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-11-07 20:06:11,245 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-11-07 20:06:11,245 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-07 20:06:11,245 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-07 20:06:11,245 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-07 20:06:11,245 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-07 20:06:11,246 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-07 20:06:11,246 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-07 20:06:11,246 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-11-07 20:06:11,246 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-11-07 20:06:11,246 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-11-07 20:06:11,246 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-11-07 20:06:11,246 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,246 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,246 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,247 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,247 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,247 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,247 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-11-07 20:06:11,247 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-11-07 20:06:11,247 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-11-07 20:06:11,247 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-07 20:06:11,247 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-07 20:06:11,247 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-07 20:06:11,248 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-07 20:06:11,248 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-07 20:06:11,248 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-07 20:06:11,248 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-11-07 20:06:11,248 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-11-07 20:06:11,248 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse3 (= |old(~a19~0)| ~a19~0)) (.cse4 (= |old(~a10~0)| ~a10~0)) (.cse2 (= ~a1~0 |old(~a1~0)|))) (let ((.cse0 (= 3 |old(~a10~0)|)) (.cse1 (and .cse3 .cse4 .cse2)) (.cse5 (= 7 |old(~a19~0)|))) (and (or .cse0 (= 4 |old(~a10~0)|) .cse1) (or (< 6 |calculate_output_#in~input|) (< |calculate_output_#in~input| 2) (not (= 14 ~a4~0)) (not (= 0 ~a12~0)) (not (= 9 |old(~a19~0)|)) (and .cse2 .cse3 .cse4)) (or (or .cse0 .cse5 (= 10 |old(~a19~0)|)) .cse1) (or .cse1 .cse5 (< 8 |old(~a19~0)|) (= 8 |old(~a19~0)|))))) [2018-11-07 20:06:11,249 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-11-07 20:06:11,249 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-11-07 20:06:11,249 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-11-07 20:06:11,249 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,249 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,249 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,249 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,249 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,250 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,250 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2018-11-07 20:06:11,250 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-11-07 20:06:11,250 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-07 20:06:11,250 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-07 20:06:11,250 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-07 20:06:11,250 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-07 20:06:11,250 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-07 20:06:11,251 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-07 20:06:11,251 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-11-07 20:06:11,251 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-11-07 20:06:11,251 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-11-07 20:06:11,251 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-11-07 20:06:11,251 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-11-07 20:06:11,251 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-11-07 20:06:11,251 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,251 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,252 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,252 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,252 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,252 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,252 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-11-07 20:06:11,252 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-11-07 20:06:11,252 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-11-07 20:06:11,252 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-07 20:06:11,252 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-07 20:06:11,253 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-07 20:06:11,253 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-07 20:06:11,253 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-07 20:06:11,253 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-07 20:06:11,253 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-11-07 20:06:11,253 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-11-07 20:06:11,253 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-11-07 20:06:11,253 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,253 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,254 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,254 INFO L425 ceAbstractionStarter]: For program point L99(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,254 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,254 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:06:11,254 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-11-07 20:06:11,254 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-11-07 20:06:11,254 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-11-07 20:06:11,254 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-07 20:06:11,254 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-07 20:06:11,255 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-07 20:06:11,255 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-07 20:06:11,255 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-07 20:06:11,255 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-07 20:06:11,255 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-11-07 20:06:11,255 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-11-07 20:06:11,255 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-11-07 20:06:11,255 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 20:06:11,256 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~inputF~0 6) (= ~inputC~0 3) (= ~a19~0 9) (= ~a10~0 0) (= ~a12~0 0) (= ~inputB~0 2) (= ~a1~0 23) (= ~inputE~0 5) (= ~a4~0 14) (= ~inputD~0 4)) [2018-11-07 20:06:11,256 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 20:06:11,256 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 20:06:11,256 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (not (= |old(~a1~0)| 23)) (not (= 0 ~a12~0)) (and (= |old(~a10~0)| ~a10~0) (= ~a19~0 9) (= ~a1~0 23)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= 3 ~inputC~0)) (not (= ~a4~0 14)) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)) (not (= ~inputF~0 6)) (not (= |old(~a10~0)| 0))) [2018-11-07 20:06:11,256 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-11-07 20:06:11,256 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse0 (not (= ~a10~0 3))) (.cse1 (not (= ~a19~0 7)))) (or (not (= |old(~a1~0)| 23)) (and (<= main_~input~0 6) (<= 9 ~a19~0) (<= ~a19~0 |old(~a19~0)|) (<= 2 main_~input~0)) (not (= ~inputF~0 6)) (not (= |old(~a10~0)| 0)) (not (= ~a12~0 0)) (and .cse0 (not (= 4 ~a10~0))) (and .cse1 (not (= ~a19~0 8)) (<= ~a19~0 8)) (and .cse0 .cse1 (not (= ~a19~0 10))) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= 14 ~a4~0)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)))) [2018-11-07 20:06:11,257 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-11-07 20:06:11,257 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-11-07 20:06:11,257 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-11-07 20:06:11,257 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse0 (not (= ~a10~0 3))) (.cse1 (not (= ~a19~0 7)))) (or (not (= |old(~a1~0)| 23)) (not (= ~inputF~0 6)) (not (= |old(~a10~0)| 0)) (not (= ~a12~0 0)) (and .cse0 (not (= 4 ~a10~0))) (and .cse1 (not (= ~a19~0 8)) (<= ~a19~0 8)) (and .cse0 .cse1 (not (= ~a19~0 10))) (not (= 4 ~inputD~0)) (and (<= 9 ~a19~0) (<= ~a19~0 |old(~a19~0)|)) (not (= ~inputE~0 5)) (not (= 14 ~a4~0)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)))) [2018-11-07 20:06:11,257 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-11-07 20:06:11,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:06:11 BoogieIcfgContainer [2018-11-07 20:06:11,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 20:06:11,272 INFO L168 Benchmark]: Toolchain (without parser) took 124968.42 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -487.1 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-11-07 20:06:11,273 INFO L168 Benchmark]: CDTParser took 0.26 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 20:06:11,273 INFO L168 Benchmark]: CACSL2BoogieTranslator took 741.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 20:06:11,274 INFO L168 Benchmark]: Boogie Procedure Inliner took 171.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -837.3 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-11-07 20:06:11,275 INFO L168 Benchmark]: Boogie Preprocessor took 111.48 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-11-07 20:06:11,276 INFO L168 Benchmark]: RCFGBuilder took 3601.92 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 105.3 MB). Peak memory consumption was 105.3 MB. Max. memory is 7.1 GB. [2018-11-07 20:06:11,276 INFO L168 Benchmark]: TraceAbstraction took 120336.38 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 199.3 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-11-07 20:06:11,282 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.26 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 741.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 171.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -837.3 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 111.48 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3601.92 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 105.3 MB). Peak memory consumption was 105.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 120336.38 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 199.3 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 121]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(a1) == 23) || !(inputF == 6)) || !(\old(a10) == 0)) || !(a12 == 0)) || (!(a10 == 3) && !(4 == a10))) || ((!(a19 == 7) && !(a19 == 8)) && a19 <= 8)) || ((!(a10 == 3) && !(a19 == 7)) && !(a19 == 10))) || !(4 == inputD)) || (9 <= a19 && a19 <= \old(a19))) || !(inputE == 5)) || !(14 == a4)) || !(3 == inputC)) || !(2 == inputB)) || !(\old(a19) == 9) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 120.2s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 98.8s AutomataDifference, 0.0s DeadEndRemovalTime, 5.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1395 SDtfs, 10772 SDslu, 2878 SDs, 0 SdLazy, 17031 SolverSat, 2521 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.1s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 1952 GetRequests, 1767 SyntacticMatches, 8 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9842occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.2s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.99644433796512 AbsIntWeakeningRatio, 0.11658456486042693 AbsIntAvgWeakeningVarsNumRemoved, 19.220853858784892 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 1576 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 193 PreInvPairs, 295 NumberOfFragments, 354 HoareAnnotationTreeSize, 193 FomulaSimplifications, 34900 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 17184 FormulaSimplificationTreeSizeReductionInter, 4.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 2639 NumberOfCodeBlocks, 2639 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2923 ConstructedInterpolants, 0 QuantifiedInterpolants, 2868427 SizeOfPredicates, 1 NumberOfNonLiveVariables, 510 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 2257/2732 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...