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/Problem17_label54_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 16:52:15,439 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 16:52:15,441 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 16:52:15,460 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 16:52:15,460 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 16:52:15,461 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 16:52:15,463 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 16:52:15,464 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 16:52:15,466 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 16:52:15,467 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 16:52:15,468 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 16:52:15,468 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 16:52:15,469 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 16:52:15,470 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 16:52:15,471 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 16:52:15,472 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 16:52:15,473 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 16:52:15,475 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 16:52:15,477 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 16:52:15,478 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 16:52:15,482 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 16:52:15,484 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 16:52:15,487 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 16:52:15,490 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 16:52:15,490 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 16:52:15,492 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 16:52:15,493 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 16:52:15,496 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 16:52:15,497 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 16:52:15,498 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 16:52:15,498 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 16:52:15,499 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 16:52:15,499 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 16:52:15,499 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 16:52:15,502 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 16:52:15,502 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 16:52:15,503 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 16:52:15,524 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 16:52:15,524 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 16:52:15,525 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 16:52:15,525 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 16:52:15,525 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 16:52:15,526 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 16:52:15,526 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 16:52:15,526 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 16:52:15,526 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 16:52:15,526 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 16:52:15,527 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 16:52:15,527 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 16:52:15,527 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 16:52:15,528 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 16:52:15,528 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 16:52:15,528 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 16:52:15,528 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 16:52:15,528 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 16:52:15,529 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 16:52:15,529 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 16:52:15,529 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 16:52:15,529 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 16:52:15,529 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 16:52:15,530 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 16:52:15,530 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 16:52:15,530 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 16:52:15,530 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 16:52:15,530 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 16:52:15,531 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 16:52:15,531 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 16:52:15,531 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 16:52:15,531 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 16:52:15,531 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 16:52:15,531 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 16:52:15,532 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 16:52:15,589 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 16:52:15,602 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 16:52:15,605 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 16:52:15,606 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 16:52:15,607 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 16:52:15,607 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label54_false-unreach-call.c [2018-11-12 16:52:15,666 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26572e81b/ee5ad2c49dd544988d61ef5127abd256/FLAG4513beacb [2018-11-12 16:52:16,442 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 16:52:16,443 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label54_false-unreach-call.c [2018-11-12 16:52:16,479 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26572e81b/ee5ad2c49dd544988d61ef5127abd256/FLAG4513beacb [2018-11-12 16:52:16,499 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26572e81b/ee5ad2c49dd544988d61ef5127abd256 [2018-11-12 16:52:16,510 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 16:52:16,512 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 16:52:16,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 16:52:16,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 16:52:16,517 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 16:52:16,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:52:16" (1/1) ... [2018-11-12 16:52:16,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5101c3ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:16, skipping insertion in model container [2018-11-12 16:52:16,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:52:16" (1/1) ... [2018-11-12 16:52:16,535 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 16:52:16,675 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 16:52:17,597 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 16:52:17,603 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 16:52:17,986 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 16:52:18,011 INFO L193 MainTranslator]: Completed translation [2018-11-12 16:52:18,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:18 WrapperNode [2018-11-12 16:52:18,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 16:52:18,013 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 16:52:18,013 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 16:52:18,013 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 16:52:18,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:18" (1/1) ... [2018-11-12 16:52:18,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:18" (1/1) ... [2018-11-12 16:52:18,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 16:52:18,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 16:52:18,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 16:52:18,291 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 16:52:18,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:18" (1/1) ... [2018-11-12 16:52:18,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:18" (1/1) ... [2018-11-12 16:52:18,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:18" (1/1) ... [2018-11-12 16:52:18,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:18" (1/1) ... [2018-11-12 16:52:18,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:18" (1/1) ... [2018-11-12 16:52:18,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:18" (1/1) ... [2018-11-12 16:52:18,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:18" (1/1) ... [2018-11-12 16:52:18,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 16:52:18,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 16:52:18,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 16:52:18,515 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 16:52:18,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 16:52:18,579 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 16:52:18,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 16:52:18,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 16:52:18,579 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-12 16:52:18,579 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-12 16:52:18,579 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 16:52:18,580 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 16:52:18,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 16:52:18,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 16:52:18,580 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 16:52:18,580 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 16:52:28,375 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 16:52:28,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:52:28 BoogieIcfgContainer [2018-11-12 16:52:28,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 16:52:28,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 16:52:28,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 16:52:28,380 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 16:52:28,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:52:16" (1/3) ... [2018-11-12 16:52:28,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22699b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:52:28, skipping insertion in model container [2018-11-12 16:52:28,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:18" (2/3) ... [2018-11-12 16:52:28,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22699b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:52:28, skipping insertion in model container [2018-11-12 16:52:28,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:52:28" (3/3) ... [2018-11-12 16:52:28,384 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label54_false-unreach-call.c [2018-11-12 16:52:28,394 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 16:52:28,403 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 16:52:28,420 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 16:52:28,471 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 16:52:28,471 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 16:52:28,471 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 16:52:28,471 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 16:52:28,471 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 16:52:28,472 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 16:52:28,472 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 16:52:28,472 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 16:52:28,521 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states. [2018-11-12 16:52:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-12 16:52:28,528 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:52:28,529 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] [2018-11-12 16:52:28,532 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:52:28,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:52:28,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1533531428, now seen corresponding path program 1 times [2018-11-12 16:52:28,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:52:28,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:52:28,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:52:28,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:52:28,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:52:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:52:28,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:52:28,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:52:28,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 16:52:28,879 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:52:28,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 16:52:28,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 16:52:28,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 16:52:28,903 INFO L87 Difference]: Start difference. First operand 604 states. Second operand 4 states. [2018-11-12 16:52:37,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:52:37,711 INFO L93 Difference]: Finished difference Result 2162 states and 4007 transitions. [2018-11-12 16:52:37,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 16:52:37,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-12 16:52:37,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:52:37,746 INFO L225 Difference]: With dead ends: 2162 [2018-11-12 16:52:37,746 INFO L226 Difference]: Without dead ends: 1552 [2018-11-12 16:52:37,758 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 16:52:37,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2018-11-12 16:52:37,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1525. [2018-11-12 16:52:37,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1525 states. [2018-11-12 16:52:37,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2696 transitions. [2018-11-12 16:52:37,911 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2696 transitions. Word has length 20 [2018-11-12 16:52:37,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:52:37,912 INFO L480 AbstractCegarLoop]: Abstraction has 1525 states and 2696 transitions. [2018-11-12 16:52:37,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 16:52:37,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2696 transitions. [2018-11-12 16:52:37,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-12 16:52:37,920 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:52:37,921 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:52:37,921 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:52:37,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:52:37,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1982050186, now seen corresponding path program 1 times [2018-11-12 16:52:37,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:52:37,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:52:37,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:52:37,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:52:37,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:52:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:52:38,323 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:52:38,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:52:38,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 16:52:38,324 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:52:38,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 16:52:38,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 16:52:38,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-12 16:52:38,326 INFO L87 Difference]: Start difference. First operand 1525 states and 2696 transitions. Second operand 6 states. [2018-11-12 16:52:49,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:52:49,705 INFO L93 Difference]: Finished difference Result 5785 states and 10669 transitions. [2018-11-12 16:52:49,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 16:52:49,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-11-12 16:52:49,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:52:49,740 INFO L225 Difference]: With dead ends: 5785 [2018-11-12 16:52:49,741 INFO L226 Difference]: Without dead ends: 4266 [2018-11-12 16:52:49,761 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-12 16:52:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4266 states. [2018-11-12 16:52:49,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4266 to 4239. [2018-11-12 16:52:49,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4239 states. [2018-11-12 16:52:49,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4239 states to 4239 states and 6345 transitions. [2018-11-12 16:52:49,912 INFO L78 Accepts]: Start accepts. Automaton has 4239 states and 6345 transitions. Word has length 99 [2018-11-12 16:52:49,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:52:49,913 INFO L480 AbstractCegarLoop]: Abstraction has 4239 states and 6345 transitions. [2018-11-12 16:52:49,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 16:52:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4239 states and 6345 transitions. [2018-11-12 16:52:49,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-12 16:52:49,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:52:49,916 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:52:49,916 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:52:49,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:52:49,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1539737542, now seen corresponding path program 1 times [2018-11-12 16:52:49,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:52:49,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:52:49,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:52:49,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:52:49,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:52:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:52:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:52:50,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:52:50,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 16:52:50,138 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:52:50,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 16:52:50,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 16:52:50,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 16:52:50,139 INFO L87 Difference]: Start difference. First operand 4239 states and 6345 transitions. Second operand 6 states. [2018-11-12 16:52:54,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:52:54,614 INFO L93 Difference]: Finished difference Result 12257 states and 20014 transitions. [2018-11-12 16:52:54,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 16:52:54,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-11-12 16:52:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:52:54,688 INFO L225 Difference]: With dead ends: 12257 [2018-11-12 16:52:54,688 INFO L226 Difference]: Without dead ends: 8024 [2018-11-12 16:52:54,715 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 16:52:54,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8024 states. [2018-11-12 16:52:54,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8024 to 7939. [2018-11-12 16:52:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7939 states. [2018-11-12 16:52:54,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7939 states to 7939 states and 11942 transitions. [2018-11-12 16:52:54,985 INFO L78 Accepts]: Start accepts. Automaton has 7939 states and 11942 transitions. Word has length 100 [2018-11-12 16:52:54,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:52:54,986 INFO L480 AbstractCegarLoop]: Abstraction has 7939 states and 11942 transitions. [2018-11-12 16:52:54,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 16:52:54,986 INFO L276 IsEmpty]: Start isEmpty. Operand 7939 states and 11942 transitions. [2018-11-12 16:52:54,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-12 16:52:54,991 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:52:54,991 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:52:54,991 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:52:54,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:52:54,992 INFO L82 PathProgramCache]: Analyzing trace with hash -724720364, now seen corresponding path program 1 times [2018-11-12 16:52:54,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:52:54,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:52:54,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:52:54,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:52:54,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:52:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:52:55,366 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 16:52:55,510 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-12 16:52:55,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:52:55,511 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:52:55,512 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 175 with the following transitions: [2018-11-12 16:52:55,514 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [770], [772], [775], [783], [791], [799], [807], [815], [823], [831], [839], [847], [855], [863], [871], [879], [887], [895], [903], [911], [919], [927], [935], [943], [951], [959], [967], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [1224], [1228], [1232], [1236], [1239], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-11-12 16:52:55,565 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:52:55,565 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:52:56,009 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:52:56,783 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 16:52:56,785 INFO L272 AbstractInterpreter]: Visited 88 different actions 250 times. Merged at 5 different actions 9 times. Never widened. Performed 4154 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4154 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-12 16:52:56,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:52:56,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 16:52:56,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:52:56,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 16:52:56,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:52:56,852 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:52:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:52:56,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:52:57,475 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 99 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:52:57,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 16:52:57,720 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-12 16:52:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 99 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:52:58,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 16:52:58,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-12 16:52:58,389 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 16:52:58,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 16:52:58,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 16:52:58,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-12 16:52:58,394 INFO L87 Difference]: Start difference. First operand 7939 states and 11942 transitions. Second operand 9 states. [2018-11-12 16:53:06,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:53:06,913 INFO L93 Difference]: Finished difference Result 19972 states and 30355 transitions. [2018-11-12 16:53:06,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 16:53:06,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 174 [2018-11-12 16:53:06,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:53:06,990 INFO L225 Difference]: With dead ends: 19972 [2018-11-12 16:53:06,990 INFO L226 Difference]: Without dead ends: 12004 [2018-11-12 16:53:07,090 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 346 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2018-11-12 16:53:07,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12004 states. [2018-11-12 16:53:07,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12004 to 11979. [2018-11-12 16:53:07,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11979 states. [2018-11-12 16:53:07,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11979 states to 11979 states and 15397 transitions. [2018-11-12 16:53:07,468 INFO L78 Accepts]: Start accepts. Automaton has 11979 states and 15397 transitions. Word has length 174 [2018-11-12 16:53:07,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:53:07,470 INFO L480 AbstractCegarLoop]: Abstraction has 11979 states and 15397 transitions. [2018-11-12 16:53:07,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 16:53:07,470 INFO L276 IsEmpty]: Start isEmpty. Operand 11979 states and 15397 transitions. [2018-11-12 16:53:07,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-12 16:53:07,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:53:07,476 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 16:53:07,476 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:53:07,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:53:07,479 INFO L82 PathProgramCache]: Analyzing trace with hash -889055236, now seen corresponding path program 1 times [2018-11-12 16:53:07,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:53:07,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:53:07,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:53:07,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:53:07,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:53:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:53:07,807 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 16:53:08,295 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 77 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 16:53:08,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:53:08,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:53:08,295 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 188 with the following transitions: [2018-11-12 16:53:08,296 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [770], [772], [775], [783], [791], [799], [807], [815], [823], [831], [839], [847], [855], [863], [871], [879], [887], [895], [903], [911], [919], [927], [935], [943], [951], [959], [967], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1232], [1236], [1239], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-11-12 16:53:08,301 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:53:08,301 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:53:08,416 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:53:09,409 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 16:53:09,410 INFO L272 AbstractInterpreter]: Visited 97 different actions 378 times. Merged at 7 different actions 25 times. Never widened. Performed 6836 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6836 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 4 fixpoints after 3 different actions. Largest state had 26 variables. [2018-11-12 16:53:09,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:53:09,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 16:53:09,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:53:09,451 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 16:53:09,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:53:09,464 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:53:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:53:09,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:53:09,874 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-12 16:53:09,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 16:53:10,206 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-12 16:53:10,235 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 16:53:10,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8 [2018-11-12 16:53:10,235 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:53:10,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 16:53:10,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 16:53:10,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-12 16:53:10,236 INFO L87 Difference]: Start difference. First operand 11979 states and 15397 transitions. Second operand 3 states. [2018-11-12 16:53:14,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:53:14,148 INFO L93 Difference]: Finished difference Result 23952 states and 30788 transitions. [2018-11-12 16:53:14,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 16:53:14,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2018-11-12 16:53:14,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:53:14,213 INFO L225 Difference]: With dead ends: 23952 [2018-11-12 16:53:14,213 INFO L226 Difference]: Without dead ends: 11979 [2018-11-12 16:53:14,253 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 374 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-12 16:53:14,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11979 states. [2018-11-12 16:53:14,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11979 to 11979. [2018-11-12 16:53:14,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11979 states. [2018-11-12 16:53:14,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11979 states to 11979 states and 14794 transitions. [2018-11-12 16:53:14,536 INFO L78 Accepts]: Start accepts. Automaton has 11979 states and 14794 transitions. Word has length 187 [2018-11-12 16:53:14,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:53:14,537 INFO L480 AbstractCegarLoop]: Abstraction has 11979 states and 14794 transitions. [2018-11-12 16:53:14,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 16:53:14,537 INFO L276 IsEmpty]: Start isEmpty. Operand 11979 states and 14794 transitions. [2018-11-12 16:53:14,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-12 16:53:14,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:53:14,544 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:53:14,544 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:53:14,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:53:14,545 INFO L82 PathProgramCache]: Analyzing trace with hash -995825682, now seen corresponding path program 1 times [2018-11-12 16:53:14,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:53:14,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:53:14,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:53:14,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:53:14,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:53:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:53:15,099 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 194 proven. 2 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-12 16:53:15,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:53:15,100 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:53:15,100 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 265 with the following transitions: [2018-11-12 16:53:15,101 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [770], [772], [775], [783], [791], [799], [807], [815], [823], [831], [839], [847], [855], [863], [871], [879], [887], [895], [903], [911], [919], [927], [935], [943], [951], [959], [967], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1231], [1232], [1236], [1239], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-11-12 16:53:15,109 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:53:15,109 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:53:15,294 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:53:17,085 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 16:53:17,085 INFO L272 AbstractInterpreter]: Visited 98 different actions 676 times. Merged at 8 different actions 59 times. Widened at 1 different actions 2 times. Performed 13792 root evaluator evaluations with a maximum evaluation depth of 6. Performed 13792 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 13 fixpoints after 2 different actions. Largest state had 26 variables. [2018-11-12 16:53:17,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:53:17,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 16:53:17,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:53:17,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 16:53:17,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:53:17,137 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:53:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:53:17,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:53:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 194 proven. 2 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-12 16:53:17,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 16:53:17,856 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 194 proven. 2 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-12 16:53:17,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 16:53:17,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2018-11-12 16:53:17,889 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 16:53:17,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 16:53:17,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 16:53:17,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-12 16:53:17,891 INFO L87 Difference]: Start difference. First operand 11979 states and 14794 transitions. Second operand 7 states. [2018-11-12 16:53:25,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:53:25,537 INFO L93 Difference]: Finished difference Result 35156 states and 44117 transitions. [2018-11-12 16:53:25,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 16:53:25,547 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 264 [2018-11-12 16:53:25,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:53:25,638 INFO L225 Difference]: With dead ends: 35156 [2018-11-12 16:53:25,638 INFO L226 Difference]: Without dead ends: 23149 [2018-11-12 16:53:25,680 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 531 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-12 16:53:25,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23149 states. [2018-11-12 16:53:26,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23149 to 21846. [2018-11-12 16:53:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21846 states. [2018-11-12 16:53:26,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21846 states to 21846 states and 26163 transitions. [2018-11-12 16:53:26,396 INFO L78 Accepts]: Start accepts. Automaton has 21846 states and 26163 transitions. Word has length 264 [2018-11-12 16:53:26,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:53:26,396 INFO L480 AbstractCegarLoop]: Abstraction has 21846 states and 26163 transitions. [2018-11-12 16:53:26,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 16:53:26,397 INFO L276 IsEmpty]: Start isEmpty. Operand 21846 states and 26163 transitions. [2018-11-12 16:53:26,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-11-12 16:53:26,408 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:53:26,408 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:53:26,409 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:53:26,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:53:26,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1598611723, now seen corresponding path program 1 times [2018-11-12 16:53:26,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:53:26,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:53:26,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:53:26,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:53:26,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:53:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:53:26,786 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-12 16:53:26,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:53:26,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 16:53:26,787 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:53:26,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 16:53:26,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 16:53:26,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 16:53:26,788 INFO L87 Difference]: Start difference. First operand 21846 states and 26163 transitions. Second operand 4 states. [2018-11-12 16:53:32,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:53:32,683 INFO L93 Difference]: Finished difference Result 59535 states and 73226 transitions. [2018-11-12 16:53:32,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 16:53:32,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 287 [2018-11-12 16:53:32,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:53:32,781 INFO L225 Difference]: With dead ends: 59535 [2018-11-12 16:53:32,781 INFO L226 Difference]: Without dead ends: 27148 [2018-11-12 16:53:32,847 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 16:53:32,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27148 states. [2018-11-12 16:53:33,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27148 to 26640. [2018-11-12 16:53:33,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26640 states. [2018-11-12 16:53:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26640 states to 26640 states and 31610 transitions. [2018-11-12 16:53:33,312 INFO L78 Accepts]: Start accepts. Automaton has 26640 states and 31610 transitions. Word has length 287 [2018-11-12 16:53:33,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:53:33,312 INFO L480 AbstractCegarLoop]: Abstraction has 26640 states and 31610 transitions. [2018-11-12 16:53:33,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 16:53:33,312 INFO L276 IsEmpty]: Start isEmpty. Operand 26640 states and 31610 transitions. [2018-11-12 16:53:33,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-11-12 16:53:33,323 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:53:33,323 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:53:33,323 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:53:33,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:53:33,324 INFO L82 PathProgramCache]: Analyzing trace with hash 634222945, now seen corresponding path program 1 times [2018-11-12 16:53:33,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:53:33,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:53:33,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:53:33,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:53:33,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:53:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:53:34,229 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 215 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 16:53:34,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:53:34,229 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:53:34,229 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 325 with the following transitions: [2018-11-12 16:53:34,230 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [770], [772], [775], [783], [791], [799], [807], [815], [823], [831], [839], [847], [855], [863], [871], [879], [887], [895], [903], [911], [919], [927], [935], [943], [951], [959], [967], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1278], [1279], [1282], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1385], [1389], [1393], [1397], [1401], [1405], [1409], [1413], [1417], [1428], [1432], [1436], [1440], [1451], [1455], [1459], [1463], [1467], [1471], [1474], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-11-12 16:53:34,235 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:53:34,235 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:53:34,325 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:53:35,743 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 16:53:35,744 INFO L272 AbstractInterpreter]: Visited 139 different actions 685 times. Merged at 8 different actions 38 times. Never widened. Performed 12940 root evaluator evaluations with a maximum evaluation depth of 6. Performed 12940 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 2 different actions. Largest state had 26 variables. [2018-11-12 16:53:35,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:53:35,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 16:53:35,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:53:35,783 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 16:53:35,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:53:35,797 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:53:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:53:35,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:53:36,137 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 215 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 16:53:36,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 16:53:36,298 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-12 16:53:36,820 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 215 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 16:53:36,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 16:53:36,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2018-11-12 16:53:36,843 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 16:53:36,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 16:53:36,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 16:53:36,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-12 16:53:36,845 INFO L87 Difference]: Start difference. First operand 26640 states and 31610 transitions. Second operand 7 states. [2018-11-12 16:53:44,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:53:44,482 INFO L93 Difference]: Finished difference Result 79491 states and 100419 transitions. [2018-11-12 16:53:44,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 16:53:44,483 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 324 [2018-11-12 16:53:44,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:53:44,652 INFO L225 Difference]: With dead ends: 79491 [2018-11-12 16:53:44,652 INFO L226 Difference]: Without dead ends: 47784 [2018-11-12 16:53:44,731 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 653 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-11-12 16:53:44,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47784 states. [2018-11-12 16:53:45,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47784 to 46325. [2018-11-12 16:53:45,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46325 states. [2018-11-12 16:53:45,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46325 states to 46325 states and 55677 transitions. [2018-11-12 16:53:45,577 INFO L78 Accepts]: Start accepts. Automaton has 46325 states and 55677 transitions. Word has length 324 [2018-11-12 16:53:45,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:53:45,578 INFO L480 AbstractCegarLoop]: Abstraction has 46325 states and 55677 transitions. [2018-11-12 16:53:45,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 16:53:45,578 INFO L276 IsEmpty]: Start isEmpty. Operand 46325 states and 55677 transitions. [2018-11-12 16:53:45,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-11-12 16:53:45,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:53:45,595 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:53:45,595 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:53:45,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:53:45,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1770420321, now seen corresponding path program 1 times [2018-11-12 16:53:45,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:53:45,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:53:45,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:53:45,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:53:45,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:53:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:53:45,931 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-11-12 16:53:45,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:53:45,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 16:53:45,932 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:53:45,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 16:53:45,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 16:53:45,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 16:53:45,933 INFO L87 Difference]: Start difference. First operand 46325 states and 55677 transitions. Second operand 4 states. [2018-11-12 16:53:51,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:53:51,489 INFO L93 Difference]: Finished difference Result 112119 states and 137652 transitions. [2018-11-12 16:53:51,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 16:53:51,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 347 [2018-11-12 16:53:51,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:53:51,650 INFO L225 Difference]: With dead ends: 112119 [2018-11-12 16:53:51,650 INFO L226 Difference]: Without dead ends: 50425 [2018-11-12 16:53:51,755 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 16:53:51,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50425 states. [2018-11-12 16:53:52,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50425 to 47413. [2018-11-12 16:53:52,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47413 states. [2018-11-12 16:53:52,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47413 states to 47413 states and 57810 transitions. [2018-11-12 16:53:52,518 INFO L78 Accepts]: Start accepts. Automaton has 47413 states and 57810 transitions. Word has length 347 [2018-11-12 16:53:52,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:53:52,519 INFO L480 AbstractCegarLoop]: Abstraction has 47413 states and 57810 transitions. [2018-11-12 16:53:52,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 16:53:52,519 INFO L276 IsEmpty]: Start isEmpty. Operand 47413 states and 57810 transitions. [2018-11-12 16:53:52,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2018-11-12 16:53:52,541 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:53:52,541 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:53:52,542 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:53:52,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:53:52,542 INFO L82 PathProgramCache]: Analyzing trace with hash 606066130, now seen corresponding path program 1 times [2018-11-12 16:53:52,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:53:52,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:53:52,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:53:52,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:53:52,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:53:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:53:53,271 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 296 proven. 2 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-11-12 16:53:53,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:53:53,272 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:53:53,273 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 449 with the following transitions: [2018-11-12 16:53:53,273 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [770], [772], [775], [783], [791], [799], [807], [815], [823], [831], [839], [847], [855], [863], [871], [879], [887], [895], [903], [911], [919], [927], [935], [943], [951], [959], [967], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1232], [1236], [1240], [1243], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1384], [1385], [1389], [1393], [1397], [1401], [1405], [1409], [1413], [1417], [1428], [1432], [1436], [1440], [1451], [1455], [1459], [1463], [1467], [1471], [1475], [1479], [1490], [1501], [1505], [1516], [1520], [1524], [1528], [1532], [1536], [1540], [1544], [1548], [1559], [1563], [1567], [1578], [1582], [1593], [1597], [1600], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-11-12 16:53:53,281 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:53:53,281 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:53:53,361 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:53:56,230 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 16:53:56,230 INFO L272 AbstractInterpreter]: Visited 161 different actions 1119 times. Merged at 9 different actions 62 times. Widened at 1 different actions 2 times. Performed 21773 root evaluator evaluations with a maximum evaluation depth of 6. Performed 21773 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 15 fixpoints after 2 different actions. Largest state had 26 variables. [2018-11-12 16:53:56,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:53:56,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 16:53:56,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:53:56,268 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 16:53:56,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:53:56,284 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:53:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:53:56,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:53:56,549 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 296 proven. 2 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-11-12 16:53:56,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 16:53:56,718 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 30 [2018-11-12 16:53:57,194 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 296 proven. 2 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-11-12 16:53:57,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 16:53:57,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-12 16:53:57,215 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 16:53:57,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 16:53:57,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 16:53:57,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-12 16:53:57,216 INFO L87 Difference]: Start difference. First operand 47413 states and 57810 transitions. Second operand 6 states. [2018-11-12 16:54:04,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:54:04,428 INFO L93 Difference]: Finished difference Result 104835 states and 129346 transitions. [2018-11-12 16:54:04,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 16:54:04,429 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 448 [2018-11-12 16:54:04,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:54:04,561 INFO L225 Difference]: With dead ends: 104835 [2018-11-12 16:54:04,562 INFO L226 Difference]: Without dead ends: 55670 [2018-11-12 16:54:04,633 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 911 GetRequests, 898 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-11-12 16:54:04,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55670 states. [2018-11-12 16:54:05,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55670 to 54008. [2018-11-12 16:54:05,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54008 states. [2018-11-12 16:54:06,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54008 states to 54008 states and 64394 transitions. [2018-11-12 16:54:06,014 INFO L78 Accepts]: Start accepts. Automaton has 54008 states and 64394 transitions. Word has length 448 [2018-11-12 16:54:06,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:54:06,015 INFO L480 AbstractCegarLoop]: Abstraction has 54008 states and 64394 transitions. [2018-11-12 16:54:06,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 16:54:06,015 INFO L276 IsEmpty]: Start isEmpty. Operand 54008 states and 64394 transitions. [2018-11-12 16:54:06,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2018-11-12 16:54:06,031 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:54:06,032 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:54:06,032 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:54:06,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:54:06,033 INFO L82 PathProgramCache]: Analyzing trace with hash -242273385, now seen corresponding path program 1 times [2018-11-12 16:54:06,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:54:06,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:54:06,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:54:06,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:54:06,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:54:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:54:07,481 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-12 16:54:07,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:54:07,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:54:07,482 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 466 with the following transitions: [2018-11-12 16:54:07,483 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [37], [41], [45], [56], [60], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [115], [119], [123], [127], [138], [142], [146], [150], [154], [158], [169], [173], [177], [181], [185], [189], [193], [204], [208], [212], [216], [227], [231], [235], [239], [250], [254], [258], [262], [266], [270], [274], [278], [282], [286], [297], [301], [305], [309], [313], [316], [710], [711], [718], [726], [734], [742], [750], [758], [766], [770], [772], [775], [783], [791], [799], [807], [815], [823], [831], [839], [847], [855], [863], [871], [879], [887], [895], [903], [911], [919], [927], [935], [943], [951], [959], [967], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1385], [1389], [1393], [1397], [1401], [1405], [1409], [1413], [1417], [1428], [1432], [1436], [1440], [1451], [1455], [1459], [1463], [1467], [1471], [1475], [1479], [1490], [1501], [1505], [1516], [1520], [1524], [1528], [1532], [1536], [1540], [1544], [1548], [1559], [1563], [1567], [1578], [1582], [1593], [1597], [1601], [1612], [1623], [1627], [1631], [1635], [1639], [1643], [1647], [1651], [1655], [1659], [1663], [1667], [1678], [1689], [1693], [1697], [1701], [1705], [1709], [1713], [1717], [1728], [1732], [1736], [1747], [1751], [1755], [1759], [1763], [1767], [1771], [1775], [1779], [1783], [1787], [1791], [1795], [1799], [1803], [1807], [1818], [1822], [1826], [1830], [1834], [1838], [1842], [1846], [1850], [1854], [1858], [1862], [1866], [1870], [1874], [1878], [1882], [1886], [1890], [1894], [1898], [1902], [1906], [1910], [1914], [1918], [1922], [1933], [1937], [1941], [1945], [1949], [1960], [1964], [1968], [1972], [1976], [1980], [1984], [1988], [1992], [1996], [2000], [2004], [2008], [2012], [2016], [2020], [2024], [2028], [2039], [2043], [2047], [2051], [2055], [2066], [2070], [2074], [2078], [2089], [2093], [2104], [2108], [2119], [2123], [2127], [2131], [2135], [2139], [2143], [2147], [2151], [2155], [2159], [2163], [2167], [2171], [2175], [2179], [2183], [2187], [2191], [2202], [2206], [2210], [2214], [2218], [2229], [2233], [2237], [2241], [2252], [2256], [2260], [2264], [2268], [2272], [2276], [2278], [2279], [2283], [2287], [2293], [2297], [2299], [2304], [2305], [2306], [2307], [2308], [2310], [2311] [2018-11-12 16:54:07,491 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:54:07,491 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:54:07,607 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:54:10,595 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 16:54:10,595 INFO L272 AbstractInterpreter]: Visited 366 different actions 1446 times. Merged at 7 different actions 21 times. Never widened. Performed 31934 root evaluator evaluations with a maximum evaluation depth of 6. Performed 31934 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 4 fixpoints after 2 different actions. Largest state had 26 variables. [2018-11-12 16:54:10,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:54:10,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 16:54:10,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:54:10,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 16:54:10,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:54:10,610 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:54:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:54:10,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:54:11,064 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-12 16:54:11,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 16:54:12,523 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 31 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:54:12,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 16:54:12,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 17 [2018-11-12 16:54:12,544 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 16:54:12,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 16:54:12,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 16:54:12,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-11-12 16:54:12,546 INFO L87 Difference]: Start difference. First operand 54008 states and 64394 transitions. Second operand 12 states. [2018-11-12 16:54:30,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:54:30,287 INFO L93 Difference]: Finished difference Result 123859 states and 150753 transitions. [2018-11-12 16:54:30,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 16:54:30,287 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 465 [2018-11-12 16:54:30,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:54:30,448 INFO L225 Difference]: With dead ends: 123859 [2018-11-12 16:54:30,448 INFO L226 Difference]: Without dead ends: 69417 [2018-11-12 16:54:30,521 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 953 GetRequests, 922 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=237, Invalid=575, Unknown=0, NotChecked=0, Total=812 [2018-11-12 16:54:30,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69417 states. [2018-11-12 16:54:31,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69417 to 64100. [2018-11-12 16:54:31,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64100 states. [2018-11-12 16:54:31,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64100 states to 64100 states and 76321 transitions. [2018-11-12 16:54:31,786 INFO L78 Accepts]: Start accepts. Automaton has 64100 states and 76321 transitions. Word has length 465 [2018-11-12 16:54:31,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:54:31,787 INFO L480 AbstractCegarLoop]: Abstraction has 64100 states and 76321 transitions. [2018-11-12 16:54:31,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 16:54:31,788 INFO L276 IsEmpty]: Start isEmpty. Operand 64100 states and 76321 transitions. [2018-11-12 16:54:31,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2018-11-12 16:54:31,835 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:54:31,836 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:54:31,837 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:54:31,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:54:31,837 INFO L82 PathProgramCache]: Analyzing trace with hash 2016741121, now seen corresponding path program 1 times [2018-11-12 16:54:31,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:54:31,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:54:31,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:54:31,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:54:31,840 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:54:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:54:32,465 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2018-11-12 16:54:32,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:54:32,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:54:32,466 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 635 with the following transitions: [2018-11-12 16:54:32,467 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [37], [41], [45], [56], [60], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [115], [119], [123], [127], [138], [142], [146], [150], [154], [158], [169], [173], [177], [181], [185], [189], [193], [196], [199], [203], [710], [711], [718], [726], [734], [742], [750], [758], [766], [770], [772], [775], [783], [791], [799], [807], [815], [823], [831], [839], [847], [855], [863], [871], [879], [887], [895], [903], [911], [919], [927], [935], [943], [951], [959], [967], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1232], [1236], [1240], [1243], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1384], [1385], [1389], [1393], [1397], [1401], [1405], [1409], [1413], [1417], [1428], [1432], [1436], [1440], [1451], [1455], [1459], [1463], [1467], [1471], [1475], [1479], [1490], [1501], [1505], [1516], [1520], [1524], [1528], [1532], [1536], [1540], [1544], [1548], [1559], [1563], [1567], [1578], [1582], [1593], [1597], [1601], [1612], [1623], [1627], [1631], [1635], [1639], [1643], [1647], [1651], [1655], [1659], [1663], [1667], [1678], [1689], [1693], [1697], [1701], [1705], [1709], [1713], [1717], [1728], [1732], [1736], [1747], [1751], [1755], [1759], [1763], [1767], [1771], [1775], [1779], [1783], [1787], [1791], [1795], [1799], [1803], [1807], [1818], [1822], [1826], [1830], [1834], [1838], [1842], [1846], [1850], [1854], [1858], [1862], [1866], [1870], [1874], [1878], [1882], [1886], [1890], [1894], [1898], [1902], [1906], [1910], [1914], [1918], [1922], [1933], [1937], [1941], [1945], [1949], [1960], [1964], [1968], [1972], [1976], [1980], [1984], [1988], [1992], [1996], [2000], [2004], [2008], [2012], [2016], [2020], [2024], [2028], [2039], [2043], [2047], [2051], [2055], [2066], [2070], [2074], [2078], [2089], [2093], [2104], [2108], [2119], [2123], [2127], [2131], [2135], [2139], [2143], [2147], [2151], [2155], [2159], [2163], [2167], [2171], [2175], [2179], [2183], [2187], [2191], [2202], [2206], [2210], [2214], [2218], [2229], [2233], [2237], [2241], [2252], [2256], [2260], [2264], [2268], [2272], [2276], [2278], [2279], [2283], [2287], [2293], [2297], [2299], [2304], [2305], [2306], [2307], [2308], [2310], [2311] [2018-11-12 16:54:32,474 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:54:32,474 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:54:32,538 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:54:34,147 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 16:54:34,147 INFO L272 AbstractInterpreter]: Visited 341 different actions 1010 times. Merged at 5 different actions 9 times. Never widened. Performed 18042 root evaluator evaluations with a maximum evaluation depth of 6. Performed 18042 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-12 16:54:34,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:54:34,153 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 16:54:35,279 INFO L227 lantSequenceWeakener]: Weakened 626 states. On average, predicates are now at 75.03% of their original sizes. [2018-11-12 16:54:35,279 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 16:54:35,555 INFO L415 sIntCurrentIteration]: We unified 633 AI predicates to 633 [2018-11-12 16:54:35,556 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 16:54:35,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 16:54:35,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 15 [2018-11-12 16:54:35,557 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:54:35,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 16:54:35,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 16:54:35,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-12 16:54:35,560 INFO L87 Difference]: Start difference. First operand 64100 states and 76321 transitions. Second operand 13 states. [2018-11-12 16:55:05,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:55:05,488 INFO L93 Difference]: Finished difference Result 131292 states and 156317 transitions. [2018-11-12 16:55:05,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 16:55:05,488 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 634 [2018-11-12 16:55:05,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:55:05,635 INFO L225 Difference]: With dead ends: 131292 [2018-11-12 16:55:05,636 INFO L226 Difference]: Without dead ends: 67198 [2018-11-12 16:55:05,704 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 648 GetRequests, 622 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2018-11-12 16:55:05,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67198 states. [2018-11-12 16:55:07,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67198 to 67186. [2018-11-12 16:55:07,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67186 states. [2018-11-12 16:55:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67186 states to 67186 states and 79907 transitions. [2018-11-12 16:55:07,520 INFO L78 Accepts]: Start accepts. Automaton has 67186 states and 79907 transitions. Word has length 634 [2018-11-12 16:55:07,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:55:07,521 INFO L480 AbstractCegarLoop]: Abstraction has 67186 states and 79907 transitions. [2018-11-12 16:55:07,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 16:55:07,521 INFO L276 IsEmpty]: Start isEmpty. Operand 67186 states and 79907 transitions. [2018-11-12 16:55:07,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2018-11-12 16:55:07,558 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:55:07,558 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:55:07,559 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:55:07,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:55:07,559 INFO L82 PathProgramCache]: Analyzing trace with hash -385510370, now seen corresponding path program 1 times [2018-11-12 16:55:07,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:55:07,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:55:07,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:55:07,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:55:07,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:55:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:55:08,782 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 60 proven. 192 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2018-11-12 16:55:08,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:55:08,782 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:55:08,782 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 656 with the following transitions: [2018-11-12 16:55:08,783 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [37], [41], [45], [56], [60], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [115], [119], [123], [127], [138], [142], [146], [150], [154], [158], [169], [173], [177], [181], [185], [189], [193], [204], [208], [212], [216], [227], [231], [235], [239], [250], [254], [258], [262], [266], [270], [274], [278], [282], [286], [297], [301], [305], [309], [313], [316], [710], [711], [718], [726], [734], [742], [750], [758], [766], [770], [772], [775], [783], [791], [799], [807], [815], [823], [831], [839], [847], [855], [863], [871], [879], [887], [895], [903], [911], [919], [927], [935], [943], [951], [959], [967], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1278], [1279], [1282], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1356], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1385], [1389], [1393], [1397], [1401], [1405], [1409], [1413], [1417], [1428], [1432], [1436], [1440], [1451], [1455], [1459], [1463], [1467], [1471], [1475], [1479], [1490], [1501], [1505], [1516], [1520], [1524], [1528], [1532], [1536], [1540], [1544], [1548], [1559], [1563], [1567], [1578], [1582], [1593], [1597], [1601], [1612], [1623], [1627], [1631], [1635], [1639], [1643], [1647], [1651], [1655], [1659], [1663], [1667], [1678], [1689], [1693], [1697], [1701], [1705], [1709], [1713], [1717], [1728], [1732], [1736], [1747], [1751], [1755], [1759], [1763], [1767], [1771], [1775], [1779], [1783], [1787], [1791], [1795], [1799], [1803], [1807], [1818], [1822], [1826], [1830], [1834], [1838], [1842], [1846], [1850], [1854], [1858], [1862], [1866], [1870], [1874], [1878], [1882], [1886], [1890], [1894], [1898], [1902], [1906], [1910], [1914], [1918], [1922], [1933], [1937], [1941], [1945], [1949], [1960], [1964], [1968], [1972], [1976], [1980], [1984], [1988], [1992], [1996], [2000], [2004], [2008], [2012], [2016], [2020], [2024], [2028], [2039], [2043], [2047], [2051], [2055], [2066], [2070], [2074], [2078], [2089], [2093], [2104], [2108], [2119], [2123], [2127], [2131], [2135], [2139], [2143], [2147], [2151], [2155], [2159], [2163], [2167], [2171], [2175], [2179], [2183], [2187], [2191], [2202], [2206], [2210], [2214], [2218], [2229], [2233], [2237], [2241], [2252], [2256], [2260], [2264], [2268], [2272], [2276], [2278], [2279], [2283], [2287], [2293], [2297], [2299], [2304], [2305], [2306], [2307], [2308], [2310], [2311] [2018-11-12 16:55:08,789 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:55:08,790 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:55:08,844 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:55:12,098 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 16:55:12,098 INFO L272 AbstractInterpreter]: Visited 368 different actions 2212 times. Merged at 9 different actions 67 times. Widened at 1 different actions 2 times. Performed 44382 root evaluator evaluations with a maximum evaluation depth of 6. Performed 44382 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 15 fixpoints after 3 different actions. Largest state had 26 variables. [2018-11-12 16:55:12,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:55:12,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 16:55:12,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:55:12,106 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 16:55:12,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:55:12,115 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:55:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:55:12,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:55:21,598 WARN L179 SmtUtils]: Spent 8.17 s on a formula simplification. DAG size of input: 423 DAG size of output: 59 [2018-11-12 16:55:22,019 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 334 proven. 2 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-12 16:55:22,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 16:55:30,243 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 334 proven. 2 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-12 16:55:30,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 16:55:30,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 15 [2018-11-12 16:55:30,263 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 16:55:30,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 16:55:30,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 16:55:30,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-11-12 16:55:30,265 INFO L87 Difference]: Start difference. First operand 67186 states and 79907 transitions. Second operand 13 states. [2018-11-12 16:55:35,426 WARN L179 SmtUtils]: Spent 3.36 s on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2018-11-12 16:55:36,360 WARN L179 SmtUtils]: Spent 879.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 Received shutdown request... [2018-11-12 16:55:41,404 WARN L187 SmtUtils]: Removed 5 from assertion stack [2018-11-12 16:55:41,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 16:55:41,404 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 16:55:41,408 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 16:55:41,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:55:41 BoogieIcfgContainer [2018-11-12 16:55:41,409 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 16:55:41,410 INFO L168 Benchmark]: Toolchain (without parser) took 204898.85 ms. Allocated memory was 1.5 GB in the beginning and 5.3 GB in the end (delta: 3.8 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-11-12 16:55:41,411 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 16:55:41,411 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1499.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. [2018-11-12 16:55:41,412 INFO L168 Benchmark]: Boogie Procedure Inliner took 277.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 783.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -965.8 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-12 16:55:41,413 INFO L168 Benchmark]: Boogie Preprocessor took 224.32 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.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2018-11-12 16:55:41,414 INFO L168 Benchmark]: RCFGBuilder took 9861.32 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 468.2 MB). Peak memory consumption was 468.2 MB. Max. memory is 7.1 GB. [2018-11-12 16:55:41,414 INFO L168 Benchmark]: TraceAbstraction took 193031.85 ms. Allocated memory was 2.3 GB in the beginning and 5.3 GB in the end (delta: 3.0 GB). Free memory was 1.8 GB in the beginning and 3.2 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-11-12 16:55:41,419 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1499.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 277.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 783.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -965.8 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 224.32 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.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9861.32 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 468.2 MB). Peak memory consumption was 468.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 193031.85 ms. Allocated memory was 2.3 GB in the beginning and 5.3 GB in the end (delta: 3.0 GB). Free memory was 1.8 GB in the beginning and 3.2 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 47). Cancelled while BasicCegarLoop was constructing difference of abstraction (67186states) and FLOYD_HOARE automaton (currently 10 states, 13 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 604 locations, 1 error locations. TIMEOUT Result, 192.9s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 131.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4360 SDtfs, 26974 SDslu, 3500 SDs, 0 SdLazy, 49205 SolverSat, 8453 SolverUnsat, 57 SolverUnknown, 0 SolverNotchecked, 83.0s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 5843 GetRequests, 5673 SyntacticMatches, 21 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 21.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67186occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 17.1s AbstIntTime, 8 AbstIntIterations, 1 AbstIntStrong, 0.9980890087772429 AbsIntWeakeningRatio, 0.06951026856240126 AbsIntAvgWeakeningVarsNumRemoved, 23.998420221169038 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 13437 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 30.0s InterpolantComputationTime, 6521 NumberOfCodeBlocks, 6521 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 9011 ConstructedInterpolants, 100 QuantifiedInterpolants, 15251466 SizeOfPredicates, 12 NumberOfNonLiveVariables, 4147 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 27 InterpolantComputations, 7 PerfectInterpolantSequences, 6899/7232 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown