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/Problem13_label31_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 20:28:16,391 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 20:28:16,397 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 20:28:16,412 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 20:28:16,412 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 20:28:16,413 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 20:28:16,414 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 20:28:16,416 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 20:28:16,418 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 20:28:16,419 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 20:28:16,420 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 20:28:16,420 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 20:28:16,421 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 20:28:16,422 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 20:28:16,423 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 20:28:16,424 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 20:28:16,425 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 20:28:16,427 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 20:28:16,429 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 20:28:16,431 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 20:28:16,432 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 20:28:16,433 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 20:28:16,436 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 20:28:16,436 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 20:28:16,437 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 20:28:16,438 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 20:28:16,439 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 20:28:16,440 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 20:28:16,441 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 20:28:16,442 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 20:28:16,442 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 20:28:16,443 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 20:28:16,443 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 20:28:16,444 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 20:28:16,445 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 20:28:16,445 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 20:28:16,446 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 20:28:16,461 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 20:28:16,462 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 20:28:16,463 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 20:28:16,463 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 20:28:16,463 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 20:28:16,463 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 20:28:16,463 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 20:28:16,464 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 20:28:16,464 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 20:28:16,464 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 20:28:16,464 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 20:28:16,464 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 20:28:16,465 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 20:28:16,465 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 20:28:16,465 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 20:28:16,466 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 20:28:16,466 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 20:28:16,466 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 20:28:16,466 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 20:28:16,467 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 20:28:16,467 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 20:28:16,467 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 20:28:16,467 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 20:28:16,467 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 20:28:16,468 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 20:28:16,468 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:28:16,468 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 20:28:16,468 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 20:28:16,468 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 20:28:16,469 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 20:28:16,469 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 20:28:16,469 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 20:28:16,469 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 20:28:16,470 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 20:28:16,470 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 20:28:16,517 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 20:28:16,537 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 20:28:16,542 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 20:28:16,544 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 20:28:16,545 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 20:28:16,545 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label31_true-unreach-call.c [2018-11-07 20:28:16,617 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8b0f7f65/89f29b54a24245419b8c378800ae7f8d/FLAGac27dc66f [2018-11-07 20:28:17,443 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 20:28:17,444 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label31_true-unreach-call.c [2018-11-07 20:28:17,484 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8b0f7f65/89f29b54a24245419b8c378800ae7f8d/FLAGac27dc66f [2018-11-07 20:28:17,504 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8b0f7f65/89f29b54a24245419b8c378800ae7f8d [2018-11-07 20:28:17,517 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 20:28:17,519 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 20:28:17,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 20:28:17,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 20:28:17,528 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 20:28:17,529 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:28:17" (1/1) ... [2018-11-07 20:28:17,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac02894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:17, skipping insertion in model container [2018-11-07 20:28:17,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:28:17" (1/1) ... [2018-11-07 20:28:17,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 20:28:17,726 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 20:28:19,308 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:28:19,316 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 20:28:20,097 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:28:20,139 INFO L193 MainTranslator]: Completed translation [2018-11-07 20:28:20,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:20 WrapperNode [2018-11-07 20:28:20,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 20:28:20,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 20:28:20,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 20:28:20,142 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 20:28:20,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:20" (1/1) ... [2018-11-07 20:28:20,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:20" (1/1) ... [2018-11-07 20:28:20,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 20:28:20,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 20:28:20,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 20:28:20,505 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 20:28:20,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:20" (1/1) ... [2018-11-07 20:28:20,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:20" (1/1) ... [2018-11-07 20:28:20,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:20" (1/1) ... [2018-11-07 20:28:20,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:20" (1/1) ... [2018-11-07 20:28:20,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:20" (1/1) ... [2018-11-07 20:28:20,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:20" (1/1) ... [2018-11-07 20:28:20,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:20" (1/1) ... [2018-11-07 20:28:20,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 20:28:20,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 20:28:20,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 20:28:20,903 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 20:28:20,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:28:20,978 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 20:28:20,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 20:28:20,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 20:28:20,979 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-11-07 20:28:20,980 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-11-07 20:28:20,980 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-11-07 20:28:20,980 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-11-07 20:28:20,980 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-07 20:28:20,981 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-07 20:28:20,981 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 20:28:20,981 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 20:28:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 20:28:20,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 20:28:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 20:28:20,983 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 20:28:30,609 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 20:28:30,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:28:30 BoogieIcfgContainer [2018-11-07 20:28:30,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 20:28:30,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 20:28:30,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 20:28:30,614 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 20:28:30,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:28:17" (1/3) ... [2018-11-07 20:28:30,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5892d5e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:28:30, skipping insertion in model container [2018-11-07 20:28:30,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:20" (2/3) ... [2018-11-07 20:28:30,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5892d5e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:28:30, skipping insertion in model container [2018-11-07 20:28:30,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:28:30" (3/3) ... [2018-11-07 20:28:30,618 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label31_true-unreach-call.c [2018-11-07 20:28:30,627 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 20:28:30,636 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 20:28:30,653 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 20:28:30,701 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 20:28:30,701 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 20:28:30,701 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 20:28:30,701 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 20:28:30,701 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 20:28:30,702 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 20:28:30,702 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 20:28:30,702 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 20:28:30,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-11-07 20:28:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 20:28:30,754 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:28:30,755 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:28:30,758 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:28:30,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:28:30,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1693652115, now seen corresponding path program 1 times [2018-11-07 20:28:30,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:28:30,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:28:30,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:28:30,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:28:30,818 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:28:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:28:31,214 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:28:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:28:31,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:28:31,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 20:28:31,342 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:28:31,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:28:31,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:28:31,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:28:31,367 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 3 states. [2018-11-07 20:28:40,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:28:40,194 INFO L93 Difference]: Finished difference Result 3093 states and 5715 transitions. [2018-11-07 20:28:40,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:28:40,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-07 20:28:40,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:28:40,233 INFO L225 Difference]: With dead ends: 3093 [2018-11-07 20:28:40,233 INFO L226 Difference]: Without dead ends: 1971 [2018-11-07 20:28:40,243 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:28:40,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2018-11-07 20:28:40,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1957. [2018-11-07 20:28:40,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1957 states. [2018-11-07 20:28:40,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 3535 transitions. [2018-11-07 20:28:40,416 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 3535 transitions. Word has length 47 [2018-11-07 20:28:40,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:28:40,417 INFO L480 AbstractCegarLoop]: Abstraction has 1957 states and 3535 transitions. [2018-11-07 20:28:40,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:28:40,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 3535 transitions. [2018-11-07 20:28:40,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-07 20:28:40,428 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:28:40,428 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:28:40,431 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:28:40,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:28:40,431 INFO L82 PathProgramCache]: Analyzing trace with hash 459936076, now seen corresponding path program 1 times [2018-11-07 20:28:40,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:28:40,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:28:40,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:28:40,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:28:40,434 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:28:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:28:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:28:40,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:28:40,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:28:40,814 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:28:40,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:28:40,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:28:40,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:28:40,817 INFO L87 Difference]: Start difference. First operand 1957 states and 3535 transitions. Second operand 6 states. [2018-11-07 20:28:52,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:28:52,253 INFO L93 Difference]: Finished difference Result 5627 states and 10356 transitions. [2018-11-07 20:28:52,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:28:52,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2018-11-07 20:28:52,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:28:52,277 INFO L225 Difference]: With dead ends: 5627 [2018-11-07 20:28:52,278 INFO L226 Difference]: Without dead ends: 3676 [2018-11-07 20:28:52,285 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:28:52,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2018-11-07 20:28:52,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 3643. [2018-11-07 20:28:52,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2018-11-07 20:28:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5987 transitions. [2018-11-07 20:28:52,394 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5987 transitions. Word has length 130 [2018-11-07 20:28:52,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:28:52,394 INFO L480 AbstractCegarLoop]: Abstraction has 3643 states and 5987 transitions. [2018-11-07 20:28:52,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:28:52,395 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5987 transitions. [2018-11-07 20:28:52,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-07 20:28:52,400 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:28:52,400 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:28:52,401 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:28:52,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:28:52,401 INFO L82 PathProgramCache]: Analyzing trace with hash -923575044, now seen corresponding path program 1 times [2018-11-07 20:28:52,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:28:52,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:28:52,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:28:52,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:28:52,403 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:28:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:28:52,620 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:28:52,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:28:52,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 20:28:52,621 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:28:52,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 20:28:52,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 20:28:52,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 20:28:52,622 INFO L87 Difference]: Start difference. First operand 3643 states and 5987 transitions. Second operand 5 states. [2018-11-07 20:29:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:29:02,319 INFO L93 Difference]: Finished difference Result 10947 states and 18497 transitions. [2018-11-07 20:29:02,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 20:29:02,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2018-11-07 20:29:02,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:29:02,368 INFO L225 Difference]: With dead ends: 10947 [2018-11-07 20:29:02,368 INFO L226 Difference]: Without dead ends: 7310 [2018-11-07 20:29:02,382 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:29:02,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7310 states. [2018-11-07 20:29:02,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7310 to 7122. [2018-11-07 20:29:02,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7122 states. [2018-11-07 20:29:02,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7122 states to 7122 states and 10912 transitions. [2018-11-07 20:29:02,623 INFO L78 Accepts]: Start accepts. Automaton has 7122 states and 10912 transitions. Word has length 146 [2018-11-07 20:29:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:29:02,624 INFO L480 AbstractCegarLoop]: Abstraction has 7122 states and 10912 transitions. [2018-11-07 20:29:02,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 20:29:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 7122 states and 10912 transitions. [2018-11-07 20:29:02,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-07 20:29:02,630 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:29:02,630 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:29:02,631 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:29:02,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:29:02,632 INFO L82 PathProgramCache]: Analyzing trace with hash -616934008, now seen corresponding path program 1 times [2018-11-07 20:29:02,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:29:02,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:29:02,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:29:02,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:29:02,634 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:29:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:29:02,975 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:29:03,146 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:29:03,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:29:03,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:29:03,147 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:29:03,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:29:03,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:29:03,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:29:03,149 INFO L87 Difference]: Start difference. First operand 7122 states and 10912 transitions. Second operand 6 states. [2018-11-07 20:29:13,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:29:13,559 INFO L93 Difference]: Finished difference Result 19740 states and 31225 transitions. [2018-11-07 20:29:13,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:29:13,569 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2018-11-07 20:29:13,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:29:13,631 INFO L225 Difference]: With dead ends: 19740 [2018-11-07 20:29:13,631 INFO L226 Difference]: Without dead ends: 12624 [2018-11-07 20:29:13,670 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:29:13,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12624 states. [2018-11-07 20:29:13,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12624 to 12422. [2018-11-07 20:29:13,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12422 states. [2018-11-07 20:29:14,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12422 states to 12422 states and 17996 transitions. [2018-11-07 20:29:14,012 INFO L78 Accepts]: Start accepts. Automaton has 12422 states and 17996 transitions. Word has length 183 [2018-11-07 20:29:14,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:29:14,012 INFO L480 AbstractCegarLoop]: Abstraction has 12422 states and 17996 transitions. [2018-11-07 20:29:14,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:29:14,013 INFO L276 IsEmpty]: Start isEmpty. Operand 12422 states and 17996 transitions. [2018-11-07 20:29:14,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-07 20:29:14,018 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:29:14,019 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:29:14,019 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:29:14,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:29:14,019 INFO L82 PathProgramCache]: Analyzing trace with hash -566668791, now seen corresponding path program 1 times [2018-11-07 20:29:14,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:29:14,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:29:14,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:29:14,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:29:14,021 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:29:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:29:14,656 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:29:14,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:29:14,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:29:14,656 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:29:14,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:29:14,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:29:14,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:29:14,658 INFO L87 Difference]: Start difference. First operand 12422 states and 17996 transitions. Second operand 6 states. [2018-11-07 20:29:28,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:29:28,199 INFO L93 Difference]: Finished difference Result 42968 states and 69581 transitions. [2018-11-07 20:29:28,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 20:29:28,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 205 [2018-11-07 20:29:28,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:29:28,374 INFO L225 Difference]: With dead ends: 42968 [2018-11-07 20:29:28,374 INFO L226 Difference]: Without dead ends: 30552 [2018-11-07 20:29:28,451 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-07 20:29:28,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30552 states. [2018-11-07 20:29:29,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30552 to 30314. [2018-11-07 20:29:29,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30314 states. [2018-11-07 20:29:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30314 states to 30314 states and 44017 transitions. [2018-11-07 20:29:29,632 INFO L78 Accepts]: Start accepts. Automaton has 30314 states and 44017 transitions. Word has length 205 [2018-11-07 20:29:29,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:29:29,633 INFO L480 AbstractCegarLoop]: Abstraction has 30314 states and 44017 transitions. [2018-11-07 20:29:29,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:29:29,633 INFO L276 IsEmpty]: Start isEmpty. Operand 30314 states and 44017 transitions. [2018-11-07 20:29:29,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-07 20:29:29,643 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:29:29,644 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:29:29,644 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:29:29,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:29:29,645 INFO L82 PathProgramCache]: Analyzing trace with hash -45725775, now seen corresponding path program 1 times [2018-11-07 20:29:29,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:29:29,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:29:29,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:29:29,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:29:29,646 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:29:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:29:30,001 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:29:30,464 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:29:30,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:29:30,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:29:30,465 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:29:30,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:29:30,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:29:30,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:29:30,466 INFO L87 Difference]: Start difference. First operand 30314 states and 44017 transitions. Second operand 6 states. [2018-11-07 20:29:42,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:29:42,233 INFO L93 Difference]: Finished difference Result 73860 states and 116109 transitions. [2018-11-07 20:29:42,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:29:42,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 228 [2018-11-07 20:29:42,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:29:42,395 INFO L225 Difference]: With dead ends: 73860 [2018-11-07 20:29:42,396 INFO L226 Difference]: Without dead ends: 43552 [2018-11-07 20:29:42,492 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:29:42,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43552 states. [2018-11-07 20:29:43,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43552 to 43246. [2018-11-07 20:29:43,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43246 states. [2018-11-07 20:29:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43246 states to 43246 states and 61390 transitions. [2018-11-07 20:29:43,428 INFO L78 Accepts]: Start accepts. Automaton has 43246 states and 61390 transitions. Word has length 228 [2018-11-07 20:29:43,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:29:43,429 INFO L480 AbstractCegarLoop]: Abstraction has 43246 states and 61390 transitions. [2018-11-07 20:29:43,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:29:43,429 INFO L276 IsEmpty]: Start isEmpty. Operand 43246 states and 61390 transitions. [2018-11-07 20:29:43,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-11-07 20:29:43,441 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:29:43,441 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:29:43,441 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:29:43,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:29:43,442 INFO L82 PathProgramCache]: Analyzing trace with hash -835857679, now seen corresponding path program 1 times [2018-11-07 20:29:43,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:29:43,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:29:43,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:29:43,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:29:43,443 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:29:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:29:43,809 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 80 proven. 94 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:29:43,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:29:43,810 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:29:43,811 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 253 with the following transitions: [2018-11-07 20:29:43,820 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2903], [2905], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3257], [3258], [3262], [3266], [3270], [3274], [3278], [3282], [3285], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-11-07 20:29:43,908 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:29:43,909 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:29:44,794 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:29:44,797 INFO L272 AbstractInterpreter]: Visited 111 different actions 111 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-11-07 20:29:44,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:29:44,845 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:29:45,696 INFO L227 lantSequenceWeakener]: Weakened 230 states. On average, predicates are now at 71.45% of their original sizes. [2018-11-07 20:29:45,696 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:29:46,278 INFO L415 sIntCurrentIteration]: We unified 251 AI predicates to 251 [2018-11-07 20:29:46,279 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:29:46,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:29:46,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-11-07 20:29:46,281 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:29:46,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 20:29:46,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 20:29:46,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-07 20:29:46,282 INFO L87 Difference]: Start difference. First operand 43246 states and 61390 transitions. Second operand 11 states. [2018-11-07 20:30:01,539 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:30:39,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:30:39,189 INFO L93 Difference]: Finished difference Result 87295 states and 123690 transitions. [2018-11-07 20:30:39,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 20:30:39,189 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 252 [2018-11-07 20:30:39,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:30:39,331 INFO L225 Difference]: With dead ends: 87295 [2018-11-07 20:30:39,331 INFO L226 Difference]: Without dead ends: 44055 [2018-11-07 20:30:39,431 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 256 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2018-11-07 20:30:39,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44055 states. [2018-11-07 20:30:40,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44055 to 44050. [2018-11-07 20:30:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44050 states. [2018-11-07 20:30:40,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44050 states to 44050 states and 62205 transitions. [2018-11-07 20:30:40,376 INFO L78 Accepts]: Start accepts. Automaton has 44050 states and 62205 transitions. Word has length 252 [2018-11-07 20:30:40,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:30:40,377 INFO L480 AbstractCegarLoop]: Abstraction has 44050 states and 62205 transitions. [2018-11-07 20:30:40,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 20:30:40,377 INFO L276 IsEmpty]: Start isEmpty. Operand 44050 states and 62205 transitions. [2018-11-07 20:30:40,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-11-07 20:30:40,404 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:30:40,404 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 20:30:40,405 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:30:40,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:30:40,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1165329692, now seen corresponding path program 1 times [2018-11-07 20:30:40,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:30:40,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:30:40,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:30:40,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:30:40,407 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:30:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:30:41,029 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 319 proven. 2 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-07 20:30:41,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:30:41,029 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:30:41,029 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 354 with the following transitions: [2018-11-07 20:30:41,030 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2903], [2905], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3257], [3258], [3262], [3265], [3266], [3270], [3274], [3278], [3282], [3285], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-11-07 20:30:41,034 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:30:41,035 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:30:41,255 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:30:42,519 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:30:42,520 INFO L272 AbstractInterpreter]: Visited 115 different actions 564 times. Merged at 7 different actions 33 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 3 different actions. Largest state had 26 variables. [2018-11-07 20:30:42,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:30:42,523 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:30:43,110 INFO L227 lantSequenceWeakener]: Weakened 350 states. On average, predicates are now at 71.12% of their original sizes. [2018-11-07 20:30:43,111 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:30:43,426 INFO L415 sIntCurrentIteration]: We unified 352 AI predicates to 352 [2018-11-07 20:30:43,427 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:30:43,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:30:43,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 20:30:43,427 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:30:43,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 20:30:43,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 20:30:43,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 20:30:43,428 INFO L87 Difference]: Start difference. First operand 44050 states and 62205 transitions. Second operand 10 states.