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_label42_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 07:06:03,704 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 07:06:03,706 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 07:06:03,719 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 07:06:03,719 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 07:06:03,721 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 07:06:03,723 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 07:06:03,726 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 07:06:03,727 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 07:06:03,730 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 07:06:03,732 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 07:06:03,732 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 07:06:03,733 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 07:06:03,734 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 07:06:03,735 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 07:06:03,736 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 07:06:03,746 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 07:06:03,748 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 07:06:03,751 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 07:06:03,753 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 07:06:03,753 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 07:06:03,759 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 07:06:03,762 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 07:06:03,762 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 07:06:03,762 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 07:06:03,765 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 07:06:03,766 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 07:06:03,767 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 07:06:03,768 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 07:06:03,769 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 07:06:03,769 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 07:06:03,769 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 07:06:03,770 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 07:06:03,770 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 07:06:03,771 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 07:06:03,772 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 07:06:03,772 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:06:03,794 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 07:06:03,794 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 07:06:03,795 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 07:06:03,795 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 07:06:03,795 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 07:06:03,796 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 07:06:03,797 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 07:06:03,797 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 07:06:03,797 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 07:06:03,797 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 07:06:03,797 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 07:06:03,797 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 07:06:03,798 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 07:06:03,798 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 07:06:03,799 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 07:06:03,799 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 07:06:03,799 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 07:06:03,799 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 07:06:03,799 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 07:06:03,800 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 07:06:03,800 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 07:06:03,800 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 07:06:03,800 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 07:06:03,800 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 07:06:03,803 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 07:06:03,803 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 07:06:03,803 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 07:06:03,803 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 07:06:03,803 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 07:06:03,804 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 07:06:03,804 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 07:06:03,804 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 07:06:03,804 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 07:06:03,804 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 07:06:03,805 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 07:06:03,805 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 07:06:03,857 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 07:06:03,880 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 07:06:03,884 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 07:06:03,886 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 07:06:03,886 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 07:06:03,887 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label42_true-unreach-call_false-termination.c [2018-11-07 07:06:03,949 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd50e1b04/4a88311b8ec4499b91a45bd61bb850fc/FLAG43e03ff61 [2018-11-07 07:06:04,549 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 07:06:04,550 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label42_true-unreach-call_false-termination.c [2018-11-07 07:06:04,562 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd50e1b04/4a88311b8ec4499b91a45bd61bb850fc/FLAG43e03ff61 [2018-11-07 07:06:04,577 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd50e1b04/4a88311b8ec4499b91a45bd61bb850fc [2018-11-07 07:06:04,588 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 07:06:04,589 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 07:06:04,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 07:06:04,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 07:06:04,594 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 07:06:04,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:06:04" (1/1) ... [2018-11-07 07:06:04,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14dd22e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:04, skipping insertion in model container [2018-11-07 07:06:04,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:06:04" (1/1) ... [2018-11-07 07:06:04,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 07:06:04,667 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 07:06:05,180 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:06:05,185 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 07:06:05,297 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:06:05,319 INFO L193 MainTranslator]: Completed translation [2018-11-07 07:06:05,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:05 WrapperNode [2018-11-07 07:06:05,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 07:06:05,321 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 07:06:05,321 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 07:06:05,321 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 07:06:05,331 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:06:05" (1/1) ... [2018-11-07 07:06:05,358 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:06:05" (1/1) ... [2018-11-07 07:06:05,453 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 07:06:05,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 07:06:05,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 07:06:05,454 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 07:06:05,466 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:05" (1/1) ... [2018-11-07 07:06:05,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:05" (1/1) ... [2018-11-07 07:06:05,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:05" (1/1) ... [2018-11-07 07:06:05,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:05" (1/1) ... [2018-11-07 07:06:05,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:05" (1/1) ... [2018-11-07 07:06:05,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:05" (1/1) ... [2018-11-07 07:06:05,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:05" (1/1) ... [2018-11-07 07:06:05,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 07:06:05,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 07:06:05,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 07:06:05,578 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 07:06:05,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:05" (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:06:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 07:06:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 07:06:05,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 07:06:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 07:06:05,653 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 07:06:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 07:06:05,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 07:06:05,654 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 07:06:05,654 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 07:06:09,009 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 07:06:09,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:06:09 BoogieIcfgContainer [2018-11-07 07:06:09,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 07:06:09,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 07:06:09,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 07:06:09,017 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 07:06:09,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:06:04" (1/3) ... [2018-11-07 07:06:09,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3ad5c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:06:09, skipping insertion in model container [2018-11-07 07:06:09,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:05" (2/3) ... [2018-11-07 07:06:09,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3ad5c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:06:09, skipping insertion in model container [2018-11-07 07:06:09,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:06:09" (3/3) ... [2018-11-07 07:06:09,021 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label42_true-unreach-call_false-termination.c [2018-11-07 07:06:09,032 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 07:06:09,042 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 07:06:09,059 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 07:06:09,098 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 07:06:09,098 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 07:06:09,098 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 07:06:09,098 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 07:06:09,099 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 07:06:09,099 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 07:06:09,099 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 07:06:09,099 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 07:06:09,128 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 07:06:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-07 07:06:09,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:09,143 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:06:09,146 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:09,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:09,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1053299728, now seen corresponding path program 1 times [2018-11-07 07:06:09,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:09,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:09,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:09,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:09,211 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:09,839 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:06:09,913 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:06:09,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:06:09,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 07:06:09,920 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:06:09,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:06:09,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:06:09,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:06:09,947 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-07 07:06:11,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:11,929 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-07 07:06:11,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:06:11,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2018-11-07 07:06:11,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:11,953 INFO L225 Difference]: With dead ends: 550 [2018-11-07 07:06:11,953 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 07:06:11,960 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:06:11,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 07:06:12,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-07 07:06:12,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 07:06:12,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 553 transitions. [2018-11-07 07:06:12,044 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 553 transitions. Word has length 122 [2018-11-07 07:06:12,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:12,045 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 553 transitions. [2018-11-07 07:06:12,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:06:12,045 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 553 transitions. [2018-11-07 07:06:12,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-07 07:06:12,052 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:12,054 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, 1, 1, 1, 1, 1, 1] [2018-11-07 07:06:12,054 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:12,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:12,055 INFO L82 PathProgramCache]: Analyzing trace with hash -693386961, now seen corresponding path program 1 times [2018-11-07 07:06:12,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:12,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:12,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:12,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:12,059 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:12,300 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:06:12,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:06:12,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 07:06:12,301 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:06:12,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:06:12,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:06:12,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:06:12,304 INFO L87 Difference]: Start difference. First operand 340 states and 553 transitions. Second operand 6 states. [2018-11-07 07:06:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:14,569 INFO L93 Difference]: Finished difference Result 1075 states and 1835 transitions. [2018-11-07 07:06:14,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:06:14,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2018-11-07 07:06:14,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:14,587 INFO L225 Difference]: With dead ends: 1075 [2018-11-07 07:06:14,587 INFO L226 Difference]: Without dead ends: 741 [2018-11-07 07:06:14,595 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:06:14,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-11-07 07:06:14,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 724. [2018-11-07 07:06:14,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-11-07 07:06:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1145 transitions. [2018-11-07 07:06:14,648 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1145 transitions. Word has length 133 [2018-11-07 07:06:14,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:14,649 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 1145 transitions. [2018-11-07 07:06:14,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:06:14,649 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1145 transitions. [2018-11-07 07:06:14,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 07:06:14,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:14,657 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, 1, 1, 1, 1, 1, 1] [2018-11-07 07:06:14,657 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:14,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:14,657 INFO L82 PathProgramCache]: Analyzing trace with hash -214566269, now seen corresponding path program 1 times [2018-11-07 07:06:14,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:14,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:14,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:14,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:14,659 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:15,031 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:06:15,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:06:15,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 07:06:15,032 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:06:15,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 07:06:15,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 07:06:15,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:06:15,034 INFO L87 Difference]: Start difference. First operand 724 states and 1145 transitions. Second operand 5 states. [2018-11-07 07:06:17,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:17,133 INFO L93 Difference]: Finished difference Result 1578 states and 2533 transitions. [2018-11-07 07:06:17,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 07:06:17,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2018-11-07 07:06:17,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:17,143 INFO L225 Difference]: With dead ends: 1578 [2018-11-07 07:06:17,144 INFO L226 Difference]: Without dead ends: 721 [2018-11-07 07:06:17,148 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:06:17,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-11-07 07:06:17,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2018-11-07 07:06:17,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-11-07 07:06:17,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1069 transitions. [2018-11-07 07:06:17,195 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1069 transitions. Word has length 134 [2018-11-07 07:06:17,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:17,196 INFO L480 AbstractCegarLoop]: Abstraction has 721 states and 1069 transitions. [2018-11-07 07:06:17,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 07:06:17,200 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1069 transitions. [2018-11-07 07:06:17,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-07 07:06:17,207 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:17,207 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, 1, 1, 1, 1, 1, 1] [2018-11-07 07:06:17,207 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:17,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:17,208 INFO L82 PathProgramCache]: Analyzing trace with hash -441297109, now seen corresponding path program 1 times [2018-11-07 07:06:17,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:17,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:17,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:17,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:17,209 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:18,163 WARN L179 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-11-07 07:06:18,303 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:06:18,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:06:18,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 07:06:18,304 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:06:18,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 07:06:18,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 07:06:18,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:06:18,305 INFO L87 Difference]: Start difference. First operand 721 states and 1069 transitions. Second operand 5 states. [2018-11-07 07:06:19,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:19,474 INFO L93 Difference]: Finished difference Result 1572 states and 2365 transitions. [2018-11-07 07:06:19,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 07:06:19,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2018-11-07 07:06:19,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:19,480 INFO L225 Difference]: With dead ends: 1572 [2018-11-07 07:06:19,480 INFO L226 Difference]: Without dead ends: 720 [2018-11-07 07:06:19,483 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:06:19,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2018-11-07 07:06:19,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2018-11-07 07:06:19,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-11-07 07:06:19,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1062 transitions. [2018-11-07 07:06:19,505 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1062 transitions. Word has length 135 [2018-11-07 07:06:19,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:19,506 INFO L480 AbstractCegarLoop]: Abstraction has 720 states and 1062 transitions. [2018-11-07 07:06:19,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 07:06:19,506 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1062 transitions. [2018-11-07 07:06:19,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-07 07:06:19,510 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:19,510 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:06:19,510 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:19,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:19,511 INFO L82 PathProgramCache]: Analyzing trace with hash -689394821, now seen corresponding path program 1 times [2018-11-07 07:06:19,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:19,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:19,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:19,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:19,512 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:19,699 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:06:19,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:06:19,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 07:06:19,700 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:06:19,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:06:19,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:06:19,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:06:19,701 INFO L87 Difference]: Start difference. First operand 720 states and 1062 transitions. Second operand 3 states. [2018-11-07 07:06:20,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:20,699 INFO L93 Difference]: Finished difference Result 1882 states and 2820 transitions. [2018-11-07 07:06:20,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:06:20,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-11-07 07:06:20,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:20,707 INFO L225 Difference]: With dead ends: 1882 [2018-11-07 07:06:20,707 INFO L226 Difference]: Without dead ends: 1168 [2018-11-07 07:06:20,711 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 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:06:20,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2018-11-07 07:06:20,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1164. [2018-11-07 07:06:20,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2018-11-07 07:06:20,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1592 transitions. [2018-11-07 07:06:20,743 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1592 transitions. Word has length 138 [2018-11-07 07:06:20,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:20,743 INFO L480 AbstractCegarLoop]: Abstraction has 1164 states and 1592 transitions. [2018-11-07 07:06:20,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:06:20,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1592 transitions. [2018-11-07 07:06:20,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-07 07:06:20,749 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:20,750 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:20,750 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:20,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:20,750 INFO L82 PathProgramCache]: Analyzing trace with hash -155247930, now seen corresponding path program 1 times [2018-11-07 07:06:20,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:20,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:20,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:20,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:20,752 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:06:20,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:20,993 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:06:20,994 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2018-11-07 07:06:20,996 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [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], [569], [577], [585], [593], [601], [609], [613], [615], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:06:21,053 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:06:21,053 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:06:21,734 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:06:21,741 INFO L272 AbstractInterpreter]: Visited 123 different actions 123 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-11-07 07:06:21,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:21,789 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:06:22,369 INFO L227 lantSequenceWeakener]: Weakened 161 states. On average, predicates are now at 80.48% of their original sizes. [2018-11-07 07:06:22,370 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:06:22,633 INFO L415 sIntCurrentIteration]: We unified 169 AI predicates to 169 [2018-11-07 07:06:22,633 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:06:22,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:06:22,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-07 07:06:22,635 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:06:22,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:06:22,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:06:22,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:06:22,636 INFO L87 Difference]: Start difference. First operand 1164 states and 1592 transitions. Second operand 6 states. [2018-11-07 07:06:30,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:30,326 INFO L93 Difference]: Finished difference Result 2460 states and 3350 transitions. [2018-11-07 07:06:30,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 07:06:30,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2018-11-07 07:06:30,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:30,334 INFO L225 Difference]: With dead ends: 2460 [2018-11-07 07:06:30,335 INFO L226 Difference]: Without dead ends: 1302 [2018-11-07 07:06:30,345 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 170 GetRequests, 165 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:06:30,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2018-11-07 07:06:30,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1300. [2018-11-07 07:06:30,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2018-11-07 07:06:30,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1734 transitions. [2018-11-07 07:06:30,399 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1734 transitions. Word has length 170 [2018-11-07 07:06:30,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:30,399 INFO L480 AbstractCegarLoop]: Abstraction has 1300 states and 1734 transitions. [2018-11-07 07:06:30,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:06:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1734 transitions. [2018-11-07 07:06:30,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-07 07:06:30,407 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:30,408 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:30,408 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:30,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:30,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1006399511, now seen corresponding path program 1 times [2018-11-07 07:06:30,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:30,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:30,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:30,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:30,410 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:30,740 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 07:06:30,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:30,741 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:06:30,741 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 180 with the following transitions: [2018-11-07 07:06:30,742 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [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], [569], [577], [585], [593], [601], [609], [613], [615], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:06:30,747 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:06:30,748 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:06:30,985 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:06:30,985 INFO L272 AbstractInterpreter]: Visited 127 different actions 248 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:06:31,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:31,025 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:06:31,300 INFO L227 lantSequenceWeakener]: Weakened 176 states. On average, predicates are now at 81.9% of their original sizes. [2018-11-07 07:06:31,300 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:06:31,715 INFO L415 sIntCurrentIteration]: We unified 178 AI predicates to 178 [2018-11-07 07:06:31,715 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:06:31,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:06:31,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 07:06:31,716 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:06:31,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 07:06:31,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 07:06:31,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:06:31,717 INFO L87 Difference]: Start difference. First operand 1300 states and 1734 transitions. Second operand 10 states. [2018-11-07 07:06:36,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:36,943 INFO L93 Difference]: Finished difference Result 2599 states and 3521 transitions. [2018-11-07 07:06:36,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 07:06:36,944 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 179 [2018-11-07 07:06:36,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:36,951 INFO L225 Difference]: With dead ends: 2599 [2018-11-07 07:06:36,951 INFO L226 Difference]: Without dead ends: 1441 [2018-11-07 07:06:36,956 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 186 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-07 07:06:36,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2018-11-07 07:06:36,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1438. [2018-11-07 07:06:36,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1438 states. [2018-11-07 07:06:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 1882 transitions. [2018-11-07 07:06:36,993 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 1882 transitions. Word has length 179 [2018-11-07 07:06:36,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:36,993 INFO L480 AbstractCegarLoop]: Abstraction has 1438 states and 1882 transitions. [2018-11-07 07:06:36,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 07:06:36,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1882 transitions. [2018-11-07 07:06:37,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-07 07:06:37,000 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:37,001 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 07:06:37,001 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:37,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:37,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1171173763, now seen corresponding path program 1 times [2018-11-07 07:06:37,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:37,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:37,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:37,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:37,003 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:37,264 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 100 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-07 07:06:37,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:37,265 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:06:37,265 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-11-07 07:06:37,265 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [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], [569], [577], [585], [593], [601], [609], [613], [615], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:06:37,270 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:06:37,270 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:06:37,446 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:06:37,446 INFO L272 AbstractInterpreter]: Visited 127 different actions 248 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:06:37,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:37,454 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:06:37,881 INFO L227 lantSequenceWeakener]: Weakened 209 states. On average, predicates are now at 81.85% of their original sizes. [2018-11-07 07:06:37,882 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:06:38,108 INFO L415 sIntCurrentIteration]: We unified 211 AI predicates to 211 [2018-11-07 07:06:38,108 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:06:38,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:06:38,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 07:06:38,109 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:06:38,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 07:06:38,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 07:06:38,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:06:38,110 INFO L87 Difference]: Start difference. First operand 1438 states and 1882 transitions. Second operand 10 states. [2018-11-07 07:06:42,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:42,340 INFO L93 Difference]: Finished difference Result 2876 states and 3820 transitions. [2018-11-07 07:06:42,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 07:06:42,341 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 212 [2018-11-07 07:06:42,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:42,349 INFO L225 Difference]: With dead ends: 2876 [2018-11-07 07:06:42,349 INFO L226 Difference]: Without dead ends: 1718 [2018-11-07 07:06:42,354 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 220 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-11-07 07:06:42,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2018-11-07 07:06:42,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1715. [2018-11-07 07:06:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2018-11-07 07:06:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2181 transitions. [2018-11-07 07:06:42,400 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2181 transitions. Word has length 212 [2018-11-07 07:06:42,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:42,400 INFO L480 AbstractCegarLoop]: Abstraction has 1715 states and 2181 transitions. [2018-11-07 07:06:42,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 07:06:42,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2181 transitions. [2018-11-07 07:06:42,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-07 07:06:42,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:42,409 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 07:06:42,410 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:42,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:42,410 INFO L82 PathProgramCache]: Analyzing trace with hash -234510368, now seen corresponding path program 1 times [2018-11-07 07:06:42,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:42,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:42,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:42,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:42,412 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:42,765 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 52 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 07:06:42,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:42,766 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:06:42,766 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2018-11-07 07:06:42,767 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [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], [569], [577], [585], [593], [601], [609], [613], [615], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:06:42,773 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:06:42,774 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:06:43,234 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:06:43,234 INFO L272 AbstractInterpreter]: Visited 129 different actions 518 times. Merged at 9 different actions 38 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 07:06:43,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:43,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:06:43,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:43,242 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:06:43,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:43,255 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:06:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:43,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:06:43,791 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 116 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 07:06:43,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:06:44,252 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 104 proven. 44 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-07 07:06:44,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:06:44,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 07:06:44,286 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:06:44,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 07:06:44,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 07:06:44,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 07:06:44,288 INFO L87 Difference]: Start difference. First operand 1715 states and 2181 transitions. Second operand 11 states. [2018-11-07 07:06:47,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:47,452 INFO L93 Difference]: Finished difference Result 3589 states and 4709 transitions. [2018-11-07 07:06:47,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 07:06:47,452 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 221 [2018-11-07 07:06:47,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:47,462 INFO L225 Difference]: With dead ends: 3589 [2018-11-07 07:06:47,462 INFO L226 Difference]: Without dead ends: 2293 [2018-11-07 07:06:47,467 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 443 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-11-07 07:06:47,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2018-11-07 07:06:47,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 2285. [2018-11-07 07:06:47,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2285 states. [2018-11-07 07:06:47,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 2863 transitions. [2018-11-07 07:06:47,528 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 2863 transitions. Word has length 221 [2018-11-07 07:06:47,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:47,528 INFO L480 AbstractCegarLoop]: Abstraction has 2285 states and 2863 transitions. [2018-11-07 07:06:47,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 07:06:47,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 2863 transitions. [2018-11-07 07:06:47,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-07 07:06:47,538 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:47,538 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 07:06:47,538 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:47,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:47,539 INFO L82 PathProgramCache]: Analyzing trace with hash 47880722, now seen corresponding path program 2 times [2018-11-07 07:06:47,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:47,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:47,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:47,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:47,540 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 54 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 07:06:47,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:47,801 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:06:47,802 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 07:06:47,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 07:06:47,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:47,802 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:06:47,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 07:06:47,811 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 07:06:47,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 07:06:47,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 07:06:47,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:06:47,995 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-07 07:06:47,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:06:48,404 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-07 07:06:48,425 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:06:48,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-07 07:06:48,425 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:06:48,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:06:48,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:06:48,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:06:48,427 INFO L87 Difference]: Start difference. First operand 2285 states and 2863 transitions. Second operand 3 states. [2018-11-07 07:06:49,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:49,253 INFO L93 Difference]: Finished difference Result 5115 states and 6588 transitions. [2018-11-07 07:06:49,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:06:49,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2018-11-07 07:06:49,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:49,254 INFO L225 Difference]: With dead ends: 5115 [2018-11-07 07:06:49,254 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 07:06:49,267 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 441 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:06:49,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 07:06:49,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 07:06:49,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 07:06:49,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 07:06:49,269 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 221 [2018-11-07 07:06:49,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:49,269 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 07:06:49,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:06:49,269 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 07:06:49,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 07:06:49,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 07:06:49,518 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 20 [2018-11-07 07:06:50,973 WARN L179 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 143 DAG size of output: 89 [2018-11-07 07:06:51,089 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 39 [2018-11-07 07:06:51,254 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2018-11-07 07:06:51,257 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 07:06:51,258 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a20~0)| ~a20~0) (= |old(~a16~0)| ~a16~0)) [2018-11-07 07:06:51,258 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 07:06:51,258 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-07 07:06:51,258 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-07 07:06:51,258 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,258 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,259 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,259 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,259 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,259 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,259 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-07 07:06:51,259 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-07 07:06:51,259 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-07 07:06:51,259 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-07 07:06:51,260 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-07 07:06:51,260 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-07 07:06:51,260 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-07 07:06:51,260 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-07 07:06:51,260 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-07 07:06:51,260 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-07 07:06:51,260 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,260 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,261 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,261 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,261 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,261 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,261 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-07 07:06:51,261 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-07 07:06:51,261 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-07 07:06:51,261 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-07 07:06:51,261 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-07 07:06:51,261 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-07 07:06:51,261 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-07 07:06:51,262 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-07 07:06:51,262 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-07 07:06:51,262 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-07 07:06:51,262 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-07 07:06:51,262 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-07 07:06:51,262 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-07 07:06:51,262 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-07 07:06:51,262 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-07 07:06:51,263 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,263 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,263 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,263 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,263 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,263 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-07 07:06:51,263 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-07 07:06:51,263 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-07 07:06:51,264 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-07 07:06:51,264 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-07 07:06:51,264 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-07 07:06:51,264 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-07 07:06:51,264 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-07 07:06:51,264 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-07 07:06:51,264 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,265 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,265 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,265 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,265 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,265 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-07 07:06:51,265 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-07 07:06:51,265 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-07 07:06:51,265 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-07 07:06:51,266 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-07 07:06:51,266 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-07 07:06:51,266 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-07 07:06:51,266 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-07 07:06:51,266 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-07 07:06:51,266 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-07 07:06:51,266 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-07 07:06:51,266 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-07 07:06:51,266 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-07 07:06:51,267 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,267 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,267 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,267 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,267 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,267 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-07 07:06:51,267 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-07 07:06:51,267 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-07 07:06:51,268 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-07 07:06:51,268 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-07 07:06:51,268 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-07 07:06:51,268 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-07 07:06:51,268 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-07 07:06:51,268 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-07 07:06:51,268 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,268 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,268 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,268 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,269 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,269 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,269 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,269 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-07 07:06:51,269 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-07 07:06:51,269 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-07 07:06:51,269 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-07 07:06:51,269 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-07 07:06:51,269 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-07 07:06:51,270 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-07 07:06:51,270 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-07 07:06:51,270 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-07 07:06:51,270 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-07 07:06:51,270 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-07 07:06:51,270 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-07 07:06:51,270 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-07 07:06:51,271 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-07 07:06:51,271 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,271 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,271 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,271 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,271 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,271 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-07 07:06:51,271 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-07 07:06:51,271 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-07 07:06:51,272 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-07 07:06:51,272 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-07 07:06:51,272 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-07 07:06:51,272 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-07 07:06:51,272 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-07 07:06:51,272 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,272 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,272 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,272 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,273 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,273 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-07 07:06:51,273 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-07 07:06:51,273 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-07 07:06:51,273 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-07 07:06:51,273 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-07 07:06:51,273 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-07 07:06:51,273 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-07 07:06:51,273 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-07 07:06:51,274 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-07 07:06:51,274 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 521) no Hoare annotation was computed. [2018-11-07 07:06:51,274 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-07 07:06:51,274 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse23 (= |old(~a20~0)| ~a20~0)) (.cse24 (= |old(~a16~0)| ~a16~0)) (.cse19 (= 13 |old(~a8~0)|))) (let ((.cse14 (not (= 5 |old(~a16~0)|))) (.cse12 (= ~a17~0 1)) (.cse3 (not (= 4 |old(~a16~0)|))) (.cse5 (= 13 ~a8~0)) (.cse6 (= 1 ~a21~0)) (.cse7 (= 1 ~a17~0)) (.cse1 (= 1 |old(~a7~0)|)) (.cse8 (not .cse19)) (.cse9 (not (= 1 |old(~a17~0)|))) (.cse20 (and .cse23 .cse24)) (.cse11 (= |calculate_output_#in~input| 0)) (.cse16 (= ~a8~0 15)) (.cse17 (= ~a21~0 1)) (.cse15 (= ~a7~0 0)) (.cse21 (= 6 |old(~a16~0)|)) (.cse10 (not (= 0 |old(~a7~0)|))) (.cse0 (not (= 1 |old(~a21~0)|))) (.cse2 (not (= 1 |old(~a20~0)|))) (.cse13 (not (= 15 |old(~a8~0)|))) (.cse18 (not (= ~a8~0 13))) (.cse4 (not (= 8 ~a12~0))) (.cse22 (< 0 |old(~a20~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (not (= ~a7~0 1)) .cse5 .cse6 .cse7) .cse8 .cse9) (or .cse10 .cse0 .cse4 .cse11 .cse9 .cse12 .cse2 .cse13 .cse14) (or (or .cse10 .cse0 .cse13 (not (= 0 |old(~a20~0)|)) .cse14 .cse4) .cse11 (and .cse15 .cse16 .cse12 .cse17) .cse9) (or .cse2 .cse18 .cse19 .cse4) (or .cse0 .cse2 .cse3 (and (= 1 ~a7~0) .cse5 .cse6 .cse7) .cse4 (not .cse1) .cse8 .cse9) (or .cse2 .cse20 .cse4) (or .cse21 .cse10 .cse0 .cse2 .cse13 (= 0 |old(~a16~0)|) .cse4 .cse11 (and .cse16 .cse17 .cse15)) (or (< 4 |old(~a16~0)|) .cse20 .cse4 .cse22) (or .cse11 (and .cse16 .cse17 (= ~a17~0 0) .cse15) (or (not .cse21) .cse10 .cse0 .cse2 .cse13 (not (= 0 |old(~a17~0)|)) .cse4)) (or (and .cse23 .cse24 .cse18) .cse19 .cse4 .cse22)))) [2018-11-07 07:06:51,275 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-07 07:06:51,275 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,275 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,275 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,275 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,275 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,275 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-07 07:06:51,275 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,275 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-07 07:06:51,276 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-07 07:06:51,276 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-07 07:06:51,276 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-07 07:06:51,276 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-07 07:06:51,276 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-07 07:06:51,276 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-07 07:06:51,276 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-07 07:06:51,276 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-07 07:06:51,276 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-07 07:06:51,277 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-07 07:06:51,277 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-07 07:06:51,277 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,277 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,277 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,277 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,277 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,277 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,278 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-07 07:06:51,278 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-07 07:06:51,278 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-07 07:06:51,278 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-07 07:06:51,278 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-07 07:06:51,278 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-07 07:06:51,278 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-07 07:06:51,278 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-07 07:06:51,279 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-07 07:06:51,279 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-07 07:06:51,279 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-07 07:06:51,279 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-07 07:06:51,279 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-07 07:06:51,279 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-07 07:06:51,279 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-07 07:06:51,279 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,279 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,280 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,280 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,280 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,280 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:51,280 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-07 07:06:51,280 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-07 07:06:51,280 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-07 07:06:51,280 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-07 07:06:51,280 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-07 07:06:51,280 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-07 07:06:51,281 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-07 07:06:51,281 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-07 07:06:51,281 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-07 07:06:51,281 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-07 07:06:51,281 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 07:06:51,281 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a7~0 0) (= ~a8~0 15) (= ~a17~0 1) (= ~a12~0 8) (= ~a21~0 1) (= ~a20~0 1) (= ~a16~0 5)) [2018-11-07 07:06:51,282 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 07:06:51,282 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 07:06:51,282 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 (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)) (and (= ~a8~0 15) (= ~a17~0 1) (= ~a21~0 1) (= ~a7~0 0) (= ~a20~0 1) (= ~a16~0 5)) (not (= 8 ~a12~0)) (not (= 1 |old(~a17~0)|))) [2018-11-07 07:06:51,282 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-07 07:06:51,282 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse0 (<= ~a20~0 0))) (or (and .cse0 (not (= ~a8~0 13))) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (and .cse0 (<= ~a16~0 4)) (= |old(~a20~0)| ~a20~0) (not (= 1 |old(~a17~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)))) [2018-11-07 07:06:51,282 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-07 07:06:51,283 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-07 07:06:51,283 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-07 07:06:51,283 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse0 (<= ~a20~0 0))) (or (and .cse0 (not (= ~a8~0 13))) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (and .cse0 (<= ~a16~0 4)) (= |old(~a20~0)| ~a20~0) (not (= 1 |old(~a17~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)))) [2018-11-07 07:06:51,283 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-07 07:06:51,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:06:51 BoogieIcfgContainer [2018-11-07 07:06:51,296 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 07:06:51,297 INFO L168 Benchmark]: Toolchain (without parser) took 46708.08 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 279.1 MB. Max. memory is 7.1 GB. [2018-11-07 07:06:51,298 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 07:06:51,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 730.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 07:06:51,299 INFO L168 Benchmark]: Boogie Procedure Inliner took 132.07 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -823.6 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2018-11-07 07:06:51,300 INFO L168 Benchmark]: Boogie Preprocessor took 124.36 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2018-11-07 07:06:51,301 INFO L168 Benchmark]: RCFGBuilder took 3434.47 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: 106.0 MB). Peak memory consumption was 106.0 MB. Max. memory is 7.1 GB. [2018-11-07 07:06:51,302 INFO L168 Benchmark]: TraceAbstraction took 42282.31 ms. Allocated memory was 2.3 GB in the beginning and 3.2 GB in the end (delta: 906.0 MB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -688.5 MB). Peak memory consumption was 217.5 MB. Max. memory is 7.1 GB. [2018-11-07 07:06:51,307 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 730.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 132.07 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -823.6 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.36 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3434.47 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: 106.0 MB). Peak memory consumption was 106.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 42282.31 ms. Allocated memory was 2.3 GB in the beginning and 3.2 GB in the end (delta: 906.0 MB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -688.5 MB). Peak memory consumption was 217.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 521]: 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: (((((((((a20 <= 0 && !(a8 == 13)) || !(0 == \old(a7))) || !(1 == \old(a21))) || !(8 == a12)) || (a20 <= 0 && a16 <= 4)) || \old(a20) == a20) || !(1 == \old(a17))) || !(1 == \old(a20))) || !(15 == \old(a8))) || !(5 == \old(a16)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 42.1s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 29.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1381 SDtfs, 5635 SDslu, 1266 SDs, 0 SdLazy, 6828 SolverSat, 1173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.7s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 1524 GetRequests, 1434 SyntacticMatches, 13 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2285occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.7s AbstIntTime, 4 AbstIntIterations, 3 AbstIntStrong, 0.997431229132853 AbsIntWeakeningRatio, 0.20967741935483872 AbsIntAvgWeakeningVarsNumRemoved, 29.24910394265233 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 37 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 86 PreInvPairs, 132 NumberOfFragments, 499 HoareAnnotationTreeSize, 86 FomulaSimplifications, 1865 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1346 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 2107 NumberOfCodeBlocks, 2040 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2535 ConstructedInterpolants, 0 QuantifiedInterpolants, 1530332 SizeOfPredicates, 3 NumberOfNonLiveVariables, 990 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 1209/1393 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...