java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:01:23,130 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:01:23,134 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:01:23,146 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:01:23,146 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:01:23,147 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:01:23,148 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:01:23,150 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:01:23,152 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:01:23,152 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:01:23,153 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:01:23,154 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:01:23,154 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:01:23,156 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:01:23,157 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:01:23,158 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:01:23,160 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:01:23,162 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:01:23,167 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:01:23,171 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:01:23,172 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:01:23,176 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:01:23,185 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:01:23,185 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:01:23,186 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:01:23,187 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:01:23,187 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:01:23,190 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:01:23,191 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:01:23,192 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:01:23,192 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:01:23,196 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:01:23,196 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:01:23,196 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:01:23,197 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:01:23,200 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:01:23,200 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 00:01:23,228 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:01:23,229 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:01:23,229 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:01:23,230 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:01:23,230 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:01:23,230 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:01:23,230 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:01:23,231 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:01:23,231 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:01:23,231 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:01:23,231 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:01:23,231 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:01:23,232 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:01:23,232 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:01:23,232 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:01:23,233 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:01:23,233 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:01:23,233 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:01:23,233 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:01:23,233 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:01:23,234 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:01:23,234 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:01:23,234 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:01:23,234 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:01:23,235 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:01:23,235 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:01:23,235 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:01:23,235 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:01:23,235 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:01:23,236 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:01:23,236 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:01:23,236 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:01:23,236 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:01:23,236 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:01:23,237 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:01:23,237 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:01:23,283 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:01:23,301 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:01:23,307 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:01:23,309 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:01:23,309 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:01:23,310 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-10-25 00:01:23,374 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cecdcb339/ccca4bc491b54af98153e961dea5b34f/FLAG75bba6f54 [2018-10-25 00:01:24,019 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:01:24,022 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-10-25 00:01:24,038 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cecdcb339/ccca4bc491b54af98153e961dea5b34f/FLAG75bba6f54 [2018-10-25 00:01:24,058 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cecdcb339/ccca4bc491b54af98153e961dea5b34f [2018-10-25 00:01:24,071 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:01:24,074 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:01:24,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:01:24,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:01:24,079 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:01:24,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:01:24" (1/1) ... [2018-10-25 00:01:24,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ed858fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:24, skipping insertion in model container [2018-10-25 00:01:24,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:01:24" (1/1) ... [2018-10-25 00:01:24,097 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:01:24,174 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:01:24,729 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:01:24,735 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:01:24,864 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:01:24,886 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:01:24,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:24 WrapperNode [2018-10-25 00:01:24,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:01:24,888 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:01:24,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:01:24,888 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:01:24,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:24" (1/1) ... [2018-10-25 00:01:24,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:24" (1/1) ... [2018-10-25 00:01:25,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:01:25,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:01:25,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:01:25,102 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:01:25,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:24" (1/1) ... [2018-10-25 00:01:25,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:24" (1/1) ... [2018-10-25 00:01:25,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:24" (1/1) ... [2018-10-25 00:01:25,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:24" (1/1) ... [2018-10-25 00:01:25,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:24" (1/1) ... [2018-10-25 00:01:25,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:24" (1/1) ... [2018-10-25 00:01:25,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:24" (1/1) ... [2018-10-25 00:01:25,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:01:25,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:01:25,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:01:25,202 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:01:25,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-25 00:01:25,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:01:25,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:01:25,271 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:01:25,271 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:01:25,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:01:25,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:01:25,272 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:01:25,272 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:01:28,528 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:01:28,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:01:28 BoogieIcfgContainer [2018-10-25 00:01:28,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:01:28,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:01:28,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:01:28,534 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:01:28,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:01:24" (1/3) ... [2018-10-25 00:01:28,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f47d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:01:28, skipping insertion in model container [2018-10-25 00:01:28,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:24" (2/3) ... [2018-10-25 00:01:28,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f47d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:01:28, skipping insertion in model container [2018-10-25 00:01:28,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:01:28" (3/3) ... [2018-10-25 00:01:28,540 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label11_true-unreach-call_false-termination.c [2018-10-25 00:01:28,551 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:01:28,562 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:01:28,580 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:01:28,630 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:01:28,630 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:01:28,631 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:01:28,631 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:01:28,631 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:01:28,631 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:01:28,631 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:01:28,631 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:01:28,658 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-25 00:01:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-25 00:01:28,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:28,674 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] [2018-10-25 00:01:28,677 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:28,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:28,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1894719720, now seen corresponding path program 1 times [2018-10-25 00:01:28,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:28,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:28,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:28,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:28,737 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:29,276 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:01:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:01:29,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:01:29,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:01:29,418 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:01:29,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:01:29,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:01:29,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:01:29,446 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-25 00:01:31,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:31,005 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-25 00:01:31,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:01:31,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-10-25 00:01:31,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:31,025 INFO L225 Difference]: With dead ends: 550 [2018-10-25 00:01:31,026 INFO L226 Difference]: Without dead ends: 340 [2018-10-25 00:01:31,033 INFO L605 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-10-25 00:01:31,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-25 00:01:31,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-25 00:01:31,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-25 00:01:31,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-10-25 00:01:31,119 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 116 [2018-10-25 00:01:31,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:31,120 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-10-25 00:01:31,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:01:31,120 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-10-25 00:01:31,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-25 00:01:31,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:31,131 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:01:31,131 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:31,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:31,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1844932745, now seen corresponding path program 1 times [2018-10-25 00:01:31,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:31,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:31,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:31,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:31,134 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:31,335 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:01:31,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:01:31,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:01:31,336 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:01:31,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:01:31,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:01:31,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:01:31,339 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-10-25 00:01:33,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:33,374 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-10-25 00:01:33,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:01:33,375 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-10-25 00:01:33,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:33,383 INFO L225 Difference]: With dead ends: 888 [2018-10-25 00:01:33,383 INFO L226 Difference]: Without dead ends: 554 [2018-10-25 00:01:33,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:01:33,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-25 00:01:33,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-10-25 00:01:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-10-25 00:01:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-10-25 00:01:33,428 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 127 [2018-10-25 00:01:33,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:33,429 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-10-25 00:01:33,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:01:33,429 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-10-25 00:01:33,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-25 00:01:33,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:33,433 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:01:33,434 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:33,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:33,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1950525493, now seen corresponding path program 1 times [2018-10-25 00:01:33,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:33,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:33,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:33,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:33,436 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:33,950 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-25 00:01:34,103 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:01:34,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:01:34,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:01:34,104 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:01:34,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:01:34,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:01:34,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:01:34,106 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 5 states. [2018-10-25 00:01:36,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:36,182 INFO L93 Difference]: Finished difference Result 1210 states and 1896 transitions. [2018-10-25 00:01:36,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:01:36,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2018-10-25 00:01:36,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:36,191 INFO L225 Difference]: With dead ends: 1210 [2018-10-25 00:01:36,192 INFO L226 Difference]: Without dead ends: 536 [2018-10-25 00:01:36,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:01:36,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-10-25 00:01:36,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2018-10-25 00:01:36,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-10-25 00:01:36,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 787 transitions. [2018-10-25 00:01:36,239 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 787 transitions. Word has length 128 [2018-10-25 00:01:36,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:36,241 INFO L481 AbstractCegarLoop]: Abstraction has 536 states and 787 transitions. [2018-10-25 00:01:36,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:01:36,243 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 787 transitions. [2018-10-25 00:01:36,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-25 00:01:36,247 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:36,248 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:01:36,248 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:36,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:36,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1220128141, now seen corresponding path program 1 times [2018-10-25 00:01:36,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:36,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:36,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:36,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:36,250 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:36,617 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-10-25 00:01:36,757 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:01:36,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:01:36,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:01:36,758 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:01:36,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:01:36,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:01:36,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:01:36,759 INFO L87 Difference]: Start difference. First operand 536 states and 787 transitions. Second operand 5 states. [2018-10-25 00:01:38,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:38,606 INFO L93 Difference]: Finished difference Result 1204 states and 1799 transitions. [2018-10-25 00:01:38,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:01:38,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2018-10-25 00:01:38,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:38,615 INFO L225 Difference]: With dead ends: 1204 [2018-10-25 00:01:38,615 INFO L226 Difference]: Without dead ends: 535 [2018-10-25 00:01:38,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:01:38,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-10-25 00:01:38,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2018-10-25 00:01:38,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-10-25 00:01:38,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 782 transitions. [2018-10-25 00:01:38,637 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 782 transitions. Word has length 129 [2018-10-25 00:01:38,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:38,638 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 782 transitions. [2018-10-25 00:01:38,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:01:38,638 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 782 transitions. [2018-10-25 00:01:38,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-25 00:01:38,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:38,641 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:01:38,641 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:38,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:38,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1858048063, now seen corresponding path program 1 times [2018-10-25 00:01:38,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:38,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:38,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:38,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:38,644 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:38,845 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:01:38,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:01:38,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:01:38,846 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:01:38,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:01:38,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:01:38,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:01:38,847 INFO L87 Difference]: Start difference. First operand 535 states and 782 transitions. Second operand 3 states. [2018-10-25 00:01:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:39,692 INFO L93 Difference]: Finished difference Result 1521 states and 2300 transitions. [2018-10-25 00:01:39,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:01:39,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2018-10-25 00:01:39,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:39,712 INFO L225 Difference]: With dead ends: 1521 [2018-10-25 00:01:39,712 INFO L226 Difference]: Without dead ends: 992 [2018-10-25 00:01:39,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:01:39,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-10-25 00:01:39,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2018-10-25 00:01:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-10-25 00:01:39,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1411 transitions. [2018-10-25 00:01:39,758 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1411 transitions. Word has length 134 [2018-10-25 00:01:39,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:39,760 INFO L481 AbstractCegarLoop]: Abstraction has 992 states and 1411 transitions. [2018-10-25 00:01:39,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:01:39,760 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1411 transitions. [2018-10-25 00:01:39,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-25 00:01:39,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:39,765 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:01:39,765 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:39,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:39,765 INFO L82 PathProgramCache]: Analyzing trace with hash -865633433, now seen corresponding path program 1 times [2018-10-25 00:01:39,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:39,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:39,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:39,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:39,767 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:01:39,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:01:39,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:01:39,932 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:01:39,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:01:39,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:01:39,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:01:39,933 INFO L87 Difference]: Start difference. First operand 992 states and 1411 transitions. Second operand 6 states. [2018-10-25 00:01:40,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:40,987 INFO L93 Difference]: Finished difference Result 2947 states and 4374 transitions. [2018-10-25 00:01:40,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:01:40,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2018-10-25 00:01:40,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:41,002 INFO L225 Difference]: With dead ends: 2947 [2018-10-25 00:01:41,002 INFO L226 Difference]: Without dead ends: 1961 [2018-10-25 00:01:41,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:01:41,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2018-10-25 00:01:41,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1928. [2018-10-25 00:01:41,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-10-25 00:01:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2554 transitions. [2018-10-25 00:01:41,080 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2554 transitions. Word has length 135 [2018-10-25 00:01:41,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:41,080 INFO L481 AbstractCegarLoop]: Abstraction has 1928 states and 2554 transitions. [2018-10-25 00:01:41,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:01:41,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2554 transitions. [2018-10-25 00:01:41,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-25 00:01:41,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:41,089 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-25 00:01:41,089 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:41,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:41,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1578661412, now seen corresponding path program 1 times [2018-10-25 00:01:41,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:41,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:41,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:41,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:41,092 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:41,395 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 43 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:01:41,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:01:41,395 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:01:41,396 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-10-25 00:01:41,399 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:01:41,458 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:01:41,459 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:01:42,134 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:01:42,139 INFO L272 AbstractInterpreter]: Visited 117 different actions 117 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-10-25 00:01:42,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:42,151 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:01:42,749 INFO L232 lantSequenceWeakener]: Weakened 142 states. On average, predicates are now at 80.44% of their original sizes. [2018-10-25 00:01:42,750 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:01:42,994 INFO L413 sIntCurrentIteration]: We have 150 unified AI predicates [2018-10-25 00:01:42,994 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:01:42,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:01:42,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 00:01:42,995 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:01:42,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:01:42,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:01:42,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:01:42,997 INFO L87 Difference]: Start difference. First operand 1928 states and 2554 transitions. Second operand 6 states. [2018-10-25 00:01:48,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:48,512 INFO L93 Difference]: Finished difference Result 3988 states and 5280 transitions. [2018-10-25 00:01:48,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 00:01:48,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2018-10-25 00:01:48,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:48,523 INFO L225 Difference]: With dead ends: 3988 [2018-10-25 00:01:48,524 INFO L226 Difference]: Without dead ends: 2066 [2018-10-25 00:01:48,531 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:01:48,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2018-10-25 00:01:48,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 2064. [2018-10-25 00:01:48,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2064 states. [2018-10-25 00:01:48,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2696 transitions. [2018-10-25 00:01:48,593 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2696 transitions. Word has length 151 [2018-10-25 00:01:48,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:48,594 INFO L481 AbstractCegarLoop]: Abstraction has 2064 states and 2696 transitions. [2018-10-25 00:01:48,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:01:48,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2696 transitions. [2018-10-25 00:01:48,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-25 00:01:48,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:48,602 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-25 00:01:48,603 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:48,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:48,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1993472409, now seen corresponding path program 1 times [2018-10-25 00:01:48,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:48,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:48,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:48,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:48,605 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:49,095 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-25 00:01:49,273 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 47 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-25 00:01:49,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:01:49,274 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:01:49,274 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 161 with the following transitions: [2018-10-25 00:01:49,275 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:01:49,281 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:01:49,281 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:01:49,731 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:01:49,731 INFO L272 AbstractInterpreter]: Visited 121 different actions 236 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:01:49,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:49,770 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:01:50,546 INFO L232 lantSequenceWeakener]: Weakened 157 states. On average, predicates are now at 80.54% of their original sizes. [2018-10-25 00:01:50,546 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:01:50,945 INFO L413 sIntCurrentIteration]: We have 159 unified AI predicates [2018-10-25 00:01:50,946 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:01:50,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:01:50,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-25 00:01:50,946 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:01:50,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 00:01:50,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 00:01:50,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:01:50,948 INFO L87 Difference]: Start difference. First operand 2064 states and 2696 transitions. Second operand 10 states. [2018-10-25 00:01:57,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:57,699 INFO L93 Difference]: Finished difference Result 4127 states and 5425 transitions. [2018-10-25 00:01:57,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 00:01:57,699 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 160 [2018-10-25 00:01:57,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:57,710 INFO L225 Difference]: With dead ends: 4127 [2018-10-25 00:01:57,710 INFO L226 Difference]: Without dead ends: 2205 [2018-10-25 00:01:57,717 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 167 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:01:57,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2018-10-25 00:01:57,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 2202. [2018-10-25 00:01:57,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2018-10-25 00:01:57,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 2844 transitions. [2018-10-25 00:01:57,774 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 2844 transitions. Word has length 160 [2018-10-25 00:01:57,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:57,775 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 2844 transitions. [2018-10-25 00:01:57,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-25 00:01:57,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 2844 transitions. [2018-10-25 00:01:57,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-25 00:01:57,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:57,783 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-25 00:01:57,784 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:57,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:57,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1610890117, now seen corresponding path program 1 times [2018-10-25 00:01:57,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:57,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:57,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:57,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:57,786 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:57,995 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 87 proven. 15 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-25 00:01:57,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:01:57,995 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:01:57,996 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2018-10-25 00:01:57,996 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:01:58,001 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:01:58,002 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:01:58,268 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:01:58,268 INFO L272 AbstractInterpreter]: Visited 121 different actions 236 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:01:58,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:58,278 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:01:59,142 INFO L232 lantSequenceWeakener]: Weakened 129 states. On average, predicates are now at 80.77% of their original sizes. [2018-10-25 00:01:59,142 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:02:02,446 INFO L413 sIntCurrentIteration]: We have 192 unified AI predicates [2018-10-25 00:02:02,446 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:02:02,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:02:02,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-10-25 00:02:02,447 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:02,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:02:02,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:02:02,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:02:02,448 INFO L87 Difference]: Start difference. First operand 2202 states and 2844 transitions. Second operand 15 states. [2018-10-25 00:02:16,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:16,853 INFO L93 Difference]: Finished difference Result 4686 states and 6090 transitions. [2018-10-25 00:02:16,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-25 00:02:16,853 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 193 [2018-10-25 00:02:16,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:16,869 INFO L225 Difference]: With dead ends: 4686 [2018-10-25 00:02:16,869 INFO L226 Difference]: Without dead ends: 2764 [2018-10-25 00:02:16,877 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 199 GetRequests, 68 SyntacticMatches, 111 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:02:16,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2018-10-25 00:02:17,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2754. [2018-10-25 00:02:17,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2754 states. [2018-10-25 00:02:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2754 states to 2754 states and 3424 transitions. [2018-10-25 00:02:17,281 INFO L78 Accepts]: Start accepts. Automaton has 2754 states and 3424 transitions. Word has length 193 [2018-10-25 00:02:17,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:17,282 INFO L481 AbstractCegarLoop]: Abstraction has 2754 states and 3424 transitions. [2018-10-25 00:02:17,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:02:17,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2754 states and 3424 transitions. [2018-10-25 00:02:17,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-25 00:02:17,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:17,292 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-25 00:02:17,293 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:17,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:17,293 INFO L82 PathProgramCache]: Analyzing trace with hash 281194242, now seen corresponding path program 1 times [2018-10-25 00:02:17,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:17,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:17,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:17,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:17,294 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 85 proven. 39 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-25 00:02:17,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:17,886 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:17,886 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 203 with the following transitions: [2018-10-25 00:02:17,887 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:17,891 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:17,891 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:19,114 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:02:19,115 INFO L272 AbstractInterpreter]: Visited 123 different actions 498 times. Merged at 9 different actions 42 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 2 different actions. Largest state had 42 variables. [2018-10-25 00:02:19,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:19,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:02:19,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:19,119 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-25 00:02:19,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:19,132 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:02:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:19,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:02:19,759 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 103 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-25 00:02:19,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:02:20,022 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-25 00:02:20,125 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-25 00:02:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 91 proven. 31 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-25 00:02:20,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:02:20,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-25 00:02:20,875 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:02:20,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-25 00:02:20,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-25 00:02:20,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-25 00:02:20,876 INFO L87 Difference]: Start difference. First operand 2754 states and 3424 transitions. Second operand 11 states. [2018-10-25 00:02:21,233 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-25 00:02:24,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:24,988 INFO L93 Difference]: Finished difference Result 9083 states and 12269 transitions. [2018-10-25 00:02:24,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-25 00:02:24,991 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 202 [2018-10-25 00:02:24,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:25,022 INFO L225 Difference]: With dead ends: 9083 [2018-10-25 00:02:25,022 INFO L226 Difference]: Without dead ends: 7023 [2018-10-25 00:02:25,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 407 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-10-25 00:02:25,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7023 states. [2018-10-25 00:02:25,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7023 to 6950. [2018-10-25 00:02:25,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6950 states. [2018-10-25 00:02:25,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6950 states to 6950 states and 8732 transitions. [2018-10-25 00:02:25,216 INFO L78 Accepts]: Start accepts. Automaton has 6950 states and 8732 transitions. Word has length 202 [2018-10-25 00:02:25,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:25,216 INFO L481 AbstractCegarLoop]: Abstraction has 6950 states and 8732 transitions. [2018-10-25 00:02:25,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-25 00:02:25,216 INFO L276 IsEmpty]: Start isEmpty. Operand 6950 states and 8732 transitions. [2018-10-25 00:02:25,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-25 00:02:25,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:25,234 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-25 00:02:25,234 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:25,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:25,235 INFO L82 PathProgramCache]: Analyzing trace with hash 425931920, now seen corresponding path program 1 times [2018-10-25 00:02:25,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:25,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:25,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:25,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:25,237 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:25,722 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-25 00:02:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 131 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-25 00:02:25,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:25,917 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:25,917 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-10-25 00:02:25,917 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:25,928 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:25,929 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:26,859 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:02:26,860 INFO L272 AbstractInterpreter]: Visited 122 different actions 358 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-10-25 00:02:26,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:26,898 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:02:29,022 INFO L232 lantSequenceWeakener]: Weakened 102 states. On average, predicates are now at 80.93% of their original sizes. [2018-10-25 00:02:29,022 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:02:31,915 INFO L413 sIntCurrentIteration]: We have 210 unified AI predicates [2018-10-25 00:02:31,915 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:02:31,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:02:31,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-10-25 00:02:31,915 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:31,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-25 00:02:31,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-25 00:02:31,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-10-25 00:02:31,916 INFO L87 Difference]: Start difference. First operand 6950 states and 8732 transitions. Second operand 13 states. [2018-10-25 00:02:44,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:44,608 INFO L93 Difference]: Finished difference Result 14182 states and 17893 transitions. [2018-10-25 00:02:44,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-25 00:02:44,609 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 211 [2018-10-25 00:02:44,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:44,641 INFO L225 Difference]: With dead ends: 14182 [2018-10-25 00:02:44,641 INFO L226 Difference]: Without dead ends: 8064 [2018-10-25 00:02:44,659 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 215 GetRequests, 83 SyntacticMatches, 116 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:02:44,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8064 states. [2018-10-25 00:02:44,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8064 to 7919. [2018-10-25 00:02:44,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7919 states. [2018-10-25 00:02:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7919 states to 7919 states and 9787 transitions. [2018-10-25 00:02:44,862 INFO L78 Accepts]: Start accepts. Automaton has 7919 states and 9787 transitions. Word has length 211 [2018-10-25 00:02:44,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:44,862 INFO L481 AbstractCegarLoop]: Abstraction has 7919 states and 9787 transitions. [2018-10-25 00:02:44,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-25 00:02:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 7919 states and 9787 transitions. [2018-10-25 00:02:44,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-25 00:02:44,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:44,886 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:44,886 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:44,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:44,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1586568926, now seen corresponding path program 1 times [2018-10-25 00:02:44,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:44,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:44,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:44,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:44,888 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:45,421 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-25 00:02:45,604 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-25 00:02:45,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:45,605 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:45,605 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 228 with the following transitions: [2018-10-25 00:02:45,605 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:45,608 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:45,608 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:46,827 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:02:46,827 INFO L272 AbstractInterpreter]: Visited 123 different actions 494 times. Merged at 9 different actions 38 times. Widened at 1 different actions 2 times. Found 7 fixpoints after 4 different actions. Largest state had 42 variables. [2018-10-25 00:02:46,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:46,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:02:46,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:46,834 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:02:46,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:46,843 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:02:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:46,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:02:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 140 proven. 14 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-25 00:02:47,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:02:47,374 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-25 00:02:47,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:02:47,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2018-10-25 00:02:47,397 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:02:47,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-25 00:02:47,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-25 00:02:47,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:02:47,400 INFO L87 Difference]: Start difference. First operand 7919 states and 9787 transitions. Second operand 8 states. [2018-10-25 00:02:50,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:50,088 INFO L93 Difference]: Finished difference Result 15132 states and 19361 transitions. [2018-10-25 00:02:50,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-25 00:02:50,089 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 227 [2018-10-25 00:02:50,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:50,131 INFO L225 Difference]: With dead ends: 15132 [2018-10-25 00:02:50,132 INFO L226 Difference]: Without dead ends: 9014 [2018-10-25 00:02:50,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 463 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-10-25 00:02:50,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9014 states. [2018-10-25 00:02:50,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9014 to 8413. [2018-10-25 00:02:50,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8413 states. [2018-10-25 00:02:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8413 states to 8413 states and 10009 transitions. [2018-10-25 00:02:50,367 INFO L78 Accepts]: Start accepts. Automaton has 8413 states and 10009 transitions. Word has length 227 [2018-10-25 00:02:50,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:50,368 INFO L481 AbstractCegarLoop]: Abstraction has 8413 states and 10009 transitions. [2018-10-25 00:02:50,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-25 00:02:50,368 INFO L276 IsEmpty]: Start isEmpty. Operand 8413 states and 10009 transitions. [2018-10-25 00:02:50,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-25 00:02:50,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:50,392 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-10-25 00:02:50,393 INFO L424 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:50,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:50,393 INFO L82 PathProgramCache]: Analyzing trace with hash 395172502, now seen corresponding path program 1 times [2018-10-25 00:02:50,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:50,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:50,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:50,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:50,394 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:51,079 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 200 proven. 61 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-25 00:02:51,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:51,079 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:51,080 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2018-10-25 00:02:51,080 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [109], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:51,083 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:51,083 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:51,950 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:02:51,950 INFO L272 AbstractInterpreter]: Visited 123 different actions 492 times. Merged at 8 different actions 36 times. Widened at 1 different actions 3 times. Found 6 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:02:51,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:51,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:02:51,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:51,957 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:02:52,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:52,189 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:02:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:52,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:02:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 179 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-25 00:02:52,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:02:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 179 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-25 00:02:52,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:02:52,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-10-25 00:02:52,761 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:02:52,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-25 00:02:52,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-25 00:02:52,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-10-25 00:02:52,762 INFO L87 Difference]: Start difference. First operand 8413 states and 10009 transitions. Second operand 12 states. [2018-10-25 00:02:57,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:57,420 INFO L93 Difference]: Finished difference Result 15086 states and 19437 transitions. [2018-10-25 00:02:57,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-25 00:02:57,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 246 [2018-10-25 00:02:57,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:57,421 INFO L225 Difference]: With dead ends: 15086 [2018-10-25 00:02:57,421 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:02:57,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 513 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=457, Invalid=1895, Unknown=0, NotChecked=0, Total=2352 [2018-10-25 00:02:57,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:02:57,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:02:57,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:02:57,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:02:57,456 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 246 [2018-10-25 00:02:57,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:57,457 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:02:57,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-25 00:02:57,457 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:02:57,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:02:57,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:02:57,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,729 WARN L179 SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 386 DAG size of output: 289 [2018-10-25 00:02:58,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:58,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:59,490 WARN L179 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 380 DAG size of output: 283 [2018-10-25 00:03:00,598 WARN L179 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2018-10-25 00:03:02,566 WARN L179 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 151 DAG size of output: 86 [2018-10-25 00:03:08,099 WARN L179 SmtUtils]: Spent 5.51 s on a formula simplification. DAG size of input: 315 DAG size of output: 141 [2018-10-25 00:03:10,007 WARN L179 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 308 DAG size of output: 110 [2018-10-25 00:03:11,769 WARN L179 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 302 DAG size of output: 110 [2018-10-25 00:03:11,772 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:03:11,773 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a17~0 |old(~a17~0)|) (<= ~a21~0 |old(~a21~0)|) (= |old(~a7~0)| ~a7~0) (<= |old(~a8~0)| ~a8~0) (= |old(~a16~0)| ~a16~0) (= ~a20~0 |old(~a20~0)|)) [2018-10-25 00:03:11,773 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:03:11,773 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-25 00:03:11,773 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-25 00:03:11,773 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,773 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,773 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,774 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,774 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,774 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,774 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-25 00:03:11,774 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-25 00:03:11,774 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-25 00:03:11,774 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-25 00:03:11,774 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-25 00:03:11,774 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-25 00:03:11,774 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-25 00:03:11,774 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-25 00:03:11,775 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-25 00:03:11,775 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-25 00:03:11,775 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,775 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,775 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,775 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,775 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,775 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,776 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-25 00:03:11,776 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-25 00:03:11,776 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-25 00:03:11,776 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-25 00:03:11,776 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-25 00:03:11,776 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-25 00:03:11,776 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-25 00:03:11,776 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-25 00:03:11,776 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-25 00:03:11,776 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-25 00:03:11,777 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-25 00:03:11,777 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-25 00:03:11,777 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-25 00:03:11,777 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-25 00:03:11,777 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-10-25 00:03:11,777 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,777 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,777 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,777 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,778 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,778 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-25 00:03:11,778 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-25 00:03:11,778 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-25 00:03:11,778 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-25 00:03:11,778 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-25 00:03:11,778 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-25 00:03:11,778 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-25 00:03:11,778 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-25 00:03:11,778 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-25 00:03:11,779 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,779 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,779 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,779 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,779 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,779 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-25 00:03:11,779 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-25 00:03:11,779 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-25 00:03:11,780 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-25 00:03:11,780 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-25 00:03:11,780 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-25 00:03:11,780 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-25 00:03:11,780 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-25 00:03:11,780 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-25 00:03:11,780 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-25 00:03:11,780 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-25 00:03:11,780 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-25 00:03:11,781 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-25 00:03:11,781 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,781 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,781 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,781 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,781 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,781 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-25 00:03:11,781 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-25 00:03:11,781 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-25 00:03:11,782 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-25 00:03:11,782 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-25 00:03:11,782 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-25 00:03:11,782 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-25 00:03:11,782 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-25 00:03:11,782 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-25 00:03:11,782 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,782 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,782 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,782 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,783 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,783 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,783 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-25 00:03:11,783 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,783 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-25 00:03:11,783 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-25 00:03:11,783 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-25 00:03:11,783 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-25 00:03:11,783 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-25 00:03:11,784 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-25 00:03:11,784 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-25 00:03:11,784 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-25 00:03:11,784 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-25 00:03:11,784 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-25 00:03:11,784 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-25 00:03:11,784 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-25 00:03:11,784 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-25 00:03:11,784 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,784 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,785 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,785 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,785 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,785 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-25 00:03:11,785 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-25 00:03:11,785 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-25 00:03:11,785 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-25 00:03:11,785 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-25 00:03:11,785 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-25 00:03:11,785 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-25 00:03:11,786 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-25 00:03:11,786 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,786 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,786 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,786 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,786 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,786 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-25 00:03:11,786 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-25 00:03:11,786 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-25 00:03:11,786 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-25 00:03:11,787 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-25 00:03:11,787 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-25 00:03:11,787 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-25 00:03:11,787 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-25 00:03:11,787 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-25 00:03:11,787 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-25 00:03:11,788 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse27 (= 1 |old(~a20~0)|)) (.cse6 (= 1 |old(~a17~0)|)) (.cse5 (= 4 |old(~a16~0)|)) (.cse15 (= ~a8~0 15)) (.cse14 (= ~a21~0 1)) (.cse16 (not (= 0 |old(~a7~0)|))) (.cse17 (not (= 1 |old(~a21~0)|))) (.cse18 (not (= 15 |old(~a8~0)|))) (.cse19 (not (= 5 |old(~a16~0)|)))) (let ((.cse20 (= |calculate_output_#in~input| 0)) (.cse9 (< |old(~a8~0)| 14)) (.cse4 (< 0 |old(~a20~0)|)) (.cse12 (or .cse16 .cse17 .cse18 .cse19)) (.cse13 (and .cse15 .cse14)) (.cse7 (= 1 |old(~a7~0)|)) (.cse8 (not .cse5)) (.cse21 (= 1 ~a20~0)) (.cse22 (= 13 ~a8~0)) (.cse23 (= |old(~a16~0)| ~a16~0)) (.cse24 (= 1 ~a21~0)) (.cse25 (= 1 ~a17~0)) (.cse26 (not (= 13 |old(~a8~0)|))) (.cse11 (not .cse6)) (.cse0 (= 6 |old(~a16~0)|)) (.cse10 (not .cse27)) (.cse1 (and (= ~a17~0 |old(~a17~0)|) (<= ~a21~0 |old(~a21~0)|) (= |old(~a7~0)| ~a7~0) (= ~a16~0 |old(~a16~0)|) (<= |old(~a8~0)| ~a8~0) (= ~a20~0 |old(~a20~0)|))) (.cse2 (not (= 8 ~a12~0))) (.cse3 (< 0 |old(~a21~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse1 .cse2 (< |old(~a20~0)| 1) .cse6 .cse3) (or .cse7 .cse8 .cse1 .cse2 .cse6) (or .cse0 .cse5 .cse9 .cse2 .cse6 .cse1) (or .cse0 .cse7 .cse1 .cse9 .cse2) (or .cse7 .cse9 .cse2 .cse1 .cse4) (or .cse7 .cse1 .cse5 .cse10 .cse2 .cse11) (or (or .cse12 .cse2 .cse6) .cse13) (or (or (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) (and .cse14 .cse15) (or .cse16 .cse17 .cse18 .cse19 .cse2 .cse20)) (or .cse17 .cse10 .cse8 (and (= 1 ~a7~0) .cse21 .cse22 .cse23 .cse24 .cse25) .cse2 (not .cse7) .cse26 .cse11) (or .cse7 .cse9 .cse2 .cse6 .cse1) (or .cse13 .cse6 (or .cse16 .cse17 .cse10 .cse18 (= 0 |old(~a16~0)|) .cse2 .cse20)) (or .cse0 .cse1 .cse9 .cse2 .cse6 .cse4) (or .cse12 .cse2 .cse13 .cse27) (or .cse17 .cse7 .cse10 .cse8 .cse2 (and (not (= ~a7~0 1)) .cse21 .cse22 .cse23 .cse24 .cse25) .cse26 .cse11) (or .cse0 .cse10 .cse1 .cse2 .cse3)))) [2018-10-25 00:03:11,788 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-25 00:03:11,788 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,788 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,788 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,788 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,788 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-25 00:03:11,788 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,788 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,788 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-25 00:03:11,788 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-25 00:03:11,789 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-25 00:03:11,789 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-25 00:03:11,789 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-25 00:03:11,789 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-25 00:03:11,789 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-25 00:03:11,789 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-25 00:03:11,789 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-25 00:03:11,789 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-25 00:03:11,789 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-25 00:03:11,789 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-25 00:03:11,790 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,790 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,790 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,790 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,790 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,790 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-25 00:03:11,790 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,790 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-25 00:03:11,790 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-25 00:03:11,791 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-25 00:03:11,791 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-25 00:03:11,791 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-25 00:03:11,791 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-25 00:03:11,791 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-25 00:03:11,791 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-25 00:03:11,791 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 503) no Hoare annotation was computed. [2018-10-25 00:03:11,791 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-25 00:03:11,791 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-25 00:03:11,792 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-25 00:03:11,792 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-25 00:03:11,792 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-25 00:03:11,792 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-25 00:03:11,792 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,792 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,792 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,792 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,792 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,792 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,793 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-25 00:03:11,793 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-25 00:03:11,793 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-25 00:03:11,793 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-25 00:03:11,793 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-25 00:03:11,793 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-25 00:03:11,793 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-25 00:03:11,793 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-25 00:03:11,793 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-25 00:03:11,793 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-25 00:03:11,794 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:03:11,794 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-10-25 00:03:11,794 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:03:11,794 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:03:11,794 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (and (= ~a21~0 1) (= ~a8~0 15) (= ~a16~0 |old(~a16~0)|) (= ~a7~0 0) (= ~a17~0 |old(~a17~0)|) (= ~a20~0 1)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-10-25 00:03:11,794 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:03:11,795 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4))) (let ((.cse5 (<= ~a20~0 0)) (.cse3 (<= 14 ~a8~0)) (.cse2 (not (= ~a17~0 1))) (.cse0 (not (= ~a7~0 1))) (.cse6 (not .cse1)) (.cse7 (= 1 ~a17~0)) (.cse8 (<= ~a21~0 0)) (.cse9 (= |old(~a20~0)| ~a20~0)) (.cse4 (not (= ~a16~0 6)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2 .cse5) (and .cse3 .cse4 .cse2 .cse6) (and .cse0 .cse3 .cse5) (and (= 1 ~a20~0) (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) .cse7) (and .cse8 .cse2 (<= 1 ~a20~0) .cse6) (not (= 3 ~c~0)) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse3 .cse4) (not (= 4 ~d~0)) (and .cse8 .cse4 .cse5) (not (= 2 ~b~0)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and .cse0 .cse3 .cse2) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse0 .cse9 .cse6 .cse7) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (and .cse8 .cse9 .cse4) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0))))) [2018-10-25 00:03:11,795 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-10-25 00:03:11,795 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-25 00:03:11,795 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-25 00:03:11,795 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4))) (let ((.cse5 (<= ~a20~0 0)) (.cse3 (<= 14 ~a8~0)) (.cse2 (not (= ~a17~0 1))) (.cse0 (not (= ~a7~0 1))) (.cse6 (not .cse1)) (.cse7 (= 1 ~a17~0)) (.cse8 (<= ~a21~0 0)) (.cse9 (= |old(~a20~0)| ~a20~0)) (.cse4 (not (= ~a16~0 6)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2 .cse5) (and .cse3 .cse4 .cse2 .cse6) (and .cse0 .cse3 .cse5) (and (= 1 ~a20~0) (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) .cse7) (and .cse8 .cse2 (<= 1 ~a20~0) .cse6) (not (= 3 ~c~0)) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse3 .cse4) (not (= 4 ~d~0)) (and .cse8 .cse4 .cse5) (not (= 2 ~b~0)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and .cse0 .cse3 .cse2) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse0 .cse9 .cse6 .cse7) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (and .cse8 .cse9 .cse4) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0))))) [2018-10-25 00:03:11,795 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:03:11,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:03:11 BoogieIcfgContainer [2018-10-25 00:03:11,811 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:03:11,812 INFO L168 Benchmark]: Toolchain (without parser) took 107740.29 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-25 00:03:11,813 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:03:11,814 INFO L168 Benchmark]: CACSL2BoogieTranslator took 812.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:03:11,815 INFO L168 Benchmark]: Boogie Procedure Inliner took 213.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -816.3 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2018-10-25 00:03:11,816 INFO L168 Benchmark]: Boogie Preprocessor took 99.44 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:03:11,816 INFO L168 Benchmark]: RCFGBuilder took 3328.27 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: 102.8 MB). Peak memory consumption was 102.8 MB. Max. memory is 7.1 GB. [2018-10-25 00:03:11,817 INFO L168 Benchmark]: TraceAbstraction took 103280.89 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.0 GB in the end (delta: -909.7 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-10-25 00:03:11,821 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 812.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 213.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -816.3 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 99.44 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3328.27 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: 102.8 MB). Peak memory consumption was 102.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 103280.89 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.0 GB in the end (delta: -909.7 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 503]: 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: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((!(a7 == 1) && a16 == 4) && !(a17 == 1)) || (((14 <= a8 && !(a16 == 6)) && !(a17 == 1)) && a20 <= 0)) || (((14 <= a8 && !(a16 == 6)) && !(a17 == 1)) && !(a16 == 4))) || ((!(a7 == 1) && 14 <= a8) && a20 <= 0)) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || (((a21 <= 0 && !(a17 == 1)) && 1 <= a20) && !(a16 == 4))) || !(3 == c)) || !(1 == \old(a21))) || ((!(a7 == 1) && 14 <= a8) && !(a16 == 6))) || !(4 == d)) || ((a21 <= 0 && !(a16 == 6)) && a20 <= 0)) || !(2 == b)) || !(y == 25)) || !(x == 24)) || !(a12 == 8)) || !(e == 5)) || ((!(a7 == 1) && 14 <= a8) && !(a17 == 1))) || !(21 == u)) || !(22 == v)) || (((!(a7 == 1) && \old(a20) == a20) && !(a16 == 4)) && 1 == a17)) || !(z == 26)) || !(\old(a16) == 5)) || !(0 == \old(a7))) || !(\old(a20) == 1)) || !(23 == w)) || !(15 == \old(a8))) || !(a == 1)) || ((a21 <= 0 && \old(a20) == a20) && !(a16 == 6))) || !(\old(a17) == 1)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 103.1s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 60.6s AutomataDifference, 0.0s DeadEndRemovalTime, 14.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1681 SDtfs, 11660 SDslu, 2155 SDs, 0 SdLazy, 17259 SolverSat, 2193 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.2s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 2253 GetRequests, 1844 SyntacticMatches, 244 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2365 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8413occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.8s AbstIntTime, 7 AbstIntIterations, 4 AbstIntStrong, 0.9970180593476459 AbsIntWeakeningRatio, 0.23066104078762306 AbsIntAvgWeakeningVarsNumRemoved, 6.819971870604782 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 882 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 326 PreInvPairs, 608 NumberOfFragments, 1259 HoareAnnotationTreeSize, 326 FomulaSimplifications, 26688 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 24493 FormulaSimplificationTreeSizeReductionInter, 12.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 2834 NumberOfCodeBlocks, 2834 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3490 ConstructedInterpolants, 0 QuantifiedInterpolants, 1920715 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1832 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 19 InterpolantComputations, 6 PerfectInterpolantSequences, 2210/2399 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...