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/systemc/pipeline.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:19:38,527 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:19:38,530 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:19:38,547 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:19:38,547 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:19:38,549 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:19:38,551 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:19:38,560 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:19:38,562 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:19:38,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:19:38,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:19:38,565 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:19:38,566 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:19:38,569 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:19:38,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:19:38,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:19:38,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:19:38,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:19:38,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:19:38,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:19:38,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:19:38,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:19:38,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:19:38,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:19:38,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:19:38,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:19:38,586 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:19:38,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:19:38,587 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:19:38,588 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:19:38,588 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:19:38,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:19:38,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:19:38,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:19:38,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:19:38,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:19:38,597 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:19:38,597 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:19:38,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:19:38,598 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:19:38,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:19:38,600 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-10 03:19:38,628 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:19:38,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:19:38,631 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:19:38,631 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:19:38,634 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:19:38,634 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:19:38,634 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:19:38,635 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:19:38,635 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:19:38,635 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:19:38,636 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:19:38,636 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:19:38,636 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:19:38,636 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:19:38,637 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:19:38,637 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:19:38,637 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:19:38,638 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:19:38,638 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:19:38,639 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:19:38,639 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:19:38,639 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:19:38,639 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:19:38,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:19:38,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:19:38,640 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:19:38,641 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:19:38,641 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:19:38,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:19:38,641 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:19:38,668 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:19:38,681 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:19:38,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:19:38,686 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:19:38,686 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:19:38,687 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pipeline.cil-1.c [2019-09-10 03:19:38,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5128ae9d3/1c5649d80e0840e1aea97b0dd05da78d/FLAGd9127bf07 [2019-09-10 03:19:39,182 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:19:39,183 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pipeline.cil-1.c [2019-09-10 03:19:39,200 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5128ae9d3/1c5649d80e0840e1aea97b0dd05da78d/FLAGd9127bf07 [2019-09-10 03:19:39,526 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5128ae9d3/1c5649d80e0840e1aea97b0dd05da78d [2019-09-10 03:19:39,536 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:19:39,538 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:19:39,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:19:39,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:19:39,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:19:39,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:19:39" (1/1) ... [2019-09-10 03:19:39,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dfd9e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:19:39, skipping insertion in model container [2019-09-10 03:19:39,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:19:39" (1/1) ... [2019-09-10 03:19:39,554 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:19:39,610 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:19:39,868 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:19:39,876 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:19:40,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:19:40,047 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:19:40,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:19:40 WrapperNode [2019-09-10 03:19:40,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:19:40,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:19:40,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:19:40,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:19:40,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:19:40" (1/1) ... [2019-09-10 03:19:40,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:19:40" (1/1) ... [2019-09-10 03:19:40,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:19:40" (1/1) ... [2019-09-10 03:19:40,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:19:40" (1/1) ... [2019-09-10 03:19:40,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:19:40" (1/1) ... [2019-09-10 03:19:40,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:19:40" (1/1) ... [2019-09-10 03:19:40,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:19:40" (1/1) ... [2019-09-10 03:19:40,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:19:40,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:19:40,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:19:40,122 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:19:40,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:19:40" (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-10 03:19:40,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:19:40,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:19:40,187 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-10 03:19:40,188 INFO L138 BoogieDeclarations]: Found implementation of procedure N_generate [2019-09-10 03:19:40,188 INFO L138 BoogieDeclarations]: Found implementation of procedure S1_addsub [2019-09-10 03:19:40,188 INFO L138 BoogieDeclarations]: Found implementation of procedure S2_presdbl [2019-09-10 03:19:40,188 INFO L138 BoogieDeclarations]: Found implementation of procedure S3_zero [2019-09-10 03:19:40,188 INFO L138 BoogieDeclarations]: Found implementation of procedure D_print [2019-09-10 03:19:40,188 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-10 03:19:40,189 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-10 03:19:40,189 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:19:40,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:19:40,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:19:40,189 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-10 03:19:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure N_generate [2019-09-10 03:19:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure S1_addsub [2019-09-10 03:19:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure S2_presdbl [2019-09-10 03:19:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure S3_zero [2019-09-10 03:19:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure D_print [2019-09-10 03:19:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-10 03:19:40,191 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-10 03:19:40,191 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:19:40,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:19:40,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:19:40,948 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:19:40,948 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-10 03:19:40,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:19:40 BoogieIcfgContainer [2019-09-10 03:19:40,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:19:40,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:19:40,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:19:40,954 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:19:40,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:19:39" (1/3) ... [2019-09-10 03:19:40,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bdfb23d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:19:40, skipping insertion in model container [2019-09-10 03:19:40,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:19:40" (2/3) ... [2019-09-10 03:19:40,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bdfb23d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:19:40, skipping insertion in model container [2019-09-10 03:19:40,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:19:40" (3/3) ... [2019-09-10 03:19:40,958 INFO L109 eAbstractionObserver]: Analyzing ICFG pipeline.cil-1.c [2019-09-10 03:19:40,968 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:19:40,977 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:19:40,995 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:19:41,023 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:19:41,023 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:19:41,023 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:19:41,023 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:19:41,023 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:19:41,024 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:19:41,024 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:19:41,024 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:19:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states. [2019-09-10 03:19:41,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 03:19:41,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:19:41,065 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:19:41,068 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:19:41,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:19:41,074 INFO L82 PathProgramCache]: Analyzing trace with hash -448734168, now seen corresponding path program 1 times [2019-09-10 03:19:41,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:19:41,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:19:41,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:19:41,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:19:41,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:19:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:19:41,539 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 03:19:41,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:19:41,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:19:41,543 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 03:19:41,545 INFO L207 CegarAbsIntRunner]: [2], [12], [14], [16], [19], [22], [40], [47], [48], [155], [167], [180], [193], [206], [219], [232], [245], [264], [268], [274], [280], [288], [292], [298], [304], [310], [316], [322], [328], [336], [340], [346], [352], [358], [364], [370], [376], [384], [388], [394], [400], [406], [412], [418], [424], [432], [436], [442], [451], [748], [754], [755], [756], [757], [758], [774], [775], [776] [2019-09-10 03:19:41,608 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:19:41,608 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:19:41,742 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:19:41,744 INFO L272 AbstractInterpreter]: Visited 17 different actions 17 times. Never merged. Never widened. Performed 215 root evaluator evaluations with a maximum evaluation depth of 3. Performed 215 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 92 variables. [2019-09-10 03:19:41,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:19:41,750 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:19:41,873 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 80.12% of their original sizes. [2019-09-10 03:19:41,873 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:19:41,922 INFO L420 sIntCurrentIteration]: We unified 98 AI predicates to 98 [2019-09-10 03:19:41,923 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:19:41,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:19:41,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2019-09-10 03:19:41,924 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:19:41,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:19:41,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:19:41,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:19:41,938 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 6 states. [2019-09-10 03:19:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:19:43,803 INFO L93 Difference]: Finished difference Result 591 states and 884 transitions. [2019-09-10 03:19:43,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:19:43,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-09-10 03:19:43,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:19:43,828 INFO L225 Difference]: With dead ends: 591 [2019-09-10 03:19:43,829 INFO L226 Difference]: Without dead ends: 591 [2019-09-10 03:19:43,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:19:43,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-10 03:19:43,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 554. [2019-09-10 03:19:43,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-09-10 03:19:43,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 837 transitions. [2019-09-10 03:19:43,927 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 837 transitions. Word has length 99 [2019-09-10 03:19:43,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:19:43,928 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 837 transitions. [2019-09-10 03:19:43,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:19:43,928 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 837 transitions. [2019-09-10 03:19:43,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-10 03:19:43,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:19:43,946 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:19:43,947 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:19:43,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:19:43,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1030184702, now seen corresponding path program 1 times [2019-09-10 03:19:43,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:19:43,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:19:43,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:19:43,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:19:43,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:19:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:19:44,318 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:19:44,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:19:44,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:19:44,318 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 216 with the following transitions: [2019-09-10 03:19:44,319 INFO L207 CegarAbsIntRunner]: [2], [12], [14], [16], [19], [22], [40], [45], [46], [47], [48], [49], [58], [62], [64], [69], [74], [79], [84], [97], [110], [123], [136], [140], [143], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [260], [262], [264], [270], [276], [282], [288], [294], [300], [306], [312], [318], [324], [330], [336], [342], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [453], [455], [457], [469], [482], [495], [508], [521], [534], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [625], [627], [631], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [715], [717], [723], [728], [733], [738], [743], [748], [754], [755], [756], [757], [758], [770], [771], [772], [773], [774], [775], [776] [2019-09-10 03:19:44,337 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:19:44,338 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:19:44,401 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:19:44,401 INFO L272 AbstractInterpreter]: Visited 128 different actions 138 times. Never merged. Never widened. Performed 430 root evaluator evaluations with a maximum evaluation depth of 4. Performed 430 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 96 variables. [2019-09-10 03:19:44,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:19:44,402 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:19:44,618 INFO L227 lantSequenceWeakener]: Weakened 111 states. On average, predicates are now at 69.81% of their original sizes. [2019-09-10 03:19:44,618 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:19:44,956 INFO L420 sIntCurrentIteration]: We unified 214 AI predicates to 214 [2019-09-10 03:19:44,957 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:19:44,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:19:44,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [6] total 24 [2019-09-10 03:19:44,957 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:19:44,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 03:19:44,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 03:19:44,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-09-10 03:19:44,960 INFO L87 Difference]: Start difference. First operand 554 states and 837 transitions. Second operand 20 states. [2019-09-10 03:19:50,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:19:50,163 INFO L93 Difference]: Finished difference Result 773 states and 1233 transitions. [2019-09-10 03:19:50,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:19:50,163 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 215 [2019-09-10 03:19:50,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:19:50,171 INFO L225 Difference]: With dead ends: 773 [2019-09-10 03:19:50,171 INFO L226 Difference]: Without dead ends: 773 [2019-09-10 03:19:50,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-09-10 03:19:50,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2019-09-10 03:19:50,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 443. [2019-09-10 03:19:50,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-09-10 03:19:50,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 670 transitions. [2019-09-10 03:19:50,205 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 670 transitions. Word has length 215 [2019-09-10 03:19:50,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:19:50,206 INFO L475 AbstractCegarLoop]: Abstraction has 443 states and 670 transitions. [2019-09-10 03:19:50,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 03:19:50,207 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 670 transitions. [2019-09-10 03:19:50,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-10 03:19:50,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:19:50,210 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:19:50,211 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:19:50,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:19:50,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1592586096, now seen corresponding path program 1 times [2019-09-10 03:19:50,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:19:50,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:19:50,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:19:50,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:19:50,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:19:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:19:50,377 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 03:19:50,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:19:50,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:19:50,378 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:19:50,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:19:50,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:19:50,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:19:50,382 INFO L87 Difference]: Start difference. First operand 443 states and 670 transitions. Second operand 5 states. [2019-09-10 03:19:50,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:19:50,620 INFO L93 Difference]: Finished difference Result 1277 states and 2079 transitions. [2019-09-10 03:19:50,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:19:50,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-10 03:19:50,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:19:50,633 INFO L225 Difference]: With dead ends: 1277 [2019-09-10 03:19:50,634 INFO L226 Difference]: Without dead ends: 1277 [2019-09-10 03:19:50,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:19:50,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2019-09-10 03:19:50,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1257. [2019-09-10 03:19:50,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1257 states. [2019-09-10 03:19:50,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 2056 transitions. [2019-09-10 03:19:50,696 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 2056 transitions. Word has length 204 [2019-09-10 03:19:50,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:19:50,697 INFO L475 AbstractCegarLoop]: Abstraction has 1257 states and 2056 transitions. [2019-09-10 03:19:50,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:19:50,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 2056 transitions. [2019-09-10 03:19:50,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-10 03:19:50,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:19:50,701 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:19:50,701 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:19:50,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:19:50,702 INFO L82 PathProgramCache]: Analyzing trace with hash 347995918, now seen corresponding path program 1 times [2019-09-10 03:19:50,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:19:50,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:19:50,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:19:50,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:19:50,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:19:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:19:50,923 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 03:19:50,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:19:50,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:19:50,924 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2019-09-10 03:19:50,927 INFO L207 CegarAbsIntRunner]: [2], [12], [14], [16], [19], [22], [40], [47], [48], [49], [58], [64], [69], [74], [79], [84], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [252], [255], [262], [264], [268], [270], [274], [276], [280], [282], [288], [292], [294], [298], [300], [304], [306], [310], [312], [316], [318], [322], [324], [328], [330], [336], [340], [342], [346], [348], [352], [354], [358], [360], [364], [366], [370], [372], [376], [378], [384], [388], [390], [394], [396], [400], [402], [406], [408], [412], [414], [418], [420], [424], [426], [432], [436], [438], [442], [444], [453], [455], [457], [469], [482], [495], [508], [521], [534], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [625], [627], [631], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [715], [717], [723], [728], [733], [738], [743], [748], [754], [755], [756], [757], [758], [772], [773], [774], [775], [776] [2019-09-10 03:19:50,940 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:19:50,940 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:19:50,993 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:19:50,994 INFO L272 AbstractInterpreter]: Visited 155 different actions 202 times. Never merged. Never widened. Performed 516 root evaluator evaluations with a maximum evaluation depth of 3. Performed 516 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 95 variables. [2019-09-10 03:19:50,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:19:50,995 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:19:51,154 INFO L227 lantSequenceWeakener]: Weakened 133 states. On average, predicates are now at 71.48% of their original sizes. [2019-09-10 03:19:51,155 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:19:52,066 INFO L420 sIntCurrentIteration]: We unified 203 AI predicates to 203 [2019-09-10 03:19:52,067 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:19:52,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:19:52,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [37] imperfect sequences [4] total 39 [2019-09-10 03:19:52,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:19:52,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 03:19:52,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 03:19:52,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1130, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 03:19:52,070 INFO L87 Difference]: Start difference. First operand 1257 states and 2056 transitions. Second operand 37 states. [2019-09-10 03:19:59,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:19:59,114 INFO L93 Difference]: Finished difference Result 1287 states and 2090 transitions. [2019-09-10 03:19:59,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 03:19:59,114 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 204 [2019-09-10 03:19:59,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:19:59,122 INFO L225 Difference]: With dead ends: 1287 [2019-09-10 03:19:59,122 INFO L226 Difference]: Without dead ends: 1287 [2019-09-10 03:19:59,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=282, Invalid=1524, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 03:19:59,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2019-09-10 03:19:59,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1279. [2019-09-10 03:19:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-09-10 03:19:59,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 2078 transitions. [2019-09-10 03:19:59,171 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 2078 transitions. Word has length 204 [2019-09-10 03:19:59,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:19:59,173 INFO L475 AbstractCegarLoop]: Abstraction has 1279 states and 2078 transitions. [2019-09-10 03:19:59,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-10 03:19:59,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 2078 transitions. [2019-09-10 03:19:59,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-10 03:19:59,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:19:59,177 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:19:59,177 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:19:59,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:19:59,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1249195690, now seen corresponding path program 1 times [2019-09-10 03:19:59,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:19:59,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:19:59,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:19:59,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:19:59,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:19:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:19:59,328 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 30 proven. 54 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 03:19:59,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:19:59,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:19:59,329 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2019-09-10 03:19:59,330 INFO L207 CegarAbsIntRunner]: [2], [12], [14], [16], [19], [22], [40], [47], [48], [49], [58], [64], [69], [74], [79], [84], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [252], [255], [262], [264], [270], [276], [282], [288], [294], [300], [306], [312], [318], [324], [330], [336], [340], [342], [346], [348], [354], [358], [360], [364], [366], [370], [372], [376], [378], [382], [384], [388], [390], [394], [396], [400], [402], [406], [408], [412], [414], [418], [420], [424], [426], [432], [436], [438], [442], [444], [453], [455], [457], [469], [482], [495], [508], [521], [534], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [625], [627], [631], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [715], [717], [723], [728], [733], [738], [743], [748], [754], [755], [756], [757], [758], [772], [773], [774], [775], [776] [2019-09-10 03:19:59,334 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:19:59,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:19:59,387 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:19:59,388 INFO L272 AbstractInterpreter]: Visited 145 different actions 197 times. Never merged. Never widened. Performed 512 root evaluator evaluations with a maximum evaluation depth of 3. Performed 512 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 95 variables. [2019-09-10 03:19:59,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:19:59,389 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:19:59,527 INFO L227 lantSequenceWeakener]: Weakened 141 states. On average, predicates are now at 71.72% of their original sizes. [2019-09-10 03:19:59,528 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:20:00,435 INFO L420 sIntCurrentIteration]: We unified 203 AI predicates to 203 [2019-09-10 03:20:00,435 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:20:00,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:20:00,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [5] total 41 [2019-09-10 03:20:00,436 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:20:00,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 03:20:00,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 03:20:00,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1191, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 03:20:00,446 INFO L87 Difference]: Start difference. First operand 1279 states and 2078 transitions. Second operand 38 states. [2019-09-10 03:20:09,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:20:09,751 INFO L93 Difference]: Finished difference Result 1295 states and 2098 transitions. [2019-09-10 03:20:09,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 03:20:09,752 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 204 [2019-09-10 03:20:09,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:20:09,759 INFO L225 Difference]: With dead ends: 1295 [2019-09-10 03:20:09,759 INFO L226 Difference]: Without dead ends: 1295 [2019-09-10 03:20:09,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=283, Invalid=1523, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 03:20:09,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2019-09-10 03:20:09,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1287. [2019-09-10 03:20:09,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1287 states. [2019-09-10 03:20:09,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 2086 transitions. [2019-09-10 03:20:09,796 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 2086 transitions. Word has length 204 [2019-09-10 03:20:09,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:20:09,797 INFO L475 AbstractCegarLoop]: Abstraction has 1287 states and 2086 transitions. [2019-09-10 03:20:09,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-10 03:20:09,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 2086 transitions. [2019-09-10 03:20:09,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-10 03:20:09,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:20:09,800 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:20:09,800 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:20:09,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:20:09,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1278277158, now seen corresponding path program 1 times [2019-09-10 03:20:09,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:20:09,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:20:09,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:20:09,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:20:09,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:20:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:20:09,881 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 03:20:09,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:20:09,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:20:09,882 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:20:09,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:20:09,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:20:09,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:20:09,883 INFO L87 Difference]: Start difference. First operand 1287 states and 2086 transitions. Second operand 3 states. [2019-09-10 03:20:09,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:20:09,931 INFO L93 Difference]: Finished difference Result 2431 states and 4007 transitions. [2019-09-10 03:20:09,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:20:09,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-09-10 03:20:09,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:20:09,943 INFO L225 Difference]: With dead ends: 2431 [2019-09-10 03:20:09,944 INFO L226 Difference]: Without dead ends: 2431 [2019-09-10 03:20:09,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 03:20:09,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2431 states. [2019-09-10 03:20:09,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2431 to 2415. [2019-09-10 03:20:09,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2415 states. [2019-09-10 03:20:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2415 states and 3991 transitions. [2019-09-10 03:20:10,009 INFO L78 Accepts]: Start accepts. Automaton has 2415 states and 3991 transitions. Word has length 204 [2019-09-10 03:20:10,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:20:10,009 INFO L475 AbstractCegarLoop]: Abstraction has 2415 states and 3991 transitions. [2019-09-10 03:20:10,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:20:10,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 3991 transitions. [2019-09-10 03:20:10,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-10 03:20:10,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:20:10,013 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 03:20:10,013 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:20:10,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:20:10,013 INFO L82 PathProgramCache]: Analyzing trace with hash 2122234968, now seen corresponding path program 1 times [2019-09-10 03:20:10,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:20:10,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:20:10,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:20:10,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:20:10,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:20:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:20:10,096 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 03:20:10,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:20:10,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:20:10,097 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:20:10,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:20:10,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:20:10,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:20:10,098 INFO L87 Difference]: Start difference. First operand 2415 states and 3991 transitions. Second operand 5 states. [2019-09-10 03:20:10,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:20:10,362 INFO L93 Difference]: Finished difference Result 4359 states and 7167 transitions. [2019-09-10 03:20:10,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:20:10,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-10 03:20:10,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:20:10,388 INFO L225 Difference]: With dead ends: 4359 [2019-09-10 03:20:10,389 INFO L226 Difference]: Without dead ends: 4359 [2019-09-10 03:20:10,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:20:10,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4359 states. [2019-09-10 03:20:10,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4359 to 4111. [2019-09-10 03:20:10,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4111 states. [2019-09-10 03:20:10,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4111 states to 4111 states and 6719 transitions. [2019-09-10 03:20:10,525 INFO L78 Accepts]: Start accepts. Automaton has 4111 states and 6719 transitions. Word has length 204 [2019-09-10 03:20:10,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:20:10,526 INFO L475 AbstractCegarLoop]: Abstraction has 4111 states and 6719 transitions. [2019-09-10 03:20:10,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:20:10,526 INFO L276 IsEmpty]: Start isEmpty. Operand 4111 states and 6719 transitions. [2019-09-10 03:20:10,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-10 03:20:10,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:20:10,531 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:20:10,531 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:20:10,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:20:10,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1721868871, now seen corresponding path program 1 times [2019-09-10 03:20:10,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:20:10,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:20:10,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:20:10,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:20:10,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:20:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:20:10,629 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 69 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 03:20:10,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:20:10,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:20:10,630 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2019-09-10 03:20:10,630 INFO L207 CegarAbsIntRunner]: [2], [12], [14], [16], [19], [22], [38], [39], [40], [47], [48], [49], [58], [62], [64], [69], [74], [79], [84], [88], [91], [110], [123], [136], [149], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [252], [255], [262], [264], [270], [276], [282], [288], [294], [300], [306], [312], [318], [324], [330], [336], [340], [342], [346], [348], [354], [358], [360], [364], [366], [370], [372], [376], [378], [382], [384], [390], [396], [402], [408], [414], [420], [426], [430], [432], [436], [438], [444], [453], [455], [457], [469], [482], [495], [508], [521], [534], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [627], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [717], [723], [728], [733], [738], [743], [748], [754], [755], [756], [757], [758], [762], [763], [772], [773], [774], [775], [776] [2019-09-10 03:20:10,633 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:20:10,633 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:20:10,683 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:20:10,684 INFO L272 AbstractInterpreter]: Visited 143 different actions 199 times. Never merged. Never widened. Performed 654 root evaluator evaluations with a maximum evaluation depth of 3. Performed 654 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 96 variables. [2019-09-10 03:20:10,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:20:10,684 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:20:10,825 INFO L227 lantSequenceWeakener]: Weakened 158 states. On average, predicates are now at 72.59% of their original sizes. [2019-09-10 03:20:10,825 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:20:12,029 INFO L420 sIntCurrentIteration]: We unified 215 AI predicates to 215 [2019-09-10 03:20:12,029 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:20:12,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:20:12,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [46] imperfect sequences [5] total 49 [2019-09-10 03:20:12,030 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:20:12,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-10 03:20:12,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-10 03:20:12,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1823, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 03:20:12,033 INFO L87 Difference]: Start difference. First operand 4111 states and 6719 transitions. Second operand 46 states. [2019-09-10 03:20:29,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:20:29,227 INFO L93 Difference]: Finished difference Result 4196 states and 6839 transitions. [2019-09-10 03:20:29,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 03:20:29,227 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 216 [2019-09-10 03:20:29,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:20:29,248 INFO L225 Difference]: With dead ends: 4196 [2019-09-10 03:20:29,249 INFO L226 Difference]: Without dead ends: 4196 [2019-09-10 03:20:29,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=336, Invalid=2526, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 03:20:29,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4196 states. [2019-09-10 03:20:29,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4196 to 4145. [2019-09-10 03:20:29,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4145 states. [2019-09-10 03:20:29,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4145 states to 4145 states and 6764 transitions. [2019-09-10 03:20:29,361 INFO L78 Accepts]: Start accepts. Automaton has 4145 states and 6764 transitions. Word has length 216 [2019-09-10 03:20:29,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:20:29,361 INFO L475 AbstractCegarLoop]: Abstraction has 4145 states and 6764 transitions. [2019-09-10 03:20:29,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-10 03:20:29,361 INFO L276 IsEmpty]: Start isEmpty. Operand 4145 states and 6764 transitions. [2019-09-10 03:20:29,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-10 03:20:29,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:20:29,365 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:20:29,366 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:20:29,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:20:29,366 INFO L82 PathProgramCache]: Analyzing trace with hash -531131172, now seen corresponding path program 1 times [2019-09-10 03:20:29,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:20:29,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:20:29,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:20:29,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:20:29,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:20:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:20:29,473 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-10 03:20:29,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:20:29,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:20:29,473 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2019-09-10 03:20:29,474 INFO L207 CegarAbsIntRunner]: [2], [12], [14], [16], [19], [22], [38], [39], [40], [43], [44], [47], [48], [49], [58], [62], [64], [69], [74], [79], [84], [88], [91], [101], [104], [123], [136], [149], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [252], [255], [262], [264], [270], [276], [282], [288], [294], [300], [306], [312], [318], [324], [330], [336], [340], [342], [346], [348], [354], [358], [360], [364], [366], [370], [372], [376], [378], [382], [384], [390], [396], [402], [408], [414], [420], [426], [430], [432], [436], [438], [444], [453], [455], [457], [469], [482], [495], [508], [521], [534], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [627], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [717], [723], [728], [733], [738], [743], [748], [754], [755], [756], [757], [758], [762], [763], [764], [765], [772], [773], [774], [775], [776] [2019-09-10 03:20:29,477 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:20:29,477 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:20:29,532 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:20:29,532 INFO L272 AbstractInterpreter]: Visited 149 different actions 205 times. Never merged. Never widened. Performed 762 root evaluator evaluations with a maximum evaluation depth of 3. Performed 762 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 97 variables. [2019-09-10 03:20:29,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:20:29,533 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:20:29,684 INFO L227 lantSequenceWeakener]: Weakened 164 states. On average, predicates are now at 71.14% of their original sizes. [2019-09-10 03:20:29,685 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:20:31,098 INFO L420 sIntCurrentIteration]: We unified 220 AI predicates to 220 [2019-09-10 03:20:31,099 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:20:31,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:20:31,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [51] imperfect sequences [5] total 54 [2019-09-10 03:20:31,099 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:20:31,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-10 03:20:31,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-10 03:20:31,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=2280, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 03:20:31,102 INFO L87 Difference]: Start difference. First operand 4145 states and 6764 transitions. Second operand 51 states. [2019-09-10 03:20:52,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:20:52,483 INFO L93 Difference]: Finished difference Result 6149 states and 10123 transitions. [2019-09-10 03:20:52,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 03:20:52,483 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 221 [2019-09-10 03:20:52,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:20:52,514 INFO L225 Difference]: With dead ends: 6149 [2019-09-10 03:20:52,514 INFO L226 Difference]: Without dead ends: 6149 [2019-09-10 03:20:52,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1239 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=390, Invalid=3516, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 03:20:52,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6149 states. [2019-09-10 03:20:52,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6149 to 6093. [2019-09-10 03:20:52,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6093 states. [2019-09-10 03:20:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6093 states to 6093 states and 10044 transitions. [2019-09-10 03:20:52,663 INFO L78 Accepts]: Start accepts. Automaton has 6093 states and 10044 transitions. Word has length 221 [2019-09-10 03:20:52,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:20:52,663 INFO L475 AbstractCegarLoop]: Abstraction has 6093 states and 10044 transitions. [2019-09-10 03:20:52,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-10 03:20:52,664 INFO L276 IsEmpty]: Start isEmpty. Operand 6093 states and 10044 transitions. [2019-09-10 03:20:52,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-10 03:20:52,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:20:52,668 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:20:52,668 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:20:52,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:20:52,669 INFO L82 PathProgramCache]: Analyzing trace with hash 69444093, now seen corresponding path program 1 times [2019-09-10 03:20:52,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:20:52,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:20:52,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:20:52,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:20:52,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:20:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:20:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 67 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-10 03:20:52,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:20:52,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:20:52,772 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 223 with the following transitions: [2019-09-10 03:20:52,773 INFO L207 CegarAbsIntRunner]: [2], [12], [14], [16], [19], [22], [38], [39], [40], [47], [48], [49], [58], [62], [64], [69], [74], [79], [84], [88], [91], [101], [107], [114], [117], [136], [149], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [252], [255], [262], [264], [270], [276], [282], [288], [294], [300], [306], [312], [318], [324], [330], [336], [340], [342], [346], [348], [354], [358], [360], [364], [366], [370], [372], [376], [378], [382], [384], [390], [396], [402], [408], [414], [420], [426], [430], [432], [436], [438], [444], [453], [455], [457], [469], [482], [495], [508], [521], [534], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [627], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [717], [723], [728], [733], [738], [743], [748], [752], [753], [754], [755], [756], [757], [758], [762], [763], [766], [767], [772], [773], [774], [775], [776] [2019-09-10 03:20:52,775 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:20:52,776 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:20:52,827 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:20:52,828 INFO L272 AbstractInterpreter]: Visited 151 different actions 207 times. Never merged. Never widened. Performed 772 root evaluator evaluations with a maximum evaluation depth of 4. Performed 772 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 98 variables. [2019-09-10 03:20:52,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:20:52,828 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:20:52,983 INFO L227 lantSequenceWeakener]: Weakened 166 states. On average, predicates are now at 71.15% of their original sizes. [2019-09-10 03:20:52,983 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:20:54,420 INFO L420 sIntCurrentIteration]: We unified 221 AI predicates to 221 [2019-09-10 03:20:54,420 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:20:54,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:20:54,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [5] total 55 [2019-09-10 03:20:54,420 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:20:54,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-10 03:20:54,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-10 03:20:54,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=2377, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 03:20:54,422 INFO L87 Difference]: Start difference. First operand 6093 states and 10044 transitions. Second operand 52 states. [2019-09-10 03:21:16,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:21:16,339 INFO L93 Difference]: Finished difference Result 10030 states and 16684 transitions. [2019-09-10 03:21:16,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 03:21:16,339 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 222 [2019-09-10 03:21:16,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:21:16,377 INFO L225 Difference]: With dead ends: 10030 [2019-09-10 03:21:16,378 INFO L226 Difference]: Without dead ends: 10030 [2019-09-10 03:21:16,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1312 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=406, Invalid=3754, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 03:21:16,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10030 states. [2019-09-10 03:21:16,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10030 to 6108. [2019-09-10 03:21:16,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6108 states. [2019-09-10 03:21:16,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6108 states to 6108 states and 10062 transitions. [2019-09-10 03:21:16,572 INFO L78 Accepts]: Start accepts. Automaton has 6108 states and 10062 transitions. Word has length 222 [2019-09-10 03:21:16,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:21:16,573 INFO L475 AbstractCegarLoop]: Abstraction has 6108 states and 10062 transitions. [2019-09-10 03:21:16,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-10 03:21:16,573 INFO L276 IsEmpty]: Start isEmpty. Operand 6108 states and 10062 transitions. [2019-09-10 03:21:16,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-10 03:21:16,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:21:16,582 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:21:16,583 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:21:16,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:16,584 INFO L82 PathProgramCache]: Analyzing trace with hash 239991291, now seen corresponding path program 1 times [2019-09-10 03:21:16,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:21:16,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:16,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:21:16,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:16,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:21:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:21:16,715 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 66 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 03:21:16,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:21:16,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:21:16,716 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2019-09-10 03:21:16,716 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [12], [14], [16], [19], [22], [38], [39], [40], [47], [48], [49], [58], [62], [64], [69], [74], [79], [84], [88], [91], [101], [107], [114], [120], [127], [130], [149], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [252], [255], [262], [264], [270], [276], [282], [288], [294], [300], [306], [312], [318], [324], [330], [336], [340], [342], [346], [348], [354], [358], [360], [364], [366], [370], [372], [376], [378], [382], [384], [390], [396], [402], [408], [414], [420], [426], [430], [432], [436], [438], [444], [453], [455], [457], [469], [482], [495], [508], [521], [534], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [627], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [717], [723], [728], [733], [738], [743], [748], [754], [755], [756], [757], [758], [762], [763], [768], [769], [772], [773], [774], [775], [776] [2019-09-10 03:21:16,720 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:21:16,720 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:21:16,773 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:21:16,773 INFO L272 AbstractInterpreter]: Visited 153 different actions 209 times. Never merged. Never widened. Performed 776 root evaluator evaluations with a maximum evaluation depth of 4. Performed 776 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 99 variables. [2019-09-10 03:21:16,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:16,774 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:21:16,926 INFO L227 lantSequenceWeakener]: Weakened 168 states. On average, predicates are now at 70.79% of their original sizes. [2019-09-10 03:21:16,926 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:21:18,503 INFO L420 sIntCurrentIteration]: We unified 222 AI predicates to 222 [2019-09-10 03:21:18,503 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:21:18,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:21:18,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [5] total 55 [2019-09-10 03:21:18,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:21:18,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-10 03:21:18,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-10 03:21:18,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=2381, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 03:21:18,506 INFO L87 Difference]: Start difference. First operand 6108 states and 10062 transitions. Second operand 52 states. [2019-09-10 03:21:44,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:21:44,634 INFO L93 Difference]: Finished difference Result 10047 states and 16705 transitions. [2019-09-10 03:21:44,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 03:21:44,634 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 223 [2019-09-10 03:21:44,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:21:44,670 INFO L225 Difference]: With dead ends: 10047 [2019-09-10 03:21:44,670 INFO L226 Difference]: Without dead ends: 10047 [2019-09-10 03:21:44,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1338 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=413, Invalid=3877, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 03:21:44,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10047 states. [2019-09-10 03:21:44,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10047 to 6123. [2019-09-10 03:21:44,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6123 states. [2019-09-10 03:21:44,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6123 states to 6123 states and 10080 transitions. [2019-09-10 03:21:44,887 INFO L78 Accepts]: Start accepts. Automaton has 6123 states and 10080 transitions. Word has length 223 [2019-09-10 03:21:44,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:21:44,888 INFO L475 AbstractCegarLoop]: Abstraction has 6123 states and 10080 transitions. [2019-09-10 03:21:44,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-10 03:21:44,888 INFO L276 IsEmpty]: Start isEmpty. Operand 6123 states and 10080 transitions. [2019-09-10 03:21:44,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-10 03:21:44,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:21:44,896 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:21:44,896 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:21:44,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:44,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1397871138, now seen corresponding path program 1 times [2019-09-10 03:21:44,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:21:44,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:44,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:21:44,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:44,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:21:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:21:45,054 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 69 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 03:21:45,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:21:45,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:21:45,055 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2019-09-10 03:21:45,055 INFO L207 CegarAbsIntRunner]: [2], [12], [14], [16], [19], [22], [38], [39], [40], [45], [46], [47], [48], [49], [58], [62], [64], [69], [74], [79], [84], [88], [91], [101], [107], [114], [120], [127], [133], [140], [143], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [252], [255], [262], [264], [270], [276], [282], [288], [294], [300], [306], [312], [318], [324], [330], [336], [340], [342], [346], [348], [354], [358], [360], [364], [366], [370], [372], [376], [378], [382], [384], [390], [396], [402], [408], [414], [420], [426], [430], [432], [436], [438], [444], [453], [455], [457], [469], [482], [495], [508], [521], [534], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [627], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [717], [723], [728], [733], [738], [743], [748], [754], [755], [756], [757], [758], [762], [763], [770], [771], [772], [773], [774], [775], [776] [2019-09-10 03:21:45,057 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:21:45,058 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:21:45,161 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:21:45,162 INFO L272 AbstractInterpreter]: Visited 154 different actions 227 times. Merged at 12 different actions 12 times. Never widened. Performed 922 root evaluator evaluations with a maximum evaluation depth of 4. Performed 922 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 100 variables. [2019-09-10 03:21:45,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:45,163 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:21:45,354 INFO L227 lantSequenceWeakener]: Weakened 170 states. On average, predicates are now at 72.58% of their original sizes. [2019-09-10 03:21:45,354 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:21:47,192 INFO L420 sIntCurrentIteration]: We unified 223 AI predicates to 223 [2019-09-10 03:21:47,193 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:21:47,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:21:47,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [55] imperfect sequences [6] total 59 [2019-09-10 03:21:47,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:21:47,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-10 03:21:47,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-10 03:21:47,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=2680, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 03:21:47,197 INFO L87 Difference]: Start difference. First operand 6123 states and 10080 transitions. Second operand 55 states. [2019-09-10 03:22:08,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:22:08,044 INFO L93 Difference]: Finished difference Result 12120 states and 20099 transitions. [2019-09-10 03:22:08,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 03:22:08,044 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 224 [2019-09-10 03:22:08,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:22:08,099 INFO L225 Difference]: With dead ends: 12120 [2019-09-10 03:22:08,100 INFO L226 Difference]: Without dead ends: 12120 [2019-09-10 03:22:08,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1592 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=511, Invalid=4601, Unknown=0, NotChecked=0, Total=5112 [2019-09-10 03:22:08,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12120 states. [2019-09-10 03:22:08,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12120 to 12077. [2019-09-10 03:22:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12077 states. [2019-09-10 03:22:08,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12077 states to 12077 states and 20044 transitions. [2019-09-10 03:22:08,545 INFO L78 Accepts]: Start accepts. Automaton has 12077 states and 20044 transitions. Word has length 224 [2019-09-10 03:22:08,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:22:08,546 INFO L475 AbstractCegarLoop]: Abstraction has 12077 states and 20044 transitions. [2019-09-10 03:22:08,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-10 03:22:08,547 INFO L276 IsEmpty]: Start isEmpty. Operand 12077 states and 20044 transitions. [2019-09-10 03:22:08,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-10 03:22:08,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:22:08,555 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:22:08,555 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:22:08,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:08,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1729486368, now seen corresponding path program 1 times [2019-09-10 03:22:08,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:22:08,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:08,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:22:08,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:08,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:22:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:22:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 67 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-10 03:22:08,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:22:08,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:22:08,697 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 227 with the following transitions: [2019-09-10 03:22:08,697 INFO L207 CegarAbsIntRunner]: [2], [12], [14], [16], [19], [22], [38], [39], [40], [43], [44], [47], [48], [49], [58], [62], [64], [69], [74], [79], [84], [88], [91], [101], [104], [114], [117], [136], [149], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [252], [255], [262], [264], [270], [276], [282], [288], [294], [300], [306], [312], [318], [324], [330], [336], [340], [342], [346], [348], [354], [358], [360], [364], [366], [370], [372], [376], [378], [382], [384], [390], [396], [402], [408], [414], [420], [426], [430], [432], [436], [438], [444], [453], [455], [457], [469], [482], [495], [508], [521], [534], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [627], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [717], [723], [728], [733], [738], [743], [748], [752], [753], [754], [755], [756], [757], [758], [762], [763], [764], [765], [766], [767], [772], [773], [774], [775], [776] [2019-09-10 03:22:08,700 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:22:08,700 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:22:08,762 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:22:08,763 INFO L272 AbstractInterpreter]: Visited 155 different actions 211 times. Never merged. Never widened. Performed 872 root evaluator evaluations with a maximum evaluation depth of 3. Performed 872 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 98 variables. [2019-09-10 03:22:08,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:08,763 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:22:08,927 INFO L227 lantSequenceWeakener]: Weakened 170 states. On average, predicates are now at 69.79% of their original sizes. [2019-09-10 03:22:08,927 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:22:11,060 INFO L420 sIntCurrentIteration]: We unified 225 AI predicates to 225 [2019-09-10 03:22:11,061 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:22:11,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:22:11,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [56] imperfect sequences [5] total 59 [2019-09-10 03:22:11,061 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:22:11,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 03:22:11,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 03:22:11,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=2783, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 03:22:11,064 INFO L87 Difference]: Start difference. First operand 12077 states and 20044 transitions. Second operand 56 states. [2019-09-10 03:22:38,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:22:38,214 INFO L93 Difference]: Finished difference Result 16066 states and 26796 transitions. [2019-09-10 03:22:38,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-10 03:22:38,214 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 226 [2019-09-10 03:22:38,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:22:38,279 INFO L225 Difference]: With dead ends: 16066 [2019-09-10 03:22:38,280 INFO L226 Difference]: Without dead ends: 16066 [2019-09-10 03:22:38,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1684 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=456, Invalid=4800, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 03:22:38,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16066 states. [2019-09-10 03:22:38,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16066 to 12093. [2019-09-10 03:22:38,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12093 states. [2019-09-10 03:22:38,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12093 states to 12093 states and 20062 transitions. [2019-09-10 03:22:38,574 INFO L78 Accepts]: Start accepts. Automaton has 12093 states and 20062 transitions. Word has length 226 [2019-09-10 03:22:38,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:22:38,575 INFO L475 AbstractCegarLoop]: Abstraction has 12093 states and 20062 transitions. [2019-09-10 03:22:38,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-10 03:22:38,575 INFO L276 IsEmpty]: Start isEmpty. Operand 12093 states and 20062 transitions. [2019-09-10 03:22:38,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-10 03:22:38,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:22:38,581 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:22:38,581 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:22:38,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:38,582 INFO L82 PathProgramCache]: Analyzing trace with hash 161694264, now seen corresponding path program 1 times [2019-09-10 03:22:38,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:22:38,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:38,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:22:38,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:38,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:22:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:22:38,695 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 66 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 03:22:38,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:22:38,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:22:38,696 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 228 with the following transitions: [2019-09-10 03:22:38,697 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [12], [14], [16], [19], [22], [38], [39], [40], [43], [44], [47], [48], [49], [58], [62], [64], [69], [74], [79], [84], [88], [91], [101], [104], [114], [120], [127], [130], [149], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [252], [255], [262], [264], [270], [276], [282], [288], [294], [300], [306], [312], [318], [324], [330], [336], [340], [342], [346], [348], [354], [358], [360], [364], [366], [370], [372], [376], [378], [382], [384], [390], [396], [402], [408], [414], [420], [426], [430], [432], [436], [438], [444], [453], [455], [457], [469], [482], [495], [508], [521], [534], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [627], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [717], [723], [728], [733], [738], [743], [748], [754], [755], [756], [757], [758], [762], [763], [764], [765], [768], [769], [772], [773], [774], [775], [776] [2019-09-10 03:22:38,699 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:22:38,699 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:22:38,755 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:22:38,756 INFO L272 AbstractInterpreter]: Visited 157 different actions 213 times. Never merged. Never widened. Performed 876 root evaluator evaluations with a maximum evaluation depth of 4. Performed 876 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 99 variables. [2019-09-10 03:22:38,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:38,756 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:22:38,966 INFO L227 lantSequenceWeakener]: Weakened 172 states. On average, predicates are now at 69.43% of their original sizes. [2019-09-10 03:22:38,967 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:22:40,971 INFO L420 sIntCurrentIteration]: We unified 226 AI predicates to 226 [2019-09-10 03:22:40,971 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:22:40,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:22:40,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [56] imperfect sequences [5] total 59 [2019-09-10 03:22:40,972 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:22:40,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 03:22:40,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 03:22:40,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=2791, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 03:22:40,974 INFO L87 Difference]: Start difference. First operand 12093 states and 20062 transitions. Second operand 56 states. [2019-09-10 03:23:02,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:23:02,906 INFO L93 Difference]: Finished difference Result 16083 states and 26816 transitions. [2019-09-10 03:23:02,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 03:23:02,907 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 227 [2019-09-10 03:23:02,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:23:02,968 INFO L225 Difference]: With dead ends: 16083 [2019-09-10 03:23:02,968 INFO L226 Difference]: Without dead ends: 16083 [2019-09-10 03:23:02,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1749 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=458, Invalid=4944, Unknown=0, NotChecked=0, Total=5402 [2019-09-10 03:23:02,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16083 states. [2019-09-10 03:23:03,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16083 to 12108. [2019-09-10 03:23:03,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12108 states. [2019-09-10 03:23:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12108 states to 12108 states and 20079 transitions. [2019-09-10 03:23:03,250 INFO L78 Accepts]: Start accepts. Automaton has 12108 states and 20079 transitions. Word has length 227 [2019-09-10 03:23:03,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:23:03,251 INFO L475 AbstractCegarLoop]: Abstraction has 12108 states and 20079 transitions. [2019-09-10 03:23:03,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-10 03:23:03,251 INFO L276 IsEmpty]: Start isEmpty. Operand 12108 states and 20079 transitions. [2019-09-10 03:23:03,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-10 03:23:03,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:23:03,257 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:23:03,257 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:23:03,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:03,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1082677608, now seen corresponding path program 1 times [2019-09-10 03:23:03,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:23:03,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:03,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:23:03,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:03,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:23:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:23:03,391 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 66 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 03:23:03,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:23:03,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:23:03,392 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 228 with the following transitions: [2019-09-10 03:23:03,393 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [12], [14], [16], [19], [22], [38], [39], [40], [47], [48], [49], [58], [62], [64], [69], [74], [79], [84], [88], [91], [101], [107], [114], [117], [127], [130], [149], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [252], [255], [262], [264], [270], [276], [282], [288], [294], [300], [306], [312], [318], [324], [330], [336], [340], [342], [346], [348], [354], [358], [360], [364], [366], [370], [372], [376], [378], [382], [384], [390], [396], [402], [408], [414], [420], [426], [430], [432], [436], [438], [444], [453], [455], [457], [469], [482], [495], [508], [521], [534], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [627], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [717], [723], [728], [733], [738], [743], [748], [752], [753], [754], [755], [756], [757], [758], [762], [763], [766], [767], [768], [769], [772], [773], [774], [775], [776] [2019-09-10 03:23:03,395 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:23:03,395 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:23:03,451 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:23:03,451 INFO L272 AbstractInterpreter]: Visited 157 different actions 213 times. Never merged. Never widened. Performed 878 root evaluator evaluations with a maximum evaluation depth of 4. Performed 878 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 99 variables. [2019-09-10 03:23:03,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:03,451 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:23:03,584 INFO L227 lantSequenceWeakener]: Weakened 172 states. On average, predicates are now at 69.41% of their original sizes. [2019-09-10 03:23:03,584 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:23:05,278 INFO L420 sIntCurrentIteration]: We unified 226 AI predicates to 226 [2019-09-10 03:23:05,278 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:23:05,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:23:05,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [56] imperfect sequences [5] total 59 [2019-09-10 03:23:05,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:23:05,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 03:23:05,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 03:23:05,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=2789, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 03:23:05,280 INFO L87 Difference]: Start difference. First operand 12108 states and 20079 transitions. Second operand 56 states. [2019-09-10 03:23:30,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:23:30,575 INFO L93 Difference]: Finished difference Result 16097 states and 26832 transitions. [2019-09-10 03:23:30,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 03:23:30,576 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 227 [2019-09-10 03:23:30,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:23:30,628 INFO L225 Difference]: With dead ends: 16097 [2019-09-10 03:23:30,629 INFO L226 Difference]: Without dead ends: 16097 [2019-09-10 03:23:30,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1720 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=459, Invalid=4943, Unknown=0, NotChecked=0, Total=5402 [2019-09-10 03:23:30,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16097 states. [2019-09-10 03:23:30,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16097 to 12122. [2019-09-10 03:23:30,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12122 states. [2019-09-10 03:23:30,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12122 states to 12122 states and 20095 transitions. [2019-09-10 03:23:30,892 INFO L78 Accepts]: Start accepts. Automaton has 12122 states and 20095 transitions. Word has length 227 [2019-09-10 03:23:30,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:23:30,892 INFO L475 AbstractCegarLoop]: Abstraction has 12122 states and 20095 transitions. [2019-09-10 03:23:30,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-10 03:23:30,893 INFO L276 IsEmpty]: Start isEmpty. Operand 12122 states and 20095 transitions. [2019-09-10 03:23:30,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-10 03:23:30,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:23:30,898 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:23:30,898 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:23:30,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:30,898 INFO L82 PathProgramCache]: Analyzing trace with hash 469888321, now seen corresponding path program 1 times [2019-09-10 03:23:30,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:23:30,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:30,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:23:30,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:30,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:23:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:23:31,021 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-10 03:23:31,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:23:31,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:23:31,024 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 229 with the following transitions: [2019-09-10 03:23:31,024 INFO L207 CegarAbsIntRunner]: [2], [12], [14], [16], [19], [22], [38], [39], [40], [43], [44], [45], [46], [47], [48], [49], [58], [62], [64], [69], [74], [79], [84], [88], [91], [101], [104], [114], [120], [127], [133], [140], [143], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [252], [255], [262], [264], [270], [276], [282], [288], [294], [300], [306], [312], [318], [324], [330], [336], [340], [342], [346], [348], [354], [358], [360], [364], [366], [370], [372], [376], [378], [382], [384], [390], [396], [402], [408], [414], [420], [426], [430], [432], [436], [438], [444], [453], [455], [457], [469], [482], [495], [508], [521], [534], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [627], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [717], [723], [728], [733], [738], [743], [748], [754], [755], [756], [757], [758], [762], [763], [764], [765], [770], [771], [772], [773], [774], [775], [776] [2019-09-10 03:23:31,026 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:23:31,026 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:23:31,098 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:23:31,098 INFO L272 AbstractInterpreter]: Visited 158 different actions 236 times. Merged at 13 different actions 13 times. Never widened. Performed 1123 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1123 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 100 variables. [2019-09-10 03:23:31,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:31,098 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:23:31,235 INFO L227 lantSequenceWeakener]: Weakened 175 states. On average, predicates are now at 71.23% of their original sizes. [2019-09-10 03:23:31,236 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:23:32,952 INFO L420 sIntCurrentIteration]: We unified 227 AI predicates to 227 [2019-09-10 03:23:32,953 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:23:32,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:23:32,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [60] imperfect sequences [6] total 64 [2019-09-10 03:23:32,953 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:23:32,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-10 03:23:32,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-10 03:23:32,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=3234, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 03:23:32,956 INFO L87 Difference]: Start difference. First operand 12122 states and 20095 transitions. Second operand 60 states. [2019-09-10 03:23:54,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:23:54,907 INFO L93 Difference]: Finished difference Result 16328 states and 27054 transitions. [2019-09-10 03:23:54,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 03:23:54,907 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 228 [2019-09-10 03:23:54,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:23:54,960 INFO L225 Difference]: With dead ends: 16328 [2019-09-10 03:23:54,961 INFO L226 Difference]: Without dead ends: 16328 [2019-09-10 03:23:54,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2173 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=633, Invalid=6009, Unknown=0, NotChecked=0, Total=6642 [2019-09-10 03:23:54,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16328 states. [2019-09-10 03:23:55,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16328 to 16244. [2019-09-10 03:23:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16244 states. [2019-09-10 03:23:55,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16244 states to 16244 states and 26946 transitions. [2019-09-10 03:23:55,323 INFO L78 Accepts]: Start accepts. Automaton has 16244 states and 26946 transitions. Word has length 228 [2019-09-10 03:23:55,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:23:55,324 INFO L475 AbstractCegarLoop]: Abstraction has 16244 states and 26946 transitions. [2019-09-10 03:23:55,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-10 03:23:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 16244 states and 26946 transitions. [2019-09-10 03:23:55,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-10 03:23:55,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:23:55,332 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:23:55,333 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:23:55,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:55,333 INFO L82 PathProgramCache]: Analyzing trace with hash 549065953, now seen corresponding path program 1 times [2019-09-10 03:23:55,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:23:55,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:55,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:23:55,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:55,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:23:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:23:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 69 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 03:23:55,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:23:55,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:23:55,551 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 229 with the following transitions: [2019-09-10 03:23:55,551 INFO L207 CegarAbsIntRunner]: [2], [12], [14], [16], [19], [22], [38], [39], [40], [45], [46], [47], [48], [49], [58], [62], [64], [69], [74], [79], [84], [88], [91], [101], [107], [114], [117], [127], [133], [140], [143], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [252], [255], [262], [264], [270], [276], [282], [288], [294], [300], [306], [312], [318], [324], [330], [336], [340], [342], [346], [348], [354], [358], [360], [364], [366], [370], [372], [376], [378], [382], [384], [390], [396], [402], [408], [414], [420], [426], [430], [432], [436], [438], [444], [453], [455], [457], [469], [482], [495], [508], [521], [534], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [627], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [717], [723], [728], [733], [738], [743], [748], [752], [753], [754], [755], [756], [757], [758], [762], [763], [766], [767], [770], [771], [772], [773], [774], [775], [776] [2019-09-10 03:23:55,553 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:23:55,553 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:23:55,604 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:23:55,604 INFO L272 AbstractInterpreter]: Visited 158 different actions 218 times. Merged at 2 different actions 2 times. Never widened. Performed 888 root evaluator evaluations with a maximum evaluation depth of 4. Performed 888 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 100 variables. [2019-09-10 03:23:55,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:55,605 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:23:55,748 INFO L227 lantSequenceWeakener]: Weakened 174 states. On average, predicates are now at 71.27% of their original sizes. [2019-09-10 03:23:55,748 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:23:57,437 INFO L420 sIntCurrentIteration]: We unified 227 AI predicates to 227 [2019-09-10 03:23:57,437 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:23:57,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:23:57,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [57] imperfect sequences [6] total 61 [2019-09-10 03:23:57,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:23:57,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-10 03:23:57,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-10 03:23:57,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=2903, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 03:23:57,440 INFO L87 Difference]: Start difference. First operand 16244 states and 26946 transitions. Second operand 57 states. [2019-09-10 03:24:19,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:24:19,444 INFO L93 Difference]: Finished difference Result 24199 states and 40320 transitions. [2019-09-10 03:24:19,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-10 03:24:19,444 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 228 [2019-09-10 03:24:19,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:24:19,503 INFO L225 Difference]: With dead ends: 24199 [2019-09-10 03:24:19,503 INFO L226 Difference]: Without dead ends: 24199 [2019-09-10 03:24:19,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1840 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=474, Invalid=5226, Unknown=0, NotChecked=0, Total=5700 [2019-09-10 03:24:19,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24199 states. [2019-09-10 03:24:19,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24199 to 16258. [2019-09-10 03:24:19,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16258 states. [2019-09-10 03:24:19,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16258 states to 16258 states and 26962 transitions. [2019-09-10 03:24:19,913 INFO L78 Accepts]: Start accepts. Automaton has 16258 states and 26962 transitions. Word has length 228 [2019-09-10 03:24:19,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:24:19,914 INFO L475 AbstractCegarLoop]: Abstraction has 16258 states and 26962 transitions. [2019-09-10 03:24:19,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-10 03:24:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 16258 states and 26962 transitions. [2019-09-10 03:24:19,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-10 03:24:19,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:24:19,920 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:24:19,920 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:24:19,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:24:19,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1030025759, now seen corresponding path program 1 times [2019-09-10 03:24:19,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:24:19,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:24:19,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:24:19,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:24:19,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:24:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:24:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 69 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 03:24:20,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:24:20,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:24:20,080 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 229 with the following transitions: [2019-09-10 03:24:20,080 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [12], [14], [16], [19], [22], [38], [39], [40], [45], [46], [47], [48], [49], [58], [62], [64], [69], [74], [79], [84], [88], [91], [101], [107], [114], [120], [127], [130], [140], [143], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [252], [255], [262], [264], [270], [276], [282], [288], [294], [300], [306], [312], [318], [324], [330], [336], [340], [342], [346], [348], [354], [358], [360], [364], [366], [370], [372], [376], [378], [382], [384], [390], [396], [402], [408], [414], [420], [426], [430], [432], [436], [438], [444], [453], [455], [457], [469], [482], [495], [508], [521], [534], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [627], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [717], [723], [728], [733], [738], [743], [748], [754], [755], [756], [757], [758], [762], [763], [768], [769], [770], [771], [772], [773], [774], [775], [776] [2019-09-10 03:24:20,082 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:24:20,083 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:24:20,195 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:24:20,196 INFO L272 AbstractInterpreter]: Visited 158 different actions 235 times. Merged at 13 different actions 13 times. Never widened. Performed 1118 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1118 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 100 variables. [2019-09-10 03:24:20,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:24:20,196 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:24:20,369 INFO L227 lantSequenceWeakener]: Weakened 174 states. On average, predicates are now at 70.83% of their original sizes. [2019-09-10 03:24:20,369 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:24:22,096 INFO L420 sIntCurrentIteration]: We unified 227 AI predicates to 227 [2019-09-10 03:24:22,096 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:24:22,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:24:22,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [58] imperfect sequences [6] total 62 [2019-09-10 03:24:22,097 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:24:22,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-10 03:24:22,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-10 03:24:22,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=3007, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 03:24:22,098 INFO L87 Difference]: Start difference. First operand 16258 states and 26962 transitions. Second operand 58 states. [2019-09-10 03:24:46,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:24:46,065 INFO L93 Difference]: Finished difference Result 22489 states and 37280 transitions. [2019-09-10 03:24:46,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 03:24:46,065 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 228 [2019-09-10 03:24:46,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:24:46,132 INFO L225 Difference]: With dead ends: 22489 [2019-09-10 03:24:46,132 INFO L226 Difference]: Without dead ends: 22489 [2019-09-10 03:24:46,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1970 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=622, Invalid=5698, Unknown=0, NotChecked=0, Total=6320 [2019-09-10 03:24:46,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22489 states. [2019-09-10 03:24:46,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22489 to 8582. [2019-09-10 03:24:46,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8582 states. [2019-09-10 03:24:46,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8582 states to 8582 states and 13966 transitions. [2019-09-10 03:24:46,364 INFO L78 Accepts]: Start accepts. Automaton has 8582 states and 13966 transitions. Word has length 228 [2019-09-10 03:24:46,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:24:46,364 INFO L475 AbstractCegarLoop]: Abstraction has 8582 states and 13966 transitions. [2019-09-10 03:24:46,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-10 03:24:46,364 INFO L276 IsEmpty]: Start isEmpty. Operand 8582 states and 13966 transitions. [2019-09-10 03:24:46,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-10 03:24:46,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:24:46,368 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:24:46,368 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:24:46,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:24:46,369 INFO L82 PathProgramCache]: Analyzing trace with hash 38045781, now seen corresponding path program 1 times [2019-09-10 03:24:46,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:24:46,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:24:46,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:24:46,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:24:46,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:24:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:24:46,591 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 66 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 03:24:46,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:24:46,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:24:46,591 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 232 with the following transitions: [2019-09-10 03:24:46,592 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [12], [14], [16], [19], [22], [38], [39], [40], [43], [44], [47], [48], [49], [58], [62], [64], [69], [74], [79], [84], [88], [91], [101], [104], [114], [117], [127], [130], [149], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [252], [255], [262], [264], [270], [276], [282], [288], [294], [300], [306], [312], [318], [324], [330], [336], [340], [342], [346], [348], [354], [358], [360], [364], [366], [370], [372], [376], [378], [382], [384], [390], [396], [402], [408], [414], [420], [426], [430], [432], [436], [438], [444], [453], [455], [457], [469], [482], [495], [508], [521], [534], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [627], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [717], [723], [728], [733], [738], [743], [748], [752], [753], [754], [755], [756], [757], [758], [762], [763], [764], [765], [766], [767], [768], [769], [772], [773], [774], [775], [776] [2019-09-10 03:24:46,594 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:24:46,594 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:24:46,654 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:24:46,655 INFO L272 AbstractInterpreter]: Visited 161 different actions 217 times. Never merged. Never widened. Performed 978 root evaluator evaluations with a maximum evaluation depth of 3. Performed 978 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 99 variables. [2019-09-10 03:24:46,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:24:46,656 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:24:46,816 INFO L227 lantSequenceWeakener]: Weakened 176 states. On average, predicates are now at 68.11% of their original sizes. [2019-09-10 03:24:46,817 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:24:48,641 INFO L420 sIntCurrentIteration]: We unified 230 AI predicates to 230 [2019-09-10 03:24:48,641 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:24:48,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:24:48,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [60] imperfect sequences [5] total 63 [2019-09-10 03:24:48,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:24:48,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-10 03:24:48,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-10 03:24:48,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=3225, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 03:24:48,643 INFO L87 Difference]: Start difference. First operand 8582 states and 13966 transitions. Second operand 60 states. [2019-09-10 03:25:17,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:25:17,249 INFO L93 Difference]: Finished difference Result 10656 states and 17436 transitions. [2019-09-10 03:25:17,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 03:25:17,249 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 231 [2019-09-10 03:25:17,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:25:17,268 INFO L225 Difference]: With dead ends: 10656 [2019-09-10 03:25:17,268 INFO L226 Difference]: Without dead ends: 10656 [2019-09-10 03:25:17,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2121 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=512, Invalid=6130, Unknown=0, NotChecked=0, Total=6642 [2019-09-10 03:25:17,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10656 states. [2019-09-10 03:25:17,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10656 to 8598. [2019-09-10 03:25:17,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8598 states. [2019-09-10 03:25:17,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8598 states to 8598 states and 13983 transitions. [2019-09-10 03:25:17,417 INFO L78 Accepts]: Start accepts. Automaton has 8598 states and 13983 transitions. Word has length 231 [2019-09-10 03:25:17,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:25:17,417 INFO L475 AbstractCegarLoop]: Abstraction has 8598 states and 13983 transitions. [2019-09-10 03:25:17,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-10 03:25:17,418 INFO L276 IsEmpty]: Start isEmpty. Operand 8598 states and 13983 transitions. [2019-09-10 03:25:17,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:25:17,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:25:17,422 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:25:17,422 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:25:17,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:25:17,423 INFO L82 PathProgramCache]: Analyzing trace with hash 931752644, now seen corresponding path program 1 times [2019-09-10 03:25:17,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:25:17,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:25:17,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:25:17,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:25:17,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:25:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:25:17,527 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 67 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-10 03:25:17,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:25:17,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:25:17,528 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2019-09-10 03:25:17,528 INFO L207 CegarAbsIntRunner]: [2], [12], [14], [16], [19], [22], [38], [39], [40], [43], [44], [45], [46], [47], [48], [49], [58], [62], [64], [69], [74], [79], [84], [88], [91], [101], [104], [114], [117], [127], [133], [140], [143], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [252], [255], [262], [264], [270], [276], [282], [288], [294], [300], [306], [312], [318], [324], [330], [336], [340], [342], [346], [348], [354], [358], [360], [364], [366], [370], [372], [376], [378], [382], [384], [390], [396], [402], [408], [414], [420], [426], [430], [432], [436], [438], [444], [453], [455], [457], [469], [482], [495], [508], [521], [534], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [627], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [717], [723], [728], [733], [738], [743], [748], [752], [753], [754], [755], [756], [757], [758], [762], [763], [764], [765], [766], [767], [770], [771], [772], [773], [774], [775], [776] [2019-09-10 03:25:17,530 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:25:17,530 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:25:17,592 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:25:17,592 INFO L272 AbstractInterpreter]: Visited 162 different actions 224 times. Merged at 2 different actions 2 times. Never widened. Performed 990 root evaluator evaluations with a maximum evaluation depth of 4. Performed 990 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 100 variables. [2019-09-10 03:25:17,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:25:17,592 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:25:17,710 INFO L227 lantSequenceWeakener]: Weakened 180 states. On average, predicates are now at 70.03% of their original sizes. [2019-09-10 03:25:17,711 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:25:19,618 INFO L420 sIntCurrentIteration]: We unified 231 AI predicates to 231 [2019-09-10 03:25:19,619 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:25:19,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:25:19,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [6] total 67 [2019-09-10 03:25:19,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:25:19,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-10 03:25:19,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-10 03:25:19,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=3588, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 03:25:19,622 INFO L87 Difference]: Start difference. First operand 8598 states and 13983 transitions. Second operand 63 states. [2019-09-10 03:25:46,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:25:46,620 INFO L93 Difference]: Finished difference Result 12589 states and 20638 transitions. [2019-09-10 03:25:46,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 03:25:46,620 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 232 [2019-09-10 03:25:46,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:25:46,645 INFO L225 Difference]: With dead ends: 12589 [2019-09-10 03:25:46,645 INFO L226 Difference]: Without dead ends: 12589 [2019-09-10 03:25:46,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2403 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=537, Invalid=6773, Unknown=0, NotChecked=0, Total=7310 [2019-09-10 03:25:46,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12589 states. [2019-09-10 03:25:46,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12589 to 8613. [2019-09-10 03:25:46,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8613 states. [2019-09-10 03:25:46,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8613 states to 8613 states and 13999 transitions. [2019-09-10 03:25:46,790 INFO L78 Accepts]: Start accepts. Automaton has 8613 states and 13999 transitions. Word has length 232 [2019-09-10 03:25:46,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:25:46,790 INFO L475 AbstractCegarLoop]: Abstraction has 8613 states and 13999 transitions. [2019-09-10 03:25:46,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-10 03:25:46,791 INFO L276 IsEmpty]: Start isEmpty. Operand 8613 states and 13999 transitions. [2019-09-10 03:25:46,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:25:46,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:25:46,795 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:25:46,795 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:25:46,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:25:46,795 INFO L82 PathProgramCache]: Analyzing trace with hash -647339068, now seen corresponding path program 1 times [2019-09-10 03:25:46,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:25:46,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:25:46,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:25:46,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:25:46,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:25:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:25:46,906 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-10 03:25:46,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:25:46,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:25:46,907 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2019-09-10 03:25:46,907 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [12], [14], [16], [19], [22], [38], [39], [40], [43], [44], [45], [46], [47], [48], [49], [58], [62], [64], [69], [74], [79], [84], [88], [91], [101], [104], [114], [120], [127], [130], [140], [143], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [252], [255], [262], [264], [270], [276], [282], [288], [294], [300], [306], [312], [318], [324], [330], [336], [340], [342], [346], [348], [354], [358], [360], [364], [366], [370], [372], [376], [378], [382], [384], [390], [396], [402], [408], [414], [420], [426], [430], [432], [436], [438], [444], [453], [455], [457], [469], [482], [495], [508], [521], [534], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [627], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [717], [723], [728], [733], [738], [743], [748], [754], [755], [756], [757], [758], [762], [763], [764], [765], [768], [769], [770], [771], [772], [773], [774], [775], [776] [2019-09-10 03:25:46,909 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:25:46,909 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:25:46,969 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:25:46,969 INFO L272 AbstractInterpreter]: Visited 162 different actions 223 times. Merged at 2 different actions 2 times. Never widened. Performed 985 root evaluator evaluations with a maximum evaluation depth of 4. Performed 985 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 100 variables. [2019-09-10 03:25:46,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:25:46,969 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:25:47,086 INFO L227 lantSequenceWeakener]: Weakened 179 states. On average, predicates are now at 69.62% of their original sizes. [2019-09-10 03:25:47,086 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:25:48,993 INFO L420 sIntCurrentIteration]: We unified 231 AI predicates to 231 [2019-09-10 03:25:48,994 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:25:48,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:25:48,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [61] imperfect sequences [6] total 65 [2019-09-10 03:25:48,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:25:48,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-10 03:25:48,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-10 03:25:48,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=3357, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 03:25:48,996 INFO L87 Difference]: Start difference. First operand 8613 states and 13999 transitions. Second operand 61 states. [2019-09-10 03:26:16,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:26:16,723 INFO L93 Difference]: Finished difference Result 12603 states and 20653 transitions. [2019-09-10 03:26:16,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 03:26:16,723 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 232 [2019-09-10 03:26:16,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:26:16,746 INFO L225 Difference]: With dead ends: 12603 [2019-09-10 03:26:16,747 INFO L226 Difference]: Without dead ends: 12603 [2019-09-10 03:26:16,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2269 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=517, Invalid=6455, Unknown=0, NotChecked=0, Total=6972 [2019-09-10 03:26:16,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12603 states. [2019-09-10 03:26:16,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12603 to 8627. [2019-09-10 03:26:16,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8627 states. [2019-09-10 03:26:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8627 states to 8627 states and 14014 transitions. [2019-09-10 03:26:16,889 INFO L78 Accepts]: Start accepts. Automaton has 8627 states and 14014 transitions. Word has length 232 [2019-09-10 03:26:16,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:26:16,889 INFO L475 AbstractCegarLoop]: Abstraction has 8627 states and 14014 transitions. [2019-09-10 03:26:16,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-10 03:26:16,890 INFO L276 IsEmpty]: Start isEmpty. Operand 8627 states and 14014 transitions. [2019-09-10 03:26:16,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 03:26:16,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:26:16,893 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:26:16,893 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:26:16,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:26:16,894 INFO L82 PathProgramCache]: Analyzing trace with hash -259671196, now seen corresponding path program 1 times [2019-09-10 03:26:16,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:26:16,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:26:16,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:26:16,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:26:16,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:26:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:26:17,001 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 69 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 03:26:17,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:26:17,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:26:17,002 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2019-09-10 03:26:17,003 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [12], [14], [16], [19], [22], [38], [39], [40], [45], [46], [47], [48], [49], [58], [62], [64], [69], [74], [79], [84], [88], [91], [101], [107], [114], [117], [127], [130], [140], [143], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [252], [255], [262], [264], [270], [276], [282], [288], [294], [300], [306], [312], [318], [324], [330], [336], [340], [342], [346], [348], [354], [358], [360], [364], [366], [370], [372], [376], [378], [382], [384], [390], [396], [402], [408], [414], [420], [426], [430], [432], [436], [438], [444], [453], [455], [457], [469], [482], [495], [508], [521], [534], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [627], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [717], [723], [728], [733], [738], [743], [748], [752], [753], [754], [755], [756], [757], [758], [762], [763], [766], [767], [768], [769], [770], [771], [772], [773], [774], [775], [776] [2019-09-10 03:26:17,005 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:26:17,005 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:26:17,111 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:26:17,111 INFO L272 AbstractInterpreter]: Visited 162 different actions 222 times. Merged at 2 different actions 2 times. Never widened. Performed 986 root evaluator evaluations with a maximum evaluation depth of 4. Performed 986 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 100 variables. [2019-09-10 03:26:17,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:26:17,112 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:26:17,376 INFO L227 lantSequenceWeakener]: Weakened 178 states. On average, predicates are now at 69.57% of their original sizes. [2019-09-10 03:26:17,377 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:26:19,191 INFO L420 sIntCurrentIteration]: We unified 231 AI predicates to 231 [2019-09-10 03:26:19,192 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:26:19,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:26:19,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [60] imperfect sequences [6] total 64 [2019-09-10 03:26:19,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:26:19,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-10 03:26:19,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-10 03:26:19,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=3238, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 03:26:19,194 INFO L87 Difference]: Start difference. First operand 8627 states and 14014 transitions. Second operand 60 states. [2019-09-10 03:26:46,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:26:46,862 INFO L93 Difference]: Finished difference Result 12616 states and 20667 transitions. [2019-09-10 03:26:46,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 03:26:46,862 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 232 [2019-09-10 03:26:46,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:26:46,893 INFO L225 Difference]: With dead ends: 12616 [2019-09-10 03:26:46,894 INFO L226 Difference]: Without dead ends: 12616 [2019-09-10 03:26:46,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2166 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=513, Invalid=6293, Unknown=0, NotChecked=0, Total=6806 [2019-09-10 03:26:46,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12616 states. [2019-09-10 03:26:47,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12616 to 8640. [2019-09-10 03:26:47,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8640 states. [2019-09-10 03:26:47,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8640 states to 8640 states and 14028 transitions. [2019-09-10 03:26:47,035 INFO L78 Accepts]: Start accepts. Automaton has 8640 states and 14028 transitions. Word has length 232 [2019-09-10 03:26:47,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:26:47,036 INFO L475 AbstractCegarLoop]: Abstraction has 8640 states and 14028 transitions. [2019-09-10 03:26:47,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-10 03:26:47,036 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states and 14028 transitions. [2019-09-10 03:26:47,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 03:26:47,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:26:47,040 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 03:26:47,040 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:26:47,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:26:47,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1453687769, now seen corresponding path program 1 times [2019-09-10 03:26:47,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:26:47,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:26:47,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:26:47,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:26:47,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:26:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:26:47,128 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-10 03:26:47,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:26:47,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:26:47,129 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 231 with the following transitions: [2019-09-10 03:26:47,129 INFO L207 CegarAbsIntRunner]: [2], [12], [14], [16], [19], [22], [38], [39], [40], [47], [48], [49], [58], [62], [64], [69], [74], [79], [84], [88], [91], [94], [101], [107], [110], [114], [117], [123], [136], [149], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [252], [255], [262], [264], [270], [276], [282], [288], [294], [300], [306], [312], [318], [324], [330], [336], [340], [342], [346], [348], [354], [358], [360], [364], [366], [370], [372], [376], [378], [382], [384], [390], [396], [402], [408], [414], [420], [426], [430], [432], [436], [438], [444], [453], [455], [457], [469], [482], [495], [508], [521], [534], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [627], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [717], [723], [728], [733], [738], [743], [748], [752], [753], [754], [755], [756], [757], [758], [762], [763], [766], [767], [772], [773], [774], [775], [776] [2019-09-10 03:26:47,131 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:26:47,131 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:26:47,189 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:26:47,190 INFO L272 AbstractInterpreter]: Visited 154 different actions 221 times. Merged at 6 different actions 6 times. Never widened. Performed 889 root evaluator evaluations with a maximum evaluation depth of 4. Performed 889 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 98 variables. [2019-09-10 03:26:47,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:26:47,190 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:26:47,369 INFO L227 lantSequenceWeakener]: Weakened 173 states. On average, predicates are now at 71.4% of their original sizes. [2019-09-10 03:26:47,369 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:26:49,129 INFO L420 sIntCurrentIteration]: We unified 229 AI predicates to 229 [2019-09-10 03:26:49,130 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:26:49,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:26:49,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [57] imperfect sequences [5] total 60 [2019-09-10 03:26:49,130 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:26:49,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-10 03:26:49,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-10 03:26:49,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=2902, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 03:26:49,132 INFO L87 Difference]: Start difference. First operand 8640 states and 14028 transitions. Second operand 57 states. [2019-09-10 03:27:12,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:12,686 INFO L93 Difference]: Finished difference Result 10746 states and 17547 transitions. [2019-09-10 03:27:12,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 03:27:12,686 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 230 [2019-09-10 03:27:12,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:12,705 INFO L225 Difference]: With dead ends: 10746 [2019-09-10 03:27:12,705 INFO L226 Difference]: Without dead ends: 10746 [2019-09-10 03:27:12,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1739 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=425, Invalid=4405, Unknown=0, NotChecked=0, Total=4830 [2019-09-10 03:27:12,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10746 states. [2019-09-10 03:27:12,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10746 to 8670. [2019-09-10 03:27:12,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8670 states. [2019-09-10 03:27:12,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8670 states to 8670 states and 14067 transitions. [2019-09-10 03:27:12,825 INFO L78 Accepts]: Start accepts. Automaton has 8670 states and 14067 transitions. Word has length 230 [2019-09-10 03:27:12,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:12,825 INFO L475 AbstractCegarLoop]: Abstraction has 8670 states and 14067 transitions. [2019-09-10 03:27:12,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-10 03:27:12,826 INFO L276 IsEmpty]: Start isEmpty. Operand 8670 states and 14067 transitions. [2019-09-10 03:27:12,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-10 03:27:12,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:12,829 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:12,830 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:12,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:12,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1037998137, now seen corresponding path program 1 times [2019-09-10 03:27:12,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:12,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:12,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:12,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:12,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:12,922 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-10 03:27:12,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:12,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:27:12,923 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:12,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:27:12,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:27:12,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:27:12,924 INFO L87 Difference]: Start difference. First operand 8670 states and 14067 transitions. Second operand 3 states. [2019-09-10 03:27:12,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:12,985 INFO L93 Difference]: Finished difference Result 9643 states and 15365 transitions. [2019-09-10 03:27:12,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:27:12,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2019-09-10 03:27:12,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:13,013 INFO L225 Difference]: With dead ends: 9643 [2019-09-10 03:27:13,013 INFO L226 Difference]: Without dead ends: 9643 [2019-09-10 03:27:13,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 03:27:13,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9643 states. [2019-09-10 03:27:13,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9643 to 8734. [2019-09-10 03:27:13,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8734 states. [2019-09-10 03:27:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8734 states to 8734 states and 14131 transitions. [2019-09-10 03:27:13,149 INFO L78 Accepts]: Start accepts. Automaton has 8734 states and 14131 transitions. Word has length 236 [2019-09-10 03:27:13,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:13,149 INFO L475 AbstractCegarLoop]: Abstraction has 8734 states and 14131 transitions. [2019-09-10 03:27:13,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:27:13,150 INFO L276 IsEmpty]: Start isEmpty. Operand 8734 states and 14131 transitions. [2019-09-10 03:27:13,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-10 03:27:13,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:13,152 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:13,152 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:13,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:13,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1944755570, now seen corresponding path program 1 times [2019-09-10 03:27:13,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:13,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:13,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:13,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:13,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:13,241 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-10 03:27:13,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:13,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:27:13,242 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:13,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:27:13,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:27:13,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:27:13,243 INFO L87 Difference]: Start difference. First operand 8734 states and 14131 transitions. Second operand 3 states. [2019-09-10 03:27:13,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:13,297 INFO L93 Difference]: Finished difference Result 9739 states and 15493 transitions. [2019-09-10 03:27:13,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:27:13,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2019-09-10 03:27:13,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:13,320 INFO L225 Difference]: With dead ends: 9739 [2019-09-10 03:27:13,321 INFO L226 Difference]: Without dead ends: 9739 [2019-09-10 03:27:13,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 03:27:13,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9739 states. [2019-09-10 03:27:13,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9739 to 8830. [2019-09-10 03:27:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8830 states. [2019-09-10 03:27:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8830 states to 8830 states and 14259 transitions. [2019-09-10 03:27:13,427 INFO L78 Accepts]: Start accepts. Automaton has 8830 states and 14259 transitions. Word has length 238 [2019-09-10 03:27:13,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:13,427 INFO L475 AbstractCegarLoop]: Abstraction has 8830 states and 14259 transitions. [2019-09-10 03:27:13,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:27:13,427 INFO L276 IsEmpty]: Start isEmpty. Operand 8830 states and 14259 transitions. [2019-09-10 03:27:13,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:27:13,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:13,430 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:13,430 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:13,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:13,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1395056631, now seen corresponding path program 1 times [2019-09-10 03:27:13,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:13,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:13,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:13,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:13,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:13,517 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-10 03:27:13,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:13,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:27:13,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:13,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:27:13,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:27:13,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:27:13,519 INFO L87 Difference]: Start difference. First operand 8830 states and 14259 transitions. Second operand 3 states. [2019-09-10 03:27:13,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:13,591 INFO L93 Difference]: Finished difference Result 12004 states and 18894 transitions. [2019-09-10 03:27:13,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:27:13,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-09-10 03:27:13,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:13,624 INFO L225 Difference]: With dead ends: 12004 [2019-09-10 03:27:13,625 INFO L226 Difference]: Without dead ends: 12004 [2019-09-10 03:27:13,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 03:27:13,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12004 states. [2019-09-10 03:27:13,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12004 to 11806. [2019-09-10 03:27:13,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11806 states. [2019-09-10 03:27:13,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11806 states to 11806 states and 18597 transitions. [2019-09-10 03:27:13,851 INFO L78 Accepts]: Start accepts. Automaton has 11806 states and 18597 transitions. Word has length 240 [2019-09-10 03:27:13,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:13,852 INFO L475 AbstractCegarLoop]: Abstraction has 11806 states and 18597 transitions. [2019-09-10 03:27:13,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:27:13,852 INFO L276 IsEmpty]: Start isEmpty. Operand 11806 states and 18597 transitions. [2019-09-10 03:27:13,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 03:27:13,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:13,856 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 03:27:13,856 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:13,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:13,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1360472100, now seen corresponding path program 1 times [2019-09-10 03:27:13,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:13,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:13,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:13,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:13,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:13,952 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 68 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-10 03:27:13,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:27:13,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:27:13,953 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 240 with the following transitions: [2019-09-10 03:27:13,953 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [12], [14], [16], [19], [22], [38], [39], [40], [47], [48], [49], [58], [62], [64], [69], [74], [79], [84], [88], [91], [94], [101], [107], [110], [114], [117], [123], [127], [130], [136], [149], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [252], [255], [262], [264], [270], [276], [282], [288], [294], [300], [306], [312], [318], [324], [330], [336], [340], [342], [346], [348], [354], [358], [360], [364], [366], [370], [372], [376], [378], [382], [384], [390], [396], [402], [408], [414], [420], [426], [430], [432], [436], [438], [444], [453], [455], [457], [460], [465], [467], [469], [473], [476], [480], [482], [495], [508], [521], [534], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [627], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [717], [723], [728], [733], [738], [743], [748], [752], [753], [754], [755], [756], [757], [758], [762], [763], [766], [767], [768], [769], [772], [773], [774], [775], [776] [2019-09-10 03:27:13,955 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:27:13,955 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:27:14,028 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:27:14,029 INFO L272 AbstractInterpreter]: Visited 163 different actions 237 times. Merged at 9 different actions 9 times. Never widened. Performed 1107 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1107 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 99 variables. [2019-09-10 03:27:14,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:14,029 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:27:14,146 INFO L227 lantSequenceWeakener]: Weakened 180 states. On average, predicates are now at 67.86% of their original sizes. [2019-09-10 03:27:14,146 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:27:16,196 INFO L420 sIntCurrentIteration]: We unified 238 AI predicates to 238 [2019-09-10 03:27:16,196 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:27:16,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:27:16,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [5] total 66 [2019-09-10 03:27:16,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:16,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-10 03:27:16,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-10 03:27:16,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=3594, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 03:27:16,198 INFO L87 Difference]: Start difference. First operand 11806 states and 18597 transitions. Second operand 63 states. [2019-09-10 03:27:46,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:46,403 INFO L93 Difference]: Finished difference Result 14757 states and 23370 transitions. [2019-09-10 03:27:46,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-10 03:27:46,403 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 239 [2019-09-10 03:27:46,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:46,432 INFO L225 Difference]: With dead ends: 14757 [2019-09-10 03:27:46,432 INFO L226 Difference]: Without dead ends: 14757 [2019-09-10 03:27:46,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2313 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=486, Invalid=5994, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 03:27:46,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14757 states. [2019-09-10 03:27:46,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14757 to 11838. [2019-09-10 03:27:46,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11838 states. [2019-09-10 03:27:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11838 states to 11838 states and 18636 transitions. [2019-09-10 03:27:46,583 INFO L78 Accepts]: Start accepts. Automaton has 11838 states and 18636 transitions. Word has length 239 [2019-09-10 03:27:46,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:46,583 INFO L475 AbstractCegarLoop]: Abstraction has 11838 states and 18636 transitions. [2019-09-10 03:27:46,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-10 03:27:46,584 INFO L276 IsEmpty]: Start isEmpty. Operand 11838 states and 18636 transitions. [2019-09-10 03:27:46,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-10 03:27:46,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:46,586 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:46,587 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:46,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:46,587 INFO L82 PathProgramCache]: Analyzing trace with hash -177713394, now seen corresponding path program 1 times [2019-09-10 03:27:46,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:46,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:46,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:46,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:46,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:46,677 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-10 03:27:46,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:46,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:27:46,678 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:46,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:27:46,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:27:46,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:27:46,679 INFO L87 Difference]: Start difference. First operand 11838 states and 18636 transitions. Second operand 3 states. [2019-09-10 03:27:46,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:46,756 INFO L93 Difference]: Finished difference Result 12132 states and 19061 transitions. [2019-09-10 03:27:46,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:27:46,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2019-09-10 03:27:46,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:46,796 INFO L225 Difference]: With dead ends: 12132 [2019-09-10 03:27:46,796 INFO L226 Difference]: Without dead ends: 12132 [2019-09-10 03:27:46,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 03:27:46,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12132 states. [2019-09-10 03:27:47,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12132 to 11934. [2019-09-10 03:27:47,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11934 states. [2019-09-10 03:27:47,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11934 states to 11934 states and 18764 transitions. [2019-09-10 03:27:47,046 INFO L78 Accepts]: Start accepts. Automaton has 11934 states and 18764 transitions. Word has length 242 [2019-09-10 03:27:47,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:47,046 INFO L475 AbstractCegarLoop]: Abstraction has 11934 states and 18764 transitions. [2019-09-10 03:27:47,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:27:47,046 INFO L276 IsEmpty]: Start isEmpty. Operand 11934 states and 18764 transitions. [2019-09-10 03:27:47,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:27:47,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:47,050 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 03:27:47,050 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:47,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:47,050 INFO L82 PathProgramCache]: Analyzing trace with hash 484203583, now seen corresponding path program 1 times [2019-09-10 03:27:47,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:47,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:47,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:47,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:47,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:47,166 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 71 proven. 12 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 03:27:47,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:27:47,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:27:47,167 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 241 with the following transitions: [2019-09-10 03:27:47,168 INFO L207 CegarAbsIntRunner]: [2], [12], [14], [16], [19], [22], [38], [39], [40], [45], [46], [47], [48], [49], [58], [62], [64], [69], [74], [79], [84], [88], [91], [94], [101], [107], [110], [114], [117], [123], [127], [133], [136], [140], [143], [149], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [252], [255], [262], [264], [270], [276], [282], [288], [294], [300], [306], [312], [318], [324], [330], [336], [340], [342], [346], [348], [354], [358], [360], [364], [366], [370], [372], [376], [378], [382], [384], [390], [396], [402], [408], [414], [420], [426], [430], [432], [436], [438], [444], [453], [455], [457], [460], [465], [467], [469], [473], [476], [480], [482], [495], [508], [521], [534], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [627], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [717], [723], [728], [733], [738], [743], [748], [752], [753], [754], [755], [756], [757], [758], [762], [763], [766], [767], [770], [771], [772], [773], [774], [775], [776] [2019-09-10 03:27:47,170 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:27:47,170 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:27:47,315 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:27:47,316 INFO L272 AbstractInterpreter]: Visited 165 different actions 313 times. Merged at 19 different actions 46 times. Never widened. Performed 2198 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2198 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 9 fixpoints after 5 different actions. Largest state had 100 variables. [2019-09-10 03:27:47,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:47,316 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:27:47,424 INFO L227 lantSequenceWeakener]: Weakened 182 states. On average, predicates are now at 69.63% of their original sizes. [2019-09-10 03:27:47,425 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:27:49,782 INFO L420 sIntCurrentIteration]: We unified 239 AI predicates to 239 [2019-09-10 03:27:49,782 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:27:49,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:27:49,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [67] imperfect sequences [6] total 71 [2019-09-10 03:27:49,783 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:49,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-10 03:27:49,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-10 03:27:49,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=4090, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 03:27:49,785 INFO L87 Difference]: Start difference. First operand 11934 states and 18764 transitions. Second operand 67 states. [2019-09-10 03:28:22,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:28:22,762 INFO L93 Difference]: Finished difference Result 17675 states and 27923 transitions. [2019-09-10 03:28:22,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-10 03:28:22,762 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 240 [2019-09-10 03:28:22,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:28:22,795 INFO L225 Difference]: With dead ends: 17675 [2019-09-10 03:28:22,795 INFO L226 Difference]: Without dead ends: 17675 [2019-09-10 03:28:22,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3124 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=878, Invalid=8434, Unknown=0, NotChecked=0, Total=9312 [2019-09-10 03:28:22,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17675 states. [2019-09-10 03:28:22,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17675 to 12016. [2019-09-10 03:28:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12016 states. [2019-09-10 03:28:22,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12016 states to 12016 states and 18868 transitions. [2019-09-10 03:28:22,968 INFO L78 Accepts]: Start accepts. Automaton has 12016 states and 18868 transitions. Word has length 240 [2019-09-10 03:28:22,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:28:22,968 INFO L475 AbstractCegarLoop]: Abstraction has 12016 states and 18868 transitions. [2019-09-10 03:28:22,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-10 03:28:22,968 INFO L276 IsEmpty]: Start isEmpty. Operand 12016 states and 18868 transitions. [2019-09-10 03:28:22,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-10 03:28:22,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:28:22,971 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 03:28:22,971 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:28:22,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:22,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1585533437, now seen corresponding path program 1 times [2019-09-10 03:28:22,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:28:22,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:22,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:22,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:22,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:28:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 68 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-10 03:28:23,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:28:23,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:28:23,060 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 242 with the following transitions: [2019-09-10 03:28:23,060 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [12], [14], [16], [19], [22], [38], [39], [40], [47], [48], [49], [58], [62], [64], [69], [74], [79], [84], [88], [91], [94], [101], [107], [114], [117], [120], [127], [130], [136], [149], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [252], [255], [262], [264], [270], [276], [282], [288], [294], [300], [306], [312], [318], [324], [330], [336], [340], [342], [346], [348], [354], [358], [360], [364], [366], [370], [372], [376], [378], [382], [384], [390], [396], [402], [408], [414], [420], [426], [430], [432], [436], [438], [444], [453], [455], [457], [460], [465], [467], [469], [473], [476], [480], [482], [495], [508], [521], [534], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [627], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [717], [723], [728], [733], [738], [743], [748], [752], [753], [754], [755], [756], [757], [758], [762], [763], [766], [767], [768], [769], [772], [773], [774], [775], [776] [2019-09-10 03:28:23,062 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:28:23,062 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:28:23,140 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:28:23,141 INFO L272 AbstractInterpreter]: Visited 162 different actions 251 times. Merged at 10 different actions 17 times. Never widened. Performed 1313 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1313 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 99 variables. [2019-09-10 03:28:23,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:23,141 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:28:23,252 INFO L227 lantSequenceWeakener]: Weakened 182 states. On average, predicates are now at 67.87% of their original sizes. [2019-09-10 03:28:23,252 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:28:25,475 INFO L420 sIntCurrentIteration]: We unified 240 AI predicates to 240 [2019-09-10 03:28:25,475 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:28:25,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:28:25,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [5] total 69 [2019-09-10 03:28:25,476 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:28:25,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-10 03:28:25,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-10 03:28:25,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=3964, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 03:28:25,478 INFO L87 Difference]: Start difference. First operand 12016 states and 18868 transitions. Second operand 66 states. [2019-09-10 03:29:01,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:29:01,130 INFO L93 Difference]: Finished difference Result 14946 states and 23614 transitions. [2019-09-10 03:29:01,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 03:29:01,130 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 241 [2019-09-10 03:29:01,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:29:01,157 INFO L225 Difference]: With dead ends: 14946 [2019-09-10 03:29:01,158 INFO L226 Difference]: Without dead ends: 14946 [2019-09-10 03:29:01,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2410 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=478, Invalid=5842, Unknown=0, NotChecked=0, Total=6320 [2019-09-10 03:29:01,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14946 states. [2019-09-10 03:29:01,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14946 to 12012. [2019-09-10 03:29:01,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12012 states. [2019-09-10 03:29:01,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12012 states to 12012 states and 18858 transitions. [2019-09-10 03:29:01,303 INFO L78 Accepts]: Start accepts. Automaton has 12012 states and 18858 transitions. Word has length 241 [2019-09-10 03:29:01,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:29:01,303 INFO L475 AbstractCegarLoop]: Abstraction has 12012 states and 18858 transitions. [2019-09-10 03:29:01,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-10 03:29:01,303 INFO L276 IsEmpty]: Start isEmpty. Operand 12012 states and 18858 transitions. [2019-09-10 03:29:01,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-10 03:29:01,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:29:01,306 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:29:01,306 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:29:01,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:29:01,307 INFO L82 PathProgramCache]: Analyzing trace with hash -164611255, now seen corresponding path program 1 times [2019-09-10 03:29:01,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:29:01,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:29:01,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:29:01,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:29:01,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:29:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:29:01,384 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-10 03:29:01,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:29:01,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:29:01,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:29:01,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:29:01,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:29:01,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:29:01,386 INFO L87 Difference]: Start difference. First operand 12012 states and 18858 transitions. Second operand 3 states. [2019-09-10 03:29:01,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:29:01,468 INFO L93 Difference]: Finished difference Result 18256 states and 28178 transitions. [2019-09-10 03:29:01,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:29:01,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-09-10 03:29:01,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:29:01,517 INFO L225 Difference]: With dead ends: 18256 [2019-09-10 03:29:01,518 INFO L226 Difference]: Without dead ends: 18256 [2019-09-10 03:29:01,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 03:29:01,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18256 states. [2019-09-10 03:29:01,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18256 to 17868. [2019-09-10 03:29:01,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17868 states. [2019-09-10 03:29:01,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17868 states to 17868 states and 27596 transitions. [2019-09-10 03:29:01,778 INFO L78 Accepts]: Start accepts. Automaton has 17868 states and 27596 transitions. Word has length 244 [2019-09-10 03:29:01,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:29:01,779 INFO L475 AbstractCegarLoop]: Abstraction has 17868 states and 27596 transitions. [2019-09-10 03:29:01,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:29:01,779 INFO L276 IsEmpty]: Start isEmpty. Operand 17868 states and 27596 transitions. [2019-09-10 03:29:01,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-10 03:29:01,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:29:01,782 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 03:29:01,782 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:29:01,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:29:01,782 INFO L82 PathProgramCache]: Analyzing trace with hash 2048089404, now seen corresponding path program 1 times [2019-09-10 03:29:01,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:29:01,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:29:01,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:29:01,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:29:01,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:29:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:29:01,868 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 68 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-10 03:29:01,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:29:01,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:29:01,869 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 244 with the following transitions: [2019-09-10 03:29:01,869 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [12], [14], [16], [19], [22], [38], [39], [40], [43], [44], [47], [48], [49], [58], [62], [64], [69], [74], [79], [84], [88], [91], [94], [101], [104], [110], [114], [120], [123], [127], [130], [136], [149], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [252], [255], [262], [264], [270], [276], [282], [288], [294], [300], [306], [312], [318], [324], [330], [336], [340], [342], [346], [348], [354], [358], [360], [364], [366], [370], [372], [376], [378], [382], [384], [390], [396], [402], [408], [414], [420], [426], [430], [432], [436], [438], [444], [453], [455], [457], [460], [465], [467], [469], [473], [476], [480], [482], [486], [489], [493], [495], [499], [502], [506], [508], [521], [534], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [627], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [717], [723], [728], [733], [738], [743], [748], [754], [755], [756], [757], [758], [762], [763], [764], [765], [768], [769], [772], [773], [774], [775], [776] [2019-09-10 03:29:01,871 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:29:01,871 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:29:01,972 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:29:01,973 INFO L272 AbstractInterpreter]: Visited 165 different actions 239 times. Merged at 9 different actions 9 times. Never widened. Performed 1110 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1110 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 99 variables. [2019-09-10 03:29:01,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:29:01,973 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:29:02,215 INFO L227 lantSequenceWeakener]: Weakened 180 states. On average, predicates are now at 67.79% of their original sizes. [2019-09-10 03:29:02,216 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:29:04,600 INFO L420 sIntCurrentIteration]: We unified 242 AI predicates to 242 [2019-09-10 03:29:04,601 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:29:04,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:29:04,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [5] total 68 [2019-09-10 03:29:04,601 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:29:04,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-10 03:29:04,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-10 03:29:04,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=3832, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 03:29:04,603 INFO L87 Difference]: Start difference. First operand 17868 states and 27596 transitions. Second operand 65 states. [2019-09-10 03:29:34,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:29:34,444 INFO L93 Difference]: Finished difference Result 22366 states and 34747 transitions. [2019-09-10 03:29:34,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 03:29:34,445 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 243 [2019-09-10 03:29:34,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:29:34,487 INFO L225 Difference]: With dead ends: 22366 [2019-09-10 03:29:34,487 INFO L226 Difference]: Without dead ends: 22366 [2019-09-10 03:29:34,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2317 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=487, Invalid=5993, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 03:29:34,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22366 states. [2019-09-10 03:29:34,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22366 to 17861. [2019-09-10 03:29:34,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17861 states. [2019-09-10 03:29:34,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17861 states to 17861 states and 27579 transitions. [2019-09-10 03:29:34,704 INFO L78 Accepts]: Start accepts. Automaton has 17861 states and 27579 transitions. Word has length 243 [2019-09-10 03:29:34,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:29:34,704 INFO L475 AbstractCegarLoop]: Abstraction has 17861 states and 27579 transitions. [2019-09-10 03:29:34,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-10 03:29:34,704 INFO L276 IsEmpty]: Start isEmpty. Operand 17861 states and 27579 transitions. [2019-09-10 03:29:34,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:29:34,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:29:34,707 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:29:34,708 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:29:34,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:29:34,708 INFO L82 PathProgramCache]: Analyzing trace with hash -233606258, now seen corresponding path program 1 times [2019-09-10 03:29:34,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:29:34,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:29:34,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:29:34,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:29:34,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:29:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:29:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-10 03:29:34,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:29:34,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:29:34,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:29:34,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:29:34,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:29:34,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:29:34,797 INFO L87 Difference]: Start difference. First operand 17861 states and 27579 transitions. Second operand 3 states. [2019-09-10 03:29:34,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:29:34,895 INFO L93 Difference]: Finished difference Result 18345 states and 28289 transitions. [2019-09-10 03:29:34,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:29:34,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-09-10 03:29:34,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:29:34,935 INFO L225 Difference]: With dead ends: 18345 [2019-09-10 03:29:34,936 INFO L226 Difference]: Without dead ends: 18345 [2019-09-10 03:29:34,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 03:29:34,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18345 states. [2019-09-10 03:29:35,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18345 to 17957. [2019-09-10 03:29:35,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17957 states. [2019-09-10 03:29:35,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17957 states to 17957 states and 27707 transitions. [2019-09-10 03:29:35,165 INFO L78 Accepts]: Start accepts. Automaton has 17957 states and 27707 transitions. Word has length 246 [2019-09-10 03:29:35,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:29:35,165 INFO L475 AbstractCegarLoop]: Abstraction has 17957 states and 27707 transitions. [2019-09-10 03:29:35,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:29:35,166 INFO L276 IsEmpty]: Start isEmpty. Operand 17957 states and 27707 transitions. [2019-09-10 03:29:35,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:29:35,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:29:35,170 INFO L399 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:29:35,170 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:29:35,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:29:35,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1674516695, now seen corresponding path program 1 times [2019-09-10 03:29:35,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:29:35,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:29:35,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:29:35,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:29:35,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:29:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:29:35,273 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 71 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-10 03:29:35,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:29:35,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:29:35,273 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 246 with the following transitions: [2019-09-10 03:29:35,274 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [12], [14], [16], [19], [22], [38], [39], [40], [43], [44], [47], [48], [49], [58], [62], [64], [67], [69], [74], [79], [84], [88], [91], [97], [101], [104], [107], [114], [120], [123], [127], [130], [136], [140], [146], [149], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [252], [255], [262], [264], [270], [276], [282], [288], [294], [300], [306], [312], [318], [324], [330], [336], [340], [342], [346], [348], [354], [358], [360], [364], [366], [370], [372], [376], [378], [382], [384], [390], [396], [402], [408], [414], [420], [426], [430], [432], [436], [438], [444], [453], [455], [457], [460], [465], [467], [469], [473], [476], [480], [482], [486], [489], [493], [495], [499], [502], [506], [508], [521], [534], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [627], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [717], [723], [728], [733], [738], [743], [748], [754], [755], [756], [757], [758], [762], [763], [764], [765], [768], [769], [772], [773], [774], [775], [776] [2019-09-10 03:29:35,277 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:29:35,277 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:29:35,380 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:29:35,380 INFO L272 AbstractInterpreter]: Visited 168 different actions 314 times. Merged at 20 different actions 45 times. Never widened. Performed 2020 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2020 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 13 fixpoints after 7 different actions. Largest state had 100 variables. [2019-09-10 03:29:35,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:29:35,380 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:29:35,493 INFO L227 lantSequenceWeakener]: Weakened 184 states. On average, predicates are now at 68.11% of their original sizes. [2019-09-10 03:29:35,493 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:29:38,274 INFO L420 sIntCurrentIteration]: We unified 244 AI predicates to 244 [2019-09-10 03:29:38,275 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:29:38,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:29:38,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [74] imperfect sequences [6] total 78 [2019-09-10 03:29:38,276 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:29:38,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-10 03:29:38,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-10 03:29:38,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=5015, Unknown=0, NotChecked=0, Total=5402 [2019-09-10 03:29:38,278 INFO L87 Difference]: Start difference. First operand 17957 states and 27707 transitions. Second operand 74 states. [2019-09-10 03:30:16,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:30:16,384 INFO L93 Difference]: Finished difference Result 22612 states and 35066 transitions. [2019-09-10 03:30:16,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-10 03:30:16,384 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 245 [2019-09-10 03:30:16,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:30:16,436 INFO L225 Difference]: With dead ends: 22612 [2019-09-10 03:30:16,436 INFO L226 Difference]: Without dead ends: 22612 [2019-09-10 03:30:16,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4303 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1115, Invalid=11767, Unknown=0, NotChecked=0, Total=12882 [2019-09-10 03:30:16,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22612 states. [2019-09-10 03:30:16,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22612 to 18052. [2019-09-10 03:30:16,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18052 states. [2019-09-10 03:30:16,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18052 states to 18052 states and 27828 transitions. [2019-09-10 03:30:16,646 INFO L78 Accepts]: Start accepts. Automaton has 18052 states and 27828 transitions. Word has length 245 [2019-09-10 03:30:16,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:30:16,647 INFO L475 AbstractCegarLoop]: Abstraction has 18052 states and 27828 transitions. [2019-09-10 03:30:16,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-10 03:30:16,647 INFO L276 IsEmpty]: Start isEmpty. Operand 18052 states and 27828 transitions. [2019-09-10 03:30:16,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-10 03:30:16,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:30:16,650 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:30:16,650 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:30:16,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:30:16,650 INFO L82 PathProgramCache]: Analyzing trace with hash 2050375305, now seen corresponding path program 1 times [2019-09-10 03:30:16,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:30:16,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:30:16,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:30:16,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:30:16,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:30:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:30:16,747 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-10 03:30:16,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:30:16,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:30:16,747 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:30:16,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:30:16,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:30:16,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:30:16,748 INFO L87 Difference]: Start difference. First operand 18052 states and 27828 transitions. Second operand 3 states. [2019-09-10 03:30:16,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:30:16,895 INFO L93 Difference]: Finished difference Result 30056 states and 46140 transitions. [2019-09-10 03:30:16,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:30:16,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-09-10 03:30:16,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:30:16,982 INFO L225 Difference]: With dead ends: 30056 [2019-09-10 03:30:16,982 INFO L226 Difference]: Without dead ends: 30056 [2019-09-10 03:30:16,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 03:30:17,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30056 states. [2019-09-10 03:30:17,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30056 to 29284. [2019-09-10 03:30:17,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29284 states. [2019-09-10 03:30:17,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29284 states to 29284 states and 44982 transitions. [2019-09-10 03:30:17,351 INFO L78 Accepts]: Start accepts. Automaton has 29284 states and 44982 transitions. Word has length 248 [2019-09-10 03:30:17,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:30:17,351 INFO L475 AbstractCegarLoop]: Abstraction has 29284 states and 44982 transitions. [2019-09-10 03:30:17,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:30:17,351 INFO L276 IsEmpty]: Start isEmpty. Operand 29284 states and 44982 transitions. [2019-09-10 03:30:17,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:30:17,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:30:17,354 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 03:30:17,354 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:30:17,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:30:17,355 INFO L82 PathProgramCache]: Analyzing trace with hash -280507330, now seen corresponding path program 1 times [2019-09-10 03:30:17,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:30:17,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:30:17,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:30:17,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:30:17,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:30:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:30:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-10 03:30:17,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:30:17,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:30:17,446 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2019-09-10 03:30:17,446 INFO L207 CegarAbsIntRunner]: [2], [12], [14], [16], [19], [22], [38], [39], [40], [43], [44], [47], [48], [49], [58], [62], [64], [69], [74], [79], [84], [88], [91], [94], [101], [104], [110], [114], [117], [123], [136], [149], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [252], [255], [262], [264], [270], [276], [282], [288], [294], [300], [306], [312], [318], [324], [330], [336], [340], [342], [346], [348], [354], [358], [360], [364], [366], [370], [372], [376], [378], [382], [384], [390], [396], [402], [408], [414], [420], [426], [430], [432], [436], [438], [444], [453], [455], [457], [460], [465], [467], [469], [473], [476], [480], [482], [486], [489], [493], [495], [499], [502], [506], [508], [512], [515], [519], [521], [525], [528], [532], [534], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [627], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [717], [723], [728], [733], [738], [743], [748], [752], [753], [754], [755], [756], [757], [758], [762], [763], [764], [765], [766], [767], [772], [773], [774], [775], [776] [2019-09-10 03:30:17,449 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:30:17,449 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:30:17,524 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:30:17,524 INFO L272 AbstractInterpreter]: Visited 164 different actions 235 times. Merged at 7 different actions 7 times. Never widened. Performed 1100 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1100 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 98 variables. [2019-09-10 03:30:17,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:30:17,524 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:30:17,668 INFO L227 lantSequenceWeakener]: Weakened 177 states. On average, predicates are now at 68.17% of their original sizes. [2019-09-10 03:30:17,668 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:30:20,435 INFO L420 sIntCurrentIteration]: We unified 245 AI predicates to 245 [2019-09-10 03:30:20,435 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:30:20,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:30:20,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [67] imperfect sequences [5] total 70 [2019-09-10 03:30:20,436 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:30:20,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-10 03:30:20,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-10 03:30:20,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=4053, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 03:30:20,438 INFO L87 Difference]: Start difference. First operand 29284 states and 44982 transitions. Second operand 67 states. [2019-09-10 03:30:49,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:30:49,038 INFO L93 Difference]: Finished difference Result 36843 states and 56937 transitions. [2019-09-10 03:30:49,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-10 03:30:49,038 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 246 [2019-09-10 03:30:49,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:30:49,113 INFO L225 Difference]: With dead ends: 36843 [2019-09-10 03:30:49,113 INFO L226 Difference]: Without dead ends: 36843 [2019-09-10 03:30:49,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=504, Invalid=5816, Unknown=0, NotChecked=0, Total=6320 [2019-09-10 03:30:49,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36843 states. [2019-09-10 03:30:49,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36843 to 29318. [2019-09-10 03:30:49,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29318 states. [2019-09-10 03:30:49,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29318 states to 29318 states and 45023 transitions. [2019-09-10 03:30:49,458 INFO L78 Accepts]: Start accepts. Automaton has 29318 states and 45023 transitions. Word has length 246 [2019-09-10 03:30:49,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:30:49,459 INFO L475 AbstractCegarLoop]: Abstraction has 29318 states and 45023 transitions. [2019-09-10 03:30:49,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-10 03:30:49,459 INFO L276 IsEmpty]: Start isEmpty. Operand 29318 states and 45023 transitions. [2019-09-10 03:30:49,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-10 03:30:49,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:30:49,462 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:30:49,462 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:30:49,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:30:49,462 INFO L82 PathProgramCache]: Analyzing trace with hash 561565710, now seen corresponding path program 1 times [2019-09-10 03:30:49,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:30:49,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:30:49,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:30:49,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:30:49,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:30:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:30:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 15 proven. 69 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 03:30:49,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:30:49,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:30:49,626 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 251 with the following transitions: [2019-09-10 03:30:49,626 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [12], [14], [16], [19], [22], [38], [39], [40], [43], [44], [45], [46], [47], [48], [49], [58], [62], [64], [69], [74], [79], [84], [88], [91], [101], [104], [114], [117], [127], [130], [140], [143], [154], [155], [167], [180], [193], [206], [219], [232], [245], [249], [252], [255], [262], [264], [270], [276], [282], [288], [294], [300], [306], [312], [318], [324], [330], [336], [340], [342], [346], [348], [354], [358], [360], [364], [366], [370], [372], [376], [378], [382], [384], [390], [396], [402], [408], [414], [420], [426], [430], [432], [436], [438], [444], [453], [455], [457], [460], [465], [467], [469], [473], [476], [480], [482], [486], [489], [493], [495], [499], [502], [506], [508], [512], [515], [519], [521], [525], [528], [532], [534], [538], [541], [545], [547], [566], [568], [571], [573], [577], [579], [583], [585], [589], [591], [595], [597], [601], [603], [609], [613], [615], [619], [621], [627], [633], [637], [639], [643], [645], [649], [651], [657], [661], [663], [667], [669], [673], [675], [679], [681], [685], [687], [691], [693], [697], [699], [705], [709], [711], [717], [723], [728], [733], [738], [743], [748], [752], [753], [754], [755], [756], [757], [758], [762], [763], [764], [765], [766], [767], [768], [769], [770], [771], [772], [773], [774], [775], [776] [2019-09-10 03:30:49,630 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:30:49,630 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:30:49,805 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:30:49,806 INFO L272 AbstractInterpreter]: Visited 185 different actions 412 times. Merged at 61 different actions 61 times. Never widened. Performed 1752 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1752 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 4 different actions. Largest state had 100 variables. [2019-09-10 03:30:49,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:30:49,806 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:30:50,034 INFO L227 lantSequenceWeakener]: Weakened 240 states. On average, predicates are now at 72.1% of their original sizes. [2019-09-10 03:30:50,034 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:30:55,904 INFO L420 sIntCurrentIteration]: We unified 249 AI predicates to 249 [2019-09-10 03:30:55,904 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:30:55,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:30:55,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [113] imperfect sequences [6] total 117 [2019-09-10 03:30:55,904 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:30:55,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-09-10 03:30:55,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-09-10 03:30:55,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=740, Invalid=11916, Unknown=0, NotChecked=0, Total=12656 [2019-09-10 03:30:55,907 INFO L87 Difference]: Start difference. First operand 29318 states and 45023 transitions. Second operand 113 states.