java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:11:31,839 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:11:31,841 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:11:31,854 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:11:31,854 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:11:31,855 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:11:31,856 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:11:31,858 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:11:31,860 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:11:31,860 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:11:31,861 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:11:31,862 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:11:31,863 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:11:31,864 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:11:31,865 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:11:31,866 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:11:31,866 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:11:31,868 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:11:31,870 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:11:31,872 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:11:31,873 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:11:31,874 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:11:31,877 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:11:31,877 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:11:31,877 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:11:31,878 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:11:31,879 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:11:31,880 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:11:31,881 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:11:31,882 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:11:31,882 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:11:31,883 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:11:31,883 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:11:31,884 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:11:31,885 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:11:31,885 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:11:31,886 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-27 06:11:31,906 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:11:31,906 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:11:31,907 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 06:11:31,907 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 06:11:31,907 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 06:11:31,908 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 06:11:31,908 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-27 06:11:31,908 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 06:11:31,908 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 06:11:31,909 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 06:11:31,909 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 06:11:31,909 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 06:11:31,909 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 06:11:31,909 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 06:11:31,910 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:11:31,910 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:11:31,910 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:11:31,911 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 06:11:31,911 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 06:11:31,912 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 06:11:31,912 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:11:31,912 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 06:11:31,912 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:11:31,913 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:11:31,913 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 06:11:31,913 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 06:11:31,913 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 06:11:31,913 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:11:31,914 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 06:11:31,914 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 06:11:31,914 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 06:11:31,914 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 06:11:31,914 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 06:11:31,914 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 06:11:31,915 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 06:11:31,915 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 06:11:31,958 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:11:31,973 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:11:31,978 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:11:31,980 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:11:31,980 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:11:31,981 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2018-10-27 06:11:32,050 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e258588ea/d65ffe2e7edc48339a5d1bd961a81883/FLAG94cf2d8ac [2018-10-27 06:11:32,618 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:11:32,620 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2018-10-27 06:11:32,636 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e258588ea/d65ffe2e7edc48339a5d1bd961a81883/FLAG94cf2d8ac [2018-10-27 06:11:32,652 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e258588ea/d65ffe2e7edc48339a5d1bd961a81883 [2018-10-27 06:11:32,663 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:11:32,665 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 06:11:32,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:32,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:11:32,670 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:11:32,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:32" (1/1) ... [2018-10-27 06:11:32,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@286f3120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:32, skipping insertion in model container [2018-10-27 06:11:32,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:32" (1/1) ... [2018-10-27 06:11:32,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:11:32,745 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:11:33,251 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:33,256 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:11:33,386 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:33,404 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:11:33,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:33 WrapperNode [2018-10-27 06:11:33,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:33,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:33,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:11:33,406 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:11:33,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:33" (1/1) ... [2018-10-27 06:11:33,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:33" (1/1) ... [2018-10-27 06:11:33,602 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:33,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:11:33,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:11:33,603 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:11:33,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:33" (1/1) ... [2018-10-27 06:11:33,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:33" (1/1) ... [2018-10-27 06:11:33,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:33" (1/1) ... [2018-10-27 06:11:33,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:33" (1/1) ... [2018-10-27 06:11:33,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:33" (1/1) ... [2018-10-27 06:11:33,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:33" (1/1) ... [2018-10-27 06:11:33,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:33" (1/1) ... [2018-10-27 06:11:33,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:11:33,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:11:33,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:11:33,669 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:11:33,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 06:11:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 06:11:33,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 06:11:33,760 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 06:11:33,760 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 06:11:33,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:11:33,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:11:33,760 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 06:11:33,761 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 06:11:37,193 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:11:37,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:37 BoogieIcfgContainer [2018-10-27 06:11:37,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:11:37,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 06:11:37,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 06:11:37,199 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 06:11:37,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 06:11:32" (1/3) ... [2018-10-27 06:11:37,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6a4db7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 06:11:37, skipping insertion in model container [2018-10-27 06:11:37,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:33" (2/3) ... [2018-10-27 06:11:37,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6a4db7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 06:11:37, skipping insertion in model container [2018-10-27 06:11:37,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:37" (3/3) ... [2018-10-27 06:11:37,203 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label06_true-unreach-call_false-termination.c [2018-10-27 06:11:37,213 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 06:11:37,223 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 06:11:37,241 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 06:11:37,281 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 06:11:37,282 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 06:11:37,282 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 06:11:37,282 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:11:37,282 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:11:37,283 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 06:11:37,283 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:11:37,283 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 06:11:37,311 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-27 06:11:37,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-27 06:11:37,328 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:37,329 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:37,332 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:37,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:37,339 INFO L82 PathProgramCache]: Analyzing trace with hash -247147345, now seen corresponding path program 1 times [2018-10-27 06:11:37,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:37,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:37,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:37,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:37,389 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:38,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:38,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:38,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:11:38,059 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:11:38,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 06:11:38,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:11:38,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:11:38,086 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-27 06:11:39,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:39,819 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-10-27 06:11:39,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:11:39,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2018-10-27 06:11:39,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:11:39,841 INFO L225 Difference]: With dead ends: 621 [2018-10-27 06:11:39,841 INFO L226 Difference]: Without dead ends: 382 [2018-10-27 06:11:39,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:11:39,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-27 06:11:39,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-10-27 06:11:39,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-27 06:11:39,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-10-27 06:11:39,939 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 147 [2018-10-27 06:11:39,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:11:39,941 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-10-27 06:11:39,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 06:11:39,941 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-10-27 06:11:39,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-27 06:11:39,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:39,956 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:39,956 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:39,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:39,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1882359938, now seen corresponding path program 1 times [2018-10-27 06:11:39,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:39,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:39,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:39,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:39,964 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:40,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:40,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:40,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:11:40,519 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:11:40,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 06:11:40,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:11:40,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:11:40,522 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-10-27 06:11:42,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:42,073 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-10-27 06:11:42,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:11:42,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2018-10-27 06:11:42,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:11:42,079 INFO L225 Difference]: With dead ends: 903 [2018-10-27 06:11:42,079 INFO L226 Difference]: Without dead ends: 381 [2018-10-27 06:11:42,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:11:42,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-27 06:11:42,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-10-27 06:11:42,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-27 06:11:42,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-10-27 06:11:42,116 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 156 [2018-10-27 06:11:42,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:11:42,117 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-10-27 06:11:42,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 06:11:42,117 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-10-27 06:11:42,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-27 06:11:42,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:42,120 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:42,121 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:42,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:42,121 INFO L82 PathProgramCache]: Analyzing trace with hash 337215758, now seen corresponding path program 1 times [2018-10-27 06:11:42,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:42,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:42,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:42,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:42,123 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:42,588 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-10-27 06:11:42,792 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:42,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:42,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:11:42,793 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:11:42,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 06:11:42,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:11:42,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:11:42,795 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-10-27 06:11:44,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:44,492 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-10-27 06:11:44,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:11:44,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2018-10-27 06:11:44,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:11:44,501 INFO L225 Difference]: With dead ends: 901 [2018-10-27 06:11:44,501 INFO L226 Difference]: Without dead ends: 380 [2018-10-27 06:11:44,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:11:44,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-27 06:11:44,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-10-27 06:11:44,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-27 06:11:44,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-10-27 06:11:44,524 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 162 [2018-10-27 06:11:44,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:11:44,524 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-10-27 06:11:44,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 06:11:44,524 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-10-27 06:11:44,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-27 06:11:44,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:44,527 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:44,528 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:44,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:44,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1461325531, now seen corresponding path program 1 times [2018-10-27 06:11:44,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:44,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:44,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:44,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:44,530 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:44,695 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:44,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:44,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 06:11:44,696 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:11:44,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 06:11:44,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:11:44,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:11:44,697 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-10-27 06:11:47,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:47,776 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-10-27 06:11:47,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:11:47,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2018-10-27 06:11:47,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:11:47,783 INFO L225 Difference]: With dead ends: 1193 [2018-10-27 06:11:47,783 INFO L226 Difference]: Without dead ends: 819 [2018-10-27 06:11:47,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:11:47,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-10-27 06:11:47,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-10-27 06:11:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-10-27 06:11:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-10-27 06:11:47,833 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 170 [2018-10-27 06:11:47,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:11:47,834 INFO L481 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-10-27 06:11:47,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 06:11:47,834 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-10-27 06:11:47,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-27 06:11:47,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:47,839 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:47,839 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:47,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:47,839 INFO L82 PathProgramCache]: Analyzing trace with hash -2126959959, now seen corresponding path program 1 times [2018-10-27 06:11:47,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:47,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:47,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:47,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:47,841 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:48,280 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-27 06:11:48,479 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:48,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:48,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:11:48,480 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:11:48,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 06:11:48,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:11:48,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:11:48,481 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-10-27 06:11:49,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:49,608 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-10-27 06:11:49,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:11:49,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2018-10-27 06:11:49,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:11:49,627 INFO L225 Difference]: With dead ends: 1753 [2018-10-27 06:11:49,627 INFO L226 Difference]: Without dead ends: 804 [2018-10-27 06:11:49,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:11:49,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-10-27 06:11:49,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-10-27 06:11:49,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-10-27 06:11:49,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-10-27 06:11:49,659 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 172 [2018-10-27 06:11:49,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:11:49,659 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-10-27 06:11:49,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 06:11:49,660 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-10-27 06:11:49,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-27 06:11:49,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:49,664 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:49,664 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:49,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:49,665 INFO L82 PathProgramCache]: Analyzing trace with hash 443683885, now seen corresponding path program 1 times [2018-10-27 06:11:49,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:49,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:49,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:49,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:49,667 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:50,026 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:50,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:50,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:11:50,027 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:11:50,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 06:11:50,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:11:50,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:11:50,029 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-10-27 06:11:51,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:51,710 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-10-27 06:11:51,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:11:51,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 174 [2018-10-27 06:11:51,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:11:51,715 INFO L225 Difference]: With dead ends: 1747 [2018-10-27 06:11:51,715 INFO L226 Difference]: Without dead ends: 801 [2018-10-27 06:11:51,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:11:51,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-27 06:11:51,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-10-27 06:11:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-10-27 06:11:51,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-10-27 06:11:51,743 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 174 [2018-10-27 06:11:51,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:11:51,743 INFO L481 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-10-27 06:11:51,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 06:11:51,744 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-10-27 06:11:51,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-27 06:11:51,749 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:51,749 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:51,750 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:51,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:51,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1771723, now seen corresponding path program 1 times [2018-10-27 06:11:51,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:51,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:51,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:51,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:51,752 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:51,989 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 06:11:52,396 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:52,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:52,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 06:11:52,397 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:11:52,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 06:11:52,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:11:52,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:11:52,398 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-10-27 06:11:53,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:53,747 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-10-27 06:11:53,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:11:53,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2018-10-27 06:11:53,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:11:53,759 INFO L225 Difference]: With dead ends: 2381 [2018-10-27 06:11:53,760 INFO L226 Difference]: Without dead ends: 1586 [2018-10-27 06:11:53,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:11:53,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-10-27 06:11:53,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-10-27 06:11:53,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-10-27 06:11:53,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-10-27 06:11:53,822 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 178 [2018-10-27 06:11:53,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:11:53,822 INFO L481 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-10-27 06:11:53,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 06:11:53,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-10-27 06:11:53,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-27 06:11:53,831 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:53,831 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:53,832 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:53,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:53,833 INFO L82 PathProgramCache]: Analyzing trace with hash 161380030, now seen corresponding path program 1 times [2018-10-27 06:11:53,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:53,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:53,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:53,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:53,834 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:54,148 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:54,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:54,149 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:11:54,150 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-10-27 06:11:54,152 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 06:11:54,219 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:11:54,219 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:11:55,310 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 06:11:55,312 INFO L272 AbstractInterpreter]: Visited 152 different actions 450 times. Merged at 7 different actions 18 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 06:11:55,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:55,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 06:11:55,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:55,358 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:55,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:55,374 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 06:11:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:55,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:55,588 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 06:11:55,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 06:11:55,991 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 06:11:56,022 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:11:56,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 8 [2018-10-27 06:11:56,023 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:11:56,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 06:11:56,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:11:56,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:11:56,024 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 3 states. [2018-10-27 06:11:57,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:57,853 INFO L93 Difference]: Finished difference Result 4565 states and 6657 transitions. [2018-10-27 06:11:57,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:11:57,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2018-10-27 06:11:57,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:11:57,879 INFO L225 Difference]: With dead ends: 4565 [2018-10-27 06:11:57,879 INFO L226 Difference]: Without dead ends: 3013 [2018-10-27 06:11:57,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 370 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:11:57,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2018-10-27 06:11:57,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 3008. [2018-10-27 06:11:57,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2018-10-27 06:11:57,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 3992 transitions. [2018-10-27 06:11:57,982 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 3992 transitions. Word has length 184 [2018-10-27 06:11:57,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:11:57,983 INFO L481 AbstractCegarLoop]: Abstraction has 3008 states and 3992 transitions. [2018-10-27 06:11:57,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 06:11:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 3992 transitions. [2018-10-27 06:11:57,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-27 06:11:57,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:57,996 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:57,996 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:57,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:57,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2112487449, now seen corresponding path program 1 times [2018-10-27 06:11:57,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:57,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:57,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:57,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:57,998 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:58,558 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:58,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:58,558 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:11:58,559 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 214 with the following transitions: [2018-10-27 06:11:58,559 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 06:11:58,578 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:11:58,579 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:11:59,031 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 06:11:59,031 INFO L272 AbstractInterpreter]: Visited 151 different actions 296 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-27 06:11:59,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:59,069 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 06:11:59,580 INFO L227 lantSequenceWeakener]: Weakened 210 states. On average, predicates are now at 82.93% of their original sizes. [2018-10-27 06:11:59,580 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 06:12:00,324 INFO L415 sIntCurrentIteration]: We unified 212 AI predicates to 212 [2018-10-27 06:12:00,324 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 06:12:00,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:12:00,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-27 06:12:00,325 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:12:00,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 06:12:00,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:12:00,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:12:00,326 INFO L87 Difference]: Start difference. First operand 3008 states and 3992 transitions. Second operand 10 states. [2018-10-27 06:12:11,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:11,178 INFO L93 Difference]: Finished difference Result 6825 states and 9103 transitions. [2018-10-27 06:12:11,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 06:12:11,179 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 213 [2018-10-27 06:12:11,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:12:11,198 INFO L225 Difference]: With dead ends: 6825 [2018-10-27 06:12:11,199 INFO L226 Difference]: Without dead ends: 3823 [2018-10-27 06:12:11,210 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 222 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-10-27 06:12:11,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3823 states. [2018-10-27 06:12:11,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3823 to 3752. [2018-10-27 06:12:11,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3752 states. [2018-10-27 06:12:11,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3752 states to 3752 states and 4845 transitions. [2018-10-27 06:12:11,304 INFO L78 Accepts]: Start accepts. Automaton has 3752 states and 4845 transitions. Word has length 213 [2018-10-27 06:12:11,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:12:11,304 INFO L481 AbstractCegarLoop]: Abstraction has 3752 states and 4845 transitions. [2018-10-27 06:12:11,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 06:12:11,305 INFO L276 IsEmpty]: Start isEmpty. Operand 3752 states and 4845 transitions. [2018-10-27 06:12:11,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-27 06:12:11,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:12:11,318 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-27 06:12:11,319 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:12:11,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:11,319 INFO L82 PathProgramCache]: Analyzing trace with hash 666818281, now seen corresponding path program 1 times [2018-10-27 06:12:11,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:12:11,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:11,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:11,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:11,320 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:12:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:11,562 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 4 [2018-10-27 06:12:11,792 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 06:12:11,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:11,793 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:12:11,793 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 232 with the following transitions: [2018-10-27 06:12:11,794 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [312], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 06:12:11,799 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:12:11,799 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:12:12,085 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 06:12:12,085 INFO L272 AbstractInterpreter]: Visited 151 different actions 449 times. Merged at 7 different actions 18 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 06:12:12,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:12,090 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 06:12:12,368 INFO L227 lantSequenceWeakener]: Weakened 228 states. On average, predicates are now at 84.95% of their original sizes. [2018-10-27 06:12:12,368 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 06:12:12,631 INFO L415 sIntCurrentIteration]: We unified 230 AI predicates to 230 [2018-10-27 06:12:12,632 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 06:12:12,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:12:12,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2018-10-27 06:12:12,632 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:12:12,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 06:12:12,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 06:12:12,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:12:12,634 INFO L87 Difference]: Start difference. First operand 3752 states and 4845 transitions. Second operand 9 states. [2018-10-27 06:12:19,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:19,105 INFO L93 Difference]: Finished difference Result 8964 states and 11861 transitions. [2018-10-27 06:12:19,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 06:12:19,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 231 [2018-10-27 06:12:19,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:12:19,129 INFO L225 Difference]: With dead ends: 8964 [2018-10-27 06:12:19,129 INFO L226 Difference]: Without dead ends: 5218 [2018-10-27 06:12:19,143 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 238 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-10-27 06:12:19,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5218 states. [2018-10-27 06:12:19,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5218 to 5166. [2018-10-27 06:12:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2018-10-27 06:12:19,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 6535 transitions. [2018-10-27 06:12:19,272 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 6535 transitions. Word has length 231 [2018-10-27 06:12:19,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:12:19,272 INFO L481 AbstractCegarLoop]: Abstraction has 5166 states and 6535 transitions. [2018-10-27 06:12:19,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 06:12:19,273 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 6535 transitions. [2018-10-27 06:12:19,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-27 06:12:19,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:12:19,288 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:19,288 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:12:19,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:19,289 INFO L82 PathProgramCache]: Analyzing trace with hash 915295681, now seen corresponding path program 1 times [2018-10-27 06:12:19,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:12:19,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:19,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:19,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:19,290 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:12:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:19,894 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 101 proven. 54 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 06:12:19,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:19,895 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:12:19,895 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 254 with the following transitions: [2018-10-27 06:12:19,895 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 06:12:19,900 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:12:19,900 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:12:20,247 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 06:12:20,247 INFO L272 AbstractInterpreter]: Visited 154 different actions 608 times. Merged at 8 different actions 29 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 06:12:20,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:20,252 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 06:12:20,560 INFO L227 lantSequenceWeakener]: Weakened 250 states. On average, predicates are now at 86.97% of their original sizes. [2018-10-27 06:12:20,560 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 06:12:21,043 INFO L415 sIntCurrentIteration]: We unified 252 AI predicates to 252 [2018-10-27 06:12:21,044 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 06:12:21,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:12:21,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 20 [2018-10-27 06:12:21,044 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:12:21,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 06:12:21,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 06:12:21,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-10-27 06:12:21,045 INFO L87 Difference]: Start difference. First operand 5166 states and 6535 transitions. Second operand 12 states. [2018-10-27 06:12:30,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:30,314 INFO L93 Difference]: Finished difference Result 11331 states and 14177 transitions. [2018-10-27 06:12:30,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-27 06:12:30,315 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 253 [2018-10-27 06:12:30,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:12:30,339 INFO L225 Difference]: With dead ends: 11331 [2018-10-27 06:12:30,339 INFO L226 Difference]: Without dead ends: 5870 [2018-10-27 06:12:30,359 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 271 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=221, Invalid=709, Unknown=0, NotChecked=0, Total=930 [2018-10-27 06:12:30,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5870 states. [2018-10-27 06:12:30,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5870 to 5747. [2018-10-27 06:12:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5747 states. [2018-10-27 06:12:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5747 states to 5747 states and 6798 transitions. [2018-10-27 06:12:30,496 INFO L78 Accepts]: Start accepts. Automaton has 5747 states and 6798 transitions. Word has length 253 [2018-10-27 06:12:30,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:12:30,497 INFO L481 AbstractCegarLoop]: Abstraction has 5747 states and 6798 transitions. [2018-10-27 06:12:30,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 06:12:30,497 INFO L276 IsEmpty]: Start isEmpty. Operand 5747 states and 6798 transitions. [2018-10-27 06:12:30,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-27 06:12:30,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:12:30,512 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:30,512 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:12:30,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:30,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1111459177, now seen corresponding path program 1 times [2018-10-27 06:12:30,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:12:30,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:30,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:30,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:30,514 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:12:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:30,785 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-10-27 06:12:31,141 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-27 06:12:31,364 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-27 06:12:31,921 WARN L179 SmtUtils]: Spent 469.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-10-27 06:12:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 120 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:32,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:32,538 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:12:32,538 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 256 with the following transitions: [2018-10-27 06:12:32,538 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 06:12:32,541 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:12:32,541 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:12:32,823 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 06:12:32,824 INFO L272 AbstractInterpreter]: Visited 155 different actions 457 times. Merged at 8 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 06:12:32,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:32,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 06:12:32,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:32,830 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:12:32,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:32,840 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 06:12:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:32,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 06:12:33,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 06:12:33,243 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 06:12:33,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 06:12:33,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 16 [2018-10-27 06:12:33,265 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 06:12:33,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 06:12:33,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 06:12:33,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-10-27 06:12:33,267 INFO L87 Difference]: Start difference. First operand 5747 states and 6798 transitions. Second operand 15 states. [2018-10-27 06:12:36,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:36,549 INFO L93 Difference]: Finished difference Result 10819 states and 13061 transitions. [2018-10-27 06:12:36,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 06:12:36,561 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 255 [2018-10-27 06:12:36,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:12:36,582 INFO L225 Difference]: With dead ends: 10819 [2018-10-27 06:12:36,582 INFO L226 Difference]: Without dead ends: 3681 [2018-10-27 06:12:36,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 517 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-10-27 06:12:36,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3681 states. [2018-10-27 06:12:36,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3681 to 3648. [2018-10-27 06:12:36,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3648 states. [2018-10-27 06:12:36,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3648 states and 4211 transitions. [2018-10-27 06:12:36,685 INFO L78 Accepts]: Start accepts. Automaton has 3648 states and 4211 transitions. Word has length 255 [2018-10-27 06:12:36,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:12:36,685 INFO L481 AbstractCegarLoop]: Abstraction has 3648 states and 4211 transitions. [2018-10-27 06:12:36,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 06:12:36,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3648 states and 4211 transitions. [2018-10-27 06:12:36,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-10-27 06:12:36,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:12:36,700 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:36,700 INFO L424 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:12:36,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:36,700 INFO L82 PathProgramCache]: Analyzing trace with hash 641913708, now seen corresponding path program 1 times [2018-10-27 06:12:36,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:12:36,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:36,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:36,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:36,702 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:12:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:37,383 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 253 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:37,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:37,383 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:12:37,383 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 314 with the following transitions: [2018-10-27 06:12:37,383 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 06:12:37,386 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:12:37,386 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:12:37,740 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 06:12:37,740 INFO L272 AbstractInterpreter]: Visited 155 different actions 612 times. Merged at 8 different actions 32 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-27 06:12:37,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:37,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 06:12:37,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:37,747 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:12:37,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:37,758 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 06:12:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:37,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:38,079 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 251 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-27 06:12:38,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 06:12:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 251 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-27 06:12:38,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 06:12:38,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 15 [2018-10-27 06:12:38,901 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 06:12:38,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 06:12:38,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 06:12:38,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-10-27 06:12:38,902 INFO L87 Difference]: Start difference. First operand 3648 states and 4211 transitions. Second operand 13 states. [2018-10-27 06:12:43,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:43,680 INFO L93 Difference]: Finished difference Result 8909 states and 10379 transitions. [2018-10-27 06:12:43,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-27 06:12:43,681 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 313 [2018-10-27 06:12:43,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:12:43,695 INFO L225 Difference]: With dead ends: 8909 [2018-10-27 06:12:43,695 INFO L226 Difference]: Without dead ends: 4991 [2018-10-27 06:12:43,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 644 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=326, Invalid=1156, Unknown=0, NotChecked=0, Total=1482 [2018-10-27 06:12:43,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4991 states. [2018-10-27 06:12:43,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4991 to 4725. [2018-10-27 06:12:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2018-10-27 06:12:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 5225 transitions. [2018-10-27 06:12:43,804 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 5225 transitions. Word has length 313 [2018-10-27 06:12:43,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:12:43,804 INFO L481 AbstractCegarLoop]: Abstraction has 4725 states and 5225 transitions. [2018-10-27 06:12:43,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 06:12:43,805 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 5225 transitions. [2018-10-27 06:12:43,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-27 06:12:43,821 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:12:43,821 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-27 06:12:43,822 INFO L424 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:12:43,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:43,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1064430452, now seen corresponding path program 1 times [2018-10-27 06:12:43,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:12:43,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:43,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:43,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:43,823 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:12:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:44,238 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 06:12:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 297 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:45,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:45,020 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:12:45,020 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 349 with the following transitions: [2018-10-27 06:12:45,021 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [198], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [309], [313], [317], [321], [325], [329], [333], [344], [348], [351], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 06:12:45,023 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:12:45,023 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:12:45,328 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 06:12:45,328 INFO L272 AbstractInterpreter]: Visited 155 different actions 610 times. Merged at 8 different actions 30 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 06:12:45,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:45,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 06:12:45,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:45,334 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:12:45,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:45,343 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 06:12:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:45,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:46,232 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 312 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-27 06:12:46,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 06:12:46,740 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 312 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-27 06:12:46,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 06:12:46,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 8] total 23 [2018-10-27 06:12:46,761 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 06:12:46,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-27 06:12:46,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-27 06:12:46,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-10-27 06:12:46,763 INFO L87 Difference]: Start difference. First operand 4725 states and 5225 transitions. Second operand 19 states. [2018-10-27 06:12:47,356 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2018-10-27 06:12:49,126 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2018-10-27 06:12:49,510 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2018-10-27 06:12:51,349 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2018-10-27 06:12:52,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:52,539 INFO L93 Difference]: Finished difference Result 9312 states and 10393 transitions. [2018-10-27 06:12:52,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-27 06:12:52,539 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 348 [2018-10-27 06:12:52,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:12:52,554 INFO L225 Difference]: With dead ends: 9312 [2018-10-27 06:12:52,554 INFO L226 Difference]: Without dead ends: 5002 [2018-10-27 06:12:52,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 751 GetRequests, 696 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=697, Invalid=2495, Unknown=0, NotChecked=0, Total=3192 [2018-10-27 06:12:52,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5002 states. [2018-10-27 06:12:52,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5002 to 4731. [2018-10-27 06:12:52,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4731 states. [2018-10-27 06:12:52,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4731 states to 4731 states and 5189 transitions. [2018-10-27 06:12:52,661 INFO L78 Accepts]: Start accepts. Automaton has 4731 states and 5189 transitions. Word has length 348 [2018-10-27 06:12:52,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:12:52,662 INFO L481 AbstractCegarLoop]: Abstraction has 4731 states and 5189 transitions. [2018-10-27 06:12:52,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-27 06:12:52,662 INFO L276 IsEmpty]: Start isEmpty. Operand 4731 states and 5189 transitions. [2018-10-27 06:12:52,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-10-27 06:12:52,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:12:52,679 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:52,679 INFO L424 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:12:52,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:52,680 INFO L82 PathProgramCache]: Analyzing trace with hash -526388730, now seen corresponding path program 1 times [2018-10-27 06:12:52,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:12:52,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:52,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:52,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:52,681 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:12:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:53,232 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 266 proven. 19 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-10-27 06:12:53,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:53,232 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:12:53,233 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 357 with the following transitions: [2018-10-27 06:12:53,233 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [45], [50], [52], [53], [56], [61], [63], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 06:12:53,236 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:12:53,236 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:12:53,734 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 06:12:53,734 INFO L272 AbstractInterpreter]: Visited 161 different actions 639 times. Merged at 10 different actions 43 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 06:12:53,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:53,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 06:12:53,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:53,741 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:12:53,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:53,751 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 06:12:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:53,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:54,194 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 318 proven. 2 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-10-27 06:12:54,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 06:12:54,483 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-27 06:12:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 266 proven. 19 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-10-27 06:12:54,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 06:12:54,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2018-10-27 06:12:54,806 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 06:12:54,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 06:12:54,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 06:12:54,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:12:54,808 INFO L87 Difference]: Start difference. First operand 4731 states and 5189 transitions. Second operand 7 states. [2018-10-27 06:12:55,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:55,735 INFO L93 Difference]: Finished difference Result 7345 states and 8113 transitions. [2018-10-27 06:12:55,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:12:55,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 356 [2018-10-27 06:12:55,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:12:55,755 INFO L225 Difference]: With dead ends: 7345 [2018-10-27 06:12:55,756 INFO L226 Difference]: Without dead ends: 4120 [2018-10-27 06:12:55,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 721 GetRequests, 711 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:12:55,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4120 states. [2018-10-27 06:12:55,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4120 to 4065. [2018-10-27 06:12:55,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4065 states. [2018-10-27 06:12:55,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4065 states to 4065 states and 4431 transitions. [2018-10-27 06:12:55,842 INFO L78 Accepts]: Start accepts. Automaton has 4065 states and 4431 transitions. Word has length 356 [2018-10-27 06:12:55,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:12:55,842 INFO L481 AbstractCegarLoop]: Abstraction has 4065 states and 4431 transitions. [2018-10-27 06:12:55,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 06:12:55,842 INFO L276 IsEmpty]: Start isEmpty. Operand 4065 states and 4431 transitions. [2018-10-27 06:12:55,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-10-27 06:12:55,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:12:55,854 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:55,854 INFO L424 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:12:55,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:55,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1961643071, now seen corresponding path program 1 times [2018-10-27 06:12:55,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:12:55,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:55,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:55,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:55,856 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:12:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:56,390 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 8 [2018-10-27 06:12:57,249 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2018-10-27 06:12:57,377 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2018-10-27 06:12:58,196 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 92 proven. 330 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-27 06:12:58,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:58,196 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:12:58,197 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 371 with the following transitions: [2018-10-27 06:12:58,197 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [56], [61], [63], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [198], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [309], [313], [317], [321], [325], [329], [333], [344], [348], [351], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 06:12:58,199 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:12:58,200 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:12:58,542 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 06:12:58,543 INFO L272 AbstractInterpreter]: Visited 158 different actions 625 times. Merged at 9 different actions 37 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 06:12:58,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:58,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 06:12:58,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:58,549 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:12:58,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:58,558 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 06:12:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:58,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:59,177 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 352 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-27 06:12:59,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 06:12:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 352 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-27 06:12:59,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 06:12:59,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 5, 5] total 29 [2018-10-27 06:12:59,477 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 06:12:59,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-27 06:12:59,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-27 06:12:59,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2018-10-27 06:12:59,479 INFO L87 Difference]: Start difference. First operand 4065 states and 4431 transitions. Second operand 27 states. [2018-10-27 06:12:59,789 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 35 [2018-10-27 06:13:01,770 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2018-10-27 06:13:02,645 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2018-10-27 06:13:03,200 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2018-10-27 06:13:03,724 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2018-10-27 06:13:04,911 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2018-10-27 06:13:05,900 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 42 [2018-10-27 06:13:12,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:12,238 INFO L93 Difference]: Finished difference Result 7728 states and 8489 transitions. [2018-10-27 06:13:12,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-27 06:13:12,238 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 370 [2018-10-27 06:13:12,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:13:12,239 INFO L225 Difference]: With dead ends: 7728 [2018-10-27 06:13:12,239 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 06:13:12,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 850 GetRequests, 765 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1845 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1262, Invalid=5218, Unknown=0, NotChecked=0, Total=6480 [2018-10-27 06:13:12,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 06:13:12,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 06:13:12,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 06:13:12,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 06:13:12,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 370 [2018-10-27 06:13:12,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:13:12,257 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:13:12,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-27 06:13:12,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:13:12,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 06:13:12,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 06:13:12,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:13:12,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:13:12,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:13:12,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:13:12,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:13:12,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:13:12,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:13:12,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:13:12,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:13:13,041 WARN L179 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 188 [2018-10-27 06:13:13,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:13:13,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:13:13,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:13:13,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:13:13,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:13:13,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:13:13,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:13:13,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:13:13,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:13:13,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:13:13,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:13:13,600 WARN L179 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 308 DAG size of output: 243 [2018-10-27 06:13:14,099 WARN L179 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 17 [2018-10-27 06:13:15,228 WARN L179 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 68 DAG size of output: 34 [2018-10-27 06:13:18,840 WARN L179 SmtUtils]: Spent 3.60 s on a formula simplification. DAG size of input: 211 DAG size of output: 92 [2018-10-27 06:13:19,960 WARN L179 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 188 DAG size of output: 70 [2018-10-27 06:13:21,634 WARN L179 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 242 DAG size of output: 74 [2018-10-27 06:13:21,638 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 06:13:21,639 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a11~0)| ~a11~0) (= ~a17~0 |old(~a17~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-10-27 06:13:21,639 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 06:13:21,639 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,639 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,639 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,639 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,639 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,639 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-27 06:13:21,639 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-27 06:13:21,639 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-27 06:13:21,640 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-27 06:13:21,640 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-27 06:13:21,640 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-27 06:13:21,640 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-27 06:13:21,640 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-27 06:13:21,640 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-27 06:13:21,640 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-27 06:13:21,640 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-27 06:13:21,640 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-27 06:13:21,640 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-27 06:13:21,640 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,640 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,640 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,640 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,641 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-27 06:13:21,641 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,641 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-27 06:13:21,641 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-27 06:13:21,641 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-27 06:13:21,641 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-27 06:13:21,641 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-27 06:13:21,641 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-27 06:13:21,641 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-27 06:13:21,641 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-27 06:13:21,641 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-27 06:13:21,641 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-27 06:13:21,641 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-27 06:13:21,641 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-27 06:13:21,642 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-27 06:13:21,642 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-27 06:13:21,642 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-27 06:13:21,642 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,642 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,642 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,642 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,642 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,642 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-27 06:13:21,642 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-27 06:13:21,642 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-27 06:13:21,643 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-27 06:13:21,643 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-27 06:13:21,643 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-27 06:13:21,643 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-27 06:13:21,643 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-27 06:13:21,643 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-27 06:13:21,643 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-27 06:13:21,643 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-27 06:13:21,643 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,643 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,644 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,644 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,644 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,644 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-27 06:13:21,644 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-27 06:13:21,644 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-27 06:13:21,644 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-27 06:13:21,644 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-27 06:13:21,644 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-27 06:13:21,644 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-27 06:13:21,645 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-27 06:13:21,645 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-27 06:13:21,645 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-27 06:13:21,645 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-27 06:13:21,645 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-27 06:13:21,645 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-27 06:13:21,645 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,645 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,645 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,645 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,645 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,646 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-27 06:13:21,646 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-27 06:13:21,646 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-27 06:13:21,646 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-27 06:13:21,646 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-27 06:13:21,646 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-27 06:13:21,646 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-27 06:13:21,646 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-27 06:13:21,646 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-27 06:13:21,646 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 592) no Hoare annotation was computed. [2018-10-27 06:13:21,647 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-27 06:13:21,647 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-27 06:13:21,647 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-27 06:13:21,647 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-27 06:13:21,647 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-27 06:13:21,647 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-27 06:13:21,647 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-27 06:13:21,647 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,647 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,647 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,647 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,647 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-27 06:13:21,647 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,647 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-27 06:13:21,647 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,647 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-27 06:13:21,648 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-27 06:13:21,648 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-27 06:13:21,648 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,648 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,648 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-27 06:13:21,648 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-27 06:13:21,648 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-27 06:13:21,648 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-27 06:13:21,648 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-27 06:13:21,648 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-27 06:13:21,648 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-27 06:13:21,648 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-27 06:13:21,648 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-27 06:13:21,648 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-27 06:13:21,648 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-27 06:13:21,649 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,649 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,649 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,649 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,649 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,649 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,649 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-27 06:13:21,649 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-27 06:13:21,649 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-27 06:13:21,649 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-27 06:13:21,649 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-27 06:13:21,649 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-27 06:13:21,649 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-27 06:13:21,649 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-27 06:13:21,649 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-27 06:13:21,649 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-27 06:13:21,650 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-27 06:13:21,650 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,650 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,650 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,650 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,650 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,650 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,650 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-27 06:13:21,650 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-27 06:13:21,650 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-27 06:13:21,650 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-27 06:13:21,650 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-27 06:13:21,650 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-27 06:13:21,650 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-27 06:13:21,650 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-27 06:13:21,650 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-27 06:13:21,651 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-27 06:13:21,651 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-27 06:13:21,651 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-27 06:13:21,651 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-27 06:13:21,651 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-27 06:13:21,651 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,651 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,651 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,652 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse15 (= 1 |old(~a19~0)|)) (.cse20 (= 1 |old(~a25~0)|))) (let ((.cse9 (= ~a17~0 8)) (.cse1 (= 1 |old(~a11~0)|)) (.cse7 (not .cse20)) (.cse0 (not (= 1 ~a21~0))) (.cse8 (not .cse15)) (.cse11 (= ~a11~0 1))) (let ((.cse10 (= ~a25~0 1)) (.cse2 (not .cse11)) (.cse25 (not (= 10 |old(~a28~0)|))) (.cse3 (= |old(~a17~0)| |old(~a28~0)|)) (.cse22 (= |old(~a28~0)| ~a28~0)) (.cse26 (let ((.cse28 (= 0 |old(~a28~0)|))) (and (or .cse0 .cse7 .cse28) (or .cse0 .cse8 .cse28)))) (.cse18 (= 8 ~a17~0)) (.cse21 (= 9 |old(~a28~0)|)) (.cse14 (not .cse1)) (.cse16 (= 7 ~a28~0)) (.cse17 (= 1 ~a11~0)) (.cse23 (= 7 ~a17~0)) (.cse19 (= 1 ~a19~0)) (.cse24 (= |old(~a25~0)| ~a25~0)) (.cse5 (not (= 7 |old(~a17~0)|))) (.cse6 (not (= 7 |old(~a28~0)|))) (.cse4 (< 0 |old(~a19~0)|)) (.cse13 (= |calculate_output_#in~input| 0)) (.cse12 (not (= 8 |old(~a17~0)|))) (.cse27 (and (= |old(~a11~0)| ~a11~0) .cse9 (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse6 .cse7 .cse8 (and .cse9 (= ~a19~0 1) (= ~a28~0 7) .cse10 .cse11) .cse12 .cse13 .cse14) (or .cse15 .cse0 .cse6 .cse12 (and .cse16 (not .cse10) .cse17 .cse18 (not .cse19)) .cse14 .cse20) (or .cse0 .cse1 .cse3 .cse21 (and .cse22 .cse23 .cse24 .cse2) .cse20 .cse5) (or (and .cse17 .cse18 .cse19 .cse24 (= 10 ~a28~0)) .cse0 .cse25 .cse7 .cse8 .cse12 .cse14) (or .cse26 .cse13 .cse1 .cse25 .cse12 .cse4 .cse27) (or .cse27 .cse26 .cse3 .cse12 .cse13 .cse20) (or .cse0 .cse1 .cse27 (not (= 8 |old(~a28~0)|)) .cse12 .cse4 .cse13 .cse20) (or .cse0 .cse3 .cse4 (and .cse22 (<= ~a19~0 0) .cse23 .cse24) .cse5) (or .cse7 .cse27 .cse26 .cse13 .cse1 .cse8 .cse12) (or .cse0 .cse7 .cse8 .cse12 (and .cse17 (= 1 ~a25~0) (= 9 ~a28~0) .cse18 .cse19) (not .cse21) .cse14) (or .cse0 .cse6 .cse7 .cse8 .cse14 (and .cse16 .cse17 .cse23 .cse19 .cse24) .cse5) (or (or .cse0 .cse6 .cse1 .cse4 .cse13 .cse20) .cse12 .cse27))))) [2018-10-27 06:13:21,652 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,652 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,652 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,652 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-27 06:13:21,652 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-27 06:13:21,652 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-27 06:13:21,653 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-27 06:13:21,653 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-27 06:13:21,653 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-27 06:13:21,653 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-27 06:13:21,653 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-27 06:13:21,653 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-27 06:13:21,653 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-27 06:13:21,653 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-27 06:13:21,653 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-27 06:13:21,653 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-27 06:13:21,653 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,653 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,654 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,654 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,654 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,654 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,654 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-27 06:13:21,654 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-27 06:13:21,654 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-27 06:13:21,654 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-27 06:13:21,654 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-27 06:13:21,654 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-27 06:13:21,655 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-27 06:13:21,655 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-27 06:13:21,655 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-27 06:13:21,655 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-27 06:13:21,655 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-27 06:13:21,655 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-27 06:13:21,655 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-27 06:13:21,655 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-27 06:13:21,655 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-27 06:13:21,656 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-27 06:13:21,656 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,656 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,656 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,656 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,656 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:13:21,656 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-27 06:13:21,656 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-27 06:13:21,656 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-27 06:13:21,656 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-27 06:13:21,657 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-27 06:13:21,657 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-27 06:13:21,657 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-27 06:13:21,657 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-27 06:13:21,657 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-27 06:13:21,657 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-27 06:13:21,657 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-27 06:13:21,657 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-27 06:13:21,657 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-27 06:13:21,657 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-27 06:13:21,657 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-27 06:13:21,658 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-27 06:13:21,658 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-27 06:13:21,658 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-27 06:13:21,658 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-27 06:13:21,658 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 06:13:21,658 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7) (= ~a21~0 1)) [2018-10-27 06:13:21,658 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 06:13:21,658 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 06:13:21,659 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (and (= ~a11~0 0) (= ~a25~0 |old(~a25~0)|) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8) (= ~a19~0 |old(~a19~0)|)) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-10-27 06:13:21,659 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-27 06:13:21,659 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse8 (= 1 ~a25~0)) (.cse4 (= ~a19~0 1)) (.cse1 (not (= ~a28~0 0))) (.cse3 (= ~a17~0 8)) (.cse13 (= ~a25~0 1))) (let ((.cse14 (let ((.cse17 (= ~a21~0 1))) (or (and .cse1 .cse3 .cse4 .cse17) (and .cse1 .cse3 .cse17 .cse13)))) (.cse9 (= 1 ~a19~0)) (.cse16 (= 10 ~a28~0)) (.cse11 (<= ~a19~0 0)) (.cse12 (not .cse8)) (.cse5 (= 7 ~a28~0)) (.cse6 (= 1 ~a11~0)) (.cse10 (= 8 ~a17~0)) (.cse0 (not (= ~a28~0 ~a17~0))) (.cse2 (not .cse13)) (.cse7 (= 7 ~a17~0)) (.cse15 (not (= ~a11~0 1)))) (or (not (= 1 ~a21~0)) (and .cse0 (and .cse1 .cse2 .cse3 .cse4)) (not (= 0 |old(~a11~0)|)) (and .cse5 .cse6 .cse7 .cse8 .cse9) (and (= 9 ~a28~0) .cse10 .cse9) (and .cse11 .cse0 .cse7) (and (and .cse11 .cse5 .cse12) .cse10) (and .cse13 .cse9 (and .cse14 .cse15)) (and (and .cse11 .cse14 .cse15) .cse16) (not (= 1 |old(~a19~0)|)) (and .cse10 .cse9 .cse16) (not (= 7 |old(~a28~0)|)) (and .cse11 .cse15 (= 8 ~a28~0) .cse12 .cse10) (and .cse5 .cse2 .cse6 .cse10) (and .cse0 .cse2 .cse7 .cse15 (not (= ~a28~0 9))) (and .cse3 .cse4 (= ~a28~0 7)) (not (= 0 |old(~a25~0)|)) (not (= |old(~a17~0)| 8))))) [2018-10-27 06:13:21,659 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-27 06:13:21,659 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-27 06:13:21,660 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse9 (= 1 ~a25~0)) (.cse14 (= ~a25~0 1))) (let ((.cse12 (= 10 ~a28~0)) (.cse7 (= 1 ~a11~0)) (.cse10 (= 8 ~a17~0)) (.cse2 (not (= ~a28~0 ~a17~0))) (.cse1 (not .cse14)) (.cse8 (= 7 ~a17~0)) (.cse3 (not (= ~a28~0 0))) (.cse4 (= 1 ~a19~0)) (.cse13 (not (= ~a11~0 1))) (.cse0 (not (= main_~input~0 0))) (.cse11 (<= ~a19~0 0)) (.cse6 (= 7 ~a28~0)) (.cse15 (not .cse9)) (.cse5 (= ~a17~0 8))) (or (not (= 1 ~a21~0)) (not (= 0 |old(~a11~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9 .cse4) (and .cse7 .cse9 (= 9 ~a28~0) .cse10 .cse4) (and .cse0 .cse11 .cse9 .cse12 .cse13 .cse5) (and .cse11 .cse2 .cse8) (not (= 1 |old(~a19~0)|)) (and .cse7 .cse9 .cse10 .cse4 .cse12) (not (= 7 |old(~a28~0)|)) (and .cse6 .cse1 .cse7 .cse10 (not .cse4)) (and .cse2 .cse1 .cse8 .cse13 (not (= ~a28~0 9))) (not (= 0 |old(~a25~0)|)) (and .cse0 .cse14 .cse13 .cse3 .cse4 .cse5) (and .cse0 .cse5 (= ~a19~0 1) (= ~a28~0 7)) (and .cse0 .cse11 .cse13 (= 8 ~a28~0) .cse15 .cse5) (not (= |old(~a17~0)| 8)) (and .cse0 .cse11 .cse6 .cse15 .cse5)))) [2018-10-27 06:13:21,660 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-27 06:13:21,660 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-27 06:13:21,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 06:13:21 BoogieIcfgContainer [2018-10-27 06:13:21,677 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 06:13:21,678 INFO L168 Benchmark]: Toolchain (without parser) took 109014.31 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -102.5 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-27 06:13:21,679 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 06:13:21,680 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-27 06:13:21,680 INFO L168 Benchmark]: Boogie Procedure Inliner took 196.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -821.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2018-10-27 06:13:21,681 INFO L168 Benchmark]: Boogie Preprocessor took 65.62 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 06:13:21,682 INFO L168 Benchmark]: RCFGBuilder took 3525.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: 118.0 MB). Peak memory consumption was 118.0 MB. Max. memory is 7.1 GB. [2018-10-27 06:13:21,682 INFO L168 Benchmark]: TraceAbstraction took 104482.27 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 569.6 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-10-27 06:13:21,686 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 739.28 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 196.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -821.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.62 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3525.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: 118.0 MB). Peak memory consumption was 118.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 104482.27 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 569.6 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 592]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((((((!(1 == a21) || (!(a28 == a17) && ((!(a28 == 0) && !(a25 == 1)) && a17 == 8) && a19 == 1)) || !(0 == \old(a11))) || ((((7 == a28 && 1 == a11) && 7 == a17) && 1 == a25) && 1 == a19)) || ((9 == a28 && 8 == a17) && 1 == a19)) || ((a19 <= 0 && !(a28 == a17)) && 7 == a17)) || (((a19 <= 0 && 7 == a28) && !(1 == a25)) && 8 == a17)) || ((a25 == 1 && 1 == a19) && ((((!(a28 == 0) && a17 == 8) && a19 == 1) && a21 == 1) || (((!(a28 == 0) && a17 == 8) && a21 == 1) && a25 == 1)) && !(a11 == 1))) || (((a19 <= 0 && ((((!(a28 == 0) && a17 == 8) && a19 == 1) && a21 == 1) || (((!(a28 == 0) && a17 == 8) && a21 == 1) && a25 == 1))) && !(a11 == 1)) && 10 == a28)) || !(1 == \old(a19))) || ((8 == a17 && 1 == a19) && 10 == a28)) || !(7 == \old(a28))) || ((((a19 <= 0 && !(a11 == 1)) && 8 == a28) && !(1 == a25)) && 8 == a17)) || (((7 == a28 && !(a25 == 1)) && 1 == a11) && 8 == a17)) || ((((!(a28 == a17) && !(a25 == 1)) && 7 == a17) && !(a11 == 1)) && !(a28 == 9))) || ((a17 == 8 && a19 == 1) && a28 == 7)) || !(0 == \old(a25))) || !(\old(a17) == 8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 104.3s OverallTime, 16 OverallIterations, 6 TraceHistogramMax, 68.5s AutomataDifference, 0.0s DeadEndRemovalTime, 9.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 2140 SDtfs, 20286 SDslu, 3968 SDs, 0 SdLazy, 28824 SolverSat, 4054 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.9s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 4715 GetRequests, 4394 SyntacticMatches, 21 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3445 ImplicationChecksByTransitivity, 18.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5747occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.2s AbstIntTime, 9 AbstIntIterations, 3 AbstIntStrong, 0.9975382092542596 AbsIntWeakeningRatio, 0.15561959654178675 AbsIntAvgWeakeningVarsNumRemoved, 25.363112391930837 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 916 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 279 PreInvPairs, 401 NumberOfFragments, 1126 HoareAnnotationTreeSize, 279 FomulaSimplifications, 26390 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 20086 FormulaSimplificationTreeSizeReductionInter, 8.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 5508 NumberOfCodeBlocks, 5508 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 7306 ConstructedInterpolants, 0 QuantifiedInterpolants, 11555736 SizeOfPredicates, 20 NumberOfNonLiveVariables, 3713 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 28 InterpolantComputations, 9 PerfectInterpolantSequences, 4996/5672 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...