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_label27_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 20:02:56,497 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 20:02:56,500 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 20:02:56,516 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 20:02:56,516 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 20:02:56,518 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 20:02:56,520 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 20:02:56,523 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 20:02:56,525 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 20:02:56,532 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 20:02:56,533 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 20:02:56,533 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 20:02:56,536 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 20:02:56,537 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 20:02:56,538 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 20:02:56,541 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 20:02:56,542 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 20:02:56,543 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 20:02:56,545 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 20:02:56,548 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 20:02:56,550 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 20:02:56,551 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 20:02:56,559 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 20:02:56,560 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 20:02:56,560 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 20:02:56,562 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 20:02:56,562 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 20:02:56,564 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 20:02:56,565 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 20:02:56,566 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 20:02:56,566 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 20:02:56,567 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 20:02:56,567 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 20:02:56,567 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 20:02:56,570 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 20:02:56,571 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 20:02:56,572 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-07 20:02:56,601 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 20:02:56,601 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 20:02:56,602 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 20:02:56,602 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 20:02:56,602 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 20:02:56,602 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 20:02:56,603 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 20:02:56,604 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 20:02:56,604 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 20:02:56,604 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 20:02:56,604 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 20:02:56,604 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 20:02:56,605 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 20:02:56,605 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 20:02:56,607 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 20:02:56,607 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 20:02:56,607 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 20:02:56,607 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 20:02:56,608 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 20:02:56,608 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 20:02:56,608 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 20:02:56,608 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 20:02:56,608 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 20:02:56,608 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 20:02:56,610 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 20:02:56,610 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:02:56,610 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 20:02:56,610 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 20:02:56,610 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 20:02:56,610 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 20:02:56,611 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 20:02:56,611 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 20:02:56,611 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 20:02:56,611 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 20:02:56,611 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 20:02:56,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 20:02:56,669 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 20:02:56,673 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 20:02:56,674 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 20:02:56,675 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 20:02:56,676 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label27_true-unreach-call.c [2018-11-07 20:02:56,744 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a26af8cdc/025e6437f307410db1ca48d384f45edd/FLAG5c39a3a5d [2018-11-07 20:02:57,309 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 20:02:57,314 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label27_true-unreach-call.c [2018-11-07 20:02:57,331 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a26af8cdc/025e6437f307410db1ca48d384f45edd/FLAG5c39a3a5d [2018-11-07 20:02:57,348 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a26af8cdc/025e6437f307410db1ca48d384f45edd [2018-11-07 20:02:57,359 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 20:02:57,361 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 20:02:57,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 20:02:57,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 20:02:57,366 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 20:02:57,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:02:57" (1/1) ... [2018-11-07 20:02:57,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d09a698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:57, skipping insertion in model container [2018-11-07 20:02:57,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:02:57" (1/1) ... [2018-11-07 20:02:57,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 20:02:57,456 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 20:02:57,970 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:02:57,975 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 20:02:58,103 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:02:58,124 INFO L193 MainTranslator]: Completed translation [2018-11-07 20:02:58,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:58 WrapperNode [2018-11-07 20:02:58,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 20:02:58,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 20:02:58,127 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 20:02:58,127 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 20:02:58,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:58" (1/1) ... [2018-11-07 20:02:58,245 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:58" (1/1) ... [2018-11-07 20:02:58,261 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 20:02:58,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 20:02:58,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 20:02:58,262 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 20:02:58,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:58" (1/1) ... [2018-11-07 20:02:58,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:58" (1/1) ... [2018-11-07 20:02:58,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:58" (1/1) ... [2018-11-07 20:02:58,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:58" (1/1) ... [2018-11-07 20:02:58,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:58" (1/1) ... [2018-11-07 20:02:58,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:58" (1/1) ... [2018-11-07 20:02:58,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:58" (1/1) ... [2018-11-07 20:02:58,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 20:02:58,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 20:02:58,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 20:02:58,399 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 20:02:58,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:02:58,473 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 20:02:58,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 20:02:58,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 20:02:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 20:02:58,474 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 20:02:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 20:02:58,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 20:02:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 20:02:58,475 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 20:03:01,590 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 20:03:01,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:03:01 BoogieIcfgContainer [2018-11-07 20:03:01,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 20:03:01,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 20:03:01,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 20:03:01,596 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 20:03:01,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:02:57" (1/3) ... [2018-11-07 20:03:01,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab27b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:03:01, skipping insertion in model container [2018-11-07 20:03:01,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:58" (2/3) ... [2018-11-07 20:03:01,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab27b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:03:01, skipping insertion in model container [2018-11-07 20:03:01,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:03:01" (3/3) ... [2018-11-07 20:03:01,600 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label27_true-unreach-call.c [2018-11-07 20:03:01,610 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 20:03:01,618 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 20:03:01,633 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 20:03:01,672 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 20:03:01,672 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 20:03:01,672 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 20:03:01,672 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 20:03:01,672 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 20:03:01,673 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 20:03:01,673 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 20:03:01,673 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 20:03:01,701 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-07 20:03:01,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-07 20:03:01,712 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:03:01,713 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] [2018-11-07 20:03:01,716 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:03:01,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:03:01,723 INFO L82 PathProgramCache]: Analyzing trace with hash 51771233, now seen corresponding path program 1 times [2018-11-07 20:03:01,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:03:01,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:03:01,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:03:01,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:03:01,778 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:03:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:03:02,282 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 5 [2018-11-07 20:03:02,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:03:02,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:03:02,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:03:02,361 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:03:02,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:03:02,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:03:02,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:03:02,387 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 4 states. [2018-11-07 20:03:04,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:03:04,963 INFO L93 Difference]: Finished difference Result 737 states and 1298 transitions. [2018-11-07 20:03:04,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:03:04,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-11-07 20:03:04,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:03:04,986 INFO L225 Difference]: With dead ends: 737 [2018-11-07 20:03:04,986 INFO L226 Difference]: Without dead ends: 515 [2018-11-07 20:03:04,995 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:03:05,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-11-07 20:03:05,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 356. [2018-11-07 20:03:05,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-07 20:03:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 613 transitions. [2018-11-07 20:03:05,107 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 613 transitions. Word has length 67 [2018-11-07 20:03:05,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:03:05,108 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 613 transitions. [2018-11-07 20:03:05,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:03:05,109 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 613 transitions. [2018-11-07 20:03:05,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-07 20:03:05,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:03:05,120 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:03:05,121 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:03:05,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:03:05,122 INFO L82 PathProgramCache]: Analyzing trace with hash -316431117, now seen corresponding path program 1 times [2018-11-07 20:03:05,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:03:05,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:03:05,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:03:05,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:03:05,124 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:03:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:03:05,544 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 20:03:05,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:03:05,544 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:03:05,546 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 139 with the following transitions: [2018-11-07 20:03:05,548 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], [437], [439], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 20:03:05,593 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:03:05,593 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:03:06,100 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:03:06,501 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:03:06,503 INFO L272 AbstractInterpreter]: Visited 78 different actions 221 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:03:06,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:03:06,556 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:03:07,015 INFO L227 lantSequenceWeakener]: Weakened 66 states. On average, predicates are now at 76.69% of their original sizes. [2018-11-07 20:03:07,015 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:03:08,007 INFO L415 sIntCurrentIteration]: We unified 137 AI predicates to 137 [2018-11-07 20:03:08,008 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:03:08,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:03:08,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [4] total 19 [2018-11-07 20:03:08,009 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:03:08,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 20:03:08,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 20:03:08,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-11-07 20:03:08,012 INFO L87 Difference]: Start difference. First operand 356 states and 613 transitions. Second operand 17 states. [2018-11-07 20:03:34,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:03:34,483 INFO L93 Difference]: Finished difference Result 1453 states and 2646 transitions. [2018-11-07 20:03:34,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 20:03:34,484 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 138 [2018-11-07 20:03:34,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:03:34,491 INFO L225 Difference]: With dead ends: 1453 [2018-11-07 20:03:34,492 INFO L226 Difference]: Without dead ends: 1103 [2018-11-07 20:03:34,496 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 157 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=254, Invalid=1078, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 20:03:34,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2018-11-07 20:03:34,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 945. [2018-11-07 20:03:34,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2018-11-07 20:03:34,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1252 transitions. [2018-11-07 20:03:34,570 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1252 transitions. Word has length 138 [2018-11-07 20:03:34,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:03:34,571 INFO L480 AbstractCegarLoop]: Abstraction has 945 states and 1252 transitions. [2018-11-07 20:03:34,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 20:03:34,571 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1252 transitions. [2018-11-07 20:03:34,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-07 20:03:34,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:03:34,588 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, 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-07 20:03:34,589 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:03:34,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:03:34,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1879326070, now seen corresponding path program 1 times [2018-11-07 20:03:34,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:03:34,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:03:34,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:03:34,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:03:34,591 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:03:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:03:34,887 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-07 20:03:34,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:03:34,888 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:03:34,888 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 215 with the following transitions: [2018-11-07 20:03:34,888 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], [437], [439], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 20:03:34,893 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:03:34,893 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:03:34,970 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:03:35,555 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:03:35,555 INFO L272 AbstractInterpreter]: Visited 84 different actions 324 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 20:03:35,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:03:35,590 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:03:35,906 INFO L227 lantSequenceWeakener]: Weakened 71 states. On average, predicates are now at 76.38% of their original sizes. [2018-11-07 20:03:35,906 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:03:36,522 INFO L415 sIntCurrentIteration]: We unified 213 AI predicates to 213 [2018-11-07 20:03:36,522 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:03:36,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:03:36,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [4] total 21 [2018-11-07 20:03:36,523 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:03:36,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 20:03:36,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 20:03:36,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-11-07 20:03:36,525 INFO L87 Difference]: Start difference. First operand 945 states and 1252 transitions. Second operand 19 states. [2018-11-07 20:03:53,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:03:53,041 INFO L93 Difference]: Finished difference Result 2366 states and 3361 transitions. [2018-11-07 20:03:53,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 20:03:53,041 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 214 [2018-11-07 20:03:53,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:03:53,052 INFO L225 Difference]: With dead ends: 2366 [2018-11-07 20:03:53,052 INFO L226 Difference]: Without dead ends: 1721 [2018-11-07 20:03:53,056 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 224 GetRequests, 191 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2018-11-07 20:03:53,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2018-11-07 20:03:53,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1620. [2018-11-07 20:03:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1620 states. [2018-11-07 20:03:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 1992 transitions. [2018-11-07 20:03:53,119 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 1992 transitions. Word has length 214 [2018-11-07 20:03:53,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:03:53,120 INFO L480 AbstractCegarLoop]: Abstraction has 1620 states and 1992 transitions. [2018-11-07 20:03:53,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 20:03:53,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 1992 transitions. [2018-11-07 20:03:53,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-07 20:03:53,125 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:03:53,126 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, 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] [2018-11-07 20:03:53,126 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:03:53,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:03:53,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1449875099, now seen corresponding path program 1 times [2018-11-07 20:03:53,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:03:53,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:03:53,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:03:53,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:03:53,128 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:03:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:03:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 121 proven. 6 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-07 20:03:53,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:03:53,439 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:03:53,439 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 230 with the following transitions: [2018-11-07 20:03:53,440 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], [437], [439], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [542], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 20:03:53,443 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:03:53,443 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:03:53,506 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:03:53,808 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:03:53,808 INFO L272 AbstractInterpreter]: Visited 90 different actions 528 times. Merged at 7 different actions 43 times. Widened at 1 different actions 2 times. Found 6 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 20:03:53,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:03:53,815 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:03:54,047 INFO L227 lantSequenceWeakener]: Weakened 226 states. On average, predicates are now at 73.65% of their original sizes. [2018-11-07 20:03:54,047 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:03:54,139 INFO L415 sIntCurrentIteration]: We unified 228 AI predicates to 228 [2018-11-07 20:03:54,140 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:03:54,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:03:54,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2018-11-07 20:03:54,140 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:03:54,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 20:03:54,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 20:03:54,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 20:03:54,141 INFO L87 Difference]: Start difference. First operand 1620 states and 1992 transitions. Second operand 10 states. [2018-11-07 20:03:59,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:03:59,790 INFO L93 Difference]: Finished difference Result 2861 states and 3953 transitions. [2018-11-07 20:03:59,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 20:03:59,790 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 229 [2018-11-07 20:03:59,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:03:59,801 INFO L225 Difference]: With dead ends: 2861 [2018-11-07 20:03:59,802 INFO L226 Difference]: Without dead ends: 2063 [2018-11-07 20:03:59,806 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 236 GetRequests, 220 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-07 20:03:59,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2018-11-07 20:03:59,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 2045. [2018-11-07 20:03:59,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2045 states. [2018-11-07 20:03:59,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 2595 transitions. [2018-11-07 20:03:59,875 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 2595 transitions. Word has length 229 [2018-11-07 20:03:59,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:03:59,876 INFO L480 AbstractCegarLoop]: Abstraction has 2045 states and 2595 transitions. [2018-11-07 20:03:59,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 20:03:59,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 2595 transitions. [2018-11-07 20:03:59,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-11-07 20:03:59,883 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:03:59,883 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, 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] [2018-11-07 20:03:59,883 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:03:59,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:03:59,884 INFO L82 PathProgramCache]: Analyzing trace with hash -631074681, now seen corresponding path program 1 times [2018-11-07 20:03:59,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:03:59,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:03:59,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:03:59,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:03:59,885 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:03:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:04:00,199 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:04:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 121 proven. 6 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-07 20:04:00,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:04:00,289 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:04:00,289 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 236 with the following transitions: [2018-11-07 20:04:00,289 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], [437], [439], [442], [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], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 20:04:00,293 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:04:00,293 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:04:00,333 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:04:00,547 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:04:00,547 INFO L272 AbstractInterpreter]: Visited 96 different actions 377 times. Merged at 7 different actions 26 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 20:04:00,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:00,562 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:04:00,793 INFO L227 lantSequenceWeakener]: Weakened 232 states. On average, predicates are now at 75.93% of their original sizes. [2018-11-07 20:04:00,793 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:04:01,142 INFO L415 sIntCurrentIteration]: We unified 234 AI predicates to 234 [2018-11-07 20:04:01,143 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:04:01,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:04:01,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2018-11-07 20:04:01,143 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:04:01,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 20:04:01,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 20:04:01,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 20:04:01,144 INFO L87 Difference]: Start difference. First operand 2045 states and 2595 transitions. Second operand 11 states. [2018-11-07 20:04:12,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:04:12,481 INFO L93 Difference]: Finished difference Result 6267 states and 9095 transitions. [2018-11-07 20:04:12,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 20:04:12,481 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 235 [2018-11-07 20:04:12,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:04:12,504 INFO L225 Difference]: With dead ends: 6267 [2018-11-07 20:04:12,504 INFO L226 Difference]: Without dead ends: 4522 [2018-11-07 20:04:12,514 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 246 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-11-07 20:04:12,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4522 states. [2018-11-07 20:04:12,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4522 to 3646. [2018-11-07 20:04:12,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3646 states. [2018-11-07 20:04:12,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3646 states to 3646 states and 4890 transitions. [2018-11-07 20:04:12,635 INFO L78 Accepts]: Start accepts. Automaton has 3646 states and 4890 transitions. Word has length 235 [2018-11-07 20:04:12,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:04:12,636 INFO L480 AbstractCegarLoop]: Abstraction has 3646 states and 4890 transitions. [2018-11-07 20:04:12,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 20:04:12,636 INFO L276 IsEmpty]: Start isEmpty. Operand 3646 states and 4890 transitions. [2018-11-07 20:04:12,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-11-07 20:04:12,652 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:04:12,653 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:04:12,653 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:04:12,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:12,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1622013747, now seen corresponding path program 1 times [2018-11-07 20:04:12,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:04:12,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:12,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:04:12,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:12,655 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:04:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:04:13,305 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 256 proven. 72 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-07 20:04:13,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:04:13,306 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:04:13,306 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 347 with the following transitions: [2018-11-07 20:04:13,307 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], [437], [439], [442], [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], [695], [699], [703], [707], [711], [715], [718], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 20:04:13,311 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:04:13,311 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:04:13,359 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:04:13,878 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:04:13,878 INFO L272 AbstractInterpreter]: Visited 136 different actions 804 times. Merged at 8 different actions 48 times. Widened at 1 different actions 2 times. Found 10 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 20:04:13,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:13,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:04:13,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:04:13,885 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 20:04:13,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:04:13,896 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:04:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:04:14,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:04:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 343 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-07 20:04:14,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:04:15,155 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 256 proven. 72 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-07 20:04:15,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 20:04:15,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 15 [2018-11-07 20:04:15,177 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 20:04:15,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 20:04:15,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 20:04:15,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-11-07 20:04:15,179 INFO L87 Difference]: Start difference. First operand 3646 states and 4890 transitions. Second operand 14 states. [2018-11-07 20:04:15,441 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2018-11-07 20:04:17,343 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2018-11-07 20:04:22,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:04:22,971 INFO L93 Difference]: Finished difference Result 11238 states and 16477 transitions. [2018-11-07 20:04:22,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 20:04:22,971 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 346 [2018-11-07 20:04:22,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:04:22,989 INFO L225 Difference]: With dead ends: 11238 [2018-11-07 20:04:22,990 INFO L226 Difference]: Without dead ends: 3400 [2018-11-07 20:04:23,040 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 705 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=335, Invalid=925, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 20:04:23,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2018-11-07 20:04:23,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 2546. [2018-11-07 20:04:23,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2546 states. [2018-11-07 20:04:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3121 transitions. [2018-11-07 20:04:23,152 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3121 transitions. Word has length 346 [2018-11-07 20:04:23,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:04:23,152 INFO L480 AbstractCegarLoop]: Abstraction has 2546 states and 3121 transitions. [2018-11-07 20:04:23,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 20:04:23,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3121 transitions. [2018-11-07 20:04:23,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-11-07 20:04:23,164 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:04:23,165 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:04:23,165 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:04:23,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:23,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1140043392, now seen corresponding path program 1 times [2018-11-07 20:04:23,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:04:23,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:23,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:04:23,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:23,167 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:04:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:04:23,598 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 222 proven. 116 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-07 20:04:23,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:04:23,599 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:04:23,599 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 352 with the following transitions: [2018-11-07 20:04:23,599 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], [437], [439], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 20:04:23,602 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:04:23,602 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:04:23,801 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:04:24,155 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:04:24,155 INFO L272 AbstractInterpreter]: Visited 125 different actions 374 times. Merged at 8 different actions 21 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 20:04:24,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:24,191 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:04:24,705 INFO L227 lantSequenceWeakener]: Weakened 348 states. On average, predicates are now at 75.68% of their original sizes. [2018-11-07 20:04:24,705 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:04:25,515 INFO L415 sIntCurrentIteration]: We unified 350 AI predicates to 350 [2018-11-07 20:04:25,516 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:04:25,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:04:25,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-07 20:04:25,516 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:04:25,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 20:04:25,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 20:04:25,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 20:04:25,517 INFO L87 Difference]: Start difference. First operand 2546 states and 3121 transitions. Second operand 10 states. [2018-11-07 20:04:30,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:04:30,517 INFO L93 Difference]: Finished difference Result 4708 states and 5891 transitions. [2018-11-07 20:04:30,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 20:04:30,517 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 351 [2018-11-07 20:04:30,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:04:30,529 INFO L225 Difference]: With dead ends: 4708 [2018-11-07 20:04:30,529 INFO L226 Difference]: Without dead ends: 2754 [2018-11-07 20:04:30,534 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 358 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:04:30,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2754 states. [2018-11-07 20:04:30,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 2567. [2018-11-07 20:04:30,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2567 states. [2018-11-07 20:04:30,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2567 states and 3043 transitions. [2018-11-07 20:04:30,621 INFO L78 Accepts]: Start accepts. Automaton has 2567 states and 3043 transitions. Word has length 351 [2018-11-07 20:04:30,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:04:30,622 INFO L480 AbstractCegarLoop]: Abstraction has 2567 states and 3043 transitions. [2018-11-07 20:04:30,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 20:04:30,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 3043 transitions. [2018-11-07 20:04:30,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-11-07 20:04:30,633 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:04:30,634 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:04:30,634 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:04:30,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:30,635 INFO L82 PathProgramCache]: Analyzing trace with hash 2114818347, now seen corresponding path program 1 times [2018-11-07 20:04:30,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:04:30,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:30,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:04:30,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:30,636 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:04:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:04:31,449 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 370 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-07 20:04:31,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:04:31,450 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:04:31,450 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 383 with the following transitions: [2018-11-07 20:04:31,451 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], [437], [439], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [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], [695], [699], [703], [707], [711], [715], [718], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 20:04:31,454 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:04:31,455 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:04:31,544 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:04:31,845 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:04:31,846 INFO L272 AbstractInterpreter]: Visited 136 different actions 533 times. Merged at 8 different actions 25 times. Never widened. Found 6 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 20:04:31,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:31,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:04:31,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:04:31,854 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 20:04:31,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:04:31,863 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:04:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:04:31,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:04:32,126 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 370 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-07 20:04:32,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:04:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 370 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-07 20:04:32,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 20:04:32,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2018-11-07 20:04:32,414 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 20:04:32,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 20:04:32,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 20:04:32,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:04:32,416 INFO L87 Difference]: Start difference. First operand 2567 states and 3043 transitions. Second operand 7 states. [2018-11-07 20:04:34,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:04:34,355 INFO L93 Difference]: Finished difference Result 5619 states and 6807 transitions. [2018-11-07 20:04:34,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 20:04:34,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 382 [2018-11-07 20:04:34,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:04:34,370 INFO L225 Difference]: With dead ends: 5619 [2018-11-07 20:04:34,370 INFO L226 Difference]: Without dead ends: 3502 [2018-11-07 20:04:34,375 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 777 GetRequests, 764 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-11-07 20:04:34,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3502 states. [2018-11-07 20:04:34,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3502 to 3281. [2018-11-07 20:04:34,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3281 states. [2018-11-07 20:04:34,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 3281 states and 3845 transitions. [2018-11-07 20:04:34,472 INFO L78 Accepts]: Start accepts. Automaton has 3281 states and 3845 transitions. Word has length 382 [2018-11-07 20:04:34,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:04:34,473 INFO L480 AbstractCegarLoop]: Abstraction has 3281 states and 3845 transitions. [2018-11-07 20:04:34,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 20:04:34,473 INFO L276 IsEmpty]: Start isEmpty. Operand 3281 states and 3845 transitions. [2018-11-07 20:04:34,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-11-07 20:04:34,488 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:04:34,488 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:04:34,488 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:04:34,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:34,489 INFO L82 PathProgramCache]: Analyzing trace with hash -2021702222, now seen corresponding path program 1 times [2018-11-07 20:04:34,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:04:34,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:34,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:04:34,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:34,490 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:04:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:04:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-11-07 20:04:34,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:04:34,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:04:34,874 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:04:34,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:04:34,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:04:34,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:04:34,875 INFO L87 Difference]: Start difference. First operand 3281 states and 3845 transitions. Second operand 4 states. [2018-11-07 20:04:36,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:04:36,346 INFO L93 Difference]: Finished difference Result 6707 states and 8070 transitions. [2018-11-07 20:04:36,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:04:36,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 395 [2018-11-07 20:04:36,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:04:36,348 INFO L225 Difference]: With dead ends: 6707 [2018-11-07 20:04:36,348 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 20:04:36,357 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-07 20:04:36,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 20:04:36,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 20:04:36,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 20:04:36,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 20:04:36,358 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 395 [2018-11-07 20:04:36,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:04:36,358 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 20:04:36,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:04:36,359 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 20:04:36,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 20:04:36,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 20:04:36,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:36,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:36,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:36,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:36,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:36,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:36,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:36,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:36,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:36,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:37,143 WARN L179 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 256 [2018-11-07 20:04:37,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:37,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:37,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:37,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:37,428 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 186 [2018-11-07 20:04:37,886 WARN L179 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2018-11-07 20:04:38,674 WARN L179 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 47 [2018-11-07 20:04:44,961 WARN L179 SmtUtils]: Spent 6.26 s on a formula simplification. DAG size of input: 358 DAG size of output: 62 [2018-11-07 20:04:46,661 WARN L179 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 259 DAG size of output: 71 [2018-11-07 20:04:47,368 WARN L179 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 66 [2018-11-07 20:04:47,371 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 20:04:47,371 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a10~0 |old(~a10~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a1~0 |old(~a1~0)|)) [2018-11-07 20:04:47,371 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 20:04:47,372 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-11-07 20:04:47,372 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,372 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,372 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,372 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,372 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,372 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,372 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-11-07 20:04:47,372 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-11-07 20:04:47,372 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-07 20:04:47,372 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-07 20:04:47,373 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-07 20:04:47,373 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-07 20:04:47,373 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-07 20:04:47,373 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-07 20:04:47,373 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-11-07 20:04:47,373 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-11-07 20:04:47,373 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-11-07 20:04:47,373 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,374 INFO L425 ceAbstractionStarter]: For program point L138(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,374 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,374 INFO L425 ceAbstractionStarter]: For program point L72(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,374 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,374 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-11-07 20:04:47,374 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-11-07 20:04:47,374 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-11-07 20:04:47,374 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-11-07 20:04:47,375 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-07 20:04:47,375 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-07 20:04:47,375 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-07 20:04:47,375 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-07 20:04:47,375 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-07 20:04:47,375 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-11-07 20:04:47,375 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-11-07 20:04:47,375 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-11-07 20:04:47,375 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-11-07 20:04:47,376 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-11-07 20:04:47,376 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,376 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,376 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,376 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,376 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,376 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-11-07 20:04:47,376 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-07 20:04:47,376 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-07 20:04:47,376 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-07 20:04:47,376 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-07 20:04:47,376 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-07 20:04:47,376 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-11-07 20:04:47,377 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-11-07 20:04:47,377 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-11-07 20:04:47,377 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-11-07 20:04:47,377 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,377 INFO L425 ceAbstractionStarter]: For program point L144(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,377 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,377 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,377 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,377 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-11-07 20:04:47,378 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-11-07 20:04:47,378 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-11-07 20:04:47,378 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-07 20:04:47,378 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-07 20:04:47,378 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-07 20:04:47,378 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-07 20:04:47,378 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-07 20:04:47,378 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-11-07 20:04:47,378 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-11-07 20:04:47,379 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-11-07 20:04:47,379 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-11-07 20:04:47,379 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-11-07 20:04:47,379 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,379 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,379 INFO L425 ceAbstractionStarter]: For program point L114(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,379 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,379 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,379 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-07 20:04:47,380 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-07 20:04:47,380 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-07 20:04:47,380 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-07 20:04:47,380 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-07 20:04:47,380 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-11-07 20:04:47,380 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-11-07 20:04:47,380 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-11-07 20:04:47,380 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-11-07 20:04:47,380 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,381 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,381 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,381 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,381 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,381 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,381 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,381 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-11-07 20:04:47,381 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-11-07 20:04:47,381 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-11-07 20:04:47,381 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-11-07 20:04:47,381 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-07 20:04:47,381 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-07 20:04:47,382 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-07 20:04:47,382 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-07 20:04:47,382 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-07 20:04:47,382 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-11-07 20:04:47,382 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-11-07 20:04:47,382 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-11-07 20:04:47,382 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-11-07 20:04:47,382 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,382 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,382 INFO L425 ceAbstractionStarter]: For program point L120(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,382 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,382 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,383 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-07 20:04:47,383 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,383 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2018-11-07 20:04:47,383 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-11-07 20:04:47,383 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-11-07 20:04:47,383 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-11-07 20:04:47,383 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-07 20:04:47,383 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-07 20:04:47,383 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-07 20:04:47,383 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-07 20:04:47,384 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-07 20:04:47,384 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-07 20:04:47,384 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-11-07 20:04:47,384 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-11-07 20:04:47,384 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-11-07 20:04:47,384 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-11-07 20:04:47,384 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,384 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,384 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,384 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,384 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,384 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,384 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-11-07 20:04:47,384 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-11-07 20:04:47,385 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-11-07 20:04:47,385 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-07 20:04:47,385 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-07 20:04:47,385 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-07 20:04:47,385 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-07 20:04:47,385 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-07 20:04:47,385 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-07 20:04:47,385 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-11-07 20:04:47,385 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-11-07 20:04:47,385 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse0 (< 8 |old(~a19~0)|)) (.cse3 (= ~a10~0 |old(~a10~0)|)) (.cse4 (= ~a19~0 |old(~a19~0)|)) (.cse5 (= ~a1~0 |old(~a1~0)|)) (.cse6 (< 6 |calculate_output_#in~input|)) (.cse1 (not (= 14 ~a4~0))) (.cse7 (< |calculate_output_#in~input| 2)) (.cse2 (not (= 0 ~a12~0))) (.cse8 (< |old(~a10~0)| 0))) (and (or .cse0 .cse1 .cse2 (= 2 |old(~a10~0)|) (and .cse3 .cse4 .cse5)) (or .cse6 .cse7 .cse1 .cse2 (< 10 |old(~a19~0)|) .cse8 (and .cse5 .cse3 .cse4) (< 1 |old(~a10~0)|)) (or (and .cse3 (< 0 (+ ~a1~0 13)) .cse4) (<= (+ |old(~a1~0)| 13) 0) .cse0 .cse1 .cse2) (or (and (and .cse3 .cse4) .cse5) (or .cse6 (or .cse1 (< 9 |old(~a19~0)|)) .cse7 .cse2 .cse8 (< 4 |old(~a10~0)|) (< |old(~a19~0)| 8))))) [2018-11-07 20:04:47,386 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-11-07 20:04:47,386 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-11-07 20:04:47,386 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-11-07 20:04:47,386 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,386 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,386 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,386 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,386 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,387 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,387 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-11-07 20:04:47,387 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-07 20:04:47,387 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-07 20:04:47,387 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-07 20:04:47,387 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-07 20:04:47,387 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-07 20:04:47,387 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-07 20:04:47,387 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-11-07 20:04:47,388 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-11-07 20:04:47,388 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-11-07 20:04:47,388 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-11-07 20:04:47,388 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-11-07 20:04:47,388 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-11-07 20:04:47,388 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,388 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,388 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,389 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,389 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,389 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,389 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-11-07 20:04:47,389 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-11-07 20:04:47,389 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-11-07 20:04:47,389 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-07 20:04:47,389 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-07 20:04:47,389 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-07 20:04:47,390 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-07 20:04:47,390 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-07 20:04:47,390 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-07 20:04:47,390 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-11-07 20:04:47,390 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-11-07 20:04:47,390 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-11-07 20:04:47,390 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,390 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,391 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,391 INFO L425 ceAbstractionStarter]: For program point L99(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,391 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,391 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:47,391 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-11-07 20:04:47,391 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-11-07 20:04:47,391 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-11-07 20:04:47,391 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-07 20:04:47,391 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-07 20:04:47,392 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-07 20:04:47,392 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-07 20:04:47,392 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-07 20:04:47,392 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-07 20:04:47,392 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-11-07 20:04:47,392 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-11-07 20:04:47,392 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-11-07 20:04:47,392 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 20:04:47,393 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~inputF~0 6) (= ~inputC~0 3) (= ~a19~0 9) (= ~a10~0 0) (= ~a12~0 0) (= ~inputB~0 2) (= ~a1~0 23) (= ~inputE~0 5) (= ~a4~0 14) (= ~inputD~0 4)) [2018-11-07 20:04:47,393 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 20:04:47,393 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 20:04:47,393 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (not (= ~inputE~0 5)) (not (= 3 ~inputC~0)) (not (= |old(~a1~0)| 23)) (not (= ~a4~0 14)) (and (= ~a10~0 |old(~a10~0)|) (= ~a1~0 23) (= ~a19~0 |old(~a19~0)|)) (not (= 2 ~inputB~0)) (not (= 0 ~a12~0)) (not (= 9 |old(~a19~0)|)) (not (= 4 ~inputD~0)) (not (= |old(~a10~0)| 0)) (not (= ~inputF~0 6))) [2018-11-07 20:04:47,393 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-11-07 20:04:47,393 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse0 (<= main_~input~0 6)) (.cse1 (<= 0 ~a10~0)) (.cse2 (<= 2 main_~input~0)) (.cse3 (<= ~a19~0 8))) (or (and (and (<= ~a10~0 4) (<= ~a19~0 9) (<= 8 ~a19~0)) .cse0 .cse1 .cse2) (not (= |old(~a1~0)| 23)) (not (= 0 ~a12~0)) (and (< 0 (+ ~a1~0 13)) .cse3) (not (= 4 ~inputD~0)) (and .cse0 .cse1 (<= ~a10~0 1) (<= ~a19~0 10) .cse2) (not (= ~inputE~0 5)) (and .cse3 (not (= 2 ~a10~0))) (not (= 3 ~inputC~0)) (not (= ~a4~0 14)) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)) (not (= |old(~a10~0)| 0)) (not (= ~inputF~0 6)))) [2018-11-07 20:04:47,393 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-11-07 20:04:47,394 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-11-07 20:04:47,394 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-11-07 20:04:47,394 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse4 (<= ~a19~0 8)) (.cse0 (<= ~a19~0 9)) (.cse1 (<= 0 ~a10~0)) (.cse2 (<= ~a10~0 1)) (.cse3 (<= ~a19~0 10))) (or (and (<= ~a10~0 4) (<= 1 ~a10~0) .cse0 (<= 8 ~a19~0)) (not (= |old(~a1~0)| 23)) (and (<= main_~input~0 6) .cse1 .cse2 .cse3 (<= 2 main_~input~0)) (and .cse4 (not (= 2 ~a10~0))) (not (= |old(~a10~0)| 0)) (not (= ~inputF~0 6)) (not (= ~a12~0 0)) (and (< 0 (+ ~a1~0 13)) .cse4) (not (= 4 ~inputD~0)) (and .cse0 .cse1 .cse2) (not (= ~inputE~0 5)) (not (= 14 ~a4~0)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)) (and .cse1 .cse2 .cse3 (<= 0 (+ ~a1~0 2147483648))))) [2018-11-07 20:04:47,394 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-11-07 20:04:47,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:04:47 BoogieIcfgContainer [2018-11-07 20:04:47,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 20:04:47,408 INFO L168 Benchmark]: Toolchain (without parser) took 110048.23 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-07 20:04:47,409 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 20:04:47,410 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.24 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 20:04:47,411 INFO L168 Benchmark]: Boogie Procedure Inliner took 135.09 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -845.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-11-07 20:04:47,412 INFO L168 Benchmark]: Boogie Preprocessor took 137.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-07 20:04:47,412 INFO L168 Benchmark]: RCFGBuilder took 3191.83 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.5 MB). Peak memory consumption was 104.5 MB. Max. memory is 7.1 GB. [2018-11-07 20:04:47,413 INFO L168 Benchmark]: TraceAbstraction took 105815.38 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 3.1 GB in the end (delta: -927.7 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-07 20:04:47,418 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.28 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 763.24 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 135.09 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -845.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 137.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3191.83 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.5 MB). Peak memory consumption was 104.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 105815.38 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 3.1 GB in the end (delta: -927.7 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 184]: 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: (((((((((((((((((a10 <= 4 && 1 <= a10) && a19 <= 9) && 8 <= a19) || !(\old(a1) == 23)) || ((((input <= 6 && 0 <= a10) && a10 <= 1) && a19 <= 10) && 2 <= input)) || (a19 <= 8 && !(2 == a10))) || !(\old(a10) == 0)) || !(inputF == 6)) || !(a12 == 0)) || (0 < a1 + 13 && a19 <= 8)) || !(4 == inputD)) || ((a19 <= 9 && 0 <= a10) && a10 <= 1)) || !(inputE == 5)) || !(14 == a4)) || !(3 == inputC)) || !(2 == inputB)) || !(\old(a19) == 9)) || (((0 <= a10 && a10 <= 1) && a19 <= 10) && 0 <= a1 + 2147483648) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 105.7s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 78.9s AutomataDifference, 0.0s DeadEndRemovalTime, 11.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1086 SDtfs, 9798 SDslu, 2067 SDs, 0 SdLazy, 13669 SolverSat, 3317 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.0s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 2750 GetRequests, 2576 SyntacticMatches, 10 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3646occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.9s AbstIntTime, 7 AbstIntIterations, 5 AbstIntStrong, 0.9967467642526832 AbsIntWeakeningRatio, 0.11187607573149742 AbsIntAvgWeakeningVarsNumRemoved, 19.978485370051636 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 2574 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 121 PreInvPairs, 203 NumberOfFragments, 442 HoareAnnotationTreeSize, 121 FomulaSimplifications, 30795 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 35996 FormulaSimplificationTreeSizeReductionInter, 9.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 3085 NumberOfCodeBlocks, 3085 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 3800 ConstructedInterpolants, 0 QuantifiedInterpolants, 3515886 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1152 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 2 PerfectInterpolantSequences, 3636/4084 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...