java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 07:04:25,300 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 07:04:25,302 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 07:04:25,316 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 07:04:25,317 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 07:04:25,318 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 07:04:25,322 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 07:04:25,325 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 07:04:25,327 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 07:04:25,328 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 07:04:25,331 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 07:04:25,331 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 07:04:25,332 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 07:04:25,333 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 07:04:25,334 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 07:04:25,335 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 07:04:25,336 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 07:04:25,338 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 07:04:25,340 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 07:04:25,341 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 07:04:25,343 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 07:04:25,344 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 07:04:25,349 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 07:04:25,349 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 07:04:25,349 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 07:04:25,350 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 07:04:25,351 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 07:04:25,352 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 07:04:25,353 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 07:04:25,354 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 07:04:25,354 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 07:04:25,355 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 07:04:25,355 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 07:04:25,355 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 07:04:25,356 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 07:04:25,357 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 07:04:25,357 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 07:04:25,380 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 07:04:25,381 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 07:04:25,382 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 07:04:25,382 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 07:04:25,382 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 07:04:25,382 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 07:04:25,383 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 07:04:25,383 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 07:04:25,383 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 07:04:25,383 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 07:04:25,383 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 07:04:25,383 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 07:04:25,384 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 07:04:25,384 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 07:04:25,385 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 07:04:25,385 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 07:04:25,387 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 07:04:25,387 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 07:04:25,388 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 07:04:25,388 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 07:04:25,388 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 07:04:25,388 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 07:04:25,389 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 07:04:25,389 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 07:04:25,389 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 07:04:25,389 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 07:04:25,389 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 07:04:25,390 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 07:04:25,390 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 07:04:25,390 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 07:04:25,390 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 07:04:25,390 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 07:04:25,391 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 07:04:25,391 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 07:04:25,392 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 07:04:25,392 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 07:04:25,461 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 07:04:25,477 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 07:04:25,481 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 07:04:25,482 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 07:04:25,483 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 07:04:25,483 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-11-07 07:04:25,550 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6515b585/05a299224f32409b95b9a8bf86a0fb6e/FLAG173fb3586 [2018-11-07 07:04:26,140 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 07:04:26,141 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-11-07 07:04:26,153 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6515b585/05a299224f32409b95b9a8bf86a0fb6e/FLAG173fb3586 [2018-11-07 07:04:26,169 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6515b585/05a299224f32409b95b9a8bf86a0fb6e [2018-11-07 07:04:26,180 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 07:04:26,183 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 07:04:26,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 07:04:26,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 07:04:26,189 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 07:04:26,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:04:26" (1/1) ... [2018-11-07 07:04:26,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56927dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26, skipping insertion in model container [2018-11-07 07:04:26,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:04:26" (1/1) ... [2018-11-07 07:04:26,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 07:04:26,281 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 07:04:26,767 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:04:26,772 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 07:04:26,875 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:04:26,896 INFO L193 MainTranslator]: Completed translation [2018-11-07 07:04:26,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26 WrapperNode [2018-11-07 07:04:26,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 07:04:26,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 07:04:26,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 07:04:26,898 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 07:04:26,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26" (1/1) ... [2018-11-07 07:04:26,927 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26" (1/1) ... [2018-11-07 07:04:27,031 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 07:04:27,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 07:04:27,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 07:04:27,032 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 07:04:27,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26" (1/1) ... [2018-11-07 07:04:27,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26" (1/1) ... [2018-11-07 07:04:27,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26" (1/1) ... [2018-11-07 07:04:27,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26" (1/1) ... [2018-11-07 07:04:27,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26" (1/1) ... [2018-11-07 07:04:27,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26" (1/1) ... [2018-11-07 07:04:27,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26" (1/1) ... [2018-11-07 07:04:27,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 07:04:27,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 07:04:27,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 07:04:27,127 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 07:04:27,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 07:04:27,203 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 07:04:27,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 07:04:27,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 07:04:27,205 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 07:04:27,205 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 07:04:27,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 07:04:27,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 07:04:27,205 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 07:04:27,205 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 07:04:30,470 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 07:04:30,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:04:30 BoogieIcfgContainer [2018-11-07 07:04:30,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 07:04:30,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 07:04:30,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 07:04:30,477 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 07:04:30,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:04:26" (1/3) ... [2018-11-07 07:04:30,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77dafd5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:04:30, skipping insertion in model container [2018-11-07 07:04:30,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26" (2/3) ... [2018-11-07 07:04:30,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77dafd5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:04:30, skipping insertion in model container [2018-11-07 07:04:30,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:04:30" (3/3) ... [2018-11-07 07:04:30,482 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label11_true-unreach-call_false-termination.c [2018-11-07 07:04:30,494 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 07:04:30,506 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 07:04:30,524 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 07:04:30,578 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 07:04:30,578 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 07:04:30,578 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 07:04:30,578 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 07:04:30,579 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 07:04:30,580 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 07:04:30,580 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 07:04:30,581 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 07:04:30,612 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 07:04:30,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-07 07:04:30,626 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:04:30,628 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-11-07 07:04:30,630 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:04:30,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:04:30,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1894719720, now seen corresponding path program 1 times [2018-11-07 07:04:30,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:04:30,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:04:30,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:04:30,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:04:30,694 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:04:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:04:31,294 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:04:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:04:31,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:04:31,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 07:04:31,459 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:04:31,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:04:31,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:04:31,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:04:31,487 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-07 07:04:33,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:04:33,270 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-07 07:04:33,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:04:33,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-11-07 07:04:33,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:04:33,292 INFO L225 Difference]: With dead ends: 550 [2018-11-07 07:04:33,292 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 07:04:33,299 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:04:33,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 07:04:33,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-07 07:04:33,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 07:04:33,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-11-07 07:04:33,381 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 116 [2018-11-07 07:04:33,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:04:33,382 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-11-07 07:04:33,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:04:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-11-07 07:04:33,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-07 07:04:33,388 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:04:33,388 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-11-07 07:04:33,389 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:04:33,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:04:33,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1844932745, now seen corresponding path program 1 times [2018-11-07 07:04:33,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:04:33,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:04:33,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:04:33,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:04:33,391 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:04:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:04:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:04:33,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:04:33,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 07:04:33,621 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:04:33,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:04:33,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:04:33,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:04:33,624 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-11-07 07:04:35,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:04:35,427 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-11-07 07:04:35,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:04:35,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-11-07 07:04:35,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:04:35,435 INFO L225 Difference]: With dead ends: 888 [2018-11-07 07:04:35,436 INFO L226 Difference]: Without dead ends: 554 [2018-11-07 07:04:35,439 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:04:35,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-07 07:04:35,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-11-07 07:04:35,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-07 07:04:35,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-11-07 07:04:35,482 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 127 [2018-11-07 07:04:35,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:04:35,483 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-11-07 07:04:35,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:04:35,483 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-11-07 07:04:35,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-07 07:04:35,488 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:04:35,488 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-11-07 07:04:35,488 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:04:35,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:04:35,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1950525493, now seen corresponding path program 1 times [2018-11-07 07:04:35,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:04:35,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:04:35,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:04:35,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:04:35,490 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:04:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:04:35,931 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:04:35,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:04:35,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 07:04:35,932 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:04:35,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 07:04:35,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 07:04:35,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:04:35,933 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 5 states. [2018-11-07 07:04:37,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:04:37,877 INFO L93 Difference]: Finished difference Result 1210 states and 1896 transitions. [2018-11-07 07:04:37,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 07:04:37,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2018-11-07 07:04:37,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:04:37,889 INFO L225 Difference]: With dead ends: 1210 [2018-11-07 07:04:37,890 INFO L226 Difference]: Without dead ends: 536 [2018-11-07 07:04:37,893 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:04:37,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-11-07 07:04:37,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2018-11-07 07:04:37,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-11-07 07:04:37,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 787 transitions. [2018-11-07 07:04:37,931 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 787 transitions. Word has length 128 [2018-11-07 07:04:37,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:04:37,932 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 787 transitions. [2018-11-07 07:04:37,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 07:04:37,932 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 787 transitions. [2018-11-07 07:04:37,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 07:04:37,936 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:04:37,936 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-11-07 07:04:37,936 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:04:37,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:04:37,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1220128141, now seen corresponding path program 1 times [2018-11-07 07:04:37,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:04:37,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:04:37,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:04:37,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:04:37,940 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:04:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:04:38,339 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-11-07 07:04:38,464 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:04:38,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:04:38,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 07:04:38,464 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:04:38,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 07:04:38,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 07:04:38,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:04:38,466 INFO L87 Difference]: Start difference. First operand 536 states and 787 transitions. Second operand 5 states. [2018-11-07 07:04:40,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:04:40,270 INFO L93 Difference]: Finished difference Result 1204 states and 1799 transitions. [2018-11-07 07:04:40,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 07:04:40,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2018-11-07 07:04:40,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:04:40,276 INFO L225 Difference]: With dead ends: 1204 [2018-11-07 07:04:40,277 INFO L226 Difference]: Without dead ends: 535 [2018-11-07 07:04:40,279 INFO L604 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-11-07 07:04:40,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-07 07:04:40,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2018-11-07 07:04:40,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-11-07 07:04:40,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 782 transitions. [2018-11-07 07:04:40,302 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 782 transitions. Word has length 129 [2018-11-07 07:04:40,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:04:40,302 INFO L480 AbstractCegarLoop]: Abstraction has 535 states and 782 transitions. [2018-11-07 07:04:40,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 07:04:40,302 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 782 transitions. [2018-11-07 07:04:40,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 07:04:40,305 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:04:40,305 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-11-07 07:04:40,306 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:04:40,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:04:40,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1858048063, now seen corresponding path program 1 times [2018-11-07 07:04:40,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:04:40,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:04:40,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:04:40,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:04:40,308 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:04:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:04:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:04:40,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:04:40,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 07:04:40,491 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:04:40,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:04:40,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:04:40,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:04:40,492 INFO L87 Difference]: Start difference. First operand 535 states and 782 transitions. Second operand 3 states. [2018-11-07 07:04:41,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:04:41,293 INFO L93 Difference]: Finished difference Result 1521 states and 2300 transitions. [2018-11-07 07:04:41,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:04:41,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2018-11-07 07:04:41,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:04:41,313 INFO L225 Difference]: With dead ends: 1521 [2018-11-07 07:04:41,313 INFO L226 Difference]: Without dead ends: 992 [2018-11-07 07:04:41,316 INFO L604 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-11-07 07:04:41,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-11-07 07:04:41,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2018-11-07 07:04:41,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-11-07 07:04:41,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1411 transitions. [2018-11-07 07:04:41,357 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1411 transitions. Word has length 134 [2018-11-07 07:04:41,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:04:41,359 INFO L480 AbstractCegarLoop]: Abstraction has 992 states and 1411 transitions. [2018-11-07 07:04:41,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:04:41,359 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1411 transitions. [2018-11-07 07:04:41,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-07 07:04:41,364 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:04:41,364 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-11-07 07:04:41,365 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:04:41,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:04:41,365 INFO L82 PathProgramCache]: Analyzing trace with hash -865633433, now seen corresponding path program 1 times [2018-11-07 07:04:41,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:04:41,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:04:41,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:04:41,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:04:41,369 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:04:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:04:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:04:41,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:04:41,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 07:04:41,494 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:04:41,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:04:41,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:04:41,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:04:41,495 INFO L87 Difference]: Start difference. First operand 992 states and 1411 transitions. Second operand 6 states. [2018-11-07 07:04:42,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:04:42,494 INFO L93 Difference]: Finished difference Result 2947 states and 4374 transitions. [2018-11-07 07:04:42,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:04:42,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2018-11-07 07:04:42,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:04:42,513 INFO L225 Difference]: With dead ends: 2947 [2018-11-07 07:04:42,513 INFO L226 Difference]: Without dead ends: 1961 [2018-11-07 07:04:42,521 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:04:42,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2018-11-07 07:04:42,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1928. [2018-11-07 07:04:42,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-11-07 07:04:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2554 transitions. [2018-11-07 07:04:42,606 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2554 transitions. Word has length 135 [2018-11-07 07:04:42,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:04:42,606 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 2554 transitions. [2018-11-07 07:04:42,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:04:42,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2554 transitions. [2018-11-07 07:04:42,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-07 07:04:42,616 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:04:42,616 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-11-07 07:04:42,616 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:04:42,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:04:42,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1578661412, now seen corresponding path program 1 times [2018-11-07 07:04:42,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:04:42,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:04:42,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:04:42,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:04:42,618 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:04:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:04:42,899 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 43 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:04:42,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:04:42,899 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:04:42,900 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-11-07 07:04:42,903 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-11-07 07:04:42,955 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:04:42,955 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:04:43,677 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:04:43,679 INFO L272 AbstractInterpreter]: Visited 117 different actions 117 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-11-07 07:04:43,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:04:43,729 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:04:44,175 INFO L227 lantSequenceWeakener]: Weakened 142 states. On average, predicates are now at 80.44% of their original sizes. [2018-11-07 07:04:44,176 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:04:44,427 INFO L415 sIntCurrentIteration]: We unified 150 AI predicates to 150 [2018-11-07 07:04:44,427 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:04:44,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:04:44,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-07 07:04:44,429 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:04:44,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:04:44,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:04:44,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:04:44,430 INFO L87 Difference]: Start difference. First operand 1928 states and 2554 transitions. Second operand 6 states. [2018-11-07 07:04:51,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:04:51,124 INFO L93 Difference]: Finished difference Result 3988 states and 5280 transitions. [2018-11-07 07:04:51,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 07:04:51,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2018-11-07 07:04:51,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:04:51,136 INFO L225 Difference]: With dead ends: 3988 [2018-11-07 07:04:51,136 INFO L226 Difference]: Without dead ends: 2066 [2018-11-07 07:04:51,142 INFO L604 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-11-07 07:04:51,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2018-11-07 07:04:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 2064. [2018-11-07 07:04:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2064 states. [2018-11-07 07:04:51,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2696 transitions. [2018-11-07 07:04:51,209 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2696 transitions. Word has length 151 [2018-11-07 07:04:51,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:04:51,209 INFO L480 AbstractCegarLoop]: Abstraction has 2064 states and 2696 transitions. [2018-11-07 07:04:51,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:04:51,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2696 transitions. [2018-11-07 07:04:51,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-07 07:04:51,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:04:51,218 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-11-07 07:04:51,218 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:04:51,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:04:51,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1993472409, now seen corresponding path program 1 times [2018-11-07 07:04:51,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:04:51,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:04:51,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:04:51,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:04:51,220 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:04:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:04:51,596 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 47 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 07:04:51,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:04:51,596 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:04:51,597 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 161 with the following transitions: [2018-11-07 07:04:51,597 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-11-07 07:04:51,602 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:04:51,603 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:04:51,851 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:04:51,851 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-11-07 07:04:51,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:04:51,890 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:04:52,170 INFO L227 lantSequenceWeakener]: Weakened 157 states. On average, predicates are now at 81.84% of their original sizes. [2018-11-07 07:04:52,170 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:04:52,799 INFO L415 sIntCurrentIteration]: We unified 159 AI predicates to 159 [2018-11-07 07:04:52,800 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:04:52,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:04:52,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 07:04:52,800 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:04:52,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 07:04:52,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 07:04:52,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:04:52,802 INFO L87 Difference]: Start difference. First operand 2064 states and 2696 transitions. Second operand 10 states. [2018-11-07 07:04:59,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:04:59,092 INFO L93 Difference]: Finished difference Result 4127 states and 5425 transitions. [2018-11-07 07:04:59,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 07:04:59,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 160 [2018-11-07 07:04:59,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:04:59,104 INFO L225 Difference]: With dead ends: 4127 [2018-11-07 07:04:59,104 INFO L226 Difference]: Without dead ends: 2205 [2018-11-07 07:04:59,110 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 167 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-07 07:04:59,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2018-11-07 07:04:59,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 2202. [2018-11-07 07:04:59,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2018-11-07 07:04:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 2844 transitions. [2018-11-07 07:04:59,165 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 2844 transitions. Word has length 160 [2018-11-07 07:04:59,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:04:59,165 INFO L480 AbstractCegarLoop]: Abstraction has 2202 states and 2844 transitions. [2018-11-07 07:04:59,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 07:04:59,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 2844 transitions. [2018-11-07 07:04:59,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-07 07:04:59,174 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:04:59,174 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-11-07 07:04:59,174 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:04:59,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:04:59,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1610890117, now seen corresponding path program 1 times [2018-11-07 07:04:59,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:04:59,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:04:59,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:04:59,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:04:59,176 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:04:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:04:59,627 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 87 proven. 15 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-07 07:04:59,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:04:59,628 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:04:59,628 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2018-11-07 07:04:59,628 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-11-07 07:04:59,636 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:04:59,637 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:04:59,916 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:04:59,916 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-11-07 07:04:59,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:04:59,920 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:05:00,194 INFO L227 lantSequenceWeakener]: Weakened 190 states. On average, predicates are now at 81.8% of their original sizes. [2018-11-07 07:05:00,194 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:05:00,327 INFO L415 sIntCurrentIteration]: We unified 192 AI predicates to 192 [2018-11-07 07:05:00,328 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:05:00,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:05:00,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 07:05:00,328 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:05:00,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 07:05:00,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 07:05:00,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:05:00,330 INFO L87 Difference]: Start difference. First operand 2202 states and 2844 transitions. Second operand 10 states. [2018-11-07 07:05:04,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:05:04,804 INFO L93 Difference]: Finished difference Result 4541 states and 5909 transitions. [2018-11-07 07:05:04,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 07:05:04,804 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 193 [2018-11-07 07:05:04,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:05:04,813 INFO L225 Difference]: With dead ends: 4541 [2018-11-07 07:05:04,814 INFO L226 Difference]: Without dead ends: 2619 [2018-11-07 07:05:04,819 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 201 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-11-07 07:05:04,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2619 states. [2018-11-07 07:05:04,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2619 to 2616. [2018-11-07 07:05:04,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2616 states. [2018-11-07 07:05:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2616 states and 3280 transitions. [2018-11-07 07:05:04,877 INFO L78 Accepts]: Start accepts. Automaton has 2616 states and 3280 transitions. Word has length 193 [2018-11-07 07:05:04,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:05:04,877 INFO L480 AbstractCegarLoop]: Abstraction has 2616 states and 3280 transitions. [2018-11-07 07:05:04,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 07:05:04,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 3280 transitions. [2018-11-07 07:05:04,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-07 07:05:04,887 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:04,887 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-11-07 07:05:04,888 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:04,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:04,888 INFO L82 PathProgramCache]: Analyzing trace with hash 281194242, now seen corresponding path program 1 times [2018-11-07 07:05:04,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:04,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:04,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:04,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:04,890 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:05,091 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 85 proven. 39 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 07:05:05,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:05:05,092 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:05:05,092 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 203 with the following transitions: [2018-11-07 07:05:05,092 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-11-07 07:05:05,098 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:05:05,098 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:05:05,500 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:05:05,500 INFO L272 AbstractInterpreter]: Visited 123 different actions 490 times. Merged at 9 different actions 34 times. Never widened. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 07:05:05,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:05,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:05:05,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:05:05,510 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:05:05,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:05,523 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:05:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:05,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:05:06,100 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 103 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-07 07:05:06,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:05:06,938 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 91 proven. 31 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-07 07:05:06,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:05:06,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 07:05:06,972 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:05:06,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 07:05:06,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 07:05:06,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 07:05:06,974 INFO L87 Difference]: Start difference. First operand 2616 states and 3280 transitions. Second operand 11 states. [2018-11-07 07:05:11,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:05:11,426 INFO L93 Difference]: Finished difference Result 8945 states and 12125 transitions. [2018-11-07 07:05:11,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 07:05:11,437 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 202 [2018-11-07 07:05:11,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:05:11,472 INFO L225 Difference]: With dead ends: 8945 [2018-11-07 07:05:11,472 INFO L226 Difference]: Without dead ends: 6885 [2018-11-07 07:05:11,496 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 407 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-11-07 07:05:11,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6885 states. [2018-11-07 07:05:11,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6885 to 6812. [2018-11-07 07:05:11,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6812 states. [2018-11-07 07:05:11,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6812 states to 6812 states and 8588 transitions. [2018-11-07 07:05:11,713 INFO L78 Accepts]: Start accepts. Automaton has 6812 states and 8588 transitions. Word has length 202 [2018-11-07 07:05:11,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:05:11,713 INFO L480 AbstractCegarLoop]: Abstraction has 6812 states and 8588 transitions. [2018-11-07 07:05:11,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 07:05:11,713 INFO L276 IsEmpty]: Start isEmpty. Operand 6812 states and 8588 transitions. [2018-11-07 07:05:11,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-07 07:05:11,734 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:11,734 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-11-07 07:05:11,735 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:11,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:11,735 INFO L82 PathProgramCache]: Analyzing trace with hash 425931920, now seen corresponding path program 1 times [2018-11-07 07:05:11,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:11,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:11,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:11,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:11,737 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:12,277 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 07:05:12,407 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 131 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 07:05:12,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:05:12,407 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:05:12,408 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-11-07 07:05:12,408 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-11-07 07:05:12,415 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:05:12,416 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:05:13,083 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:05:13,083 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-11-07 07:05:13,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:13,110 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:05:13,483 INFO L227 lantSequenceWeakener]: Weakened 208 states. On average, predicates are now at 83.43% of their original sizes. [2018-11-07 07:05:13,483 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:05:14,253 INFO L415 sIntCurrentIteration]: We unified 210 AI predicates to 210 [2018-11-07 07:05:14,254 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:05:14,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:05:14,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 07:05:14,254 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:05:14,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 07:05:14,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 07:05:14,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:05:14,256 INFO L87 Difference]: Start difference. First operand 6812 states and 8588 transitions. Second operand 10 states. [2018-11-07 07:05:21,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:05:21,486 INFO L93 Difference]: Finished difference Result 13623 states and 17295 transitions. [2018-11-07 07:05:21,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 07:05:21,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 211 [2018-11-07 07:05:21,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:05:21,514 INFO L225 Difference]: With dead ends: 13623 [2018-11-07 07:05:21,515 INFO L226 Difference]: Without dead ends: 7505 [2018-11-07 07:05:21,531 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 218 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-07 07:05:21,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7505 states. [2018-11-07 07:05:21,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7505 to 7500. [2018-11-07 07:05:21,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7500 states. [2018-11-07 07:05:21,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7500 states to 7500 states and 9359 transitions. [2018-11-07 07:05:21,710 INFO L78 Accepts]: Start accepts. Automaton has 7500 states and 9359 transitions. Word has length 211 [2018-11-07 07:05:21,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:05:21,710 INFO L480 AbstractCegarLoop]: Abstraction has 7500 states and 9359 transitions. [2018-11-07 07:05:21,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 07:05:21,711 INFO L276 IsEmpty]: Start isEmpty. Operand 7500 states and 9359 transitions. [2018-11-07 07:05:21,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-07 07:05:21,731 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:21,732 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-11-07 07:05:21,732 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:21,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:21,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1586568926, now seen corresponding path program 1 times [2018-11-07 07:05:21,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:21,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:21,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:21,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:21,734 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 07:05:22,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:05:22,210 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:05:22,211 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 228 with the following transitions: [2018-11-07 07:05:22,211 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-11-07 07:05:22,213 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:05:22,214 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:05:22,585 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:05:22,586 INFO L272 AbstractInterpreter]: Visited 123 different actions 491 times. Merged at 9 different actions 35 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 07:05:22,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:22,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:05:22,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:05:22,595 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-07 07:05:22,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:22,605 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:05:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:22,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:05:22,806 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 140 proven. 14 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-07 07:05:22,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:05:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-07 07:05:23,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:05:23,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2018-11-07 07:05:23,234 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:05:23,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 07:05:23,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 07:05:23,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:05:23,236 INFO L87 Difference]: Start difference. First operand 7500 states and 9359 transitions. Second operand 8 states. [2018-11-07 07:05:26,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:05:26,042 INFO L93 Difference]: Finished difference Result 14711 states and 18928 transitions. [2018-11-07 07:05:26,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 07:05:26,042 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 227 [2018-11-07 07:05:26,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:05:26,077 INFO L225 Difference]: With dead ends: 14711 [2018-11-07 07:05:26,080 INFO L226 Difference]: Without dead ends: 8593 [2018-11-07 07:05:26,102 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 463 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-11-07 07:05:26,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8593 states. [2018-11-07 07:05:26,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8593 to 7864. [2018-11-07 07:05:26,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7864 states. [2018-11-07 07:05:26,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7864 states to 7864 states and 9433 transitions. [2018-11-07 07:05:26,301 INFO L78 Accepts]: Start accepts. Automaton has 7864 states and 9433 transitions. Word has length 227 [2018-11-07 07:05:26,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:05:26,301 INFO L480 AbstractCegarLoop]: Abstraction has 7864 states and 9433 transitions. [2018-11-07 07:05:26,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 07:05:26,302 INFO L276 IsEmpty]: Start isEmpty. Operand 7864 states and 9433 transitions. [2018-11-07 07:05:26,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-07 07:05:26,323 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:26,324 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-11-07 07:05:26,325 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:26,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:26,325 INFO L82 PathProgramCache]: Analyzing trace with hash 395172502, now seen corresponding path program 1 times [2018-11-07 07:05:26,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:26,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:26,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:26,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:26,326 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:26,620 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 200 proven. 61 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-07 07:05:26,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:05:26,621 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:05:26,621 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2018-11-07 07:05:26,621 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-11-07 07:05:26,624 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:05:26,624 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:05:27,216 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:05:27,217 INFO L272 AbstractInterpreter]: Visited 123 different actions 488 times. Merged at 8 different actions 32 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-07 07:05:27,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:27,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:05:27,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:05:27,221 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-07 07:05:27,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:27,233 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:05:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:27,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:05:27,417 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 179 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-07 07:05:27,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:05:27,722 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 179 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-07 07:05:27,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:05:27,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-11-07 07:05:27,743 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:05:27,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 07:05:27,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 07:05:27,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-07 07:05:27,745 INFO L87 Difference]: Start difference. First operand 7864 states and 9433 transitions. Second operand 12 states. [2018-11-07 07:05:33,798 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-07 07:05:34,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:05:34,472 INFO L93 Difference]: Finished difference Result 14533 states and 18856 transitions. [2018-11-07 07:05:34,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 07:05:34,472 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 246 [2018-11-07 07:05:34,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:05:34,473 INFO L225 Difference]: With dead ends: 14533 [2018-11-07 07:05:34,473 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 07:05:34,514 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 513 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=457, Invalid=1895, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 07:05:34,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 07:05:34,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 07:05:34,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 07:05:34,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 07:05:34,516 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 246 [2018-11-07 07:05:34,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:05:34,516 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 07:05:34,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 07:05:34,516 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 07:05:34,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 07:05:34,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 07:05:34,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:34,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:34,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:34,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:34,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:34,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:34,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:34,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,480 WARN L179 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 216 [2018-11-07 07:05:35,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:35,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:36,028 WARN L179 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 295 DAG size of output: 207 [2018-11-07 07:05:36,536 WARN L179 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2018-11-07 07:05:36,869 WARN L179 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 40 [2018-11-07 07:05:41,715 WARN L179 SmtUtils]: Spent 4.82 s on a formula simplification. DAG size of input: 220 DAG size of output: 100 [2018-11-07 07:05:43,094 WARN L179 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 220 DAG size of output: 66 [2018-11-07 07:05:44,237 WARN L179 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 211 DAG size of output: 66 [2018-11-07 07:05:44,240 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 07:05:44,240 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-11-07 07:05:44,240 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 07:05:44,240 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-07 07:05:44,240 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-07 07:05:44,241 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,241 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,241 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,241 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,241 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,241 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,241 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-07 07:05:44,242 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-07 07:05:44,242 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-07 07:05:44,242 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-07 07:05:44,242 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-07 07:05:44,242 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-07 07:05:44,242 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-07 07:05:44,242 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-07 07:05:44,242 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-07 07:05:44,242 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-07 07:05:44,243 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,243 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,243 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,243 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,243 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,243 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,243 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-07 07:05:44,243 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-07 07:05:44,244 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-07 07:05:44,244 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-07 07:05:44,244 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-07 07:05:44,244 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-07 07:05:44,244 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-07 07:05:44,244 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-07 07:05:44,244 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-07 07:05:44,244 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-07 07:05:44,244 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-07 07:05:44,244 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-07 07:05:44,244 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-07 07:05:44,245 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-07 07:05:44,245 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-07 07:05:44,245 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,245 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,245 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,245 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,245 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,245 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-07 07:05:44,245 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-07 07:05:44,245 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-07 07:05:44,245 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-07 07:05:44,245 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-07 07:05:44,246 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-07 07:05:44,246 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-07 07:05:44,246 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-07 07:05:44,246 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-07 07:05:44,246 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,246 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,246 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,246 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,246 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,246 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-07 07:05:44,246 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-07 07:05:44,247 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-07 07:05:44,247 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-07 07:05:44,247 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-07 07:05:44,247 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-07 07:05:44,247 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-07 07:05:44,247 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-07 07:05:44,247 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-07 07:05:44,247 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-07 07:05:44,247 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-07 07:05:44,248 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-07 07:05:44,248 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-07 07:05:44,248 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,248 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,248 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,248 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,248 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,248 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-07 07:05:44,248 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-07 07:05:44,249 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-07 07:05:44,249 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-07 07:05:44,249 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-07 07:05:44,249 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-07 07:05:44,249 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-07 07:05:44,249 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-07 07:05:44,249 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-07 07:05:44,249 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,249 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,249 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,249 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,249 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,249 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,249 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,250 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-07 07:05:44,250 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-07 07:05:44,250 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-07 07:05:44,250 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-07 07:05:44,250 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-07 07:05:44,250 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-07 07:05:44,250 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-07 07:05:44,250 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-07 07:05:44,250 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-07 07:05:44,250 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-07 07:05:44,250 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-07 07:05:44,250 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-07 07:05:44,250 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-07 07:05:44,250 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-07 07:05:44,251 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,251 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,251 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,251 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,251 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,251 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-07 07:05:44,251 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-07 07:05:44,251 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-07 07:05:44,251 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-07 07:05:44,251 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-07 07:05:44,251 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-07 07:05:44,251 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-07 07:05:44,252 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-07 07:05:44,252 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,252 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,252 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,252 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,252 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,252 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-07 07:05:44,252 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-07 07:05:44,252 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-07 07:05:44,253 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-07 07:05:44,253 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-07 07:05:44,253 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-07 07:05:44,253 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-07 07:05:44,253 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-07 07:05:44,253 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-07 07:05:44,253 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-07 07:05:44,254 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse6 (= 1 |old(~a17~0)|)) (.cse5 (= 4 |old(~a16~0)|))) (let ((.cse3 (< 0 |old(~a21~0)|)) (.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)|))) (.cse9 (< |old(~a8~0)| 14)) (.cse4 (< 0 |old(~a20~0)|)) (.cse12 (and (= ~a8~0 15) (= ~a21~0 1))) (.cse13 (= |calculate_output_#in~input| 0)) (.cse0 (= 6 |old(~a16~0)|)) (.cse14 (not (= 0 |old(~a7~0)|))) (.cse16 (not (= 15 |old(~a8~0)|))) (.cse17 (not (= 0 |old(~a17~0)|))) (.cse15 (not (= 1 |old(~a21~0)|))) (.cse7 (= 1 |old(~a7~0)|)) (.cse10 (not (= 1 |old(~a20~0)|))) (.cse8 (not .cse5)) (.cse2 (not (= 8 ~a12~0))) (.cse19 (= 1 ~a20~0)) (.cse20 (= 13 ~a8~0)) (.cse21 (= |old(~a16~0)| ~a16~0)) (.cse22 (= 1 ~a21~0)) (.cse23 (= 1 ~a17~0)) (.cse24 (not (= 13 |old(~a8~0)|))) (.cse11 (not .cse6))) (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 .cse1 (or .cse0 .cse10 .cse2 .cse3)) (or .cse7 .cse9 .cse2 .cse1 .cse4) (or .cse7 .cse1 .cse5 .cse10 .cse2 .cse11) (or .cse12 .cse13 (let ((.cse18 (not (= 5 |old(~a16~0)|)))) (and (or .cse14 .cse15 .cse16 .cse17 .cse18 .cse2) (or .cse14 .cse15 .cse16 .cse18 .cse2 .cse11)))) (or .cse15 .cse10 .cse8 (and (= 1 ~a7~0) .cse19 .cse20 .cse21 .cse22 .cse23) .cse2 (not .cse7) .cse24 .cse11) (or .cse7 .cse9 .cse2 .cse6 .cse1) (or .cse0 .cse1 .cse9 .cse2 .cse6 .cse4) (or .cse12 (and (or .cse0 .cse14 .cse15 .cse10 .cse16 (= 0 |old(~a16~0)|) .cse2 .cse6 .cse13) (or .cse13 (or (not .cse0) .cse14 .cse15 .cse10 .cse16 .cse17 .cse2)))) (or .cse15 .cse7 .cse10 .cse8 .cse2 (and (not (= ~a7~0 1)) .cse19 .cse20 .cse21 .cse22 .cse23) .cse24 .cse11)))) [2018-11-07 07:05:44,254 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-07 07:05:44,254 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,254 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,254 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,254 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,254 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,254 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-07 07:05:44,254 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,255 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-07 07:05:44,255 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-07 07:05:44,255 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-07 07:05:44,255 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-07 07:05:44,255 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-07 07:05:44,255 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-07 07:05:44,255 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-07 07:05:44,255 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-07 07:05:44,255 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-07 07:05:44,255 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-07 07:05:44,256 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-07 07:05:44,256 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-07 07:05:44,256 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,256 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,256 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,256 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,256 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,256 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,256 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-07 07:05:44,256 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-07 07:05:44,256 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-07 07:05:44,257 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-07 07:05:44,257 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-07 07:05:44,257 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-07 07:05:44,257 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-07 07:05:44,257 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-07 07:05:44,257 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-07 07:05:44,257 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-07 07:05:44,257 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-07 07:05:44,257 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-07 07:05:44,257 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-07 07:05:44,258 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-07 07:05:44,258 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-07 07:05:44,258 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 503) no Hoare annotation was computed. [2018-11-07 07:05:44,258 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,258 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,258 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,258 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,258 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,258 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:05:44,258 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-07 07:05:44,259 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-07 07:05:44,259 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-07 07:05:44,259 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-07 07:05:44,259 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-07 07:05:44,259 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-07 07:05:44,259 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-07 07:05:44,259 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-07 07:05:44,259 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-07 07:05:44,259 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-07 07:05:44,260 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 07:05:44,260 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a7~0 0) (= ~a8~0 15) (= ~a12~0 8) (= ~a21~0 1) (= ~a20~0 1) (= 1 ~a17~0) (= ~a16~0 5)) [2018-11-07 07:05:44,260 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 07:05:44,260 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 07:05:44,260 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (not (= 1 |old(~a17~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)) (and (= ~a8~0 15) (= ~a21~0 1) (= ~a17~0 |old(~a17~0)|) (= |old(~a7~0)| ~a7~0) (= ~a20~0 |old(~a20~0)|) (= ~a16~0 5))) [2018-11-07 07:05:44,260 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-07 07:05:44,260 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) (not (= 1 |old(~a20~0)|)) (and .cse3 .cse4 .cse2 .cse6) (not (= 5 |old(~a16~0)|)) (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 (= 1 |old(~a21~0)|)) (and .cse0 .cse3 .cse4) (not (= 8 ~a12~0)) (and .cse8 .cse4 .cse5) (and .cse0 .cse3 .cse2) (and .cse0 .cse9 .cse6 .cse7) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)) (and .cse8 .cse9 .cse4)))) [2018-11-07 07:05:44,261 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-07 07:05:44,261 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-07 07:05:44,261 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-07 07:05:44,261 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) (not (= 1 |old(~a20~0)|)) (and .cse3 .cse4 .cse2 .cse6) (not (= 5 |old(~a16~0)|)) (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 (= 1 |old(~a21~0)|)) (and .cse0 .cse3 .cse4) (not (= 8 ~a12~0)) (and .cse8 .cse4 .cse5) (and .cse0 .cse3 .cse2) (and .cse0 .cse9 .cse6 .cse7) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)) (and .cse8 .cse9 .cse4)))) [2018-11-07 07:05:44,261 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-07 07:05:44,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:05:44 BoogieIcfgContainer [2018-11-07 07:05:44,275 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 07:05:44,276 INFO L168 Benchmark]: Toolchain (without parser) took 78094.88 ms. Allocated memory was 1.6 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-11-07 07:05:44,278 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 07:05:44,278 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.10 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-07 07:05:44,279 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.30 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -851.2 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2018-11-07 07:05:44,280 INFO L168 Benchmark]: Boogie Preprocessor took 94.91 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2018-11-07 07:05:44,281 INFO L168 Benchmark]: RCFGBuilder took 3344.85 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: 101.3 MB). Peak memory consumption was 101.3 MB. Max. memory is 7.1 GB. [2018-11-07 07:05:44,281 INFO L168 Benchmark]: TraceAbstraction took 73801.93 ms. Allocated memory was 2.3 GB in the beginning and 3.5 GB in the end (delta: 1.2 GB). Free memory was 2.1 GB in the beginning and 2.7 GB in the end (delta: -543.5 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-11-07 07:05:44,286 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.22 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 712.10 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 133.30 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -851.2 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 94.91 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3344.85 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: 101.3 MB). Peak memory consumption was 101.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 73801.93 ms. Allocated memory was 2.3 GB in the beginning and 3.5 GB in the end (delta: 1.2 GB). Free memory was 2.1 GB in the beginning and 2.7 GB in the end (delta: -543.5 MB). Peak memory consumption was 1.8 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)) || !(1 == \old(a20))) || (((14 <= a8 && !(a16 == 6)) && !(a17 == 1)) && !(a16 == 4))) || !(5 == \old(a16))) || ((!(a7 == 1) && 14 <= a8) && a20 <= 0)) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || (((a21 <= 0 && !(a17 == 1)) && 1 <= a20) && !(a16 == 4))) || !(1 == \old(a21))) || ((!(a7 == 1) && 14 <= a8) && !(a16 == 6))) || !(8 == a12)) || ((a21 <= 0 && !(a16 == 6)) && a20 <= 0)) || ((!(a7 == 1) && 14 <= a8) && !(a17 == 1))) || (((!(a7 == 1) && \old(a20) == a20) && !(a16 == 4)) && 1 == a17)) || !(0 == \old(a7))) || !(1 == \old(a17))) || !(15 == \old(a8))) || ((a21 <= 0 && \old(a20) == a20) && !(a16 == 6)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 73.6s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 48.2s AutomataDifference, 0.0s DeadEndRemovalTime, 9.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1684 SDtfs, 10919 SDslu, 2162 SDs, 0 SdLazy, 13346 SolverSat, 2231 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.8s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 2258 GetRequests, 2079 SyntacticMatches, 17 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7864occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.5s AbstIntTime, 7 AbstIntIterations, 4 AbstIntStrong, 0.9969429432615227 AbsIntWeakeningRatio, 0.23066104078762306 AbsIntAvgWeakeningVarsNumRemoved, 28.040787623066105 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 863 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 322 PreInvPairs, 596 NumberOfFragments, 1033 HoareAnnotationTreeSize, 322 FomulaSimplifications, 20872 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 18242 FormulaSimplificationTreeSizeReductionInter, 8.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.2s 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...