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_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:08:24,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:08:24,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:08:24,285 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:08:24,286 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:08:24,287 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:08:24,288 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:08:24,290 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:08:24,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:08:24,292 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:08:24,293 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:08:24,295 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:08:24,295 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:08:24,296 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:08:24,297 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:08:24,298 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:08:24,299 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:08:24,299 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:08:24,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:08:24,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:08:24,305 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:08:24,307 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:08:24,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:08:24,309 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:08:24,311 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:08:24,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:08:24,312 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:08:24,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:08:24,313 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:08:24,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:08:24,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:08:24,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:08:24,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:08:24,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:08:24,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:08:24,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:08:24,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:08:24,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:08:24,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:08:24,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:08:24,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:08:24,323 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 06:08:24,354 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:08:24,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:08:24,358 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:08:24,358 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:08:24,359 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:08:24,359 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:08:24,360 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:08:24,360 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:08:24,360 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:08:24,360 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:08:24,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:08:24,361 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:08:24,362 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:08:24,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:08:24,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:08:24,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:08:24,364 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:08:24,364 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:08:24,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:08:24,365 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:08:24,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:08:24,365 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:08:24,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:08:24,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:08:24,366 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:08:24,366 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:08:24,367 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:08:24,367 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:08:24,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:08:24,367 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:08:24,409 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:08:24,422 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:08:24,426 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:08:24,428 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:08:24,428 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:08:24,429 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 06:08:24,511 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/892c83db4/d8fb020d6d3c4508a285354d371662b7/FLAG569f19326 [2019-09-10 06:08:25,070 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:08:25,071 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 06:08:25,083 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/892c83db4/d8fb020d6d3c4508a285354d371662b7/FLAG569f19326 [2019-09-10 06:08:25,431 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/892c83db4/d8fb020d6d3c4508a285354d371662b7 [2019-09-10 06:08:25,442 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:08:25,443 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:08:25,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:08:25,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:08:25,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:08:25,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:08:25" (1/1) ... [2019-09-10 06:08:25,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2671cfd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:08:25, skipping insertion in model container [2019-09-10 06:08:25,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:08:25" (1/1) ... [2019-09-10 06:08:25,460 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:08:25,515 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:08:25,899 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:08:25,916 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:08:25,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:08:26,040 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:08:26,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:08:26 WrapperNode [2019-09-10 06:08:26,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:08:26,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:08:26,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:08:26,042 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:08:26,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:08:26" (1/1) ... [2019-09-10 06:08:26,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:08:26" (1/1) ... [2019-09-10 06:08:26,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:08:26" (1/1) ... [2019-09-10 06:08:26,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:08:26" (1/1) ... [2019-09-10 06:08:26,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:08:26" (1/1) ... [2019-09-10 06:08:26,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:08:26" (1/1) ... [2019-09-10 06:08:26,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:08:26" (1/1) ... [2019-09-10 06:08:26,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:08:26,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:08:26,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:08:26,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:08:26,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:08:26" (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 06:08:26,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:08:26,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:08:26,173 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:08:26,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:08:26,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:08:26,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:08:26,174 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:08:26,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:08:26,174 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:08:26,174 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:08:26,174 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:08:26,174 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:08:26,175 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:08:26,175 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:08:26,175 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:08:26,175 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:08:26,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:08:26,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:08:27,030 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:08:27,030 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:08:27,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:08:27 BoogieIcfgContainer [2019-09-10 06:08:27,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:08:27,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:08:27,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:08:27,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:08:27,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:08:25" (1/3) ... [2019-09-10 06:08:27,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116c295e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:08:27, skipping insertion in model container [2019-09-10 06:08:27,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:08:26" (2/3) ... [2019-09-10 06:08:27,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116c295e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:08:27, skipping insertion in model container [2019-09-10 06:08:27,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:08:27" (3/3) ... [2019-09-10 06:08:27,040 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 06:08:27,049 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:08:27,058 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:08:27,076 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:08:27,102 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:08:27,102 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:08:27,103 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:08:27,103 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:08:27,103 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:08:27,103 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:08:27,103 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:08:27,103 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:08:27,129 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-09-10 06:08:27,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:08:27,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:27,145 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] [2019-09-10 06:08:27,148 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:27,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:27,153 INFO L82 PathProgramCache]: Analyzing trace with hash 8502252, now seen corresponding path program 1 times [2019-09-10 06:08:27,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:27,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:27,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:27,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:27,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:27,647 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 06:08:27,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:27,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:08:27,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:27,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:08:27,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:08:27,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:08:27,675 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-09-10 06:08:27,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:27,825 INFO L93 Difference]: Finished difference Result 203 states and 338 transitions. [2019-09-10 06:08:27,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:08:27,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-10 06:08:27,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:27,852 INFO L225 Difference]: With dead ends: 203 [2019-09-10 06:08:27,852 INFO L226 Difference]: Without dead ends: 195 [2019-09-10 06:08:27,857 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 06:08:27,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-10 06:08:27,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2019-09-10 06:08:27,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-10 06:08:27,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 301 transitions. [2019-09-10 06:08:27,930 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 301 transitions. Word has length 61 [2019-09-10 06:08:27,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:27,931 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 301 transitions. [2019-09-10 06:08:27,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:08:27,931 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 301 transitions. [2019-09-10 06:08:27,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 06:08:27,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:27,935 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] [2019-09-10 06:08:27,935 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:27,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:27,937 INFO L82 PathProgramCache]: Analyzing trace with hash -851487175, now seen corresponding path program 1 times [2019-09-10 06:08:27,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:27,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:27,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:27,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:27,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:28,072 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 06:08:28,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:28,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:08:28,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:28,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:08:28,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:08:28,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:08:28,076 INFO L87 Difference]: Start difference. First operand 193 states and 301 transitions. Second operand 3 states. [2019-09-10 06:08:28,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:28,109 INFO L93 Difference]: Finished difference Result 314 states and 498 transitions. [2019-09-10 06:08:28,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:08:28,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-10 06:08:28,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:28,113 INFO L225 Difference]: With dead ends: 314 [2019-09-10 06:08:28,113 INFO L226 Difference]: Without dead ends: 314 [2019-09-10 06:08:28,114 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 06:08:28,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-10 06:08:28,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2019-09-10 06:08:28,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-09-10 06:08:28,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 497 transitions. [2019-09-10 06:08:28,154 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 497 transitions. Word has length 63 [2019-09-10 06:08:28,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:28,155 INFO L475 AbstractCegarLoop]: Abstraction has 312 states and 497 transitions. [2019-09-10 06:08:28,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:08:28,155 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 497 transitions. [2019-09-10 06:08:28,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 06:08:28,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:28,160 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 06:08:28,160 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:28,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:28,161 INFO L82 PathProgramCache]: Analyzing trace with hash 812724513, now seen corresponding path program 1 times [2019-09-10 06:08:28,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:28,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:28,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:28,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:28,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:28,329 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 06:08:28,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:28,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:08:28,331 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:28,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:08:28,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:08:28,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:08:28,332 INFO L87 Difference]: Start difference. First operand 312 states and 497 transitions. Second operand 3 states. [2019-09-10 06:08:28,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:28,372 INFO L93 Difference]: Finished difference Result 432 states and 692 transitions. [2019-09-10 06:08:28,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:08:28,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-10 06:08:28,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:28,381 INFO L225 Difference]: With dead ends: 432 [2019-09-10 06:08:28,381 INFO L226 Difference]: Without dead ends: 432 [2019-09-10 06:08:28,381 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 06:08:28,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-09-10 06:08:28,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 430. [2019-09-10 06:08:28,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-10 06:08:28,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 691 transitions. [2019-09-10 06:08:28,416 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 691 transitions. Word has length 65 [2019-09-10 06:08:28,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:28,417 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 691 transitions. [2019-09-10 06:08:28,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:08:28,417 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 691 transitions. [2019-09-10 06:08:28,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 06:08:28,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:28,420 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 06:08:28,420 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:28,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:28,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1750058316, now seen corresponding path program 1 times [2019-09-10 06:08:28,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:28,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:28,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:28,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:28,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:28,501 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 06:08:28,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:28,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:08:28,502 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:28,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:08:28,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:08:28,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:08:28,503 INFO L87 Difference]: Start difference. First operand 430 states and 691 transitions. Second operand 3 states. [2019-09-10 06:08:28,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:28,532 INFO L93 Difference]: Finished difference Result 737 states and 1186 transitions. [2019-09-10 06:08:28,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:08:28,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-10 06:08:28,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:28,537 INFO L225 Difference]: With dead ends: 737 [2019-09-10 06:08:28,537 INFO L226 Difference]: Without dead ends: 737 [2019-09-10 06:08:28,538 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 06:08:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-09-10 06:08:28,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 735. [2019-09-10 06:08:28,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2019-09-10 06:08:28,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1185 transitions. [2019-09-10 06:08:28,558 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1185 transitions. Word has length 65 [2019-09-10 06:08:28,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:28,559 INFO L475 AbstractCegarLoop]: Abstraction has 735 states and 1185 transitions. [2019-09-10 06:08:28,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:08:28,559 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1185 transitions. [2019-09-10 06:08:28,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:08:28,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:28,561 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 06:08:28,562 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:28,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:28,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1895724377, now seen corresponding path program 1 times [2019-09-10 06:08:28,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:28,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:28,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:28,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:28,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:28,688 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 06:08:28,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:28,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:08:28,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:28,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:08:28,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:08:28,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:08:28,691 INFO L87 Difference]: Start difference. First operand 735 states and 1185 transitions. Second operand 5 states. [2019-09-10 06:08:28,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:28,859 INFO L93 Difference]: Finished difference Result 2158 states and 3515 transitions. [2019-09-10 06:08:28,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:08:28,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-09-10 06:08:28,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:28,872 INFO L225 Difference]: With dead ends: 2158 [2019-09-10 06:08:28,872 INFO L226 Difference]: Without dead ends: 2158 [2019-09-10 06:08:28,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:08:28,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2019-09-10 06:08:28,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 1724. [2019-09-10 06:08:28,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2019-09-10 06:08:28,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2804 transitions. [2019-09-10 06:08:28,927 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2804 transitions. Word has length 67 [2019-09-10 06:08:28,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:28,928 INFO L475 AbstractCegarLoop]: Abstraction has 1724 states and 2804 transitions. [2019-09-10 06:08:28,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:08:28,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2804 transitions. [2019-09-10 06:08:28,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:08:28,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:28,930 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 06:08:28,930 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:28,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:28,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1423696929, now seen corresponding path program 1 times [2019-09-10 06:08:28,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:28,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:28,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:28,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:28,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:29,041 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 06:08:29,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:29,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:08:29,042 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:29,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:08:29,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:08:29,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:08:29,043 INFO L87 Difference]: Start difference. First operand 1724 states and 2804 transitions. Second operand 6 states. [2019-09-10 06:08:29,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:29,254 INFO L93 Difference]: Finished difference Result 6144 states and 9916 transitions. [2019-09-10 06:08:29,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:08:29,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-09-10 06:08:29,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:29,288 INFO L225 Difference]: With dead ends: 6144 [2019-09-10 06:08:29,289 INFO L226 Difference]: Without dead ends: 6144 [2019-09-10 06:08:29,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:08:29,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6144 states. [2019-09-10 06:08:29,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6144 to 6075. [2019-09-10 06:08:29,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6075 states. [2019-09-10 06:08:29,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6075 states to 6075 states and 9815 transitions. [2019-09-10 06:08:29,498 INFO L78 Accepts]: Start accepts. Automaton has 6075 states and 9815 transitions. Word has length 68 [2019-09-10 06:08:29,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:29,498 INFO L475 AbstractCegarLoop]: Abstraction has 6075 states and 9815 transitions. [2019-09-10 06:08:29,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:08:29,499 INFO L276 IsEmpty]: Start isEmpty. Operand 6075 states and 9815 transitions. [2019-09-10 06:08:29,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:08:29,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:29,500 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 06:08:29,501 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:29,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:29,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1771341997, now seen corresponding path program 1 times [2019-09-10 06:08:29,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:29,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:29,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:29,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:29,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:29,590 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 06:08:29,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:29,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:08:29,591 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:29,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:08:29,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:08:29,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:08:29,593 INFO L87 Difference]: Start difference. First operand 6075 states and 9815 transitions. Second operand 3 states. [2019-09-10 06:08:29,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:29,756 INFO L93 Difference]: Finished difference Result 8429 states and 13546 transitions. [2019-09-10 06:08:29,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:08:29,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 06:08:29,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:29,807 INFO L225 Difference]: With dead ends: 8429 [2019-09-10 06:08:29,808 INFO L226 Difference]: Without dead ends: 8429 [2019-09-10 06:08:29,808 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 06:08:29,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8429 states. [2019-09-10 06:08:30,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8429 to 8427. [2019-09-10 06:08:30,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8427 states. [2019-09-10 06:08:30,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8427 states to 8427 states and 13545 transitions. [2019-09-10 06:08:30,039 INFO L78 Accepts]: Start accepts. Automaton has 8427 states and 13545 transitions. Word has length 68 [2019-09-10 06:08:30,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:30,039 INFO L475 AbstractCegarLoop]: Abstraction has 8427 states and 13545 transitions. [2019-09-10 06:08:30,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:08:30,039 INFO L276 IsEmpty]: Start isEmpty. Operand 8427 states and 13545 transitions. [2019-09-10 06:08:30,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:08:30,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:30,041 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 06:08:30,041 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:30,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:30,041 INFO L82 PathProgramCache]: Analyzing trace with hash 334558445, now seen corresponding path program 1 times [2019-09-10 06:08:30,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:30,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:30,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:30,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:30,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:30,099 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 06:08:30,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:30,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:08:30,100 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:30,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:08:30,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:08:30,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:08:30,101 INFO L87 Difference]: Start difference. First operand 8427 states and 13545 transitions. Second operand 3 states. [2019-09-10 06:08:30,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:30,169 INFO L93 Difference]: Finished difference Result 11643 states and 18748 transitions. [2019-09-10 06:08:30,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:08:30,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 06:08:30,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:30,222 INFO L225 Difference]: With dead ends: 11643 [2019-09-10 06:08:30,223 INFO L226 Difference]: Without dead ends: 11643 [2019-09-10 06:08:30,223 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 06:08:30,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11643 states. [2019-09-10 06:08:30,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11643 to 11641. [2019-09-10 06:08:30,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11641 states. [2019-09-10 06:08:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11641 states to 11641 states and 18747 transitions. [2019-09-10 06:08:30,581 INFO L78 Accepts]: Start accepts. Automaton has 11641 states and 18747 transitions. Word has length 68 [2019-09-10 06:08:30,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:30,582 INFO L475 AbstractCegarLoop]: Abstraction has 11641 states and 18747 transitions. [2019-09-10 06:08:30,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:08:30,582 INFO L276 IsEmpty]: Start isEmpty. Operand 11641 states and 18747 transitions. [2019-09-10 06:08:30,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:08:30,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:30,583 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] [2019-09-10 06:08:30,583 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:30,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:30,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1241984288, now seen corresponding path program 1 times [2019-09-10 06:08:30,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:30,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:30,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:30,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:30,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:30,674 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 06:08:30,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:30,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:08:30,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:30,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:08:30,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:08:30,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:08:30,676 INFO L87 Difference]: Start difference. First operand 11641 states and 18747 transitions. Second operand 4 states. [2019-09-10 06:08:30,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:30,830 INFO L93 Difference]: Finished difference Result 18244 states and 29314 transitions. [2019-09-10 06:08:30,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:08:30,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-10 06:08:30,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:30,886 INFO L225 Difference]: With dead ends: 18244 [2019-09-10 06:08:30,887 INFO L226 Difference]: Without dead ends: 18244 [2019-09-10 06:08:30,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:08:30,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18244 states. [2019-09-10 06:08:31,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18244 to 18159. [2019-09-10 06:08:31,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18159 states. [2019-09-10 06:08:31,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18159 states to 18159 states and 29150 transitions. [2019-09-10 06:08:31,353 INFO L78 Accepts]: Start accepts. Automaton has 18159 states and 29150 transitions. Word has length 69 [2019-09-10 06:08:31,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:31,353 INFO L475 AbstractCegarLoop]: Abstraction has 18159 states and 29150 transitions. [2019-09-10 06:08:31,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:08:31,354 INFO L276 IsEmpty]: Start isEmpty. Operand 18159 states and 29150 transitions. [2019-09-10 06:08:31,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:08:31,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:31,358 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 06:08:31,358 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:31,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:31,359 INFO L82 PathProgramCache]: Analyzing trace with hash 100698310, now seen corresponding path program 1 times [2019-09-10 06:08:31,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:31,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:31,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:31,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:31,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:31,426 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 06:08:31,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:31,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:08:31,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:31,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:08:31,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:08:31,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:08:31,428 INFO L87 Difference]: Start difference. First operand 18159 states and 29150 transitions. Second operand 4 states. [2019-09-10 06:08:31,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:31,649 INFO L93 Difference]: Finished difference Result 37005 states and 59324 transitions. [2019-09-10 06:08:31,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:08:31,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-09-10 06:08:31,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:31,746 INFO L225 Difference]: With dead ends: 37005 [2019-09-10 06:08:31,748 INFO L226 Difference]: Without dead ends: 37005 [2019-09-10 06:08:31,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:08:31,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37005 states. [2019-09-10 06:08:32,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37005 to 27463. [2019-09-10 06:08:32,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27463 states. [2019-09-10 06:08:32,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27463 states to 27463 states and 43903 transitions. [2019-09-10 06:08:32,927 INFO L78 Accepts]: Start accepts. Automaton has 27463 states and 43903 transitions. Word has length 70 [2019-09-10 06:08:32,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:32,928 INFO L475 AbstractCegarLoop]: Abstraction has 27463 states and 43903 transitions. [2019-09-10 06:08:32,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:08:32,928 INFO L276 IsEmpty]: Start isEmpty. Operand 27463 states and 43903 transitions. [2019-09-10 06:08:32,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:08:32,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:32,929 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 06:08:32,929 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:32,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:32,930 INFO L82 PathProgramCache]: Analyzing trace with hash 792159510, now seen corresponding path program 1 times [2019-09-10 06:08:32,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:32,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:32,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:32,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:32,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:33,102 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 06:08:33,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:33,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:08:33,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:33,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:08:33,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:08:33,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:08:33,104 INFO L87 Difference]: Start difference. First operand 27463 states and 43903 transitions. Second operand 5 states. [2019-09-10 06:08:33,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:33,282 INFO L93 Difference]: Finished difference Result 29857 states and 47634 transitions. [2019-09-10 06:08:33,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:08:33,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-10 06:08:33,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:33,360 INFO L225 Difference]: With dead ends: 29857 [2019-09-10 06:08:33,361 INFO L226 Difference]: Without dead ends: 29857 [2019-09-10 06:08:33,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:08:33,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29857 states. [2019-09-10 06:08:33,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29857 to 27463. [2019-09-10 06:08:33,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27463 states. [2019-09-10 06:08:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27463 states to 27463 states and 43753 transitions. [2019-09-10 06:08:33,979 INFO L78 Accepts]: Start accepts. Automaton has 27463 states and 43753 transitions. Word has length 72 [2019-09-10 06:08:33,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:33,980 INFO L475 AbstractCegarLoop]: Abstraction has 27463 states and 43753 transitions. [2019-09-10 06:08:33,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:08:33,980 INFO L276 IsEmpty]: Start isEmpty. Operand 27463 states and 43753 transitions. [2019-09-10 06:08:33,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:08:33,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:33,981 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, 1, 1, 1] [2019-09-10 06:08:33,981 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:33,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:33,982 INFO L82 PathProgramCache]: Analyzing trace with hash 624122737, now seen corresponding path program 1 times [2019-09-10 06:08:33,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:33,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:33,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:33,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:33,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:34,135 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 06:08:34,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:34,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:08:34,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:34,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:08:34,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:08:34,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:08:34,138 INFO L87 Difference]: Start difference. First operand 27463 states and 43753 transitions. Second operand 5 states. [2019-09-10 06:08:34,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:34,605 INFO L93 Difference]: Finished difference Result 49821 states and 78938 transitions. [2019-09-10 06:08:34,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:08:34,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-10 06:08:34,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:34,750 INFO L225 Difference]: With dead ends: 49821 [2019-09-10 06:08:34,750 INFO L226 Difference]: Without dead ends: 49821 [2019-09-10 06:08:34,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:08:34,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49821 states. [2019-09-10 06:08:36,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49821 to 49819. [2019-09-10 06:08:36,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49819 states. [2019-09-10 06:08:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49819 states to 49819 states and 78937 transitions. [2019-09-10 06:08:36,768 INFO L78 Accepts]: Start accepts. Automaton has 49819 states and 78937 transitions. Word has length 75 [2019-09-10 06:08:36,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:36,769 INFO L475 AbstractCegarLoop]: Abstraction has 49819 states and 78937 transitions. [2019-09-10 06:08:36,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:08:36,769 INFO L276 IsEmpty]: Start isEmpty. Operand 49819 states and 78937 transitions. [2019-09-10 06:08:36,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:08:36,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:36,770 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, 1, 1, 1, 1] [2019-09-10 06:08:36,770 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:36,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:36,771 INFO L82 PathProgramCache]: Analyzing trace with hash -2128940941, now seen corresponding path program 1 times [2019-09-10 06:08:36,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:36,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:36,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:36,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:36,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:36,882 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 06:08:36,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:36,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:08:36,883 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:36,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:08:36,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:08:36,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:08:36,884 INFO L87 Difference]: Start difference. First operand 49819 states and 78937 transitions. Second operand 5 states. [2019-09-10 06:08:37,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:37,223 INFO L93 Difference]: Finished difference Result 87944 states and 137888 transitions. [2019-09-10 06:08:37,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:08:37,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-10 06:08:37,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:37,473 INFO L225 Difference]: With dead ends: 87944 [2019-09-10 06:08:37,474 INFO L226 Difference]: Without dead ends: 87944 [2019-09-10 06:08:37,474 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 06:08:37,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87944 states. [2019-09-10 06:08:38,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87944 to 51007. [2019-09-10 06:08:38,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51007 states. [2019-09-10 06:08:38,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51007 states to 51007 states and 80107 transitions. [2019-09-10 06:08:38,949 INFO L78 Accepts]: Start accepts. Automaton has 51007 states and 80107 transitions. Word has length 76 [2019-09-10 06:08:38,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:38,949 INFO L475 AbstractCegarLoop]: Abstraction has 51007 states and 80107 transitions. [2019-09-10 06:08:38,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:08:38,949 INFO L276 IsEmpty]: Start isEmpty. Operand 51007 states and 80107 transitions. [2019-09-10 06:08:38,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:08:38,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:38,953 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:38,954 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:38,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:38,954 INFO L82 PathProgramCache]: Analyzing trace with hash -294350133, now seen corresponding path program 1 times [2019-09-10 06:08:38,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:38,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:38,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:38,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:38,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:08:39,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:39,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:08:39,189 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:39,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:08:39,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:08:39,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:08:39,190 INFO L87 Difference]: Start difference. First operand 51007 states and 80107 transitions. Second operand 4 states. [2019-09-10 06:08:39,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:39,453 INFO L93 Difference]: Finished difference Result 82748 states and 130280 transitions. [2019-09-10 06:08:39,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:08:39,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-10 06:08:39,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:39,599 INFO L225 Difference]: With dead ends: 82748 [2019-09-10 06:08:39,599 INFO L226 Difference]: Without dead ends: 82748 [2019-09-10 06:08:39,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:08:39,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82748 states. [2019-09-10 06:08:40,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82748 to 73048. [2019-09-10 06:08:40,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73048 states. [2019-09-10 06:08:42,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73048 states to 73048 states and 115051 transitions. [2019-09-10 06:08:42,719 INFO L78 Accepts]: Start accepts. Automaton has 73048 states and 115051 transitions. Word has length 97 [2019-09-10 06:08:42,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:42,719 INFO L475 AbstractCegarLoop]: Abstraction has 73048 states and 115051 transitions. [2019-09-10 06:08:42,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:08:42,719 INFO L276 IsEmpty]: Start isEmpty. Operand 73048 states and 115051 transitions. [2019-09-10 06:08:42,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:08:42,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:42,721 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] [2019-09-10 06:08:42,722 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:42,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:42,722 INFO L82 PathProgramCache]: Analyzing trace with hash -266072244, now seen corresponding path program 1 times [2019-09-10 06:08:42,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:42,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:42,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:42,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:42,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:08:42,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:42,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:08:42,961 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:42,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:08:42,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:08:42,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:08:42,963 INFO L87 Difference]: Start difference. First operand 73048 states and 115051 transitions. Second operand 4 states. [2019-09-10 06:08:43,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:43,389 INFO L93 Difference]: Finished difference Result 122185 states and 192982 transitions. [2019-09-10 06:08:43,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:08:43,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-10 06:08:43,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:43,633 INFO L225 Difference]: With dead ends: 122185 [2019-09-10 06:08:43,633 INFO L226 Difference]: Without dead ends: 122185 [2019-09-10 06:08:43,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:08:43,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122185 states. [2019-09-10 06:08:45,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122185 to 107790. [2019-09-10 06:08:45,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107790 states. [2019-09-10 06:08:45,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107790 states to 107790 states and 170277 transitions. [2019-09-10 06:08:45,179 INFO L78 Accepts]: Start accepts. Automaton has 107790 states and 170277 transitions. Word has length 97 [2019-09-10 06:08:45,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:45,180 INFO L475 AbstractCegarLoop]: Abstraction has 107790 states and 170277 transitions. [2019-09-10 06:08:45,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:08:45,180 INFO L276 IsEmpty]: Start isEmpty. Operand 107790 states and 170277 transitions. [2019-09-10 06:08:45,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:08:45,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:45,181 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] [2019-09-10 06:08:45,181 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:45,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:45,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1991425558, now seen corresponding path program 1 times [2019-09-10 06:08:45,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:45,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:45,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:45,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:45,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:45,258 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:08:45,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:45,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:08:45,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:45,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:08:45,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:08:45,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:08:45,260 INFO L87 Difference]: Start difference. First operand 107790 states and 170277 transitions. Second operand 3 states. [2019-09-10 06:08:45,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:45,576 INFO L93 Difference]: Finished difference Result 92938 states and 145887 transitions. [2019-09-10 06:08:45,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:08:45,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 06:08:45,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:45,737 INFO L225 Difference]: With dead ends: 92938 [2019-09-10 06:08:45,737 INFO L226 Difference]: Without dead ends: 92938 [2019-09-10 06:08:45,737 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 06:08:45,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92938 states. [2019-09-10 06:08:47,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92938 to 92936. [2019-09-10 06:08:47,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92936 states. [2019-09-10 06:08:47,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92936 states to 92936 states and 145886 transitions. [2019-09-10 06:08:47,585 INFO L78 Accepts]: Start accepts. Automaton has 92936 states and 145886 transitions. Word has length 97 [2019-09-10 06:08:47,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:47,585 INFO L475 AbstractCegarLoop]: Abstraction has 92936 states and 145886 transitions. [2019-09-10 06:08:47,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:08:47,586 INFO L276 IsEmpty]: Start isEmpty. Operand 92936 states and 145886 transitions. [2019-09-10 06:08:47,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:08:47,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:47,587 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:47,587 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:47,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:47,588 INFO L82 PathProgramCache]: Analyzing trace with hash -25120715, now seen corresponding path program 1 times [2019-09-10 06:08:47,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:47,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:47,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:47,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:47,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:08:47,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:08:47,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:08:47,699 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2019-09-10 06:08:47,702 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [118], [121], [138], [141], [143], [147], [169], [173], [195], [197], [200], [203], [206], [209], [216], [224], [226], [229], [230], [232], [241], [244], [255], [258], [268], [272], [276], [280], [282], [285], [310], [318], [326], [332], [336], [340], [342], [345], [370], [378], [386], [396], [400], [402], [405], [430], [438], [446], [558], [559], [563], [564], [565] [2019-09-10 06:08:47,764 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:08:47,765 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:08:48,011 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:08:48,557 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:08:48,561 INFO L272 AbstractInterpreter]: Visited 91 different actions 464 times. Merged at 42 different actions 329 times. Widened at 22 different actions 48 times. Performed 1517 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1517 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 18 fixpoints after 9 different actions. Largest state had 162 variables. [2019-09-10 06:08:48,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:48,566 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:08:48,924 INFO L227 lantSequenceWeakener]: Weakened 75 states. On average, predicates are now at 84.85% of their original sizes. [2019-09-10 06:08:48,924 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:08:56,106 INFO L420 sIntCurrentIteration]: We unified 96 AI predicates to 96 [2019-09-10 06:08:56,107 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:08:56,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:08:56,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [5] total 68 [2019-09-10 06:08:56,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:56,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-10 06:08:56,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-10 06:08:56,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=3757, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 06:08:56,110 INFO L87 Difference]: Start difference. First operand 92936 states and 145886 transitions. Second operand 65 states. [2019-09-10 06:10:12,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:12,558 INFO L93 Difference]: Finished difference Result 507610 states and 779346 transitions. [2019-09-10 06:10:12,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-09-10 06:10:12,558 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 97 [2019-09-10 06:10:12,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:14,120 INFO L225 Difference]: With dead ends: 507610 [2019-09-10 06:10:14,121 INFO L226 Difference]: Without dead ends: 507610 [2019-09-10 06:10:14,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8594 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=3592, Invalid=20588, Unknown=0, NotChecked=0, Total=24180 [2019-09-10 06:10:14,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507610 states. [2019-09-10 06:10:21,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507610 to 157338. [2019-09-10 06:10:21,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157338 states. [2019-09-10 06:10:21,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157338 states to 157338 states and 243792 transitions. [2019-09-10 06:10:21,884 INFO L78 Accepts]: Start accepts. Automaton has 157338 states and 243792 transitions. Word has length 97 [2019-09-10 06:10:21,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:21,884 INFO L475 AbstractCegarLoop]: Abstraction has 157338 states and 243792 transitions. [2019-09-10 06:10:21,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-10 06:10:21,885 INFO L276 IsEmpty]: Start isEmpty. Operand 157338 states and 243792 transitions. [2019-09-10 06:10:21,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:10:21,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:21,887 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:21,887 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:21,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:21,888 INFO L82 PathProgramCache]: Analyzing trace with hash -2003722731, now seen corresponding path program 1 times [2019-09-10 06:10:21,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:21,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:21,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:21,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:21,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:22,537 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:10:22,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:22,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:22,538 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:22,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:22,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:22,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:22,539 INFO L87 Difference]: Start difference. First operand 157338 states and 243792 transitions. Second operand 3 states. [2019-09-10 06:10:23,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:23,674 INFO L93 Difference]: Finished difference Result 314661 states and 487560 transitions. [2019-09-10 06:10:23,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:23,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:10:23,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:24,226 INFO L225 Difference]: With dead ends: 314661 [2019-09-10 06:10:24,227 INFO L226 Difference]: Without dead ends: 314661 [2019-09-10 06:10:24,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:24,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314661 states. [2019-09-10 06:10:30,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314661 to 157340. [2019-09-10 06:10:30,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157340 states. [2019-09-10 06:10:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157340 states to 157340 states and 243794 transitions. [2019-09-10 06:10:30,862 INFO L78 Accepts]: Start accepts. Automaton has 157340 states and 243794 transitions. Word has length 98 [2019-09-10 06:10:30,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:30,862 INFO L475 AbstractCegarLoop]: Abstraction has 157340 states and 243794 transitions. [2019-09-10 06:10:30,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:30,863 INFO L276 IsEmpty]: Start isEmpty. Operand 157340 states and 243794 transitions. [2019-09-10 06:10:30,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:10:30,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:30,865 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:30,865 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:30,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:30,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1681261196, now seen corresponding path program 1 times [2019-09-10 06:10:30,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:30,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:30,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:30,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:30,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:30,905 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:10:30,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:30,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:30,906 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:30,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:30,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:30,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:30,907 INFO L87 Difference]: Start difference. First operand 157340 states and 243794 transitions. Second operand 3 states. [2019-09-10 06:10:31,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:31,594 INFO L93 Difference]: Finished difference Result 314664 states and 487564 transitions. [2019-09-10 06:10:31,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:31,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:10:31,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:32,027 INFO L225 Difference]: With dead ends: 314664 [2019-09-10 06:10:32,028 INFO L226 Difference]: Without dead ends: 314664 [2019-09-10 06:10:32,028 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 06:10:32,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314664 states. [2019-09-10 06:10:35,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314664 to 157343. [2019-09-10 06:10:35,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157343 states. [2019-09-10 06:10:37,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157343 states to 157343 states and 243798 transitions. [2019-09-10 06:10:37,118 INFO L78 Accepts]: Start accepts. Automaton has 157343 states and 243798 transitions. Word has length 98 [2019-09-10 06:10:37,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:37,119 INFO L475 AbstractCegarLoop]: Abstraction has 157343 states and 243798 transitions. [2019-09-10 06:10:37,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:37,119 INFO L276 IsEmpty]: Start isEmpty. Operand 157343 states and 243798 transitions. [2019-09-10 06:10:37,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:10:37,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:37,121 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:37,121 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:37,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:37,122 INFO L82 PathProgramCache]: Analyzing trace with hash 60102803, now seen corresponding path program 1 times [2019-09-10 06:10:37,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:37,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:37,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:37,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:37,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:37,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:10:37,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:37,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:37,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:37,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:37,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:37,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:37,166 INFO L87 Difference]: Start difference. First operand 157343 states and 243798 transitions. Second operand 3 states. [2019-09-10 06:10:37,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:37,963 INFO L93 Difference]: Finished difference Result 314650 states and 487538 transitions. [2019-09-10 06:10:37,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:37,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:10:37,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:38,415 INFO L225 Difference]: With dead ends: 314650 [2019-09-10 06:10:38,415 INFO L226 Difference]: Without dead ends: 314650 [2019-09-10 06:10:38,415 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 06:10:38,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314650 states. [2019-09-10 06:10:45,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314650 to 157345. [2019-09-10 06:10:45,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157345 states. [2019-09-10 06:10:46,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157345 states to 157345 states and 243800 transitions. [2019-09-10 06:10:46,073 INFO L78 Accepts]: Start accepts. Automaton has 157345 states and 243800 transitions. Word has length 98 [2019-09-10 06:10:46,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:46,074 INFO L475 AbstractCegarLoop]: Abstraction has 157345 states and 243800 transitions. [2019-09-10 06:10:46,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:46,074 INFO L276 IsEmpty]: Start isEmpty. Operand 157345 states and 243800 transitions. [2019-09-10 06:10:46,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:10:46,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:46,076 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:46,076 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:46,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:46,077 INFO L82 PathProgramCache]: Analyzing trace with hash 748323930, now seen corresponding path program 1 times [2019-09-10 06:10:46,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:46,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:46,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:46,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:46,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:46,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:46,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:46,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:46,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:46,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:46,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:46,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:46,137 INFO L87 Difference]: Start difference. First operand 157345 states and 243800 transitions. Second operand 3 states. [2019-09-10 06:10:47,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:47,054 INFO L93 Difference]: Finished difference Result 304774 states and 468575 transitions. [2019-09-10 06:10:47,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:47,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:10:47,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:47,548 INFO L225 Difference]: With dead ends: 304774 [2019-09-10 06:10:47,548 INFO L226 Difference]: Without dead ends: 304774 [2019-09-10 06:10:47,548 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 06:10:47,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304774 states. [2019-09-10 06:10:51,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304774 to 304772. [2019-09-10 06:10:51,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304772 states. [2019-09-10 06:10:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304772 states to 304772 states and 468574 transitions. [2019-09-10 06:10:54,071 INFO L78 Accepts]: Start accepts. Automaton has 304772 states and 468574 transitions. Word has length 98 [2019-09-10 06:10:54,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:54,071 INFO L475 AbstractCegarLoop]: Abstraction has 304772 states and 468574 transitions. [2019-09-10 06:10:54,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:54,071 INFO L276 IsEmpty]: Start isEmpty. Operand 304772 states and 468574 transitions. [2019-09-10 06:10:54,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:10:54,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:54,075 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:54,075 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:54,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:54,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1972012880, now seen corresponding path program 1 times [2019-09-10 06:10:54,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:54,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:54,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:54,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:54,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:54,144 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:54,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:54,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:54,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:54,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:54,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:54,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:54,146 INFO L87 Difference]: Start difference. First operand 304772 states and 468574 transitions. Second operand 3 states. [2019-09-10 06:10:55,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:55,543 INFO L93 Difference]: Finished difference Result 576619 states and 879011 transitions. [2019-09-10 06:10:55,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:55,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:10:55,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:02,907 INFO L225 Difference]: With dead ends: 576619 [2019-09-10 06:11:02,907 INFO L226 Difference]: Without dead ends: 576619 [2019-09-10 06:11:02,908 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 06:11:03,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576619 states. [2019-09-10 06:11:09,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576619 to 576617. [2019-09-10 06:11:09,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576617 states. [2019-09-10 06:11:18,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576617 states to 576617 states and 879010 transitions. [2019-09-10 06:11:18,106 INFO L78 Accepts]: Start accepts. Automaton has 576617 states and 879010 transitions. Word has length 98 [2019-09-10 06:11:18,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:18,107 INFO L475 AbstractCegarLoop]: Abstraction has 576617 states and 879010 transitions. [2019-09-10 06:11:18,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:18,107 INFO L276 IsEmpty]: Start isEmpty. Operand 576617 states and 879010 transitions. [2019-09-10 06:11:18,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:11:18,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:18,111 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:18,111 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:18,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:18,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1677865072, now seen corresponding path program 1 times [2019-09-10 06:11:18,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:18,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:18,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:18,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:18,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:18,150 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:11:18,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:18,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:18,150 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:18,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:18,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:18,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:18,151 INFO L87 Difference]: Start difference. First operand 576617 states and 879010 transitions. Second operand 3 states. [2019-09-10 06:11:28,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:28,696 INFO L93 Difference]: Finished difference Result 1153167 states and 1757907 transitions. [2019-09-10 06:11:28,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:28,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:11:28,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:32,058 INFO L225 Difference]: With dead ends: 1153167 [2019-09-10 06:11:32,059 INFO L226 Difference]: Without dead ends: 1153167 [2019-09-10 06:11:32,059 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 06:11:32,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153167 states. [2019-09-10 06:11:49,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153167 to 576626. [2019-09-10 06:11:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576626 states. [2019-09-10 06:11:51,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576626 states to 576626 states and 879022 transitions. [2019-09-10 06:11:51,358 INFO L78 Accepts]: Start accepts. Automaton has 576626 states and 879022 transitions. Word has length 98 [2019-09-10 06:11:51,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:51,358 INFO L475 AbstractCegarLoop]: Abstraction has 576626 states and 879022 transitions. [2019-09-10 06:11:51,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:51,359 INFO L276 IsEmpty]: Start isEmpty. Operand 576626 states and 879022 transitions. [2019-09-10 06:11:51,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:11:51,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:51,362 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:51,362 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:51,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:51,362 INFO L82 PathProgramCache]: Analyzing trace with hash 444547601, now seen corresponding path program 1 times [2019-09-10 06:11:51,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:51,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:51,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:51,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:51,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:51,416 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:11:51,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:51,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:51,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:51,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:51,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:51,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:51,418 INFO L87 Difference]: Start difference. First operand 576626 states and 879022 transitions. Second operand 3 states. [2019-09-10 06:12:03,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:03,329 INFO L93 Difference]: Finished difference Result 1153171 states and 1757911 transitions. [2019-09-10 06:12:03,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:03,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:12:03,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:05,468 INFO L225 Difference]: With dead ends: 1153171 [2019-09-10 06:12:05,468 INFO L226 Difference]: Without dead ends: 1153171 [2019-09-10 06:12:05,469 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 06:12:06,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153171 states. [2019-09-10 06:12:22,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153171 to 576630. [2019-09-10 06:12:22,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576630 states. [2019-09-10 06:12:25,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576630 states to 576630 states and 879026 transitions. [2019-09-10 06:12:25,011 INFO L78 Accepts]: Start accepts. Automaton has 576630 states and 879026 transitions. Word has length 98 [2019-09-10 06:12:25,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:25,011 INFO L475 AbstractCegarLoop]: Abstraction has 576630 states and 879026 transitions. [2019-09-10 06:12:25,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:25,011 INFO L276 IsEmpty]: Start isEmpty. Operand 576630 states and 879026 transitions. [2019-09-10 06:12:25,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:12:25,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:25,014 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:25,015 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:25,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:25,015 INFO L82 PathProgramCache]: Analyzing trace with hash 592109426, now seen corresponding path program 1 times [2019-09-10 06:12:25,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:25,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:25,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:25,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:25,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:25,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:12:25,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:25,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:25,056 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:25,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:25,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:25,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:25,057 INFO L87 Difference]: Start difference. First operand 576630 states and 879026 transitions. Second operand 3 states. [2019-09-10 06:12:36,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:36,194 INFO L93 Difference]: Finished difference Result 1153222 states and 1757991 transitions. [2019-09-10 06:12:36,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:36,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:12:36,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:39,090 INFO L225 Difference]: With dead ends: 1153222 [2019-09-10 06:12:39,091 INFO L226 Difference]: Without dead ends: 1153222 [2019-09-10 06:12:39,091 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 06:12:39,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153222 states. [2019-09-10 06:12:56,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153222 to 576636. [2019-09-10 06:12:56,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576636 states. [2019-09-10 06:12:58,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576636 states to 576636 states and 879034 transitions. [2019-09-10 06:12:58,278 INFO L78 Accepts]: Start accepts. Automaton has 576636 states and 879034 transitions. Word has length 98 [2019-09-10 06:12:58,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:58,279 INFO L475 AbstractCegarLoop]: Abstraction has 576636 states and 879034 transitions. [2019-09-10 06:12:58,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:58,279 INFO L276 IsEmpty]: Start isEmpty. Operand 576636 states and 879034 transitions. [2019-09-10 06:12:58,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:12:58,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:58,282 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:58,283 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:58,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:58,283 INFO L82 PathProgramCache]: Analyzing trace with hash -2036866056, now seen corresponding path program 1 times [2019-09-10 06:12:58,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:58,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:58,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:58,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:58,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:58,451 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:12:58,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:58,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:58,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:58,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:58,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:58,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:58,453 INFO L87 Difference]: Start difference. First operand 576636 states and 879034 transitions. Second operand 4 states. [2019-09-10 06:13:07,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:07,951 INFO L93 Difference]: Finished difference Result 1060685 states and 1618058 transitions. [2019-09-10 06:13:07,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:13:07,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-09-10 06:13:07,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:11,330 INFO L225 Difference]: With dead ends: 1060685 [2019-09-10 06:13:11,330 INFO L226 Difference]: Without dead ends: 1060685 [2019-09-10 06:13:11,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:13:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060685 states. [2019-09-10 06:13:30,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060685 to 996301. [2019-09-10 06:13:30,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996301 states. [2019-09-10 06:13:47,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996301 states to 996301 states and 1517926 transitions. [2019-09-10 06:13:47,667 INFO L78 Accepts]: Start accepts. Automaton has 996301 states and 1517926 transitions. Word has length 99 [2019-09-10 06:13:47,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:47,668 INFO L475 AbstractCegarLoop]: Abstraction has 996301 states and 1517926 transitions. [2019-09-10 06:13:47,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:13:47,668 INFO L276 IsEmpty]: Start isEmpty. Operand 996301 states and 1517926 transitions. [2019-09-10 06:13:47,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 06:13:47,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:47,671 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, 1, 1, 1] [2019-09-10 06:13:47,671 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:47,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:47,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1874896550, now seen corresponding path program 1 times [2019-09-10 06:13:47,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:47,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:47,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:47,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:47,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:47,774 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 06:13:47,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:47,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:13:47,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:47,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:13:47,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:13:47,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:13:47,776 INFO L87 Difference]: Start difference. First operand 996301 states and 1517926 transitions. Second operand 4 states. [2019-09-10 06:13:52,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:52,780 INFO L93 Difference]: Finished difference Result 996396 states and 1518047 transitions. [2019-09-10 06:13:52,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:13:52,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-10 06:13:52,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:54,664 INFO L225 Difference]: With dead ends: 996396 [2019-09-10 06:13:54,664 INFO L226 Difference]: Without dead ends: 996295 [2019-09-10 06:13:54,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:13:55,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996295 states. [2019-09-10 06:14:18,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996295 to 996295. [2019-09-10 06:14:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996295 states. [2019-09-10 06:14:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996295 states to 996295 states and 1517915 transitions. [2019-09-10 06:14:34,185 INFO L78 Accepts]: Start accepts. Automaton has 996295 states and 1517915 transitions. Word has length 104 [2019-09-10 06:14:34,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:34,185 INFO L475 AbstractCegarLoop]: Abstraction has 996295 states and 1517915 transitions. [2019-09-10 06:14:34,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:14:34,186 INFO L276 IsEmpty]: Start isEmpty. Operand 996295 states and 1517915 transitions. [2019-09-10 06:14:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 06:14:34,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:34,188 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, 1, 1, 1] [2019-09-10 06:14:34,188 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:34,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:34,189 INFO L82 PathProgramCache]: Analyzing trace with hash 609980056, now seen corresponding path program 1 times [2019-09-10 06:14:34,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:34,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:34,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:34,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:34,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:34,292 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:14:34,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:14:34,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:14:34,293 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 105 with the following transitions: [2019-09-10 06:14:34,294 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [118], [121], [143], [147], [169], [173], [195], [197], [200], [203], [206], [209], [212], [216], [224], [226], [229], [230], [232], [241], [244], [248], [253], [255], [258], [272], [276], [280], [282], [285], [310], [318], [326], [332], [336], [340], [342], [345], [370], [378], [386], [392], [396], [400], [402], [405], [430], [438], [446], [531], [534], [540], [558], [559], [563], [564], [565] [2019-09-10 06:14:34,298 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:14:34,298 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:14:34,328 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:14:34,574 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:14:34,574 INFO L272 AbstractInterpreter]: Visited 97 different actions 506 times. Merged at 49 different actions 358 times. Widened at 24 different actions 51 times. Performed 1560 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1560 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 36 fixpoints after 15 different actions. Largest state had 162 variables. [2019-09-10 06:14:34,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:34,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:14:34,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:14:34,576 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) [2019-09-10 06:14:34,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:34,591 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:14:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:34,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:14:34,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:14:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:14:34,793 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:14:34,870 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:14:34,884 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:14:34,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2019-09-10 06:14:34,885 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:34,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:14:34,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:14:34,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:14:34,887 INFO L87 Difference]: Start difference. First operand 996295 states and 1517915 transitions. Second operand 4 states. [2019-09-10 06:14:41,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:41,020 INFO L93 Difference]: Finished difference Result 996461 states and 1506188 transitions. [2019-09-10 06:14:41,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:14:41,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-10 06:14:41,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:42,743 INFO L225 Difference]: With dead ends: 996461 [2019-09-10 06:14:42,744 INFO L226 Difference]: Without dead ends: 996461 [2019-09-10 06:14:42,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:14:43,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996461 states. [2019-09-10 06:15:04,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996461 to 996183. [2019-09-10 06:15:04,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996183 states. [2019-09-10 06:15:21,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996183 states to 996183 states and 1505911 transitions. [2019-09-10 06:15:21,253 INFO L78 Accepts]: Start accepts. Automaton has 996183 states and 1505911 transitions. Word has length 104 [2019-09-10 06:15:21,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:21,253 INFO L475 AbstractCegarLoop]: Abstraction has 996183 states and 1505911 transitions. [2019-09-10 06:15:21,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:15:21,253 INFO L276 IsEmpty]: Start isEmpty. Operand 996183 states and 1505911 transitions. [2019-09-10 06:15:21,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 06:15:21,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:21,257 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, 1, 1, 1] [2019-09-10 06:15:21,257 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:21,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:21,258 INFO L82 PathProgramCache]: Analyzing trace with hash -309202614, now seen corresponding path program 1 times [2019-09-10 06:15:21,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:21,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:21,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:21,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:21,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:21,380 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:15:21,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:15:21,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:15:21,381 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 105 with the following transitions: [2019-09-10 06:15:21,381 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [15], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [118], [121], [143], [147], [169], [173], [195], [197], [200], [203], [206], [209], [212], [216], [224], [226], [229], [230], [232], [241], [244], [248], [253], [255], [258], [272], [276], [280], [282], [285], [310], [318], [326], [332], [336], [340], [342], [345], [370], [378], [386], [392], [396], [400], [402], [405], [430], [438], [446], [505], [516], [518], [529], [558], [559], [563], [564], [565] [2019-09-10 06:15:21,384 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:15:21,385 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:15:21,407 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:15:21,609 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:15:21,609 INFO L272 AbstractInterpreter]: Visited 97 different actions 522 times. Merged at 49 different actions 373 times. Widened at 26 different actions 57 times. Performed 1596 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1596 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 37 fixpoints after 16 different actions. Largest state had 162 variables. [2019-09-10 06:15:21,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:21,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:15:21,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:15:21,610 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:15:21,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:21,633 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:15:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:21,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:15:21,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:15:21,802 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:15:21,802 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:15:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 06:15:21,875 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:15:21,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2019-09-10 06:15:21,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:21,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:15:21,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:15:21,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:15:21,877 INFO L87 Difference]: Start difference. First operand 996183 states and 1505911 transitions. Second operand 4 states. [2019-09-10 06:15:26,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:26,193 INFO L93 Difference]: Finished difference Result 905856 states and 1362368 transitions. [2019-09-10 06:15:26,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:15:26,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-10 06:15:26,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:27,744 INFO L225 Difference]: With dead ends: 905856 [2019-09-10 06:15:27,744 INFO L226 Difference]: Without dead ends: 905687 [2019-09-10 06:15:27,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:15:29,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905687 states. [2019-09-10 06:15:47,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905687 to 905409. [2019-09-10 06:15:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905409 states. [2019-09-10 06:15:51,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905409 states to 905409 states and 1361887 transitions. [2019-09-10 06:15:51,327 INFO L78 Accepts]: Start accepts. Automaton has 905409 states and 1361887 transitions. Word has length 104 [2019-09-10 06:15:51,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:51,327 INFO L475 AbstractCegarLoop]: Abstraction has 905409 states and 1361887 transitions. [2019-09-10 06:15:51,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:15:51,327 INFO L276 IsEmpty]: Start isEmpty. Operand 905409 states and 1361887 transitions. [2019-09-10 06:15:51,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 06:15:51,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:51,330 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, 1, 1, 1, 1, 1] [2019-09-10 06:15:51,330 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:51,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:51,331 INFO L82 PathProgramCache]: Analyzing trace with hash 800845451, now seen corresponding path program 1 times [2019-09-10 06:15:51,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:51,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:51,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:51,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:51,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:51,420 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 06:15:51,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:51,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:15:51,420 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:51,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:15:51,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:15:51,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:15:51,421 INFO L87 Difference]: Start difference. First operand 905409 states and 1361887 transitions. Second operand 4 states. [2019-09-10 06:15:55,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:55,699 INFO L93 Difference]: Finished difference Result 755503 states and 1134576 transitions. [2019-09-10 06:15:55,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:15:55,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-10 06:15:55,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:10,051 INFO L225 Difference]: With dead ends: 755503 [2019-09-10 06:16:10,051 INFO L226 Difference]: Without dead ends: 755347 [2019-09-10 06:16:10,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:16:10,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755347 states. [2019-09-10 06:16:19,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755347 to 755341. [2019-09-10 06:16:19,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755341 states. [2019-09-10 06:16:20,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755341 states to 755341 states and 1134408 transitions. [2019-09-10 06:16:20,826 INFO L78 Accepts]: Start accepts. Automaton has 755341 states and 1134408 transitions. Word has length 106 [2019-09-10 06:16:20,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:20,827 INFO L475 AbstractCegarLoop]: Abstraction has 755341 states and 1134408 transitions. [2019-09-10 06:16:20,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:16:20,827 INFO L276 IsEmpty]: Start isEmpty. Operand 755341 states and 1134408 transitions. [2019-09-10 06:16:20,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 06:16:20,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:20,830 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:16:20,830 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:20,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:20,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1386700272, now seen corresponding path program 1 times [2019-09-10 06:16:20,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:20,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:20,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:20,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:20,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:20,923 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 06:16:20,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:20,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:16:20,924 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:20,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:16:20,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:16:20,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:16:20,925 INFO L87 Difference]: Start difference. First operand 755341 states and 1134408 transitions. Second operand 4 states. [2019-09-10 06:16:30,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:30,070 INFO L93 Difference]: Finished difference Result 755350 states and 1134410 transitions. [2019-09-10 06:16:30,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:16:30,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-10 06:16:30,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:32,430 INFO L225 Difference]: With dead ends: 755350 [2019-09-10 06:16:32,430 INFO L226 Difference]: Without dead ends: 755266 [2019-09-10 06:16:32,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:16:32,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755266 states. [2019-09-10 06:16:40,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755266 to 755266. [2019-09-10 06:16:40,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755266 states. [2019-09-10 06:16:43,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755266 states to 755266 states and 1134312 transitions. [2019-09-10 06:16:43,333 INFO L78 Accepts]: Start accepts. Automaton has 755266 states and 1134312 transitions. Word has length 108 [2019-09-10 06:16:43,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:43,333 INFO L475 AbstractCegarLoop]: Abstraction has 755266 states and 1134312 transitions. [2019-09-10 06:16:43,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:16:43,333 INFO L276 IsEmpty]: Start isEmpty. Operand 755266 states and 1134312 transitions. [2019-09-10 06:16:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 06:16:43,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:43,336 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:16:43,336 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:43,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:43,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1464729779, now seen corresponding path program 1 times [2019-09-10 06:16:43,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:43,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:43,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:43,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:43,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:43,441 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:16:43,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:16:43,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:16:43,442 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2019-09-10 06:16:43,443 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [118], [121], [131], [134], [143], [147], [169], [173], [195], [197], [200], [203], [206], [209], [212], [216], [224], [226], [229], [230], [232], [241], [244], [248], [253], [255], [258], [272], [276], [280], [282], [285], [288], [291], [294], [296], [310], [318], [332], [336], [340], [342], [345], [370], [378], [386], [392], [400], [402], [405], [430], [438], [446], [518], [521], [524], [558], [559], [563], [564], [565] [2019-09-10 06:16:43,452 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:16:43,452 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:16:43,477 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:16:43,718 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:16:43,719 INFO L272 AbstractInterpreter]: Visited 101 different actions 538 times. Merged at 53 different actions 387 times. Widened at 25 different actions 80 times. Performed 1732 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1732 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 37 fixpoints after 16 different actions. Largest state had 163 variables. [2019-09-10 06:16:43,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:43,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:16:43,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:16:43,720 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:16:43,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:43,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:16:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:43,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:16:43,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:16:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:16:43,911 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:16:43,952 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:16:43,956 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:16:43,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2019-09-10 06:16:43,956 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:43,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:16:43,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:16:43,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:16:43,958 INFO L87 Difference]: Start difference. First operand 755266 states and 1134312 transitions. Second operand 4 states. [2019-09-10 06:16:54,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:54,770 INFO L93 Difference]: Finished difference Result 1222756 states and 1815285 transitions. [2019-09-10 06:16:54,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:16:54,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-10 06:16:54,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:56,783 INFO L225 Difference]: With dead ends: 1222756 [2019-09-10 06:16:56,783 INFO L226 Difference]: Without dead ends: 1222756 [2019-09-10 06:16:56,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:16:57,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222756 states. [2019-09-10 06:17:28,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222756 to 1222477. [2019-09-10 06:17:28,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222477 states. [2019-09-10 06:17:32,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222477 states to 1222477 states and 1815007 transitions. [2019-09-10 06:17:32,784 INFO L78 Accepts]: Start accepts. Automaton has 1222477 states and 1815007 transitions. Word has length 108 [2019-09-10 06:17:32,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:32,785 INFO L475 AbstractCegarLoop]: Abstraction has 1222477 states and 1815007 transitions. [2019-09-10 06:17:32,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:17:32,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1222477 states and 1815007 transitions. [2019-09-10 06:17:32,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:17:32,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:32,789 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:17:32,789 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:32,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:32,790 INFO L82 PathProgramCache]: Analyzing trace with hash 349178788, now seen corresponding path program 1 times [2019-09-10 06:17:32,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:32,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:32,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:32,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:32,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:32,867 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:17:32,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:32,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:17:32,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:32,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:17:32,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:17:32,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:17:32,869 INFO L87 Difference]: Start difference. First operand 1222477 states and 1815007 transitions. Second operand 5 states. [2019-09-10 06:17:52,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:52,422 INFO L93 Difference]: Finished difference Result 1220832 states and 1789863 transitions. [2019-09-10 06:17:52,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:17:52,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-10 06:17:52,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:54,343 INFO L225 Difference]: With dead ends: 1220832 [2019-09-10 06:17:54,343 INFO L226 Difference]: Without dead ends: 1220832 [2019-09-10 06:17:54,344 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 06:17:55,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220832 states.