java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label18.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 18:10:46,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 18:10:46,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 18:10:46,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 18:10:46,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 18:10:46,674 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 18:10:46,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 18:10:46,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 18:10:46,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 18:10:46,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 18:10:46,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 18:10:46,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 18:10:46,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 18:10:46,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 18:10:46,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 18:10:46,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 18:10:46,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 18:10:46,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 18:10:46,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 18:10:46,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 18:10:46,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 18:10:46,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 18:10:46,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 18:10:46,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 18:10:46,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 18:10:46,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 18:10:46,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 18:10:46,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 18:10:46,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 18:10:46,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 18:10:46,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 18:10:46,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 18:10:46,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 18:10:46,702 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 18:10:46,703 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 18:10:46,703 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 18:10:46,704 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 18:10:46,704 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 18:10:46,704 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 18:10:46,705 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 18:10:46,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 18:10:46,707 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 18:10:46,722 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 18:10:46,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 18:10:46,722 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 18:10:46,723 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 18:10:46,723 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 18:10:46,723 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 18:10:46,724 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 18:10:46,724 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 18:10:46,724 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 18:10:46,724 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 18:10:46,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 18:10:46,725 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 18:10:46,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 18:10:46,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 18:10:46,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 18:10:46,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 18:10:46,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 18:10:46,726 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 18:10:46,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 18:10:46,727 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 18:10:46,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 18:10:46,727 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 18:10:46,727 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 18:10:46,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 18:10:46,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 18:10:46,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 18:10:46,728 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 18:10:46,728 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 18:10:46,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 18:10:46,729 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 18:10:46,758 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 18:10:46,771 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 18:10:46,775 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 18:10:46,776 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 18:10:46,777 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 18:10:46,778 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label18.c [2019-09-09 18:10:46,847 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/504dc3c0c/9655c9c504a1499d87d1f24b15f6da1c/FLAG23e42a6c8 [2019-09-09 18:10:47,456 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 18:10:47,457 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label18.c [2019-09-09 18:10:47,481 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/504dc3c0c/9655c9c504a1499d87d1f24b15f6da1c/FLAG23e42a6c8 [2019-09-09 18:10:47,695 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/504dc3c0c/9655c9c504a1499d87d1f24b15f6da1c [2019-09-09 18:10:47,708 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 18:10:47,710 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 18:10:47,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 18:10:47,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 18:10:47,720 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 18:10:47,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 06:10:47" (1/1) ... [2019-09-09 18:10:47,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48607f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:10:47, skipping insertion in model container [2019-09-09 18:10:47,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 06:10:47" (1/1) ... [2019-09-09 18:10:47,734 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 18:10:47,803 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 18:10:48,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 18:10:48,385 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 18:10:48,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 18:10:48,533 INFO L192 MainTranslator]: Completed translation [2019-09-09 18:10:48,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:10:48 WrapperNode [2019-09-09 18:10:48,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 18:10:48,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 18:10:48,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 18:10:48,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 18:10:48,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:10:48" (1/1) ... [2019-09-09 18:10:48,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:10:48" (1/1) ... [2019-09-09 18:10:48,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:10:48" (1/1) ... [2019-09-09 18:10:48,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:10:48" (1/1) ... [2019-09-09 18:10:48,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:10:48" (1/1) ... [2019-09-09 18:10:48,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:10:48" (1/1) ... [2019-09-09 18:10:48,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:10:48" (1/1) ... [2019-09-09 18:10:48,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 18:10:48,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 18:10:48,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 18:10:48,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 18:10:48,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:10:48" (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 [2019-09-09 18:10:48,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 18:10:48,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 18:10:48,791 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-09 18:10:48,791 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 18:10:48,791 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-09 18:10:48,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 18:10:48,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 18:10:48,792 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-09 18:10:48,792 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 18:10:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 18:10:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 18:10:50,162 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 18:10:50,162 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 18:10:50,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 06:10:50 BoogieIcfgContainer [2019-09-09 18:10:50,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 18:10:50,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 18:10:50,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 18:10:50,169 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 18:10:50,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 06:10:47" (1/3) ... [2019-09-09 18:10:50,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78b8fb0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 06:10:50, skipping insertion in model container [2019-09-09 18:10:50,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:10:48" (2/3) ... [2019-09-09 18:10:50,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78b8fb0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 06:10:50, skipping insertion in model container [2019-09-09 18:10:50,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 06:10:50" (3/3) ... [2019-09-09 18:10:50,173 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label18.c [2019-09-09 18:10:50,183 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 18:10:50,192 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 18:10:50,209 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 18:10:50,236 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 18:10:50,237 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 18:10:50,237 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 18:10:50,237 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 18:10:50,237 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 18:10:50,237 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 18:10:50,238 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 18:10:50,238 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 18:10:50,264 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-09-09 18:10:50,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-09 18:10:50,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:10:50,276 INFO L399 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] [2019-09-09 18:10:50,278 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:10:50,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:10:50,284 INFO L82 PathProgramCache]: Analyzing trace with hash 730753051, now seen corresponding path program 1 times [2019-09-09 18:10:50,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:10:50,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:10:50,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:10:50,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:10:50,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:10:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:10:50,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 18:10:50,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 18:10:50,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 18:10:50,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:10:50,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 18:10:50,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 18:10:50,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 18:10:50,568 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 3 states. [2019-09-09 18:10:51,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:10:51,723 INFO L93 Difference]: Finished difference Result 440 states and 711 transitions. [2019-09-09 18:10:51,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 18:10:51,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-09 18:10:51,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:10:51,757 INFO L225 Difference]: With dead ends: 440 [2019-09-09 18:10:51,758 INFO L226 Difference]: Without dead ends: 372 [2019-09-09 18:10:51,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 18:10:51,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-09-09 18:10:51,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2019-09-09 18:10:51,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-09-09 18:10:51,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 602 transitions. [2019-09-09 18:10:51,876 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 602 transitions. Word has length 26 [2019-09-09 18:10:51,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:10:51,876 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 602 transitions. [2019-09-09 18:10:51,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 18:10:51,877 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 602 transitions. [2019-09-09 18:10:51,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-09 18:10:51,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:10:51,881 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 18:10:51,881 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:10:51,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:10:51,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1043318331, now seen corresponding path program 1 times [2019-09-09 18:10:51,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:10:51,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:10:51,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:10:51,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:10:51,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:10:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:10:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 18:10:52,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 18:10:52,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 18:10:52,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:10:52,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 18:10:52,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 18:10:52,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 18:10:52,099 INFO L87 Difference]: Start difference. First operand 372 states and 602 transitions. Second operand 6 states. [2019-09-09 18:10:53,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:10:53,710 INFO L93 Difference]: Finished difference Result 756 states and 1199 transitions. [2019-09-09 18:10:53,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 18:10:53,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-09-09 18:10:53,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:10:53,719 INFO L225 Difference]: With dead ends: 756 [2019-09-09 18:10:53,720 INFO L226 Difference]: Without dead ends: 756 [2019-09-09 18:10:53,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-09 18:10:53,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2019-09-09 18:10:53,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 752. [2019-09-09 18:10:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-09-09 18:10:53,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1190 transitions. [2019-09-09 18:10:53,766 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1190 transitions. Word has length 95 [2019-09-09 18:10:53,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:10:53,767 INFO L475 AbstractCegarLoop]: Abstraction has 752 states and 1190 transitions. [2019-09-09 18:10:53,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 18:10:53,768 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1190 transitions. [2019-09-09 18:10:53,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-09 18:10:53,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:10:53,771 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 18:10:53,772 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:10:53,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:10:53,772 INFO L82 PathProgramCache]: Analyzing trace with hash -461532642, now seen corresponding path program 1 times [2019-09-09 18:10:53,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:10:53,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:10:53,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:10:53,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:10:53,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:10:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:10:53,933 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 18:10:53,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 18:10:53,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 18:10:53,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:10:53,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 18:10:53,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 18:10:53,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 18:10:53,935 INFO L87 Difference]: Start difference. First operand 752 states and 1190 transitions. Second operand 5 states. [2019-09-09 18:10:55,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:10:55,259 INFO L93 Difference]: Finished difference Result 1158 states and 1699 transitions. [2019-09-09 18:10:55,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 18:10:55,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-09-09 18:10:55,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:10:55,271 INFO L225 Difference]: With dead ends: 1158 [2019-09-09 18:10:55,272 INFO L226 Difference]: Without dead ends: 1158 [2019-09-09 18:10:55,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-09 18:10:55,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-09-09 18:10:55,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1138. [2019-09-09 18:10:55,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2019-09-09 18:10:55,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1632 transitions. [2019-09-09 18:10:55,324 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1632 transitions. Word has length 96 [2019-09-09 18:10:55,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:10:55,325 INFO L475 AbstractCegarLoop]: Abstraction has 1138 states and 1632 transitions. [2019-09-09 18:10:55,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 18:10:55,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1632 transitions. [2019-09-09 18:10:55,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-09 18:10:55,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:10:55,329 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 18:10:55,329 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:10:55,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:10:55,330 INFO L82 PathProgramCache]: Analyzing trace with hash 889296378, now seen corresponding path program 1 times [2019-09-09 18:10:55,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:10:55,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:10:55,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:10:55,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:10:55,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:10:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:10:55,476 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 18:10:55,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 18:10:55,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 18:10:55,477 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:10:55,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 18:10:55,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 18:10:55,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 18:10:55,480 INFO L87 Difference]: Start difference. First operand 1138 states and 1632 transitions. Second operand 5 states. [2019-09-09 18:10:56,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:10:56,742 INFO L93 Difference]: Finished difference Result 1748 states and 2410 transitions. [2019-09-09 18:10:56,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 18:10:56,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-09 18:10:56,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:10:56,753 INFO L225 Difference]: With dead ends: 1748 [2019-09-09 18:10:56,753 INFO L226 Difference]: Without dead ends: 1748 [2019-09-09 18:10:56,754 INFO L628 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 [2019-09-09 18:10:56,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2019-09-09 18:10:56,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1326. [2019-09-09 18:10:56,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2019-09-09 18:10:56,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1863 transitions. [2019-09-09 18:10:56,808 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1863 transitions. Word has length 98 [2019-09-09 18:10:56,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:10:56,809 INFO L475 AbstractCegarLoop]: Abstraction has 1326 states and 1863 transitions. [2019-09-09 18:10:56,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 18:10:56,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1863 transitions. [2019-09-09 18:10:56,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-09 18:10:56,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:10:56,814 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 18:10:56,815 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:10:56,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:10:56,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2098961713, now seen corresponding path program 1 times [2019-09-09 18:10:56,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:10:56,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:10:56,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:10:56,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:10:56,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:10:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:10:56,966 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-09 18:10:56,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 18:10:56,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 18:10:56,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:10:56,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 18:10:56,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 18:10:56,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 18:10:56,968 INFO L87 Difference]: Start difference. First operand 1326 states and 1863 transitions. Second operand 4 states. [2019-09-09 18:10:58,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:10:58,404 INFO L93 Difference]: Finished difference Result 2808 states and 3833 transitions. [2019-09-09 18:10:58,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 18:10:58,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-09-09 18:10:58,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:10:58,423 INFO L225 Difference]: With dead ends: 2808 [2019-09-09 18:10:58,423 INFO L226 Difference]: Without dead ends: 2808 [2019-09-09 18:10:58,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 18:10:58,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2019-09-09 18:10:58,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 1712. [2019-09-09 18:10:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1712 states. [2019-09-09 18:10:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2319 transitions. [2019-09-09 18:10:58,498 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2319 transitions. Word has length 182 [2019-09-09 18:10:58,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:10:58,500 INFO L475 AbstractCegarLoop]: Abstraction has 1712 states and 2319 transitions. [2019-09-09 18:10:58,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 18:10:58,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2319 transitions. [2019-09-09 18:10:58,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-09 18:10:58,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:10:58,510 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 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] [2019-09-09 18:10:58,511 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:10:58,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:10:58,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1099287497, now seen corresponding path program 1 times [2019-09-09 18:10:58,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:10:58,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:10:58,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:10:58,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:10:58,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:10:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:10:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-09 18:10:58,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 18:10:58,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 18:10:58,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:10:58,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 18:10:58,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 18:10:58,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 18:10:58,736 INFO L87 Difference]: Start difference. First operand 1712 states and 2319 transitions. Second operand 3 states. [2019-09-09 18:10:59,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:10:59,598 INFO L93 Difference]: Finished difference Result 2644 states and 3640 transitions. [2019-09-09 18:10:59,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 18:10:59,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2019-09-09 18:10:59,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:10:59,616 INFO L225 Difference]: With dead ends: 2644 [2019-09-09 18:10:59,616 INFO L226 Difference]: Without dead ends: 2644 [2019-09-09 18:10:59,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 18:10:59,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2019-09-09 18:10:59,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 2458. [2019-09-09 18:10:59,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2458 states. [2019-09-09 18:10:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2458 states to 2458 states and 3386 transitions. [2019-09-09 18:10:59,680 INFO L78 Accepts]: Start accepts. Automaton has 2458 states and 3386 transitions. Word has length 242 [2019-09-09 18:10:59,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:10:59,681 INFO L475 AbstractCegarLoop]: Abstraction has 2458 states and 3386 transitions. [2019-09-09 18:10:59,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 18:10:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 3386 transitions. [2019-09-09 18:10:59,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-09 18:10:59,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:10:59,691 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-09 18:10:59,691 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:10:59,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:10:59,692 INFO L82 PathProgramCache]: Analyzing trace with hash -967463410, now seen corresponding path program 1 times [2019-09-09 18:10:59,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:10:59,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:10:59,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:10:59,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:10:59,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:10:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:11:00,599 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 148 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 18:11:00,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 18:11:00,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 18:11:00,602 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 308 with the following transitions: [2019-09-09 18:11:00,604 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [894], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-09-09 18:11:00,669 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 18:11:00,669 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 18:11:21,561 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 18:11:21,563 INFO L272 AbstractInterpreter]: Visited 174 different actions 174 times. Never merged. Never widened. Performed 387 root evaluator evaluations with a maximum evaluation depth of 14. Performed 387 inverse root evaluator evaluations with a maximum inverse evaluation depth of 14. Never found a fixpoint. Largest state had 24 variables. [2019-09-09 18:11:21,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:11:21,567 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 18:11:41,330 INFO L227 lantSequenceWeakener]: Weakened 288 states. On average, predicates are now at 77.5% of their original sizes. [2019-09-09 18:11:41,330 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 18:11:41,462 INFO L420 sIntCurrentIteration]: We unified 306 AI predicates to 306 [2019-09-09 18:11:41,462 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 18:11:41,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 18:11:41,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 20 [2019-09-09 18:11:41,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:11:41,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-09 18:11:41,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-09 18:11:41,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-09-09 18:11:41,465 INFO L87 Difference]: Start difference. First operand 2458 states and 3386 transitions. Second operand 13 states. [2019-09-09 18:13:37,394 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 18:14:36,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:14:36,068 INFO L93 Difference]: Finished difference Result 2644 states and 3583 transitions. [2019-09-09 18:14:36,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-09 18:14:36,069 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 307 [2019-09-09 18:14:36,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:14:36,081 INFO L225 Difference]: With dead ends: 2644 [2019-09-09 18:14:36,082 INFO L226 Difference]: Without dead ends: 2644 [2019-09-09 18:14:36,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-09-09 18:14:36,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2019-09-09 18:14:36,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 2640. [2019-09-09 18:14:36,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2640 states. [2019-09-09 18:14:36,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 3576 transitions. [2019-09-09 18:14:36,155 INFO L78 Accepts]: Start accepts. Automaton has 2640 states and 3576 transitions. Word has length 307 [2019-09-09 18:14:36,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:14:36,155 INFO L475 AbstractCegarLoop]: Abstraction has 2640 states and 3576 transitions. [2019-09-09 18:14:36,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-09 18:14:36,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 3576 transitions. [2019-09-09 18:14:36,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-09 18:14:36,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:14:36,167 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 18:14:36,168 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:14:36,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:14:36,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1046410983, now seen corresponding path program 1 times [2019-09-09 18:14:36,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:14:36,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:14:36,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:14:36,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:14:36,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:14:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:14:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 143 proven. 190 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-09 18:14:37,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 18:14:37,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 18:14:37,557 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 392 with the following transitions: [2019-09-09 18:14:37,559 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [894], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-09-09 18:14:37,579 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 18:14:37,580 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 18:15:05,266 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 18:15:05,268 INFO L272 AbstractInterpreter]: Visited 178 different actions 351 times. Merged at 4 different actions 5 times. Never widened. Performed 656 root evaluator evaluations with a maximum evaluation depth of 14. Performed 656 inverse root evaluator evaluations with a maximum inverse evaluation depth of 14. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-09-09 18:15:05,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:15:05,268 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 18:15:14,884 INFO L227 lantSequenceWeakener]: Weakened 388 states. On average, predicates are now at 77.38% of their original sizes. [2019-09-09 18:15:14,885 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 18:15:15,003 INFO L420 sIntCurrentIteration]: We unified 390 AI predicates to 390 [2019-09-09 18:15:15,003 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 18:15:15,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 18:15:15,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 22 [2019-09-09 18:15:15,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:15:15,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-09 18:15:15,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-09 18:15:15,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-09 18:15:15,006 INFO L87 Difference]: Start difference. First operand 2640 states and 3576 transitions. Second operand 12 states. [2019-09-09 18:15:51,971 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 18:16:19,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:16:19,283 INFO L93 Difference]: Finished difference Result 2856 states and 3792 transitions. [2019-09-09 18:16:19,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-09 18:16:19,284 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 391 [2019-09-09 18:16:19,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:16:19,295 INFO L225 Difference]: With dead ends: 2856 [2019-09-09 18:16:19,295 INFO L226 Difference]: Without dead ends: 2641 [2019-09-09 18:16:19,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-09-09 18:16:19,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2019-09-09 18:16:19,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 2640. [2019-09-09 18:16:19,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2640 states. [2019-09-09 18:16:19,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 3570 transitions. [2019-09-09 18:16:19,357 INFO L78 Accepts]: Start accepts. Automaton has 2640 states and 3570 transitions. Word has length 391 [2019-09-09 18:16:19,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:16:19,358 INFO L475 AbstractCegarLoop]: Abstraction has 2640 states and 3570 transitions. [2019-09-09 18:16:19,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-09 18:16:19,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 3570 transitions. [2019-09-09 18:16:19,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-09-09 18:16:19,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:16:19,370 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 18:16:19,370 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:16:19,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:16:19,371 INFO L82 PathProgramCache]: Analyzing trace with hash 84981307, now seen corresponding path program 1 times [2019-09-09 18:16:19,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:16:19,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:16:19,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:16:19,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:16:19,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:16:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:16:20,975 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 68 proven. 317 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-09 18:16:20,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 18:16:20,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 18:16:20,977 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 418 with the following transitions: [2019-09-09 18:16:20,978 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [894], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-09-09 18:16:20,984 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 18:16:20,984 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 18:16:58,564 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 18:16:58,565 INFO L272 AbstractInterpreter]: Visited 178 different actions 351 times. Merged at 4 different actions 5 times. Never widened. Performed 793 root evaluator evaluations with a maximum evaluation depth of 14. Performed 793 inverse root evaluator evaluations with a maximum inverse evaluation depth of 14. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-09-09 18:16:58,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:16:58,565 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 18:17:22,325 INFO L227 lantSequenceWeakener]: Weakened 414 states. On average, predicates are now at 77.37% of their original sizes. [2019-09-09 18:17:22,325 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 18:17:22,451 INFO L420 sIntCurrentIteration]: We unified 416 AI predicates to 416 [2019-09-09 18:17:22,452 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 18:17:22,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 18:17:22,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 26 [2019-09-09 18:17:22,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:17:22,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-09 18:17:22,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-09 18:17:22,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-09-09 18:17:22,454 INFO L87 Difference]: Start difference. First operand 2640 states and 3570 transitions. Second operand 13 states. [2019-09-09 18:18:12,219 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 18:20:19,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:20:19,480 INFO L93 Difference]: Finished difference Result 2826 states and 3770 transitions. [2019-09-09 18:20:19,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-09 18:20:19,480 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 417 [2019-09-09 18:20:19,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:20:19,493 INFO L225 Difference]: With dead ends: 2826 [2019-09-09 18:20:19,493 INFO L226 Difference]: Without dead ends: 2826 [2019-09-09 18:20:19,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2019-09-09 18:20:19,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2019-09-09 18:20:19,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2824. [2019-09-09 18:20:19,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2019-09-09 18:20:19,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3768 transitions. [2019-09-09 18:20:19,557 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3768 transitions. Word has length 417 [2019-09-09 18:20:19,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:20:19,558 INFO L475 AbstractCegarLoop]: Abstraction has 2824 states and 3768 transitions. [2019-09-09 18:20:19,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-09 18:20:19,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3768 transitions. [2019-09-09 18:20:19,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2019-09-09 18:20:19,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:20:19,579 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 18:20:19,579 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:20:19,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:20:19,580 INFO L82 PathProgramCache]: Analyzing trace with hash 831864468, now seen corresponding path program 1 times [2019-09-09 18:20:19,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:20:19,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:20:19,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:20:19,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:20:19,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:20:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:20:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 166 proven. 166 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-09-09 18:20:19,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 18:20:19,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 18:20:19,937 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 502 with the following transitions: [2019-09-09 18:20:19,937 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [894], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-09-09 18:20:19,941 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 18:20:19,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 18:20:58,004 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 18:20:58,004 INFO L272 AbstractInterpreter]: Visited 179 different actions 535 times. Merged at 6 different actions 18 times. Never widened. Performed 893 root evaluator evaluations with a maximum evaluation depth of 14. Performed 893 inverse root evaluator evaluations with a maximum inverse evaluation depth of 14. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2019-09-09 18:20:58,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:20:58,005 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 18:21:08,426 INFO L227 lantSequenceWeakener]: Weakened 498 states. On average, predicates are now at 77.37% of their original sizes. [2019-09-09 18:21:08,426 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 18:21:08,499 INFO L420 sIntCurrentIteration]: We unified 500 AI predicates to 500 [2019-09-09 18:21:08,500 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 18:21:08,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 18:21:08,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2019-09-09 18:21:08,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:21:08,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-09 18:21:08,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-09 18:21:08,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-09 18:21:08,502 INFO L87 Difference]: Start difference. First operand 2824 states and 3768 transitions. Second operand 10 states. [2019-09-09 18:21:42,463 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 18:22:43,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:22:43,493 INFO L93 Difference]: Finished difference Result 3011 states and 3954 transitions. [2019-09-09 18:22:43,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-09 18:22:43,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 501 [2019-09-09 18:22:43,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:22:43,504 INFO L225 Difference]: With dead ends: 3011 [2019-09-09 18:22:43,505 INFO L226 Difference]: Without dead ends: 2826 [2019-09-09 18:22:43,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-09-09 18:22:43,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2019-09-09 18:22:43,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2824. [2019-09-09 18:22:43,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2019-09-09 18:22:43,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3757 transitions. [2019-09-09 18:22:43,565 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3757 transitions. Word has length 501 [2019-09-09 18:22:43,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:22:43,566 INFO L475 AbstractCegarLoop]: Abstraction has 2824 states and 3757 transitions. [2019-09-09 18:22:43,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-09 18:22:43,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3757 transitions. [2019-09-09 18:22:43,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-09-09 18:22:43,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:22:43,583 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 18:22:43,583 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:22:43,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:22:43,584 INFO L82 PathProgramCache]: Analyzing trace with hash -178252185, now seen corresponding path program 1 times [2019-09-09 18:22:43,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:22:43,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:22:43,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:22:43,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:22:43,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:22:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:22:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 304 proven. 112 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-09-09 18:22:44,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 18:22:44,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 18:22:44,072 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 527 with the following transitions: [2019-09-09 18:22:44,073 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [894], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-09-09 18:22:44,077 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 18:22:44,077 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 18:23:08,407 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 18:24:22,781 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 18:24:22,781 INFO L272 AbstractInterpreter]: Visited 179 different actions 880 times. Merged at 6 different actions 25 times. Never widened. Performed 1623 root evaluator evaluations with a maximum evaluation depth of 22. Performed 1623 inverse root evaluator evaluations with a maximum inverse evaluation depth of 22. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2019-09-09 18:24:22,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:24:22,782 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 18:24:40,388 INFO L227 lantSequenceWeakener]: Weakened 523 states. On average, predicates are now at 77.37% of their original sizes. [2019-09-09 18:24:40,388 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 18:24:40,467 INFO L420 sIntCurrentIteration]: We unified 525 AI predicates to 525 [2019-09-09 18:24:40,467 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 18:24:40,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 18:24:40,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2019-09-09 18:24:40,468 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:24:40,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-09 18:24:40,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-09 18:24:40,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-09 18:24:40,469 INFO L87 Difference]: Start difference. First operand 2824 states and 3757 transitions. Second operand 10 states.