java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label11_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 18:29:58,943 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 18:29:58,945 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 18:29:58,957 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 18:29:58,957 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 18:29:58,958 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 18:29:58,959 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 18:29:58,961 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 18:29:58,963 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 18:29:58,964 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 18:29:58,965 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 18:29:58,965 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 18:29:58,966 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 18:29:58,967 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 18:29:58,971 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 18:29:58,972 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 18:29:58,973 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 18:29:58,978 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 18:29:58,980 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 18:29:58,982 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 18:29:58,983 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 18:29:58,984 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 18:29:58,988 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 18:29:58,989 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 18:29:58,992 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 18:29:58,993 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 18:29:58,994 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 18:29:58,994 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 18:29:58,998 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 18:29:58,999 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 18:29:59,000 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 18:29:59,000 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 18:29:59,001 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 18:29:59,003 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 18:29:59,005 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 18:29:59,005 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 18:29:59,006 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 18:29:59,034 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 18:29:59,034 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 18:29:59,037 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 18:29:59,038 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 18:29:59,038 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 18:29:59,038 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 18:29:59,038 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 18:29:59,038 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 18:29:59,039 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 18:29:59,039 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 18:29:59,039 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 18:29:59,039 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 18:29:59,039 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 18:29:59,040 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 18:29:59,041 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 18:29:59,041 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 18:29:59,041 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 18:29:59,041 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 18:29:59,041 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 18:29:59,041 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 18:29:59,043 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 18:29:59,043 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 18:29:59,043 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 18:29:59,043 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 18:29:59,043 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 18:29:59,043 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 18:29:59,044 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 18:29:59,044 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 18:29:59,044 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 18:29:59,044 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 18:29:59,044 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 18:29:59,045 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 18:29:59,046 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 18:29:59,046 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 18:29:59,046 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 18:29:59,109 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 18:29:59,125 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 18:29:59,130 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 18:29:59,132 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 18:29:59,132 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 18:29:59,133 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label11_true-unreach-call.c [2018-11-12 18:29:59,195 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bc8c42a4/46647f91011547bdb5c34f32b3d701e1/FLAGe22ea1dca [2018-11-12 18:29:59,691 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 18:29:59,695 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label11_true-unreach-call.c [2018-11-12 18:29:59,714 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bc8c42a4/46647f91011547bdb5c34f32b3d701e1/FLAGe22ea1dca [2018-11-12 18:29:59,729 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bc8c42a4/46647f91011547bdb5c34f32b3d701e1 [2018-11-12 18:29:59,740 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 18:29:59,742 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 18:29:59,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 18:29:59,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 18:29:59,747 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 18:29:59,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:29:59" (1/1) ... [2018-11-12 18:29:59,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f8be60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:59, skipping insertion in model container [2018-11-12 18:29:59,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:29:59" (1/1) ... [2018-11-12 18:29:59,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 18:29:59,812 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 18:30:00,286 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 18:30:00,293 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 18:30:00,422 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 18:30:00,439 INFO L193 MainTranslator]: Completed translation [2018-11-12 18:30:00,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:00 WrapperNode [2018-11-12 18:30:00,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 18:30:00,441 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 18:30:00,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 18:30:00,441 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 18:30:00,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:00" (1/1) ... [2018-11-12 18:30:00,472 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:00" (1/1) ... [2018-11-12 18:30:00,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 18:30:00,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 18:30:00,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 18:30:00,486 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 18:30:00,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:00" (1/1) ... [2018-11-12 18:30:00,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:00" (1/1) ... [2018-11-12 18:30:00,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:00" (1/1) ... [2018-11-12 18:30:00,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:00" (1/1) ... [2018-11-12 18:30:00,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:00" (1/1) ... [2018-11-12 18:30:00,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:00" (1/1) ... [2018-11-12 18:30:00,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:00" (1/1) ... [2018-11-12 18:30:00,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 18:30:00,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 18:30:00,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 18:30:00,719 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 18:30:00,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 18:30:00,785 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 18:30:00,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 18:30:00,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 18:30:00,786 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 18:30:00,786 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 18:30:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 18:30:00,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 18:30:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 18:30:00,787 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 18:30:04,004 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 18:30:04,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:30:04 BoogieIcfgContainer [2018-11-12 18:30:04,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 18:30:04,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 18:30:04,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 18:30:04,009 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 18:30:04,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:29:59" (1/3) ... [2018-11-12 18:30:04,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289ee066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:30:04, skipping insertion in model container [2018-11-12 18:30:04,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:30:00" (2/3) ... [2018-11-12 18:30:04,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289ee066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:30:04, skipping insertion in model container [2018-11-12 18:30:04,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:30:04" (3/3) ... [2018-11-12 18:30:04,013 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label11_true-unreach-call.c [2018-11-12 18:30:04,023 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 18:30:04,034 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 18:30:04,053 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 18:30:04,095 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 18:30:04,096 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 18:30:04,096 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 18:30:04,096 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 18:30:04,096 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 18:30:04,096 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 18:30:04,096 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 18:30:04,097 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 18:30:04,122 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-12 18:30:04,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-12 18:30:04,133 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:30:04,134 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] [2018-11-12 18:30:04,136 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:30:04,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:30:04,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1604912700, now seen corresponding path program 1 times [2018-11-12 18:30:04,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:30:04,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:30:04,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:30:04,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:30:04,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:30:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:30:04,611 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:30:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:30:04,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:30:04,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 18:30:04,744 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:30:04,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 18:30:04,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 18:30:04,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 18:30:04,773 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-11-12 18:30:06,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:30:06,421 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-11-12 18:30:06,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 18:30:06,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-11-12 18:30:06,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:30:06,441 INFO L225 Difference]: With dead ends: 574 [2018-11-12 18:30:06,442 INFO L226 Difference]: Without dead ends: 356 [2018-11-12 18:30:06,449 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 18:30:06,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-12 18:30:06,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-11-12 18:30:06,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-12 18:30:06,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 609 transitions. [2018-11-12 18:30:06,551 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 609 transitions. Word has length 68 [2018-11-12 18:30:06,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:30:06,552 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 609 transitions. [2018-11-12 18:30:06,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 18:30:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 609 transitions. [2018-11-12 18:30:06,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-12 18:30:06,563 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:30:06,564 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, 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] [2018-11-12 18:30:06,564 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:30:06,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:30:06,565 INFO L82 PathProgramCache]: Analyzing trace with hash 633419456, now seen corresponding path program 1 times [2018-11-12 18:30:06,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:30:06,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:30:06,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:30:06,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:30:06,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:30:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:30:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:30:07,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:30:07,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 18:30:07,108 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:30:07,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 18:30:07,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 18:30:07,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 18:30:07,112 INFO L87 Difference]: Start difference. First operand 356 states and 609 transitions. Second operand 5 states. [2018-11-12 18:30:09,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:30:09,681 INFO L93 Difference]: Finished difference Result 1140 states and 2022 transitions. [2018-11-12 18:30:09,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 18:30:09,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 188 [2018-11-12 18:30:09,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:30:09,694 INFO L225 Difference]: With dead ends: 1140 [2018-11-12 18:30:09,694 INFO L226 Difference]: Without dead ends: 790 [2018-11-12 18:30:09,697 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-12 18:30:09,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-11-12 18:30:09,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 784. [2018-11-12 18:30:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2018-11-12 18:30:09,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1300 transitions. [2018-11-12 18:30:09,759 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1300 transitions. Word has length 188 [2018-11-12 18:30:09,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:30:09,760 INFO L480 AbstractCegarLoop]: Abstraction has 784 states and 1300 transitions. [2018-11-12 18:30:09,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 18:30:09,760 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1300 transitions. [2018-11-12 18:30:09,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-12 18:30:09,767 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:30:09,767 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, 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] [2018-11-12 18:30:09,767 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:30:09,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:30:09,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1277434075, now seen corresponding path program 1 times [2018-11-12 18:30:09,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:30:09,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:30:09,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:30:09,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:30:09,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:30:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:30:10,089 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:30:10,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:30:10,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 18:30:10,090 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:30:10,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 18:30:10,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 18:30:10,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 18:30:10,092 INFO L87 Difference]: Start difference. First operand 784 states and 1300 transitions. Second operand 6 states. [2018-11-12 18:30:14,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:30:14,421 INFO L93 Difference]: Finished difference Result 1975 states and 3367 transitions. [2018-11-12 18:30:14,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 18:30:14,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2018-11-12 18:30:14,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:30:14,430 INFO L225 Difference]: With dead ends: 1975 [2018-11-12 18:30:14,430 INFO L226 Difference]: Without dead ends: 1197 [2018-11-12 18:30:14,435 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 18:30:14,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2018-11-12 18:30:14,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1177. [2018-11-12 18:30:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-11-12 18:30:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1754 transitions. [2018-11-12 18:30:14,473 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1754 transitions. Word has length 195 [2018-11-12 18:30:14,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:30:14,474 INFO L480 AbstractCegarLoop]: Abstraction has 1177 states and 1754 transitions. [2018-11-12 18:30:14,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 18:30:14,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1754 transitions. [2018-11-12 18:30:14,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-11-12 18:30:14,481 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:30:14,481 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, 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:30:14,481 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:30:14,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:30:14,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1200598705, now seen corresponding path program 1 times [2018-11-12 18:30:14,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:30:14,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:30:14,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:30:14,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:30:14,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:30:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:30:14,906 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 18:30:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 191 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:30:15,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:30:15,524 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:30:15,525 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 260 with the following transitions: [2018-11-12 18:30:15,527 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [694], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:30:15,583 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:30:15,584 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:30:16,009 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:30:16,909 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:30:16,911 INFO L272 AbstractInterpreter]: Visited 128 different actions 371 times. Merged at 5 different actions 9 times. Never widened. Performed 4646 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4646 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 18:30:16,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:30:16,951 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:30:17,889 INFO L227 lantSequenceWeakener]: Weakened 91 states. On average, predicates are now at 75.65% of their original sizes. [2018-11-12 18:30:17,889 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:30:19,426 INFO L415 sIntCurrentIteration]: We unified 258 AI predicates to 258 [2018-11-12 18:30:19,427 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:30:19,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:30:19,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [13] total 32 [2018-11-12 18:30:19,428 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:30:19,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 18:30:19,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 18:30:19,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-11-12 18:30:19,430 INFO L87 Difference]: Start difference. First operand 1177 states and 1754 transitions. Second operand 21 states. [2018-11-12 18:30:50,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:30:50,865 INFO L93 Difference]: Finished difference Result 2877 states and 4372 transitions. [2018-11-12 18:30:50,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-12 18:30:50,865 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 259 [2018-11-12 18:30:50,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:30:50,876 INFO L225 Difference]: With dead ends: 2877 [2018-11-12 18:30:50,876 INFO L226 Difference]: Without dead ends: 1706 [2018-11-12 18:30:50,882 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 279 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=320, Invalid=1402, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 18:30:50,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2018-11-12 18:30:50,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1693. [2018-11-12 18:30:50,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1693 states. [2018-11-12 18:30:50,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2299 transitions. [2018-11-12 18:30:50,942 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2299 transitions. Word has length 259 [2018-11-12 18:30:50,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:30:50,943 INFO L480 AbstractCegarLoop]: Abstraction has 1693 states and 2299 transitions. [2018-11-12 18:30:50,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 18:30:50,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2299 transitions. [2018-11-12 18:30:50,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-11-12 18:30:50,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:30:50,951 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, 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:30:50,952 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:30:50,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:30:50,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1067175916, now seen corresponding path program 1 times [2018-11-12 18:30:50,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:30:50,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:30:50,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:30:50,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:30:50,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:30:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:30:51,652 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:30:52,561 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-12 18:30:52,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:30:52,562 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:30:52,562 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 269 with the following transitions: [2018-11-12 18:30:52,563 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [694], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:30:52,571 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:30:52,571 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:30:52,686 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:30:53,540 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:30:53,541 INFO L272 AbstractInterpreter]: Visited 128 different actions 738 times. Merged at 5 different actions 25 times. Widened at 1 different actions 1 times. Performed 9223 root evaluator evaluations with a maximum evaluation depth of 6. Performed 9223 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 18:30:53,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:30:53,579 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:30:53,947 INFO L227 lantSequenceWeakener]: Weakened 265 states. On average, predicates are now at 73.53% of their original sizes. [2018-11-12 18:30:53,947 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:30:54,322 INFO L415 sIntCurrentIteration]: We unified 267 AI predicates to 267 [2018-11-12 18:30:54,323 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:30:54,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:30:54,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2018-11-12 18:30:54,323 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:30:54,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 18:30:54,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 18:30:54,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-12 18:30:54,324 INFO L87 Difference]: Start difference. First operand 1693 states and 2299 transitions. Second operand 10 states. [2018-11-12 18:31:04,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:31:04,340 INFO L93 Difference]: Finished difference Result 4042 states and 5755 transitions. [2018-11-12 18:31:04,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 18:31:04,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 268 [2018-11-12 18:31:04,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:31:04,355 INFO L225 Difference]: With dead ends: 4042 [2018-11-12 18:31:04,355 INFO L226 Difference]: Without dead ends: 2651 [2018-11-12 18:31:04,361 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 275 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-12 18:31:04,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2651 states. [2018-11-12 18:31:04,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2651 to 2549. [2018-11-12 18:31:04,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2549 states. [2018-11-12 18:31:04,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 3363 transitions. [2018-11-12 18:31:04,431 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 3363 transitions. Word has length 268 [2018-11-12 18:31:04,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:31:04,431 INFO L480 AbstractCegarLoop]: Abstraction has 2549 states and 3363 transitions. [2018-11-12 18:31:04,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 18:31:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 3363 transitions. [2018-11-12 18:31:04,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-11-12 18:31:04,445 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:31:04,446 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:31:04,446 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:31:04,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:31:04,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1882822516, now seen corresponding path program 1 times [2018-11-12 18:31:04,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:31:04,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:04,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:31:04,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:04,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:31:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:31:06,143 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 236 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:31:06,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:31:06,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:31:06,144 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 305 with the following transitions: [2018-11-12 18:31:06,144 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [679], [683], [687], [691], [694], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:31:06,149 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:31:06,149 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:31:06,255 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:31:06,362 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:31:06,362 INFO L272 AbstractInterpreter]: Visited 128 different actions 252 times. Merged at 5 different actions 7 times. Never widened. Performed 3760 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3760 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 18:31:06,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:31:06,370 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:31:06,790 INFO L227 lantSequenceWeakener]: Weakened 116 states. On average, predicates are now at 77.04% of their original sizes. [2018-11-12 18:31:06,791 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:31:07,249 INFO L415 sIntCurrentIteration]: We unified 303 AI predicates to 303 [2018-11-12 18:31:07,249 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:31:07,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:31:07,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [15] total 36 [2018-11-12 18:31:07,250 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:31:07,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-12 18:31:07,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-12 18:31:07,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2018-11-12 18:31:07,251 INFO L87 Difference]: Start difference. First operand 2549 states and 3363 transitions. Second operand 23 states. [2018-11-12 18:31:22,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:31:22,391 INFO L93 Difference]: Finished difference Result 6130 states and 8489 transitions. [2018-11-12 18:31:22,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-12 18:31:22,391 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 304 [2018-11-12 18:31:22,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:31:22,410 INFO L225 Difference]: With dead ends: 6130 [2018-11-12 18:31:22,410 INFO L226 Difference]: Without dead ends: 3883 [2018-11-12 18:31:22,420 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 328 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=417, Invalid=1839, Unknown=0, NotChecked=0, Total=2256 [2018-11-12 18:31:22,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3883 states. [2018-11-12 18:31:22,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3883 to 3832. [2018-11-12 18:31:22,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3832 states. [2018-11-12 18:31:22,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3832 states to 3832 states and 4851 transitions. [2018-11-12 18:31:22,516 INFO L78 Accepts]: Start accepts. Automaton has 3832 states and 4851 transitions. Word has length 304 [2018-11-12 18:31:22,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:31:22,517 INFO L480 AbstractCegarLoop]: Abstraction has 3832 states and 4851 transitions. [2018-11-12 18:31:22,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-12 18:31:22,517 INFO L276 IsEmpty]: Start isEmpty. Operand 3832 states and 4851 transitions. [2018-11-12 18:31:22,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-11-12 18:31:22,532 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:31:22,532 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 18:31:22,533 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:31:22,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:31:22,533 INFO L82 PathProgramCache]: Analyzing trace with hash 594817387, now seen corresponding path program 1 times [2018-11-12 18:31:22,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:31:22,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:22,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:31:22,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:22,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:31:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:31:23,324 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 321 proven. 72 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-12 18:31:23,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:31:23,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:31:23,325 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 336 with the following transitions: [2018-11-12 18:31:23,326 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [694], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:31:23,332 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:31:23,332 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:31:23,389 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:31:23,805 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:31:23,805 INFO L272 AbstractInterpreter]: Visited 129 different actions 504 times. Merged at 7 different actions 21 times. Never widened. Performed 8165 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8165 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 18:31:23,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:31:23,812 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:31:24,225 INFO L227 lantSequenceWeakener]: Weakened 91 states. On average, predicates are now at 75.63% of their original sizes. [2018-11-12 18:31:24,225 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:31:24,580 INFO L415 sIntCurrentIteration]: We unified 334 AI predicates to 334 [2018-11-12 18:31:24,581 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:31:24,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:31:24,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [13] total 32 [2018-11-12 18:31:24,581 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:31:24,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 18:31:24,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 18:31:24,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-11-12 18:31:24,582 INFO L87 Difference]: Start difference. First operand 3832 states and 4851 transitions. Second operand 21 states. [2018-11-12 18:31:35,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:31:35,580 INFO L93 Difference]: Finished difference Result 8155 states and 10466 transitions. [2018-11-12 18:31:35,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-12 18:31:35,580 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 335 [2018-11-12 18:31:35,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:31:35,600 INFO L225 Difference]: With dead ends: 8155 [2018-11-12 18:31:35,600 INFO L226 Difference]: Without dead ends: 4923 [2018-11-12 18:31:35,610 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 348 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=228, Invalid=962, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 18:31:35,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4923 states. [2018-11-12 18:31:35,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4923 to 4863. [2018-11-12 18:31:35,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4863 states. [2018-11-12 18:31:35,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4863 states to 4863 states and 6002 transitions. [2018-11-12 18:31:35,734 INFO L78 Accepts]: Start accepts. Automaton has 4863 states and 6002 transitions. Word has length 335 [2018-11-12 18:31:35,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:31:35,734 INFO L480 AbstractCegarLoop]: Abstraction has 4863 states and 6002 transitions. [2018-11-12 18:31:35,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 18:31:35,735 INFO L276 IsEmpty]: Start isEmpty. Operand 4863 states and 6002 transitions. [2018-11-12 18:31:35,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-11-12 18:31:35,752 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:31:35,753 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, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:31:35,753 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:31:35,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:31:35,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1933116009, now seen corresponding path program 1 times [2018-11-12 18:31:35,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:31:35,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:35,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:31:35,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:35,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:31:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:31:36,145 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 18:31:36,330 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 18:31:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 259 proven. 72 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-12 18:31:36,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:31:36,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:31:36,739 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 342 with the following transitions: [2018-11-12 18:31:36,739 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [694], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:31:36,742 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:31:36,742 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:31:36,803 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:31:37,246 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:31:37,246 INFO L272 AbstractInterpreter]: Visited 129 different actions 634 times. Merged at 7 different actions 33 times. Widened at 1 different actions 1 times. Performed 8086 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8086 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 5 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-12 18:31:37,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:31:37,255 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:31:37,527 INFO L227 lantSequenceWeakener]: Weakened 338 states. On average, predicates are now at 73.38% of their original sizes. [2018-11-12 18:31:37,528 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:31:37,610 INFO L415 sIntCurrentIteration]: We unified 340 AI predicates to 340 [2018-11-12 18:31:37,610 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:31:37,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:31:37,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2018-11-12 18:31:37,611 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:31:37,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 18:31:37,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 18:31:37,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-12 18:31:37,612 INFO L87 Difference]: Start difference. First operand 4863 states and 6002 transitions. Second operand 10 states. [2018-11-12 18:31:42,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:31:42,752 INFO L93 Difference]: Finished difference Result 10829 states and 13816 transitions. [2018-11-12 18:31:42,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 18:31:42,752 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 341 [2018-11-12 18:31:42,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:31:42,780 INFO L225 Difference]: With dead ends: 10829 [2018-11-12 18:31:42,781 INFO L226 Difference]: Without dead ends: 7170 [2018-11-12 18:31:42,793 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 348 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-12 18:31:42,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states. [2018-11-12 18:31:42,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 7101. [2018-11-12 18:31:42,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7101 states. [2018-11-12 18:31:42,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7101 states to 7101 states and 8656 transitions. [2018-11-12 18:31:42,956 INFO L78 Accepts]: Start accepts. Automaton has 7101 states and 8656 transitions. Word has length 341 [2018-11-12 18:31:42,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:31:42,957 INFO L480 AbstractCegarLoop]: Abstraction has 7101 states and 8656 transitions. [2018-11-12 18:31:42,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 18:31:42,957 INFO L276 IsEmpty]: Start isEmpty. Operand 7101 states and 8656 transitions. [2018-11-12 18:31:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-11-12 18:31:42,980 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:31:42,981 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:31:42,981 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:31:42,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:31:42,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1930668300, now seen corresponding path program 1 times [2018-11-12 18:31:42,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:31:42,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:42,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:31:42,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:42,983 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:31:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:31:43,271 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:31:43,398 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 189 proven. 154 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-12 18:31:43,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:31:43,398 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:31:43,399 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 347 with the following transitions: [2018-11-12 18:31:43,399 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [694], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:31:43,401 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:31:43,401 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:31:43,457 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:31:43,815 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 18:31:43,815 INFO L272 AbstractInterpreter]: Visited 130 different actions 516 times. Merged at 8 different actions 32 times. Widened at 1 different actions 1 times. Performed 6721 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6721 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 6 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 18:31:43,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:31:43,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 18:31:43,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:31:43,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 18:31:43,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:31:43,836 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 18:31:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:31:43,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 18:31:44,335 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 355 proven. 2 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-12 18:31:44,335 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 18:31:44,554 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-12 18:31:44,655 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-12 18:31:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 264 proven. 77 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-12 18:31:45,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 18:31:45,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-12 18:31:45,144 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 18:31:45,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 18:31:45,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 18:31:45,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-12 18:31:45,146 INFO L87 Difference]: Start difference. First operand 7101 states and 8656 transitions. Second operand 11 states. [2018-11-12 18:31:49,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:31:49,328 INFO L93 Difference]: Finished difference Result 14019 states and 17894 transitions. [2018-11-12 18:31:49,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-12 18:31:49,328 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 346 [2018-11-12 18:31:49,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:31:49,348 INFO L225 Difference]: With dead ends: 14019 [2018-11-12 18:31:49,348 INFO L226 Difference]: Without dead ends: 5217 [2018-11-12 18:31:49,379 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 726 GetRequests, 699 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-11-12 18:31:49,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5217 states. [2018-11-12 18:31:49,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5217 to 4406. [2018-11-12 18:31:49,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4406 states. [2018-11-12 18:31:49,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4406 states to 4406 states and 4934 transitions. [2018-11-12 18:31:49,499 INFO L78 Accepts]: Start accepts. Automaton has 4406 states and 4934 transitions. Word has length 346 [2018-11-12 18:31:49,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:31:49,499 INFO L480 AbstractCegarLoop]: Abstraction has 4406 states and 4934 transitions. [2018-11-12 18:31:49,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 18:31:49,500 INFO L276 IsEmpty]: Start isEmpty. Operand 4406 states and 4934 transitions. [2018-11-12 18:31:49,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-11-12 18:31:49,515 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:31:49,515 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, 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, 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] [2018-11-12 18:31:49,515 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:31:49,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:31:49,516 INFO L82 PathProgramCache]: Analyzing trace with hash -341971068, now seen corresponding path program 1 times [2018-11-12 18:31:49,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:31:49,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:49,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:31:49,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:49,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:31:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:31:50,691 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 315 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:31:50,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:31:50,692 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:31:50,692 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 383 with the following transitions: [2018-11-12 18:31:50,692 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [679], [683], [687], [691], [694], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:31:50,694 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:31:50,695 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:31:50,734 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:31:51,061 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 18:31:51,062 INFO L272 AbstractInterpreter]: Visited 130 different actions 514 times. Merged at 8 different actions 30 times. Never widened. Performed 5783 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5783 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 6 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-12 18:31:51,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:31:51,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 18:31:51,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:31:51,070 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 18:31:51,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:31:51,083 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 18:31:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:31:51,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 18:32:04,139 WARN L179 SmtUtils]: Spent 12.55 s on a formula simplification. DAG size of input: 179 DAG size of output: 47 [2018-11-12 18:32:04,763 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 391 proven. 2 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-12 18:32:04,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 18:32:05,572 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-12 18:32:06,156 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:06,265 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 118 [2018-11-12 18:32:07,208 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 5171 disjunctions. This might take some time... [2018-11-12 18:32:07,261 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 22 disjunctions. [2018-11-12 18:32:07,466 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 35 [2018-11-12 18:32:07,470 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:07,519 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:07,572 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:07,637 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:07,687 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:07,734 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:07,783 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:07,964 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:08,042 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:08,113 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:08,161 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:08,208 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:08,259 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:08,305 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:08,396 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:08,447 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:08,556 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:08,608 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:08,656 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:08,745 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:09,173 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:09,593 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:09,908 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:09,965 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:10,012 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:10,063 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:10,110 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:10,235 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:10,284 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:10,333 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:10,384 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:10,456 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:10,505 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:10,554 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:10,603 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:10,654 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:10,704 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:10,756 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:10,830 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:10,879 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:10,931 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:10,983 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:11,052 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:11,105 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:11,158 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:11,206 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:11,258 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:11,306 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:11,355 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:11,410 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:11,455 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:11,506 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:11,557 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:11,607 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:11,694 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:11,743 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:12,158 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:12,213 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:12,258 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:12,305 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:12,354 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:12,412 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:12,462 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:12,512 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:12,562 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:12,615 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:12,688 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:12,820 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:12,870 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:12,955 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:13,001 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:13,052 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:13,101 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:13,149 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:13,196 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:13,324 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:13,375 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:13,423 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:13,477 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:13,528 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:13,577 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:13,622 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:13,672 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:13,718 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:13,765 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:13,832 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:14,144 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:14,192 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:14,238 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:14,287 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:14,332 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:14,379 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:14,740 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:14,797 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:14,866 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:14,929 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:15,007 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:15,077 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:15,144 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:15,191 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:15,237 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:15,282 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:15,352 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:15,397 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:15,444 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:15,492 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:15,551 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:15,597 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:32:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 189 proven. 261 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 18:32:16,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 18:32:16,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8, 8] total 28 [2018-11-12 18:32:16,275 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 18:32:16,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-12 18:32:16,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-12 18:32:16,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2018-11-12 18:32:16,279 INFO L87 Difference]: Start difference. First operand 4406 states and 4934 transitions. Second operand 23 states. [2018-11-12 18:32:18,253 WARN L179 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 43 [2018-11-12 18:32:31,797 WARN L179 SmtUtils]: Spent 12.18 s on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2018-11-12 18:32:33,052 WARN L179 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2018-11-12 18:32:37,167 WARN L179 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2018-11-12 18:32:37,893 WARN L179 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 41 [2018-11-12 18:32:41,041 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 39 [2018-11-12 18:32:41,890 WARN L179 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-11-12 18:32:43,258 WARN L179 SmtUtils]: Spent 804.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 34 [2018-11-12 18:32:46,308 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2018-11-12 18:32:54,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:32:54,678 INFO L93 Difference]: Finished difference Result 12347 states and 14676 transitions. [2018-11-12 18:32:54,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-11-12 18:32:54,679 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 382 [2018-11-12 18:32:54,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:32:54,702 INFO L225 Difference]: With dead ends: 12347 [2018-11-12 18:32:54,703 INFO L226 Difference]: Without dead ends: 7441 [2018-11-12 18:32:54,720 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 902 GetRequests, 669 SyntacticMatches, 113 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7184 ImplicationChecksByTransitivity, 44.2s TimeCoverageRelationStatistics Valid=2724, Invalid=12038, Unknown=0, NotChecked=0, Total=14762 [2018-11-12 18:32:54,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7441 states. [2018-11-12 18:32:54,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7441 to 5896. [2018-11-12 18:32:54,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5896 states. [2018-11-12 18:32:54,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5896 states to 5896 states and 6621 transitions. [2018-11-12 18:32:54,900 INFO L78 Accepts]: Start accepts. Automaton has 5896 states and 6621 transitions. Word has length 382 [2018-11-12 18:32:54,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:32:54,901 INFO L480 AbstractCegarLoop]: Abstraction has 5896 states and 6621 transitions. [2018-11-12 18:32:54,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-12 18:32:54,901 INFO L276 IsEmpty]: Start isEmpty. Operand 5896 states and 6621 transitions. [2018-11-12 18:32:54,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-11-12 18:32:54,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:32:54,921 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:32:54,922 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:32:54,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:32:54,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1553693176, now seen corresponding path program 1 times [2018-11-12 18:32:54,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:32:54,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:32:54,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:32:54,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:32:54,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:32:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:32:55,276 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-11-12 18:32:55,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:32:55,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 18:32:55,277 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:32:55,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 18:32:55,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 18:32:55,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 18:32:55,278 INFO L87 Difference]: Start difference. First operand 5896 states and 6621 transitions. Second operand 4 states. [2018-11-12 18:32:56,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:32:56,311 INFO L93 Difference]: Finished difference Result 10878 states and 12280 transitions. [2018-11-12 18:32:56,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 18:32:56,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 396 [2018-11-12 18:32:56,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:32:56,312 INFO L225 Difference]: With dead ends: 10878 [2018-11-12 18:32:56,313 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 18:32:56,323 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 18:32:56,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 18:32:56,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 18:32:56,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 18:32:56,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 18:32:56,324 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 396 [2018-11-12 18:32:56,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:32:56,325 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 18:32:56,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 18:32:56,325 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 18:32:56,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 18:32:56,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 18:32:56,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:56,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,154 WARN L179 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 273 [2018-11-12 18:32:57,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:32:57,531 WARN L179 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 218 [2018-11-12 18:32:58,200 WARN L179 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 30 [2018-11-12 18:32:59,526 WARN L179 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 94 DAG size of output: 47 [2018-11-12 18:33:03,350 WARN L179 SmtUtils]: Spent 3.81 s on a formula simplification. DAG size of input: 378 DAG size of output: 78 [2018-11-12 18:33:04,297 WARN L179 SmtUtils]: Spent 920.00 ms on a formula simplification. DAG size of input: 286 DAG size of output: 71 [2018-11-12 18:33:05,058 WARN L179 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 79 [2018-11-12 18:33:05,061 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 18:33:05,062 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a19~0 |old(~a19~0)|) (= |old(~a10~0)| ~a10~0) (= ~a1~0 |old(~a1~0)|)) [2018-11-12 18:33:05,062 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 18:33:05,062 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-11-12 18:33:05,062 INFO L425 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,062 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,062 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,062 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,062 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,062 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,062 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-11-12 18:33:05,062 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-11-12 18:33:05,063 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-12 18:33:05,063 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-12 18:33:05,063 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-12 18:33:05,063 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-12 18:33:05,063 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-12 18:33:05,063 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-12 18:33:05,063 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-11-12 18:33:05,063 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-11-12 18:33:05,063 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-11-12 18:33:05,063 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,063 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,063 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,063 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,064 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,064 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-11-12 18:33:05,064 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-11-12 18:33:05,064 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-11-12 18:33:05,064 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-11-12 18:33:05,064 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-12 18:33:05,064 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-12 18:33:05,064 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-12 18:33:05,064 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-12 18:33:05,064 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-12 18:33:05,064 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-11-12 18:33:05,064 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-11-12 18:33:05,065 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-11-12 18:33:05,065 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-11-12 18:33:05,065 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-11-12 18:33:05,065 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,065 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,065 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,065 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,065 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,065 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-11-12 18:33:05,065 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-12 18:33:05,065 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-12 18:33:05,065 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-12 18:33:05,065 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-12 18:33:05,066 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-12 18:33:05,066 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-11-12 18:33:05,066 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-11-12 18:33:05,066 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-11-12 18:33:05,066 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-11-12 18:33:05,066 INFO L425 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,066 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,066 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,066 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,066 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,066 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-11-12 18:33:05,067 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-11-12 18:33:05,067 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-11-12 18:33:05,067 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-12 18:33:05,067 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-12 18:33:05,067 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-12 18:33:05,067 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-12 18:33:05,067 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-12 18:33:05,067 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-11-12 18:33:05,067 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-11-12 18:33:05,068 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-11-12 18:33:05,068 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-11-12 18:33:05,068 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-11-12 18:33:05,068 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,068 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,068 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,068 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,068 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,068 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-12 18:33:05,068 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-12 18:33:05,069 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-12 18:33:05,069 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-12 18:33:05,069 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-12 18:33:05,069 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-11-12 18:33:05,069 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-11-12 18:33:05,069 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-11-12 18:33:05,069 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-11-12 18:33:05,069 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,069 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,069 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,069 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,069 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,070 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,070 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,070 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-11-12 18:33:05,070 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-11-12 18:33:05,070 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-11-12 18:33:05,070 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-11-12 18:33:05,070 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-12 18:33:05,070 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-12 18:33:05,070 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-12 18:33:05,070 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-12 18:33:05,070 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-12 18:33:05,070 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-11-12 18:33:05,070 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-11-12 18:33:05,070 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-11-12 18:33:05,070 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-11-12 18:33:05,071 INFO L425 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,071 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,071 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,071 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,071 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-12 18:33:05,071 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,071 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,071 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-11-12 18:33:05,071 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-11-12 18:33:05,071 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-11-12 18:33:05,071 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-12 18:33:05,071 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-12 18:33:05,071 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-12 18:33:05,072 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-12 18:33:05,072 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-12 18:33:05,072 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-12 18:33:05,072 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-11-12 18:33:05,072 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-11-12 18:33:05,072 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-11-12 18:33:05,072 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-11-12 18:33:05,072 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,072 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,073 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,073 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,073 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,073 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,073 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-11-12 18:33:05,073 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-11-12 18:33:05,073 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-11-12 18:33:05,073 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-12 18:33:05,073 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-12 18:33:05,073 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-12 18:33:05,074 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-12 18:33:05,074 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-12 18:33:05,074 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-12 18:33:05,074 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-11-12 18:33:05,074 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-11-12 18:33:05,074 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse17 (= 9 |old(~a19~0)|))) (let ((.cse5 (= ~a19~0 |old(~a19~0)|)) (.cse12 (= |old(~a19~0)| ~a19~0)) (.cse6 (= |old(~a10~0)| ~a10~0)) (.cse1 (= ~a1~0 |old(~a1~0)|)) (.cse11 (< 6 |calculate_output_#in~input|)) (.cse13 (< |calculate_output_#in~input| 2)) (.cse7 (= 1 |old(~a10~0)|)) (.cse2 (not (= 14 ~a4~0))) (.cse3 (not (= 0 ~a12~0))) (.cse4 (not .cse17))) (let ((.cse0 (or .cse11 .cse13 (and (or .cse2 .cse3 .cse4 (not (= 23 |old(~a1~0)|)) (not (= 0 |old(~a10~0)|))) (or (not .cse7) .cse2 .cse3 .cse4)))) (.cse10 (and .cse12 .cse6 .cse1)) (.cse8 (< 8 |old(~a19~0)|)) (.cse9 (= 6 |old(~a19~0)|)) (.cse15 (= 8 |old(~a19~0)|)) (.cse16 (= 3 |old(~a10~0)|)) (.cse14 (and .cse5 .cse6 .cse1))) (and (or .cse0 (and .cse1 (= 9 ~a19~0))) (or .cse2 .cse3 .cse4 (and .cse1 .cse5 .cse6) .cse7) (or .cse8 .cse9 .cse10 .cse7) (or (= ~a10~0 |old(~a10~0)|) .cse0) (or .cse11 (and .cse1 .cse12 .cse6) (< |old(~a1~0)| 23) .cse13 .cse2 (< 1 |old(~a10~0)|) (< 2147483647 |old(~a1~0)|) .cse3 (< |old(~a19~0)| 8)) (or .cse8 .cse2 .cse3 (<= (+ |old(~a1~0)| 13) 0) .cse14 .cse7) (or .cse10 .cse8 .cse9 .cse15) (or .cse16 (or .cse2 .cse3 .cse17 .cse9 .cse15) .cse14) (or .cse16 .cse14 .cse2 .cse3 .cse7))))) [2018-11-12 18:33:05,074 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-11-12 18:33:05,075 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-11-12 18:33:05,075 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-11-12 18:33:05,075 INFO L425 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,075 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,075 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,075 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,075 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,075 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,075 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-11-12 18:33:05,075 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-12 18:33:05,075 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-12 18:33:05,076 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-12 18:33:05,076 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-12 18:33:05,076 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-12 18:33:05,076 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-12 18:33:05,076 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 187) no Hoare annotation was computed. [2018-11-12 18:33:05,076 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-11-12 18:33:05,076 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-11-12 18:33:05,076 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-11-12 18:33:05,076 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-11-12 18:33:05,076 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-11-12 18:33:05,077 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-11-12 18:33:05,077 INFO L425 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,077 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,077 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,077 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,077 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,077 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,077 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-11-12 18:33:05,077 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-11-12 18:33:05,077 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-11-12 18:33:05,078 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-12 18:33:05,078 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-12 18:33:05,078 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-12 18:33:05,078 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-12 18:33:05,078 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-12 18:33:05,078 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-12 18:33:05,078 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-11-12 18:33:05,078 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-11-12 18:33:05,078 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-11-12 18:33:05,078 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,079 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,079 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,079 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,079 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,079 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:33:05,079 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-11-12 18:33:05,079 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-11-12 18:33:05,079 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-11-12 18:33:05,079 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-12 18:33:05,079 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-12 18:33:05,079 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-12 18:33:05,079 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-12 18:33:05,079 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-12 18:33:05,080 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-12 18:33:05,080 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-11-12 18:33:05,080 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-11-12 18:33:05,080 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-11-12 18:33:05,080 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 18:33:05,080 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~inputF~0 6) (= ~inputC~0 3) (= ~a10~0 0) (= ~a12~0 0) (= ~inputB~0 2) (= ~a1~0 23) (= ~inputE~0 5) (= ~a4~0 14) (= ~inputD~0 4) (= 9 ~a19~0)) [2018-11-12 18:33:05,080 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 18:33:05,080 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 18:33:05,081 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (not (= |old(~a1~0)| 23)) (not (= 0 ~a12~0)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= 3 ~inputC~0)) (not (= ~a4~0 14)) (and (= ~a10~0 |old(~a10~0)|) (= ~a1~0 23) (= ~a19~0 |old(~a19~0)|)) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)) (not (= ~inputF~0 6)) (not (= |old(~a10~0)| 0))) [2018-11-12 18:33:05,081 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-11-12 18:33:05,081 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse1 (not (= ~a10~0 1))) (.cse3 (not (= 3 ~a10~0))) (.cse4 (<= main_~input~0 6)) (.cse5 (<= 2 main_~input~0)) (.cse2 (= 9 ~a19~0)) (.cse6 (not (= ~a19~0 6))) (.cse7 (not (= ~a19~0 8))) (.cse0 (<= ~a19~0 8))) (or (and .cse0 (< 0 (+ ~a1~0 13)) .cse1) (and .cse1 .cse2) (and .cse1 .cse3) (not (= |old(~a1~0)| 23)) (not (= ~inputF~0 6)) (not (= |old(~a10~0)| 0)) (and (<= 23 ~a1~0) .cse4 (<= ~a1~0 2147483647) (<= 7 ~a19~0) (<= ~a10~0 2) .cse5) (and (= 8 ~a19~0) .cse1) (not (= ~a12~0 0)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= 14 ~a4~0)) (not (= 3 ~inputC~0)) (and .cse6 .cse7 (not (= ~a19~0 9)) .cse3) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)) (and (and .cse4 .cse5) .cse2) (and .cse6 .cse7 .cse0))) [2018-11-12 18:33:05,081 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-11-12 18:33:05,081 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-11-12 18:33:05,081 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-11-12 18:33:05,082 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse1 (not (= ~a10~0 1))) (.cse2 (not (= 3 ~a10~0))) (.cse3 (not (= ~a19~0 6))) (.cse4 (not (= ~a19~0 8))) (.cse0 (<= ~a19~0 8))) (or (and .cse0 (< 0 (+ ~a1~0 13)) .cse1) (= 9 ~a19~0) (and .cse1 .cse2) (not (= |old(~a1~0)| 23)) (and (<= 23 ~a1~0) (<= ~a1~0 2147483647) (<= 7 ~a19~0) (<= ~a10~0 2)) (not (= ~inputF~0 6)) (not (= |old(~a10~0)| 0)) (and (= 8 ~a19~0) .cse1) (not (= ~a12~0 0)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= 14 ~a4~0)) (not (= 3 ~inputC~0)) (and .cse3 .cse4 .cse2) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)) (and .cse3 .cse4 .cse0))) [2018-11-12 18:33:05,082 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-11-12 18:33:05,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:33:05 BoogieIcfgContainer [2018-11-12 18:33:05,095 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 18:33:05,096 INFO L168 Benchmark]: Toolchain (without parser) took 185355.43 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2018-11-12 18:33:05,097 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 18:33:05,098 INFO L168 Benchmark]: CACSL2BoogieTranslator took 697.72 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-12 18:33:05,099 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.98 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 18:33:05,099 INFO L168 Benchmark]: Boogie Preprocessor took 233.43 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.3 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-11-12 18:33:05,100 INFO L168 Benchmark]: RCFGBuilder took 3285.69 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 122.6 MB). Peak memory consumption was 122.6 MB. Max. memory is 7.1 GB. [2018-11-12 18:33:05,101 INFO L168 Benchmark]: TraceAbstraction took 181089.62 ms. Allocated memory was 2.2 GB in the beginning and 3.9 GB in the end (delta: 1.7 GB). Free memory was 2.0 GB in the beginning and 2.7 GB in the end (delta: -626.8 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2018-11-12 18:33:05,106 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.25 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 697.72 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.98 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 233.43 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.3 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3285.69 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 122.6 MB). Peak memory consumption was 122.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 181089.62 ms. Allocated memory was 2.2 GB in the beginning and 3.9 GB in the end (delta: 1.7 GB). Free memory was 2.0 GB in the beginning and 2.7 GB in the end (delta: -626.8 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 187]: 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: 582]: Loop Invariant Derived loop invariant: (((((((((((((((((a19 <= 8 && 0 < a1 + 13) && !(a10 == 1)) || 9 == a19) || (!(a10 == 1) && !(3 == a10))) || !(\old(a1) == 23)) || (((23 <= a1 && a1 <= 2147483647) && 7 <= a19) && a10 <= 2)) || !(inputF == 6)) || !(\old(a10) == 0)) || (8 == a19 && !(a10 == 1))) || !(a12 == 0)) || !(4 == inputD)) || !(inputE == 5)) || !(14 == a4)) || !(3 == inputC)) || ((!(a19 == 6) && !(a19 == 8)) && !(3 == a10))) || !(2 == inputB)) || !(\old(a19) == 9)) || ((!(a19 == 6) && !(a19 == 8)) && a19 <= 8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 180.9s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 125.2s AutomataDifference, 0.0s DeadEndRemovalTime, 8.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1418 SDtfs, 16512 SDslu, 2493 SDs, 0 SdLazy, 27745 SolverSat, 3976 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46.1s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 3235 GetRequests, 2805 SyntacticMatches, 121 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8625 ImplicationChecksByTransitivity, 50.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7101occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.4s AbstIntTime, 7 AbstIntIterations, 5 AbstIntStrong, 0.9971633975783297 AbsIntWeakeningRatio, 0.09454061251664447 AbsIntAvgWeakeningVarsNumRemoved, 18.914780292942744 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 2677 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 175 PreInvPairs, 277 NumberOfFragments, 652 HoareAnnotationTreeSize, 175 FomulaSimplifications, 20648 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 20967 FormulaSimplificationTreeSizeReductionInter, 7.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 32.8s InterpolantComputationTime, 3810 NumberOfCodeBlocks, 3810 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 4523 ConstructedInterpolants, 126 QuantifiedInterpolants, 12406340 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1146 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 3868/4658 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...