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/Problem02_label51_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 17:15:58,357 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 17:15:58,359 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 17:15:58,377 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 17:15:58,377 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 17:15:58,379 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 17:15:58,381 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 17:15:58,384 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 17:15:58,386 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 17:15:58,387 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 17:15:58,394 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 17:15:58,395 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 17:15:58,398 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 17:15:58,399 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 17:15:58,400 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 17:15:58,402 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 17:15:58,403 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 17:15:58,406 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 17:15:58,412 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 17:15:58,415 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 17:15:58,416 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 17:15:58,418 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 17:15:58,420 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 17:15:58,420 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 17:15:58,423 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 17:15:58,423 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 17:15:58,424 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 17:15:58,425 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 17:15:58,428 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 17:15:58,429 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 17:15:58,429 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 17:15:58,431 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 17:15:58,433 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 17:15:58,433 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 17:15:58,434 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 17:15:58,434 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 17:15:58,436 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-12 17:15:58,460 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 17:15:58,461 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 17:15:58,462 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 17:15:58,462 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 17:15:58,462 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 17:15:58,462 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 17:15:58,462 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 17:15:58,463 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 17:15:58,463 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 17:15:58,463 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 17:15:58,463 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 17:15:58,463 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 17:15:58,463 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 17:15:58,464 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 17:15:58,464 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 17:15:58,465 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 17:15:58,465 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 17:15:58,465 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 17:15:58,465 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 17:15:58,465 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 17:15:58,465 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 17:15:58,466 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 17:15:58,466 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 17:15:58,466 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 17:15:58,466 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 17:15:58,466 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:15:58,467 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 17:15:58,467 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 17:15:58,467 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 17:15:58,467 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 17:15:58,467 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 17:15:58,468 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 17:15:58,468 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 17:15:58,468 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 17:15:58,468 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 17:15:58,524 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 17:15:58,547 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 17:15:58,552 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 17:15:58,554 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 17:15:58,555 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 17:15:58,556 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label51_true-unreach-call_false-termination.c [2018-11-12 17:15:58,615 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c04194bde/00ec0d799fdc4b4b9f05860958bff9ce/FLAG1826efd42 [2018-11-12 17:15:59,117 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 17:15:59,118 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label51_true-unreach-call_false-termination.c [2018-11-12 17:15:59,145 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c04194bde/00ec0d799fdc4b4b9f05860958bff9ce/FLAG1826efd42 [2018-11-12 17:15:59,159 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c04194bde/00ec0d799fdc4b4b9f05860958bff9ce [2018-11-12 17:15:59,170 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 17:15:59,172 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 17:15:59,173 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 17:15:59,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 17:15:59,176 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 17:15:59,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:15:59" (1/1) ... [2018-11-12 17:15:59,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bca0b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:59, skipping insertion in model container [2018-11-12 17:15:59,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:15:59" (1/1) ... [2018-11-12 17:15:59,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 17:15:59,254 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 17:15:59,741 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:15:59,750 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 17:15:59,856 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:15:59,877 INFO L193 MainTranslator]: Completed translation [2018-11-12 17:15:59,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:59 WrapperNode [2018-11-12 17:15:59,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 17:15:59,879 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 17:15:59,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 17:15:59,879 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 17:15:59,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:59" (1/1) ... [2018-11-12 17:15:59,989 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:59" (1/1) ... [2018-11-12 17:15:59,999 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 17:16:00,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 17:16:00,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 17:16:00,000 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 17:16:00,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:59" (1/1) ... [2018-11-12 17:16:00,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:59" (1/1) ... [2018-11-12 17:16:00,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:59" (1/1) ... [2018-11-12 17:16:00,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:59" (1/1) ... [2018-11-12 17:16:00,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:59" (1/1) ... [2018-11-12 17:16:00,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:59" (1/1) ... [2018-11-12 17:16:00,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:59" (1/1) ... [2018-11-12 17:16:00,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 17:16:00,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 17:16:00,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 17:16:00,096 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 17:16:00,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:59" (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-12 17:16:00,160 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 17:16:00,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 17:16:00,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 17:16:00,161 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 17:16:00,161 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 17:16:00,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 17:16:00,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 17:16:00,162 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 17:16:00,162 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 17:16:03,580 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 17:16:03,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:16:03 BoogieIcfgContainer [2018-11-12 17:16:03,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 17:16:03,585 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 17:16:03,585 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 17:16:03,588 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 17:16:03,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:15:59" (1/3) ... [2018-11-12 17:16:03,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b9a458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:16:03, skipping insertion in model container [2018-11-12 17:16:03,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:59" (2/3) ... [2018-11-12 17:16:03,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b9a458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:16:03, skipping insertion in model container [2018-11-12 17:16:03,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:16:03" (3/3) ... [2018-11-12 17:16:03,595 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label51_true-unreach-call_false-termination.c [2018-11-12 17:16:03,606 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 17:16:03,613 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 17:16:03,630 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 17:16:03,669 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 17:16:03,670 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 17:16:03,670 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 17:16:03,670 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 17:16:03,670 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 17:16:03,673 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 17:16:03,673 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 17:16:03,673 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 17:16:03,700 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-12 17:16:03,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-12 17:16:03,715 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:03,718 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:16:03,722 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:03,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:03,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1195562327, now seen corresponding path program 1 times [2018-11-12 17:16:03,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:03,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:03,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:03,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:03,778 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:04,375 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:16:04,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-12 17:16:04,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:16:04,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:16:04,517 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:16:04,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:16:04,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:16:04,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:16:04,546 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-12 17:16:06,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:06,248 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-11-12 17:16:06,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:16:06,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-11-12 17:16:06,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:06,269 INFO L225 Difference]: With dead ends: 621 [2018-11-12 17:16:06,269 INFO L226 Difference]: Without dead ends: 382 [2018-11-12 17:16:06,276 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:16:06,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-12 17:16:06,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-12 17:16:06,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-12 17:16:06,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-11-12 17:16:06,358 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 117 [2018-11-12 17:16:06,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:06,363 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-11-12 17:16:06,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:16:06,363 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-11-12 17:16:06,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-12 17:16:06,377 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:06,377 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:16:06,378 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:06,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:06,379 INFO L82 PathProgramCache]: Analyzing trace with hash -324277142, now seen corresponding path program 1 times [2018-11-12 17:16:06,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:06,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:06,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:06,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:06,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:06,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:16:06,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:16:06,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:16:06,801 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:16:06,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:16:06,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:16:06,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:16:06,804 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-11-12 17:16:08,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:08,541 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-11-12 17:16:08,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:16:08,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2018-11-12 17:16:08,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:08,546 INFO L225 Difference]: With dead ends: 903 [2018-11-12 17:16:08,546 INFO L226 Difference]: Without dead ends: 381 [2018-11-12 17:16:08,550 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:16:08,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-12 17:16:08,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-11-12 17:16:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-12 17:16:08,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-11-12 17:16:08,574 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 126 [2018-11-12 17:16:08,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:08,575 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-11-12 17:16:08,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:16:08,575 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-11-12 17:16:08,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-12 17:16:08,578 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:08,579 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:16:08,579 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:08,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:08,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1188045302, now seen corresponding path program 1 times [2018-11-12 17:16:08,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:08,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:08,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:08,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:08,581 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:08,956 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-11-12 17:16:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:16:09,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:16:09,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:16:09,093 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:16:09,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:16:09,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:16:09,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:16:09,094 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-11-12 17:16:10,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:10,721 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-11-12 17:16:10,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:16:10,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-11-12 17:16:10,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:10,728 INFO L225 Difference]: With dead ends: 901 [2018-11-12 17:16:10,728 INFO L226 Difference]: Without dead ends: 380 [2018-11-12 17:16:10,730 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:16:10,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-12 17:16:10,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-12 17:16:10,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-12 17:16:10,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-11-12 17:16:10,751 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 132 [2018-11-12 17:16:10,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:10,751 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-11-12 17:16:10,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:16:10,751 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-11-12 17:16:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-12 17:16:10,754 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:10,754 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:16:10,754 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:10,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:10,755 INFO L82 PathProgramCache]: Analyzing trace with hash -34077619, now seen corresponding path program 1 times [2018-11-12 17:16:10,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:10,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:10,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:10,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:10,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:11,000 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:16:11,081 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:16:11,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:16:11,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:16:11,082 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:16:11,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:16:11,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:16:11,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:16:11,084 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-11-12 17:16:14,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:14,254 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-11-12 17:16:14,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:16:14,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2018-11-12 17:16:14,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:14,261 INFO L225 Difference]: With dead ends: 1193 [2018-11-12 17:16:14,261 INFO L226 Difference]: Without dead ends: 819 [2018-11-12 17:16:14,263 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:16:14,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-12 17:16:14,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-11-12 17:16:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-11-12 17:16:14,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-11-12 17:16:14,300 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 140 [2018-11-12 17:16:14,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:14,300 INFO L480 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-11-12 17:16:14,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:16:14,301 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-11-12 17:16:14,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-12 17:16:14,304 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:14,304 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:16:14,305 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:14,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:14,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1593443119, now seen corresponding path program 1 times [2018-11-12 17:16:14,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:14,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:14,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:14,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:14,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:14,767 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-12 17:16:14,940 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:16:14,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:16:14,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:16:14,940 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:16:14,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:16:14,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:16:14,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:16:14,941 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-11-12 17:16:16,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:16,058 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-11-12 17:16:16,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:16:16,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2018-11-12 17:16:16,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:16,066 INFO L225 Difference]: With dead ends: 1753 [2018-11-12 17:16:16,070 INFO L226 Difference]: Without dead ends: 804 [2018-11-12 17:16:16,073 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:16:16,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-11-12 17:16:16,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-11-12 17:16:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-11-12 17:16:16,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-11-12 17:16:16,111 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 142 [2018-11-12 17:16:16,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:16,111 INFO L480 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-11-12 17:16:16,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:16:16,111 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-11-12 17:16:16,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-12 17:16:16,115 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:16,115 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:16:16,115 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:16,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:16,116 INFO L82 PathProgramCache]: Analyzing trace with hash 890086741, now seen corresponding path program 1 times [2018-11-12 17:16:16,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:16,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:16,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:16,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:16,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:16,469 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:16:16,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:16:16,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:16:16,470 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:16:16,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:16:16,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:16:16,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:16:16,471 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-11-12 17:16:18,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:18,022 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-11-12 17:16:18,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:16:18,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2018-11-12 17:16:18,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:18,028 INFO L225 Difference]: With dead ends: 1747 [2018-11-12 17:16:18,028 INFO L226 Difference]: Without dead ends: 801 [2018-11-12 17:16:18,032 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:16:18,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-11-12 17:16:18,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-11-12 17:16:18,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-12 17:16:18,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-11-12 17:16:18,066 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 144 [2018-11-12 17:16:18,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:18,066 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-11-12 17:16:18,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:16:18,067 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-11-12 17:16:18,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-12 17:16:18,070 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:18,070 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:16:18,070 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:18,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:18,074 INFO L82 PathProgramCache]: Analyzing trace with hash 207226461, now seen corresponding path program 1 times [2018-11-12 17:16:18,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:18,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:18,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:18,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:18,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:18,315 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:16:18,360 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:16:18,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:16:18,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:16:18,361 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:16:18,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:16:18,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:16:18,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:16:18,362 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-11-12 17:16:19,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:19,464 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-11-12 17:16:19,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:16:19,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2018-11-12 17:16:19,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:19,479 INFO L225 Difference]: With dead ends: 2381 [2018-11-12 17:16:19,480 INFO L226 Difference]: Without dead ends: 1586 [2018-11-12 17:16:19,484 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:16:19,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-11-12 17:16:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-11-12 17:16:19,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-11-12 17:16:19,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-11-12 17:16:19,545 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 148 [2018-11-12 17:16:19,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:19,545 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-11-12 17:16:19,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:16:19,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-11-12 17:16:19,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-12 17:16:19,552 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:19,553 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, 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] [2018-11-12 17:16:19,553 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:19,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:19,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1224274575, now seen corresponding path program 1 times [2018-11-12 17:16:19,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:19,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:19,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:19,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:19,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:19,817 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:16:19,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:16:19,818 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:16:19,819 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 184 with the following transitions: [2018-11-12 17:16:19,821 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [607], [609], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:16:19,893 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:16:19,894 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:16:21,085 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:16:21,087 INFO L272 AbstractInterpreter]: Visited 121 different actions 238 times. Merged at 5 different actions 7 times. Never widened. Performed 3393 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3393 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-12 17:16:21,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:21,139 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:16:22,001 INFO L227 lantSequenceWeakener]: Weakened 94 states. On average, predicates are now at 80.99% of their original sizes. [2018-11-12 17:16:22,001 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:16:22,945 INFO L415 sIntCurrentIteration]: We unified 182 AI predicates to 182 [2018-11-12 17:16:22,946 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:16:22,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:16:22,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-12 17:16:22,947 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:16:22,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 17:16:22,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 17:16:22,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:16:22,949 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 18 states. [2018-11-12 17:16:40,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:40,698 INFO L93 Difference]: Finished difference Result 3716 states and 5313 transitions. [2018-11-12 17:16:40,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 17:16:40,699 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 183 [2018-11-12 17:16:40,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:40,712 INFO L225 Difference]: With dead ends: 3716 [2018-11-12 17:16:40,712 INFO L226 Difference]: Without dead ends: 2164 [2018-11-12 17:16:40,718 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 196 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=182, Invalid=810, Unknown=0, NotChecked=0, Total=992 [2018-11-12 17:16:40,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2018-11-12 17:16:40,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2152. [2018-11-12 17:16:40,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2018-11-12 17:16:40,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 2889 transitions. [2018-11-12 17:16:40,778 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 2889 transitions. Word has length 183 [2018-11-12 17:16:40,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:40,779 INFO L480 AbstractCegarLoop]: Abstraction has 2152 states and 2889 transitions. [2018-11-12 17:16:40,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 17:16:40,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2889 transitions. [2018-11-12 17:16:40,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-12 17:16:40,787 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:40,787 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:16:40,787 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:40,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:40,788 INFO L82 PathProgramCache]: Analyzing trace with hash 133706701, now seen corresponding path program 1 times [2018-11-12 17:16:40,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:40,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:40,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:40,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:40,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:16:41,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:16:41,034 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:16:41,034 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 187 with the following transitions: [2018-11-12 17:16:41,035 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [607], [609], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:16:41,040 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:16:41,041 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:16:41,541 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:16:41,542 INFO L272 AbstractInterpreter]: Visited 121 different actions 238 times. Merged at 5 different actions 7 times. Never widened. Performed 3375 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3375 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-12 17:16:41,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:41,580 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:16:42,047 INFO L227 lantSequenceWeakener]: Weakened 95 states. On average, predicates are now at 80.99% of their original sizes. [2018-11-12 17:16:42,048 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:16:42,790 INFO L415 sIntCurrentIteration]: We unified 185 AI predicates to 185 [2018-11-12 17:16:42,791 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:16:42,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:16:42,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-12 17:16:42,791 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:16:42,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 17:16:42,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 17:16:42,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:16:42,792 INFO L87 Difference]: Start difference. First operand 2152 states and 2889 transitions. Second operand 18 states. [2018-11-12 17:17:00,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:17:00,460 INFO L93 Difference]: Finished difference Result 5055 states and 6869 transitions. [2018-11-12 17:17:00,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 17:17:00,460 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 186 [2018-11-12 17:17:00,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:17:00,476 INFO L225 Difference]: With dead ends: 5055 [2018-11-12 17:17:00,477 INFO L226 Difference]: Without dead ends: 2909 [2018-11-12 17:17:00,485 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 200 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 17:17:00,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2018-11-12 17:17:00,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 2899. [2018-11-12 17:17:00,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2899 states. [2018-11-12 17:17:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2899 states to 2899 states and 3786 transitions. [2018-11-12 17:17:00,570 INFO L78 Accepts]: Start accepts. Automaton has 2899 states and 3786 transitions. Word has length 186 [2018-11-12 17:17:00,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:17:00,571 INFO L480 AbstractCegarLoop]: Abstraction has 2899 states and 3786 transitions. [2018-11-12 17:17:00,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 17:17:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2899 states and 3786 transitions. [2018-11-12 17:17:00,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-12 17:17:00,581 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:17:00,582 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 17:17:00,582 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:17:00,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:17:00,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1298981372, now seen corresponding path program 1 times [2018-11-12 17:17:00,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:17:00,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:17:00,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:17:00,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:17:00,584 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:17:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:17:00,813 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:17:00,905 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 85 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:17:00,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:17:00,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:17:00,906 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 189 with the following transitions: [2018-11-12 17:17:00,906 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [119], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [607], [609], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:17:00,911 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:17:00,911 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:17:01,821 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:17:01,821 INFO L272 AbstractInterpreter]: Visited 123 different actions 362 times. Merged at 7 different actions 17 times. Never widened. Performed 5226 root evaluator evaluations with a maximum evaluation depth of 4. Performed 5226 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:17:01,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:17:01,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:17:01,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:17:01,826 INFO L192 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-12 17:17:01,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:17:01,836 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:17:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:17:01,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:17:02,352 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:17:02,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:17:02,633 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:17:02,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:17:02,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-11-12 17:17:02,654 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:17:02,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 17:17:02,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 17:17:02,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-11-12 17:17:02,655 INFO L87 Difference]: Start difference. First operand 2899 states and 3786 transitions. Second operand 14 states. [2018-11-12 17:17:03,322 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-11-12 17:17:04,037 WARN L179 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-11-12 17:17:05,855 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-11-12 17:17:07,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:17:07,631 INFO L93 Difference]: Finished difference Result 8790 states and 12022 transitions. [2018-11-12 17:17:07,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 17:17:07,640 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 188 [2018-11-12 17:17:07,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:17:07,641 INFO L225 Difference]: With dead ends: 8790 [2018-11-12 17:17:07,641 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 17:17:07,664 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 388 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 17:17:07,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 17:17:07,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 17:17:07,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 17:17:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 17:17:07,665 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-11-12 17:17:07,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:17:07,665 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 17:17:07,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 17:17:07,666 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 17:17:07,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 17:17:07,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 17:17:07,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:07,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:07,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:07,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:07,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:07,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:07,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:07,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:07,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:08,423 WARN L179 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2018-11-12 17:17:08,680 WARN L179 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2018-11-12 17:17:11,180 WARN L179 SmtUtils]: Spent 2.49 s on a formula simplification. DAG size of input: 210 DAG size of output: 94 [2018-11-12 17:17:11,397 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 47 [2018-11-12 17:17:12,049 WARN L179 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 47 [2018-11-12 17:17:12,052 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:17:12,053 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a17~0)| ~a17~0) (= |old(~a25~0)| ~a25~0) (= ~a28~0 |old(~a28~0)|)) [2018-11-12 17:17:12,053 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:17:12,053 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,053 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,053 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,053 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,054 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,054 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-12 17:17:12,054 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-12 17:17:12,054 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-12 17:17:12,054 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-12 17:17:12,054 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-12 17:17:12,054 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-12 17:17:12,054 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-12 17:17:12,054 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-12 17:17:12,054 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-12 17:17:12,054 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-12 17:17:12,054 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:17:12,055 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:17:12,055 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-12 17:17:12,055 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,055 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,055 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,055 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,055 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-12 17:17:12,055 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,055 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-12 17:17:12,055 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-12 17:17:12,055 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-12 17:17:12,056 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-12 17:17:12,056 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-12 17:17:12,056 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-12 17:17:12,056 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-12 17:17:12,056 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:17:12,056 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:17:12,056 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-12 17:17:12,056 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-12 17:17:12,056 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 502) no Hoare annotation was computed. [2018-11-12 17:17:12,056 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-12 17:17:12,057 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:17:12,057 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:17:12,057 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-12 17:17:12,057 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,057 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,057 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,057 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,057 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,057 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:17:12,058 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-12 17:17:12,058 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:17:12,058 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-12 17:17:12,058 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-12 17:17:12,058 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-12 17:17:12,058 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-12 17:17:12,058 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-12 17:17:12,058 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-12 17:17:12,058 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-12 17:17:12,059 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-12 17:17:12,059 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,059 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,059 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,059 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,059 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,059 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-12 17:17:12,059 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-12 17:17:12,060 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-12 17:17:12,060 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-12 17:17:12,060 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-12 17:17:12,060 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-12 17:17:12,060 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-12 17:17:12,060 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-12 17:17:12,060 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-12 17:17:12,060 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-12 17:17:12,060 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-12 17:17:12,060 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-12 17:17:12,060 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-12 17:17:12,061 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,061 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,061 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,061 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,061 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,061 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-12 17:17:12,061 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-12 17:17:12,061 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-12 17:17:12,061 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-12 17:17:12,061 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-12 17:17:12,062 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-12 17:17:12,062 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-12 17:17:12,062 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-12 17:17:12,062 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-12 17:17:12,062 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-12 17:17:12,062 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-12 17:17:12,062 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-12 17:17:12,062 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-12 17:17:12,062 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:17:12,062 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-12 17:17:12,062 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:17:12,062 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,062 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,062 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,063 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,063 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-12 17:17:12,063 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,063 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:17:12,063 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,063 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:17:12,063 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:17:12,063 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:17:12,063 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,063 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,063 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-12 17:17:12,063 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-12 17:17:12,063 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-12 17:17:12,063 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-12 17:17:12,064 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-12 17:17:12,064 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-12 17:17:12,064 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-12 17:17:12,064 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-12 17:17:12,064 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-12 17:17:12,064 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-12 17:17:12,064 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-12 17:17:12,064 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,064 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,064 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,064 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,064 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,065 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,065 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-12 17:17:12,065 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-12 17:17:12,065 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-12 17:17:12,065 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-12 17:17:12,065 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-12 17:17:12,065 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-12 17:17:12,065 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-12 17:17:12,065 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-12 17:17:12,065 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-12 17:17:12,065 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-12 17:17:12,065 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-12 17:17:12,065 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,066 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,066 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,066 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,066 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,066 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,066 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-12 17:17:12,066 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-12 17:17:12,066 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-12 17:17:12,066 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-12 17:17:12,066 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-12 17:17:12,066 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-12 17:17:12,066 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-12 17:17:12,066 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-12 17:17:12,066 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-12 17:17:12,067 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-12 17:17:12,067 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-12 17:17:12,067 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-12 17:17:12,067 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-12 17:17:12,067 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-12 17:17:12,067 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,067 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,067 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,068 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse19 (= |old(~a17~0)| ~a17~0)) (.cse20 (= |old(~a25~0)| ~a25~0)) (.cse21 (= ~a28~0 |old(~a28~0)|)) (.cse6 (= 1 |old(~a11~0)|)) (.cse16 (= 1 |old(~a19~0)|)) (.cse17 (= 1 |old(~a25~0)|)) (.cse11 (= 1 ~a11~0)) (.cse12 (= 1 ~a19~0))) (let ((.cse0 (and .cse11 .cse12)) (.cse2 (not .cse17)) (.cse3 (not .cse16)) (.cse10 (not (= 7 |old(~a28~0)|))) (.cse4 (not (= 8 |old(~a17~0)|))) (.cse5 (not .cse6)) (.cse13 (= 9 |old(~a28~0)|)) (.cse8 (not (= ~a11~0 1))) (.cse15 (not (= |old(~a17~0)| 8))) (.cse18 (and .cse19 .cse20 .cse21)) (.cse1 (not (= 1 ~a21~0))) (.cse7 (= 8 |old(~a28~0)|)) (.cse9 (< 7 |old(~a17~0)|))) (and (or .cse0 .cse1 (not (= 10 |old(~a28~0)|)) .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse10 .cse2 .cse3 .cse5 .cse0 (not (= 7 |old(~a17~0)|))) (or .cse1 .cse2 .cse3 .cse4 (and .cse11 (= 1 ~a25~0) (= 9 ~a28~0) (= 8 ~a17~0) .cse12) (not .cse13) .cse5) (or (< 6 |calculate_output_#in~input|) (let ((.cse14 (not (= 0 |old(~a11~0)|)))) (and (or .cse1 .cse14 (not (= 0 |old(~a25~0)|))) (or .cse1 (< |old(~a28~0)| 8) .cse14))) (< |old(~a25~0)| 0) (< |old(~a28~0)| 7) (and (= ~a11~0 0) (= ~a19~0 1)) .cse3 (< 1 |old(~a25~0)|) (< 11 |old(~a28~0)|) .cse15 (< |calculate_output_#in~input| 1)) (or .cse16 .cse1 .cse10 .cse4 (and .cse11 (not .cse12)) .cse5 .cse17) (or .cse1 .cse7 .cse18 .cse13 .cse15) (or .cse1 .cse6 (and .cse19 .cse20 .cse21 .cse8) .cse15) (or .cse1 .cse7 .cse18 .cse15 .cse17) (or .cse18 .cse1 .cse7 .cse9)))) [2018-11-12 17:17:12,068 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,068 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,068 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,068 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-12 17:17:12,068 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-12 17:17:12,068 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-12 17:17:12,068 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-12 17:17:12,068 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-12 17:17:12,068 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-12 17:17:12,069 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-12 17:17:12,069 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-12 17:17:12,069 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-12 17:17:12,069 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-12 17:17:12,069 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-12 17:17:12,069 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-12 17:17:12,069 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-12 17:17:12,069 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,069 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,069 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,069 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,069 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,069 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,069 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-12 17:17:12,070 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-12 17:17:12,070 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-12 17:17:12,070 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-12 17:17:12,070 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-12 17:17:12,070 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-12 17:17:12,070 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-12 17:17:12,070 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-12 17:17:12,070 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-12 17:17:12,070 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-12 17:17:12,070 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-12 17:17:12,070 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:17:12,070 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:17:12,070 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-12 17:17:12,070 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-12 17:17:12,071 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-11-12 17:17:12,071 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,071 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,071 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,071 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,071 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:12,071 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-12 17:17:12,071 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-12 17:17:12,071 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-12 17:17:12,071 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-12 17:17:12,071 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-12 17:17:12,071 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-12 17:17:12,071 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-12 17:17:12,071 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-12 17:17:12,071 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-12 17:17:12,072 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-12 17:17:12,072 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-12 17:17:12,072 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:17:12,072 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-12 17:17:12,072 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:17:12,072 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-12 17:17:12,072 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:17:12,072 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:17:12,073 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-12 17:17:12,073 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-12 17:17:12,073 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:17:12,073 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7) (= ~a21~0 1)) [2018-11-12 17:17:12,073 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 17:17:12,073 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:17:12,073 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 1 |old(~a19~0)|)) (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-11-12 17:17:12,074 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-12 17:17:12,074 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse0 (not (= ~a28~0 8))) (.cse1 (= |old(~a17~0)| ~a17~0))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and (<= ~a17~0 7) .cse0) (not (= 0 |old(~a11~0)|)) (and (= 9 ~a28~0) (= 8 ~a17~0) (= 1 ~a19~0)) (not (= 0 |old(~a25~0)|)) (and .cse1 .cse0 (not (= ~a28~0 9))) (not (= 1 |old(~a19~0)|)) (and (not (= ~a25~0 1)) .cse1 .cse0) (not (= 8 |old(~a17~0)|)) (and .cse1 (not (= ~a11~0 1))))) [2018-11-12 17:17:12,074 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:17:12,074 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:17:12,074 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse1 (= |old(~a17~0)| ~a17~0)) (.cse0 (not (= ~a28~0 8)))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and (<= ~a17~0 7) .cse0) (not (= 0 |old(~a11~0)|)) (and (= 9 ~a28~0) (= 8 ~a17~0) (= 1 ~a19~0)) (not (= 0 |old(~a25~0)|)) (and .cse1 (not (= ~a11~0 1))) (and .cse1 .cse0 (not (= ~a28~0 9))) (not (= 1 |old(~a19~0)|)) (and (not (= ~a25~0 1)) .cse1 .cse0) (not (= 8 |old(~a17~0)|)))) [2018-11-12 17:17:12,074 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-12 17:17:12,074 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-12 17:17:12,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:17:12 BoogieIcfgContainer [2018-11-12 17:17:12,087 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 17:17:12,088 INFO L168 Benchmark]: Toolchain (without parser) took 72917.13 ms. Allocated memory was 1.6 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -323.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-11-12 17:17:12,089 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 17:17:12,089 INFO L168 Benchmark]: CACSL2BoogieTranslator took 706.14 ms. Allocated memory is still 1.6 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-12 17:17:12,090 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.37 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -838.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. [2018-11-12 17:17:12,091 INFO L168 Benchmark]: Boogie Preprocessor took 95.96 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2018-11-12 17:17:12,092 INFO L168 Benchmark]: RCFGBuilder took 3485.11 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: 103.2 MB). Peak memory consumption was 103.2 MB. Max. memory is 7.1 GB. [2018-11-12 17:17:12,092 INFO L168 Benchmark]: TraceAbstraction took 68502.12 ms. Allocated memory was 2.3 GB in the beginning and 3.4 GB in the end (delta: 1.1 GB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 376.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-11-12 17:17:12,097 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.27 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 706.14 ms. Allocated memory is still 1.6 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 120.37 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -838.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 95.96 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3485.11 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: 103.2 MB). Peak memory consumption was 103.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 68502.12 ms. Allocated memory was 2.3 GB in the beginning and 3.4 GB in the end (delta: 1.1 GB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 376.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 502]: 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: 606]: Loop Invariant Derived loop invariant: (((((((((!(1 == a21) || !(7 == \old(a28))) || (a17 <= 7 && !(a28 == 8))) || !(0 == \old(a11))) || ((9 == a28 && 8 == a17) && 1 == a19)) || !(0 == \old(a25))) || ((\old(a17) == a17 && !(a28 == 8)) && !(a28 == 9))) || !(1 == \old(a19))) || ((!(a25 == 1) && \old(a17) == a17) && !(a28 == 8))) || !(8 == \old(a17))) || (\old(a17) == a17 && !(a11 == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 68.4s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 52.5s AutomataDifference, 0.0s DeadEndRemovalTime, 4.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1369 SDtfs, 8885 SDslu, 2248 SDs, 0 SdLazy, 13258 SolverSat, 2085 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.1s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 873 GetRequests, 745 SyntacticMatches, 8 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2899occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.7s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, 0.9976481335593377 AbsIntWeakeningRatio, 0.1880108991825613 AbsIntAvgWeakeningVarsNumRemoved, 26.337874659400544 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 62 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 102 PreInvPairs, 182 NumberOfFragments, 542 HoareAnnotationTreeSize, 102 FomulaSimplifications, 5932 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 4848 FormulaSimplificationTreeSizeReductionInter, 4.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1694 NumberOfCodeBlocks, 1694 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1870 ConstructedInterpolants, 0 QuantifiedInterpolants, 1434393 SizeOfPredicates, 0 NumberOfNonLiveVariables, 497 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 581/617 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...