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/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:13:07,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:13:07,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:13:07,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:13:07,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:13:07,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:13:07,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:13:07,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:13:07,556 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:13:07,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:13:07,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:13:07,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:13:07,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:13:07,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:13:07,562 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:13:07,563 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:13:07,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:13:07,565 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:13:07,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:13:07,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:13:07,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:13:07,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:13:07,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:13:07,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:13:07,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:13:07,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:13:07,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:13:07,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:13:07,579 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:13:07,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:13:07,580 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:13:07,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:13:07,582 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:13:07,583 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:13:07,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:13:07,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:13:07,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:13:07,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:13:07,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:13:07,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:13:07,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:13:07,591 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 07:13:07,621 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:13:07,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:13:07,622 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:13:07,623 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:13:07,623 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:13:07,624 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:13:07,624 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:13:07,624 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:13:07,624 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:13:07,625 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:13:07,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:13:07,627 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:13:07,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:13:07,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:13:07,628 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:13:07,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:13:07,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:13:07,629 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:13:07,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:13:07,630 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:13:07,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:13:07,630 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:13:07,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:13:07,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:13:07,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:13:07,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:13:07,631 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:13:07,632 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:13:07,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:13:07,632 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:13:07,685 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:13:07,707 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:13:07,714 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:13:07,716 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:13:07,717 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:13:07,718 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 07:13:07,798 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67dac3d5c/90a4f9943c8040e5a08b508503054b01/FLAG0a18b7e9c [2019-09-10 07:13:08,288 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:13:08,289 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 07:13:08,309 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67dac3d5c/90a4f9943c8040e5a08b508503054b01/FLAG0a18b7e9c [2019-09-10 07:13:08,615 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67dac3d5c/90a4f9943c8040e5a08b508503054b01 [2019-09-10 07:13:08,623 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:13:08,624 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:13:08,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:13:08,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:13:08,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:13:08,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:13:08" (1/1) ... [2019-09-10 07:13:08,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40ea8c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:08, skipping insertion in model container [2019-09-10 07:13:08,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:13:08" (1/1) ... [2019-09-10 07:13:08,639 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:13:08,687 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:13:09,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:13:09,051 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:13:09,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:13:09,148 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:13:09,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:09 WrapperNode [2019-09-10 07:13:09,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:13:09,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:13:09,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:13:09,150 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:13:09,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:09" (1/1) ... [2019-09-10 07:13:09,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:09" (1/1) ... [2019-09-10 07:13:09,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:09" (1/1) ... [2019-09-10 07:13:09,171 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:09" (1/1) ... [2019-09-10 07:13:09,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:09" (1/1) ... [2019-09-10 07:13:09,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:09" (1/1) ... [2019-09-10 07:13:09,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:09" (1/1) ... [2019-09-10 07:13:09,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:13:09,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:13:09,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:13:09,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:13:09,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:09" (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 07:13:09,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:13:09,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:13:09,260 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:13:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:13:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:13:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:13:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:13:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:13:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:13:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:13:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:13:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:13:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:13:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:13:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:13:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:13:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:13:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:13:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:13:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:13:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:13:09,954 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:13:09,954 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:13:09,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:13:09 BoogieIcfgContainer [2019-09-10 07:13:09,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:13:09,957 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:13:09,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:13:09,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:13:09,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:13:08" (1/3) ... [2019-09-10 07:13:09,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6226ff5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:13:09, skipping insertion in model container [2019-09-10 07:13:09,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:09" (2/3) ... [2019-09-10 07:13:09,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6226ff5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:13:09, skipping insertion in model container [2019-09-10 07:13:09,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:13:09" (3/3) ... [2019-09-10 07:13:09,964 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 07:13:09,974 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:13:09,982 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:13:09,998 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:13:10,026 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:13:10,026 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:13:10,026 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:13:10,026 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:13:10,027 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:13:10,027 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:13:10,027 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:13:10,027 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:13:10,046 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2019-09-10 07:13:10,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 07:13:10,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:10,061 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:13:10,063 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:10,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:10,069 INFO L82 PathProgramCache]: Analyzing trace with hash 236206689, now seen corresponding path program 1 times [2019-09-10 07:13:10,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:10,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:10,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:10,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:10,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:10,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:10,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:10,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:13:10,487 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:10,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:13:10,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:13:10,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:13:10,510 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2019-09-10 07:13:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:10,583 INFO L93 Difference]: Finished difference Result 221 states and 353 transitions. [2019-09-10 07:13:10,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:13:10,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-10 07:13:10,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:10,600 INFO L225 Difference]: With dead ends: 221 [2019-09-10 07:13:10,600 INFO L226 Difference]: Without dead ends: 213 [2019-09-10 07:13:10,602 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 07:13:10,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-10 07:13:10,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2019-09-10 07:13:10,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-10 07:13:10,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 313 transitions. [2019-09-10 07:13:10,705 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 313 transitions. Word has length 64 [2019-09-10 07:13:10,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:10,706 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 313 transitions. [2019-09-10 07:13:10,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:13:10,706 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 313 transitions. [2019-09-10 07:13:10,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 07:13:10,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:10,710 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:13:10,710 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:10,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:10,711 INFO L82 PathProgramCache]: Analyzing trace with hash 2118823319, now seen corresponding path program 1 times [2019-09-10 07:13:10,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:10,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:10,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:10,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:10,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:10,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:10,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:10,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:13:10,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:10,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:13:10,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:13:10,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:13:10,856 INFO L87 Difference]: Start difference. First operand 211 states and 313 transitions. Second operand 3 states. [2019-09-10 07:13:10,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:10,886 INFO L93 Difference]: Finished difference Result 351 states and 533 transitions. [2019-09-10 07:13:10,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:13:10,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-10 07:13:10,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:10,890 INFO L225 Difference]: With dead ends: 351 [2019-09-10 07:13:10,890 INFO L226 Difference]: Without dead ends: 351 [2019-09-10 07:13:10,891 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 07:13:10,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-09-10 07:13:10,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-09-10 07:13:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-09-10 07:13:10,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 532 transitions. [2019-09-10 07:13:10,912 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 532 transitions. Word has length 65 [2019-09-10 07:13:10,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:10,912 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 532 transitions. [2019-09-10 07:13:10,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:13:10,913 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 532 transitions. [2019-09-10 07:13:10,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 07:13:10,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:10,915 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:13:10,915 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:10,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:10,916 INFO L82 PathProgramCache]: Analyzing trace with hash -953795146, now seen corresponding path program 1 times [2019-09-10 07:13:10,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:10,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:10,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:10,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:10,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:11,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:11,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:11,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:13:11,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:11,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:13:11,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:13:11,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:13:11,049 INFO L87 Difference]: Start difference. First operand 349 states and 532 transitions. Second operand 3 states. [2019-09-10 07:13:11,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:11,082 INFO L93 Difference]: Finished difference Result 595 states and 917 transitions. [2019-09-10 07:13:11,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:13:11,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 07:13:11,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:11,087 INFO L225 Difference]: With dead ends: 595 [2019-09-10 07:13:11,087 INFO L226 Difference]: Without dead ends: 595 [2019-09-10 07:13:11,088 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 07:13:11,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-09-10 07:13:11,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 593. [2019-09-10 07:13:11,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-09-10 07:13:11,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 916 transitions. [2019-09-10 07:13:11,117 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 916 transitions. Word has length 66 [2019-09-10 07:13:11,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:11,117 INFO L475 AbstractCegarLoop]: Abstraction has 593 states and 916 transitions. [2019-09-10 07:13:11,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:13:11,118 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 916 transitions. [2019-09-10 07:13:11,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:13:11,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:11,120 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:13:11,120 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:11,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:11,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1958601078, now seen corresponding path program 1 times [2019-09-10 07:13:11,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:11,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:11,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:11,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:11,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:11,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:11,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:11,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:13:11,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:11,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:13:11,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:13:11,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:13:11,193 INFO L87 Difference]: Start difference. First operand 593 states and 916 transitions. Second operand 3 states. [2019-09-10 07:13:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:11,221 INFO L93 Difference]: Finished difference Result 1019 states and 1577 transitions. [2019-09-10 07:13:11,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:13:11,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 07:13:11,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:11,228 INFO L225 Difference]: With dead ends: 1019 [2019-09-10 07:13:11,228 INFO L226 Difference]: Without dead ends: 1019 [2019-09-10 07:13:11,228 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 07:13:11,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-09-10 07:13:11,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1017. [2019-09-10 07:13:11,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1017 states. [2019-09-10 07:13:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1576 transitions. [2019-09-10 07:13:11,255 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1576 transitions. Word has length 67 [2019-09-10 07:13:11,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:11,256 INFO L475 AbstractCegarLoop]: Abstraction has 1017 states and 1576 transitions. [2019-09-10 07:13:11,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:13:11,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1576 transitions. [2019-09-10 07:13:11,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:13:11,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:11,258 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:13:11,258 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:11,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:11,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1238942495, now seen corresponding path program 1 times [2019-09-10 07:13:11,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:11,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:11,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:11,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:11,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:11,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:11,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:11,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:13:11,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:11,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:13:11,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:13:11,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:13:11,498 INFO L87 Difference]: Start difference. First operand 1017 states and 1576 transitions. Second operand 7 states. [2019-09-10 07:13:11,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:11,703 INFO L93 Difference]: Finished difference Result 4289 states and 6652 transitions. [2019-09-10 07:13:11,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:13:11,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-09-10 07:13:11,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:11,724 INFO L225 Difference]: With dead ends: 4289 [2019-09-10 07:13:11,724 INFO L226 Difference]: Without dead ends: 4289 [2019-09-10 07:13:11,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:13:11,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4289 states. [2019-09-10 07:13:11,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4289 to 4281. [2019-09-10 07:13:11,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4281 states. [2019-09-10 07:13:11,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 6648 transitions. [2019-09-10 07:13:11,823 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 6648 transitions. Word has length 68 [2019-09-10 07:13:11,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:11,823 INFO L475 AbstractCegarLoop]: Abstraction has 4281 states and 6648 transitions. [2019-09-10 07:13:11,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:13:11,824 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 6648 transitions. [2019-09-10 07:13:11,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:13:11,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:11,825 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:13:11,826 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:11,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:11,826 INFO L82 PathProgramCache]: Analyzing trace with hash 691911688, now seen corresponding path program 1 times [2019-09-10 07:13:11,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:11,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:11,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:11,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:11,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:11,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:11,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:11,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:13:11,926 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:11,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:13:11,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:13:11,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:13:11,927 INFO L87 Difference]: Start difference. First operand 4281 states and 6648 transitions. Second operand 6 states. [2019-09-10 07:13:12,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:12,297 INFO L93 Difference]: Finished difference Result 12541 states and 19418 transitions. [2019-09-10 07:13:12,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:13:12,297 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 07:13:12,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:12,362 INFO L225 Difference]: With dead ends: 12541 [2019-09-10 07:13:12,363 INFO L226 Difference]: Without dead ends: 12541 [2019-09-10 07:13:12,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:13:12,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12541 states. [2019-09-10 07:13:12,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12541 to 12537. [2019-09-10 07:13:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12537 states. [2019-09-10 07:13:12,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12537 states to 12537 states and 19416 transitions. [2019-09-10 07:13:12,734 INFO L78 Accepts]: Start accepts. Automaton has 12537 states and 19416 transitions. Word has length 70 [2019-09-10 07:13:12,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:12,736 INFO L475 AbstractCegarLoop]: Abstraction has 12537 states and 19416 transitions. [2019-09-10 07:13:12,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:13:12,739 INFO L276 IsEmpty]: Start isEmpty. Operand 12537 states and 19416 transitions. [2019-09-10 07:13:12,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:13:12,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:12,741 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:13:12,747 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:12,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:12,747 INFO L82 PathProgramCache]: Analyzing trace with hash 194818221, now seen corresponding path program 1 times [2019-09-10 07:13:12,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:12,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:12,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:12,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:12,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:12,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:12,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:12,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:13:12,905 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:12,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:13:12,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:13:12,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:13:12,907 INFO L87 Difference]: Start difference. First operand 12537 states and 19416 transitions. Second operand 7 states. [2019-09-10 07:13:13,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:13,308 INFO L93 Difference]: Finished difference Result 51163 states and 78837 transitions. [2019-09-10 07:13:13,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:13:13,309 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-09-10 07:13:13,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:13,447 INFO L225 Difference]: With dead ends: 51163 [2019-09-10 07:13:13,448 INFO L226 Difference]: Without dead ends: 51163 [2019-09-10 07:13:13,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:13:13,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51163 states. [2019-09-10 07:13:14,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51163 to 25033. [2019-09-10 07:13:14,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25033 states. [2019-09-10 07:13:14,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25033 states to 25033 states and 38312 transitions. [2019-09-10 07:13:14,749 INFO L78 Accepts]: Start accepts. Automaton has 25033 states and 38312 transitions. Word has length 70 [2019-09-10 07:13:14,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:14,749 INFO L475 AbstractCegarLoop]: Abstraction has 25033 states and 38312 transitions. [2019-09-10 07:13:14,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:13:14,749 INFO L276 IsEmpty]: Start isEmpty. Operand 25033 states and 38312 transitions. [2019-09-10 07:13:14,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:13:14,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:14,752 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:13:14,753 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:14,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:14,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1725864837, now seen corresponding path program 1 times [2019-09-10 07:13:14,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:14,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:14,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:14,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:14,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:14,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:14,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:14,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:13:14,847 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:14,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:13:14,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:13:14,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:13:14,848 INFO L87 Difference]: Start difference. First operand 25033 states and 38312 transitions. Second operand 5 states. [2019-09-10 07:13:15,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:15,018 INFO L93 Difference]: Finished difference Result 50985 states and 77064 transitions. [2019-09-10 07:13:15,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:13:15,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 07:13:15,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:15,239 INFO L225 Difference]: With dead ends: 50985 [2019-09-10 07:13:15,239 INFO L226 Difference]: Without dead ends: 50985 [2019-09-10 07:13:15,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:13:15,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50985 states. [2019-09-10 07:13:15,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50985 to 25993. [2019-09-10 07:13:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25993 states. [2019-09-10 07:13:15,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25993 states to 25993 states and 39272 transitions. [2019-09-10 07:13:15,805 INFO L78 Accepts]: Start accepts. Automaton has 25993 states and 39272 transitions. Word has length 71 [2019-09-10 07:13:15,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:15,806 INFO L475 AbstractCegarLoop]: Abstraction has 25993 states and 39272 transitions. [2019-09-10 07:13:15,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:13:15,806 INFO L276 IsEmpty]: Start isEmpty. Operand 25993 states and 39272 transitions. [2019-09-10 07:13:15,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:13:15,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:15,810 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:13:15,810 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:15,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:15,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1971822172, now seen corresponding path program 1 times [2019-09-10 07:13:15,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:15,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:15,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:15,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:15,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:15,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:15,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:15,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:13:15,895 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:15,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:13:15,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:13:15,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:13:15,897 INFO L87 Difference]: Start difference. First operand 25993 states and 39272 transitions. Second operand 3 states. [2019-09-10 07:13:16,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:16,446 INFO L93 Difference]: Finished difference Result 46467 states and 68737 transitions. [2019-09-10 07:13:16,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:13:16,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-10 07:13:16,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:16,528 INFO L225 Difference]: With dead ends: 46467 [2019-09-10 07:13:16,528 INFO L226 Difference]: Without dead ends: 46467 [2019-09-10 07:13:16,529 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 07:13:16,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46467 states. [2019-09-10 07:13:17,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46467 to 46033. [2019-09-10 07:13:17,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46033 states. [2019-09-10 07:13:17,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46033 states to 46033 states and 68304 transitions. [2019-09-10 07:13:17,211 INFO L78 Accepts]: Start accepts. Automaton has 46033 states and 68304 transitions. Word has length 72 [2019-09-10 07:13:17,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:17,211 INFO L475 AbstractCegarLoop]: Abstraction has 46033 states and 68304 transitions. [2019-09-10 07:13:17,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:13:17,211 INFO L276 IsEmpty]: Start isEmpty. Operand 46033 states and 68304 transitions. [2019-09-10 07:13:17,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:13:17,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:17,213 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:13:17,214 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:17,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:17,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1665482865, now seen corresponding path program 1 times [2019-09-10 07:13:17,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:17,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:17,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:17,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:17,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:17,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:17,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:17,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:13:17,264 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:17,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:13:17,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:13:17,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:13:17,265 INFO L87 Difference]: Start difference. First operand 46033 states and 68304 transitions. Second operand 3 states. [2019-09-10 07:13:17,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:17,461 INFO L93 Difference]: Finished difference Result 65749 states and 96979 transitions. [2019-09-10 07:13:17,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:13:17,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-10 07:13:17,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:17,552 INFO L225 Difference]: With dead ends: 65749 [2019-09-10 07:13:17,553 INFO L226 Difference]: Without dead ends: 65749 [2019-09-10 07:13:17,553 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 07:13:17,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65749 states. [2019-09-10 07:13:19,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65749 to 65747. [2019-09-10 07:13:19,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65747 states. [2019-09-10 07:13:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65747 states to 65747 states and 96978 transitions. [2019-09-10 07:13:19,284 INFO L78 Accepts]: Start accepts. Automaton has 65747 states and 96978 transitions. Word has length 72 [2019-09-10 07:13:19,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:19,285 INFO L475 AbstractCegarLoop]: Abstraction has 65747 states and 96978 transitions. [2019-09-10 07:13:19,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:13:19,285 INFO L276 IsEmpty]: Start isEmpty. Operand 65747 states and 96978 transitions. [2019-09-10 07:13:19,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:13:19,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:19,301 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:13:19,301 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:19,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:19,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1046922902, now seen corresponding path program 1 times [2019-09-10 07:13:19,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:19,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:19,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:19,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:19,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:19,402 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:19,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:13:19,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:13:19,404 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2019-09-10 07:13:19,406 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [101], [122], [125], [128], [131], [136], [138], [141], [152], [154], [157], [168], [170], [173], [184], [186], [189], [192], [194], [197], [198], [200], [209], [220], [222], [235], [243], [262], [273], [275], [288], [296], [315], [326], [328], [341], [349], [368], [370], [373], [381], [384], [387], [390], [392], [394], [436], [449], [457], [493], [494], [498], [499], [500] [2019-09-10 07:13:19,446 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:13:19,446 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:13:19,566 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:13:19,865 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:13:19,868 INFO L272 AbstractInterpreter]: Visited 83 different actions 219 times. Merged at 41 different actions 113 times. Widened at 4 different actions 7 times. Performed 838 root evaluator evaluations with a maximum evaluation depth of 6. Performed 838 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 14 fixpoints after 4 different actions. Largest state had 142 variables. [2019-09-10 07:13:19,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:19,873 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:13:20,386 INFO L227 lantSequenceWeakener]: Weakened 64 states. On average, predicates are now at 81.76% of their original sizes. [2019-09-10 07:13:20,386 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:13:23,397 INFO L420 sIntCurrentIteration]: We unified 97 AI predicates to 97 [2019-09-10 07:13:23,398 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:13:23,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:13:23,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [50] imperfect sequences [7] total 55 [2019-09-10 07:13:23,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:23,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-10 07:13:23,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-10 07:13:23,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2157, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 07:13:23,401 INFO L87 Difference]: Start difference. First operand 65747 states and 96978 transitions. Second operand 50 states. [2019-09-10 07:14:39,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:39,667 INFO L93 Difference]: Finished difference Result 237941 states and 336290 transitions. [2019-09-10 07:14:39,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 461 states. [2019-09-10 07:14:39,668 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-09-10 07:14:39,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:40,251 INFO L225 Difference]: With dead ends: 237941 [2019-09-10 07:14:40,251 INFO L226 Difference]: Without dead ends: 237941 [2019-09-10 07:14:40,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 476 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103108 ImplicationChecksByTransitivity, 26.4s TimeCoverageRelationStatistics Valid=23750, Invalid=204256, Unknown=0, NotChecked=0, Total=228006 [2019-09-10 07:14:40,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237941 states. [2019-09-10 07:14:44,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237941 to 105994. [2019-09-10 07:14:44,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105994 states. [2019-09-10 07:14:44,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105994 states to 105994 states and 153241 transitions. [2019-09-10 07:14:44,331 INFO L78 Accepts]: Start accepts. Automaton has 105994 states and 153241 transitions. Word has length 98 [2019-09-10 07:14:44,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:44,332 INFO L475 AbstractCegarLoop]: Abstraction has 105994 states and 153241 transitions. [2019-09-10 07:14:44,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-10 07:14:44,332 INFO L276 IsEmpty]: Start isEmpty. Operand 105994 states and 153241 transitions. [2019-09-10 07:14:44,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:14:44,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:44,367 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:14:44,368 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:44,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:44,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1236166574, now seen corresponding path program 1 times [2019-09-10 07:14:44,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:44,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:44,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:44,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:44,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:44,447 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:44,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:44,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:44,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:44,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:44,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:44,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:44,449 INFO L87 Difference]: Start difference. First operand 105994 states and 153241 transitions. Second operand 3 states. [2019-09-10 07:14:44,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:44,758 INFO L93 Difference]: Finished difference Result 149535 states and 213789 transitions. [2019-09-10 07:14:44,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:44,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 07:14:44,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:44,927 INFO L225 Difference]: With dead ends: 149535 [2019-09-10 07:14:44,927 INFO L226 Difference]: Without dead ends: 149535 [2019-09-10 07:14:44,928 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 07:14:45,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149535 states. [2019-09-10 07:14:48,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149535 to 143366. [2019-09-10 07:14:48,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143366 states. [2019-09-10 07:14:48,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143366 states to 143366 states and 205527 transitions. [2019-09-10 07:14:48,854 INFO L78 Accepts]: Start accepts. Automaton has 143366 states and 205527 transitions. Word has length 98 [2019-09-10 07:14:48,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:48,854 INFO L475 AbstractCegarLoop]: Abstraction has 143366 states and 205527 transitions. [2019-09-10 07:14:48,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:48,854 INFO L276 IsEmpty]: Start isEmpty. Operand 143366 states and 205527 transitions. [2019-09-10 07:14:48,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:14:48,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:48,886 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:14:48,887 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:48,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:48,887 INFO L82 PathProgramCache]: Analyzing trace with hash 341981923, now seen corresponding path program 1 times [2019-09-10 07:14:48,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:48,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:48,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:48,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:48,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:48,988 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:48,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:14:48,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:14:48,989 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2019-09-10 07:14:48,991 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [101], [122], [125], [136], [138], [141], [144], [147], [152], [154], [157], [168], [170], [173], [184], [186], [189], [192], [194], [197], [198], [200], [209], [220], [222], [235], [243], [262], [273], [275], [288], [296], [315], [317], [320], [328], [331], [334], [337], [339], [341], [379], [381], [394], [402], [421], [436], [449], [457], [493], [494], [498], [499], [500] [2019-09-10 07:14:49,002 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:14:49,004 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:14:49,029 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:14:49,165 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:14:49,166 INFO L272 AbstractInterpreter]: Visited 83 different actions 229 times. Merged at 41 different actions 123 times. Widened at 1 different actions 1 times. Performed 896 root evaluator evaluations with a maximum evaluation depth of 6. Performed 896 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 13 fixpoints after 4 different actions. Largest state had 142 variables. [2019-09-10 07:14:49,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:49,167 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:14:49,333 INFO L227 lantSequenceWeakener]: Weakened 64 states. On average, predicates are now at 81.85% of their original sizes. [2019-09-10 07:14:49,333 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:14:52,757 INFO L420 sIntCurrentIteration]: We unified 97 AI predicates to 97 [2019-09-10 07:14:52,757 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:14:52,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:14:52,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [50] imperfect sequences [7] total 55 [2019-09-10 07:14:52,758 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:52,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-10 07:14:52,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-10 07:14:52,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=2158, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 07:14:52,759 INFO L87 Difference]: Start difference. First operand 143366 states and 205527 transitions. Second operand 50 states. [2019-09-10 07:16:10,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:10,405 INFO L93 Difference]: Finished difference Result 431191 states and 601783 transitions. [2019-09-10 07:16:10,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 485 states. [2019-09-10 07:16:10,405 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-09-10 07:16:10,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:11,049 INFO L225 Difference]: With dead ends: 431191 [2019-09-10 07:16:11,049 INFO L226 Difference]: Without dead ends: 431191 [2019-09-10 07:16:11,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 499 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114803 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=24227, Invalid=226273, Unknown=0, NotChecked=0, Total=250500 [2019-09-10 07:16:11,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431191 states. [2019-09-10 07:16:15,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431191 to 195608. [2019-09-10 07:16:15,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195608 states. [2019-09-10 07:16:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195608 states to 195608 states and 277585 transitions. [2019-09-10 07:16:16,085 INFO L78 Accepts]: Start accepts. Automaton has 195608 states and 277585 transitions. Word has length 98 [2019-09-10 07:16:16,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:16,085 INFO L475 AbstractCegarLoop]: Abstraction has 195608 states and 277585 transitions. [2019-09-10 07:16:16,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-10 07:16:16,085 INFO L276 IsEmpty]: Start isEmpty. Operand 195608 states and 277585 transitions. [2019-09-10 07:16:16,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:16:16,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:16,117 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:16:16,117 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:16,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:16,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1740883167, now seen corresponding path program 1 times [2019-09-10 07:16:16,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:16,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:16,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:16,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:16,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:16,179 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:16,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:16,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:16,180 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:16,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:16,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:16,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:16,181 INFO L87 Difference]: Start difference. First operand 195608 states and 277585 transitions. Second operand 3 states. [2019-09-10 07:16:16,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:16,886 INFO L93 Difference]: Finished difference Result 255571 states and 358713 transitions. [2019-09-10 07:16:16,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:16,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 07:16:16,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:17,201 INFO L225 Difference]: With dead ends: 255571 [2019-09-10 07:16:17,201 INFO L226 Difference]: Without dead ends: 255571 [2019-09-10 07:16:17,201 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 07:16:17,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255571 states. [2019-09-10 07:16:23,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255571 to 246814. [2019-09-10 07:16:23,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246814 states. [2019-09-10 07:16:24,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246814 states to 246814 states and 347237 transitions. [2019-09-10 07:16:24,198 INFO L78 Accepts]: Start accepts. Automaton has 246814 states and 347237 transitions. Word has length 98 [2019-09-10 07:16:24,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:24,198 INFO L475 AbstractCegarLoop]: Abstraction has 246814 states and 347237 transitions. [2019-09-10 07:16:24,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:24,198 INFO L276 IsEmpty]: Start isEmpty. Operand 246814 states and 347237 transitions. [2019-09-10 07:16:24,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:16:24,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:24,228 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:16:24,229 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:24,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:24,229 INFO L82 PathProgramCache]: Analyzing trace with hash 262432318, now seen corresponding path program 1 times [2019-09-10 07:16:24,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:24,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:24,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:24,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:24,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:24,316 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:24,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:16:24,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:16:24,317 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2019-09-10 07:16:24,318 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [101], [122], [125], [136], [138], [141], [152], [154], [157], [160], [163], [168], [170], [173], [184], [186], [189], [192], [194], [197], [198], [200], [209], [220], [222], [235], [243], [262], [264], [267], [275], [278], [281], [284], [286], [288], [326], [328], [341], [349], [368], [379], [381], [394], [402], [421], [436], [449], [457], [493], [494], [498], [499], [500] [2019-09-10 07:16:24,321 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:16:24,322 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:16:24,345 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:16:24,464 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:16:24,464 INFO L272 AbstractInterpreter]: Visited 83 different actions 220 times. Merged at 41 different actions 116 times. Widened at 1 different actions 1 times. Performed 828 root evaluator evaluations with a maximum evaluation depth of 6. Performed 828 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 12 fixpoints after 6 different actions. Largest state had 142 variables. [2019-09-10 07:16:24,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:24,465 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:16:24,609 INFO L227 lantSequenceWeakener]: Weakened 64 states. On average, predicates are now at 81.94% of their original sizes. [2019-09-10 07:16:24,610 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:16:27,291 INFO L420 sIntCurrentIteration]: We unified 97 AI predicates to 97 [2019-09-10 07:16:27,291 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:16:27,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:16:27,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [50] imperfect sequences [7] total 55 [2019-09-10 07:16:27,292 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:27,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-10 07:16:27,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-10 07:16:27,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=2155, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 07:16:27,293 INFO L87 Difference]: Start difference. First operand 246814 states and 347237 transitions. Second operand 50 states. [2019-09-10 07:17:26,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:26,007 INFO L93 Difference]: Finished difference Result 540906 states and 750274 transitions. [2019-09-10 07:17:26,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 405 states. [2019-09-10 07:17:26,007 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-09-10 07:17:26,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:27,222 INFO L225 Difference]: With dead ends: 540906 [2019-09-10 07:17:27,223 INFO L226 Difference]: Without dead ends: 540906 [2019-09-10 07:17:27,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 419 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79649 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=17427, Invalid=159393, Unknown=0, NotChecked=0, Total=176820 [2019-09-10 07:17:27,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540906 states. [2019-09-10 07:17:31,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540906 to 268031. [2019-09-10 07:17:31,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268031 states. [2019-09-10 07:17:32,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268031 states to 268031 states and 375800 transitions. [2019-09-10 07:17:32,427 INFO L78 Accepts]: Start accepts. Automaton has 268031 states and 375800 transitions. Word has length 98 [2019-09-10 07:17:32,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:32,428 INFO L475 AbstractCegarLoop]: Abstraction has 268031 states and 375800 transitions. [2019-09-10 07:17:32,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-10 07:17:32,428 INFO L276 IsEmpty]: Start isEmpty. Operand 268031 states and 375800 transitions. [2019-09-10 07:17:32,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:17:32,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:32,460 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:17:32,460 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:32,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:32,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1435059202, now seen corresponding path program 1 times [2019-09-10 07:17:32,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:32,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:32,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:32,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:32,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:17:32,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:32,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:17:32,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:32,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:17:32,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:17:32,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:32,541 INFO L87 Difference]: Start difference. First operand 268031 states and 375800 transitions. Second operand 3 states. [2019-09-10 07:17:33,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:33,412 INFO L93 Difference]: Finished difference Result 337961 states and 467942 transitions. [2019-09-10 07:17:33,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:17:33,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 07:17:33,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:33,892 INFO L225 Difference]: With dead ends: 337961 [2019-09-10 07:17:33,893 INFO L226 Difference]: Without dead ends: 337961 [2019-09-10 07:17:33,893 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 07:17:34,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337961 states. [2019-09-10 07:17:42,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337961 to 323035. [2019-09-10 07:17:42,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323035 states. [2019-09-10 07:17:42,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323035 states to 323035 states and 448629 transitions. [2019-09-10 07:17:42,751 INFO L78 Accepts]: Start accepts. Automaton has 323035 states and 448629 transitions. Word has length 98 [2019-09-10 07:17:42,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:42,752 INFO L475 AbstractCegarLoop]: Abstraction has 323035 states and 448629 transitions. [2019-09-10 07:17:42,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:17:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand 323035 states and 448629 transitions. [2019-09-10 07:17:42,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:17:42,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:42,794 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:17:42,794 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:42,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:42,795 INFO L82 PathProgramCache]: Analyzing trace with hash 948223371, now seen corresponding path program 1 times [2019-09-10 07:17:42,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:42,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:42,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:42,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:42,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:42,917 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:17:42,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:17:42,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:17:42,918 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2019-09-10 07:17:42,919 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [101], [122], [125], [136], [138], [141], [152], [154], [157], [168], [170], [173], [176], [179], [184], [186], [189], [192], [194], [197], [198], [200], [209], [211], [214], [222], [225], [228], [231], [233], [235], [273], [275], [288], [296], [315], [326], [328], [341], [349], [368], [379], [381], [394], [402], [421], [436], [449], [457], [493], [494], [498], [499], [500] [2019-09-10 07:17:42,922 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:17:42,923 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:17:42,935 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:17:43,001 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:17:43,001 INFO L272 AbstractInterpreter]: Visited 83 different actions 263 times. Merged at 41 different actions 154 times. Never widened. Performed 964 root evaluator evaluations with a maximum evaluation depth of 6. Performed 964 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 13 fixpoints after 4 different actions. Largest state had 142 variables. [2019-09-10 07:17:43,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:43,002 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:17:43,075 INFO L227 lantSequenceWeakener]: Weakened 64 states. On average, predicates are now at 82.03% of their original sizes. [2019-09-10 07:17:43,076 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:17:50,169 INFO L420 sIntCurrentIteration]: We unified 97 AI predicates to 97 [2019-09-10 07:17:50,169 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:17:50,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:17:50,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [50] imperfect sequences [7] total 55 [2019-09-10 07:17:50,170 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:50,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-10 07:17:50,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-10 07:17:50,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=2150, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 07:17:50,171 INFO L87 Difference]: Start difference. First operand 323035 states and 448629 transitions. Second operand 50 states. [2019-09-10 07:18:54,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:54,275 INFO L93 Difference]: Finished difference Result 645956 states and 889169 transitions. [2019-09-10 07:18:54,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 297 states. [2019-09-10 07:18:54,275 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-09-10 07:18:54,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:55,108 INFO L225 Difference]: With dead ends: 645956 [2019-09-10 07:18:55,109 INFO L226 Difference]: Without dead ends: 645956 [2019-09-10 07:18:55,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41603 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=11374, Invalid=85036, Unknown=0, NotChecked=0, Total=96410 [2019-09-10 07:18:55,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645956 states. [2019-09-10 07:19:01,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645956 to 334409. [2019-09-10 07:19:01,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334409 states. [2019-09-10 07:19:01,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334409 states to 334409 states and 463182 transitions. [2019-09-10 07:19:01,894 INFO L78 Accepts]: Start accepts. Automaton has 334409 states and 463182 transitions. Word has length 98 [2019-09-10 07:19:01,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:01,894 INFO L475 AbstractCegarLoop]: Abstraction has 334409 states and 463182 transitions. [2019-09-10 07:19:01,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-10 07:19:01,894 INFO L276 IsEmpty]: Start isEmpty. Operand 334409 states and 463182 transitions. [2019-09-10 07:19:01,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:19:01,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:01,926 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:19:01,926 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:01,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:01,926 INFO L82 PathProgramCache]: Analyzing trace with hash 2025578436, now seen corresponding path program 1 times [2019-09-10 07:19:01,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:01,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:01,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:01,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:01,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:19:01,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:01,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:19:01,990 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:01,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:19:01,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:19:01,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:19:01,991 INFO L87 Difference]: Start difference. First operand 334409 states and 463182 transitions. Second operand 3 states. [2019-09-10 07:19:04,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:04,872 INFO L93 Difference]: Finished difference Result 530505 states and 730764 transitions. [2019-09-10 07:19:04,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:19:04,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:19:04,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:05,609 INFO L225 Difference]: With dead ends: 530505 [2019-09-10 07:19:05,609 INFO L226 Difference]: Without dead ends: 530505 [2019-09-10 07:19:05,610 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 07:19:05,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530505 states. [2019-09-10 07:19:17,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530505 to 519399. [2019-09-10 07:19:17,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519399 states. [2019-09-10 07:19:18,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519399 states to 519399 states and 717171 transitions. [2019-09-10 07:19:18,696 INFO L78 Accepts]: Start accepts. Automaton has 519399 states and 717171 transitions. Word has length 99 [2019-09-10 07:19:18,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:18,696 INFO L475 AbstractCegarLoop]: Abstraction has 519399 states and 717171 transitions. [2019-09-10 07:19:18,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:19:18,696 INFO L276 IsEmpty]: Start isEmpty. Operand 519399 states and 717171 transitions. [2019-09-10 07:19:18,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:19:18,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:18,742 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:19:18,742 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:18,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:18,742 INFO L82 PathProgramCache]: Analyzing trace with hash 64456435, now seen corresponding path program 1 times [2019-09-10 07:19:18,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:18,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:18,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:18,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:18,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:18,980 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:19:18,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:19:18,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:19:18,981 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 07:19:18,983 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [101], [104], [109], [120], [122], [125], [136], [138], [141], [152], [154], [157], [168], [170], [173], [184], [186], [189], [192], [194], [197], [198], [200], [202], [207], [220], [222], [235], [243], [262], [273], [275], [288], [296], [315], [326], [328], [341], [349], [368], [379], [381], [384], [387], [390], [392], [394], [432], [434], [436], [449], [457], [493], [494], [498], [499], [500] [2019-09-10 07:19:18,986 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:19:18,986 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:19:18,998 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:19:19,146 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:19:19,147 INFO L272 AbstractInterpreter]: Visited 91 different actions 517 times. Merged at 52 different actions 371 times. Widened at 17 different actions 38 times. Performed 1706 root evaluator evaluations with a maximum evaluation depth of 7. Performed 1706 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 59 fixpoints after 18 different actions. Largest state had 142 variables. [2019-09-10 07:19:19,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:19,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:19:19,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:19:19,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:19:19,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:19,173 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:19:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:19,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 07:19:19,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:19:19,431 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:19:19,431 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:19:19,512 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:19:19,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:19:19,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4] total 14 [2019-09-10 07:19:19,524 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:19:19,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:19:19,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:19:19,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:19:19,526 INFO L87 Difference]: Start difference. First operand 519399 states and 717171 transitions. Second operand 12 states. [2019-09-10 07:20:01,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:20:01,802 INFO L93 Difference]: Finished difference Result 3846221 states and 5254942 transitions. [2019-09-10 07:20:01,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-10 07:20:01,802 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2019-09-10 07:20:01,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:20:22,046 INFO L225 Difference]: With dead ends: 3846221 [2019-09-10 07:20:22,046 INFO L226 Difference]: Without dead ends: 3846221 [2019-09-10 07:20:22,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7286 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=2585, Invalid=14971, Unknown=0, NotChecked=0, Total=17556 [2019-09-10 07:20:24,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3846221 states. [2019-09-10 07:21:15,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3846221 to 1045863. [2019-09-10 07:21:15,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1045863 states. [2019-09-10 07:21:18,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045863 states to 1045863 states and 1435532 transitions. [2019-09-10 07:21:18,934 INFO L78 Accepts]: Start accepts. Automaton has 1045863 states and 1435532 transitions. Word has length 99 [2019-09-10 07:21:18,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:18,934 INFO L475 AbstractCegarLoop]: Abstraction has 1045863 states and 1435532 transitions. [2019-09-10 07:21:18,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:21:18,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1045863 states and 1435532 transitions. [2019-09-10 07:21:18,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:21:18,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:18,986 INFO L399 BasicCegarLoop]: trace histogram [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 07:21:18,986 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:18,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:18,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1184334863, now seen corresponding path program 1 times [2019-09-10 07:21:18,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:18,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:18,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:18,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:18,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:19,063 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:21:19,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:19,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:21:19,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:19,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:21:19,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:21:19,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:21:19,065 INFO L87 Difference]: Start difference. First operand 1045863 states and 1435532 transitions. Second operand 3 states. [2019-09-10 07:21:22,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:22,473 INFO L93 Difference]: Finished difference Result 657301 states and 894355 transitions. [2019-09-10 07:21:22,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:21:22,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 07:21:22,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:23,255 INFO L225 Difference]: With dead ends: 657301 [2019-09-10 07:21:23,255 INFO L226 Difference]: Without dead ends: 657301 [2019-09-10 07:21:23,256 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 07:21:23,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657301 states. [2019-09-10 07:21:41,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657301 to 656858. [2019-09-10 07:21:41,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656858 states. [2019-09-10 07:21:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656858 states to 656858 states and 893831 transitions. [2019-09-10 07:21:42,504 INFO L78 Accepts]: Start accepts. Automaton has 656858 states and 893831 transitions. Word has length 100 [2019-09-10 07:21:42,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:42,505 INFO L475 AbstractCegarLoop]: Abstraction has 656858 states and 893831 transitions. [2019-09-10 07:21:42,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:21:42,505 INFO L276 IsEmpty]: Start isEmpty. Operand 656858 states and 893831 transitions. [2019-09-10 07:21:42,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:21:42,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:42,533 INFO L399 BasicCegarLoop]: trace histogram [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 07:21:42,533 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:42,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:42,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1792128130, now seen corresponding path program 1 times [2019-09-10 07:21:42,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:42,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:42,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:42,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:42,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:42,598 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:21:42,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:42,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:21:42,598 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:42,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:21:42,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:21:42,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:21:42,599 INFO L87 Difference]: Start difference. First operand 656858 states and 893831 transitions. Second operand 3 states. [2019-09-10 07:21:50,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:50,733 INFO L93 Difference]: Finished difference Result 631966 states and 853158 transitions. [2019-09-10 07:21:50,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:21:50,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 07:21:50,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:51,603 INFO L225 Difference]: With dead ends: 631966 [2019-09-10 07:21:51,604 INFO L226 Difference]: Without dead ends: 631966 [2019-09-10 07:21:51,604 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 07:21:52,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631966 states. [2019-09-10 07:21:59,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631966 to 631964. [2019-09-10 07:21:59,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631964 states. [2019-09-10 07:22:10,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631964 states to 631964 states and 853157 transitions. [2019-09-10 07:22:10,007 INFO L78 Accepts]: Start accepts. Automaton has 631964 states and 853157 transitions. Word has length 100 [2019-09-10 07:22:10,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:10,007 INFO L475 AbstractCegarLoop]: Abstraction has 631964 states and 853157 transitions. [2019-09-10 07:22:10,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:22:10,007 INFO L276 IsEmpty]: Start isEmpty. Operand 631964 states and 853157 transitions. [2019-09-10 07:22:10,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:22:10,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:10,028 INFO L399 BasicCegarLoop]: trace histogram [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 07:22:10,028 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:10,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:10,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1653723994, now seen corresponding path program 1 times [2019-09-10 07:22:10,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:10,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:10,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:10,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:10,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:22:10,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:10,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:22:10,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:10,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:22:10,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:22:10,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:22:10,096 INFO L87 Difference]: Start difference. First operand 631964 states and 853157 transitions. Second operand 3 states. [2019-09-10 07:22:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:13,168 INFO L93 Difference]: Finished difference Result 715500 states and 949284 transitions. [2019-09-10 07:22:13,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:22:13,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 07:22:13,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:14,214 INFO L225 Difference]: With dead ends: 715500 [2019-09-10 07:22:14,214 INFO L226 Difference]: Without dead ends: 644156 [2019-09-10 07:22:14,215 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 07:22:14,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644156 states. [2019-09-10 07:22:28,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644156 to 605980. [2019-09-10 07:22:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605980 states. [2019-09-10 07:22:30,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605980 states to 605980 states and 807533 transitions. [2019-09-10 07:22:30,357 INFO L78 Accepts]: Start accepts. Automaton has 605980 states and 807533 transitions. Word has length 100 [2019-09-10 07:22:30,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:30,357 INFO L475 AbstractCegarLoop]: Abstraction has 605980 states and 807533 transitions. [2019-09-10 07:22:30,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:22:30,358 INFO L276 IsEmpty]: Start isEmpty. Operand 605980 states and 807533 transitions. [2019-09-10 07:22:30,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:22:30,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:30,380 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:22:30,380 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:30,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:30,380 INFO L82 PathProgramCache]: Analyzing trace with hash -619404229, now seen corresponding path program 1 times [2019-09-10 07:22:30,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:30,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:30,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:30,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:30,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 07:22:30,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:30,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:22:30,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:30,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:22:30,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:22:30,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:22:30,450 INFO L87 Difference]: Start difference. First operand 605980 states and 807533 transitions. Second operand 5 states. [2019-09-10 07:22:34,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:34,490 INFO L93 Difference]: Finished difference Result 926006 states and 1225559 transitions. [2019-09-10 07:22:34,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:22:34,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-10 07:22:34,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:35,715 INFO L225 Difference]: With dead ends: 926006 [2019-09-10 07:22:35,715 INFO L226 Difference]: Without dead ends: 926006 [2019-09-10 07:22:35,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:22:36,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926006 states. [2019-09-10 07:22:53,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926006 to 605314. [2019-09-10 07:22:53,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605314 states. [2019-09-10 07:22:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605314 states to 605314 states and 803419 transitions. [2019-09-10 07:22:55,144 INFO L78 Accepts]: Start accepts. Automaton has 605314 states and 803419 transitions. Word has length 101 [2019-09-10 07:22:55,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:55,145 INFO L475 AbstractCegarLoop]: Abstraction has 605314 states and 803419 transitions. [2019-09-10 07:22:55,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:22:55,145 INFO L276 IsEmpty]: Start isEmpty. Operand 605314 states and 803419 transitions. [2019-09-10 07:22:55,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:22:55,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:55,165 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:22:55,165 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:55,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:55,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1703901834, now seen corresponding path program 1 times [2019-09-10 07:22:55,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:55,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:55,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:55,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:55,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:55,264 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:22:55,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:22:55,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:22:55,265 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 102 with the following transitions: [2019-09-10 07:22:55,265 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [101], [104], [109], [112], [115], [120], [122], [125], [136], [138], [141], [152], [154], [157], [168], [170], [173], [184], [186], [189], [192], [194], [197], [198], [200], [209], [220], [222], [235], [243], [262], [273], [275], [288], [296], [315], [326], [328], [341], [349], [368], [379], [381], [394], [402], [421], [423], [426], [434], [436], [439], [442], [445], [447], [449], [493], [494], [498], [499], [500] [2019-09-10 07:22:55,269 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:22:55,269 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:22:55,284 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:22:55,370 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:22:55,371 INFO L272 AbstractInterpreter]: Visited 89 different actions 293 times. Merged at 47 different actions 170 times. Widened at 4 different actions 7 times. Performed 1085 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1085 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 22 fixpoints after 6 different actions. Largest state had 142 variables. [2019-09-10 07:22:55,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:55,371 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:22:55,478 INFO L227 lantSequenceWeakener]: Weakened 67 states. On average, predicates are now at 81% of their original sizes. [2019-09-10 07:22:55,479 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:23:05,157 INFO L420 sIntCurrentIteration]: We unified 100 AI predicates to 100 [2019-09-10 07:23:05,157 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:23:05,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:23:05,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [7] total 57 [2019-09-10 07:23:05,158 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:05,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-10 07:23:05,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-10 07:23:05,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=2349, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 07:23:05,159 INFO L87 Difference]: Start difference. First operand 605314 states and 803419 transitions. Second operand 52 states.