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_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:46:17,280 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:46:17,282 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:46:17,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:46:17,294 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:46:17,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:46:17,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:46:17,299 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:46:17,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:46:17,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:46:17,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:46:17,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:46:17,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:46:17,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:46:17,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:46:17,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:46:17,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:46:17,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:46:17,310 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:46:17,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:46:17,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:46:17,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:46:17,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:46:17,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:46:17,319 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:46:17,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:46:17,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:46:17,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:46:17,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:46:17,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:46:17,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:46:17,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:46:17,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:46:17,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:46:17,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:46:17,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:46:17,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:46:17,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:46:17,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:46:17,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:46:17,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:46:17,329 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 08:46:17,344 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:46:17,344 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:46:17,344 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:46:17,344 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:46:17,345 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:46:17,345 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:46:17,346 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:46:17,346 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:46:17,346 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:46:17,346 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:46:17,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:46:17,347 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:46:17,347 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:46:17,347 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:46:17,348 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:46:17,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:46:17,348 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:46:17,348 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:46:17,349 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:46:17,349 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:46:17,349 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:46:17,349 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:46:17,349 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:46:17,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:46:17,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:46:17,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:46:17,350 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:46:17,350 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:46:17,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:46:17,351 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:46:17,380 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:46:17,392 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:46:17,396 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:46:17,398 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:46:17,398 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:46:17,399 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 08:46:17,468 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/815be7c15/f9944940082f404a878ca1330e73f18a/FLAG06344eede [2019-09-10 08:46:18,090 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:46:18,091 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 08:46:18,103 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/815be7c15/f9944940082f404a878ca1330e73f18a/FLAG06344eede [2019-09-10 08:46:18,282 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/815be7c15/f9944940082f404a878ca1330e73f18a [2019-09-10 08:46:18,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:46:18,292 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:46:18,294 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:46:18,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:46:18,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:46:18,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:46:18" (1/1) ... [2019-09-10 08:46:18,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@313b300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:46:18, skipping insertion in model container [2019-09-10 08:46:18,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:46:18" (1/1) ... [2019-09-10 08:46:18,309 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:46:18,372 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:46:18,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:46:18,886 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:46:19,023 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:46:19,049 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:46:19,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:46:19 WrapperNode [2019-09-10 08:46:19,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:46:19,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:46:19,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:46:19,051 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:46:19,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:46:19" (1/1) ... [2019-09-10 08:46:19,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:46:19" (1/1) ... [2019-09-10 08:46:19,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:46:19" (1/1) ... [2019-09-10 08:46:19,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:46:19" (1/1) ... [2019-09-10 08:46:19,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:46:19" (1/1) ... [2019-09-10 08:46:19,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:46:19" (1/1) ... [2019-09-10 08:46:19,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:46:19" (1/1) ... [2019-09-10 08:46:19,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:46:19,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:46:19,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:46:19,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:46:19,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:46:19" (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 08:46:19,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:46:19,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:46:19,260 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:46:19,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:46:19,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:46:19,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:46:19,261 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:46:19,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:46:19,261 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:46:19,261 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:46:19,261 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:46:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:46:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:46:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:46:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:46:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:46:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:46:19,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:46:19,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:46:20,877 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:46:20,877 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:46:20,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:46:20 BoogieIcfgContainer [2019-09-10 08:46:20,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:46:20,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:46:20,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:46:20,884 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:46:20,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:46:18" (1/3) ... [2019-09-10 08:46:20,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cabcee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:46:20, skipping insertion in model container [2019-09-10 08:46:20,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:46:19" (2/3) ... [2019-09-10 08:46:20,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cabcee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:46:20, skipping insertion in model container [2019-09-10 08:46:20,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:46:20" (3/3) ... [2019-09-10 08:46:20,888 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 08:46:20,899 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:46:20,908 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:46:20,927 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:46:20,964 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:46:20,965 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:46:20,965 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:46:20,965 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:46:20,965 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:46:20,965 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:46:20,966 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:46:20,966 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:46:21,017 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states. [2019-09-10 08:46:21,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 08:46:21,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:21,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:21,064 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:21,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:21,071 INFO L82 PathProgramCache]: Analyzing trace with hash 308974954, now seen corresponding path program 1 times [2019-09-10 08:46:21,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:21,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:21,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:21,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:21,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:21,748 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 08:46:21,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:21,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:21,751 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:21,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:21,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:21,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:21,775 INFO L87 Difference]: Start difference. First operand 335 states. Second operand 3 states. [2019-09-10 08:46:21,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:21,919 INFO L93 Difference]: Finished difference Result 473 states and 815 transitions. [2019-09-10 08:46:21,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:21,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-10 08:46:21,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:21,954 INFO L225 Difference]: With dead ends: 473 [2019-09-10 08:46:21,955 INFO L226 Difference]: Without dead ends: 465 [2019-09-10 08:46:21,958 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 08:46:21,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-10 08:46:22,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 463. [2019-09-10 08:46:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-09-10 08:46:22,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 771 transitions. [2019-09-10 08:46:22,060 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 771 transitions. Word has length 110 [2019-09-10 08:46:22,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:22,061 INFO L475 AbstractCegarLoop]: Abstraction has 463 states and 771 transitions. [2019-09-10 08:46:22,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:22,061 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 771 transitions. [2019-09-10 08:46:22,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:46:22,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:22,065 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:22,065 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:22,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:22,066 INFO L82 PathProgramCache]: Analyzing trace with hash -69317551, now seen corresponding path program 1 times [2019-09-10 08:46:22,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:22,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:22,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:22,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:22,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:22,322 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 08:46:22,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:22,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:22,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:22,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:22,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:22,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:22,326 INFO L87 Difference]: Start difference. First operand 463 states and 771 transitions. Second operand 3 states. [2019-09-10 08:46:22,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:22,369 INFO L93 Difference]: Finished difference Result 721 states and 1199 transitions. [2019-09-10 08:46:22,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:22,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-09-10 08:46:22,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:22,375 INFO L225 Difference]: With dead ends: 721 [2019-09-10 08:46:22,376 INFO L226 Difference]: Without dead ends: 721 [2019-09-10 08:46:22,377 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 08:46:22,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-09-10 08:46:22,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 719. [2019-09-10 08:46:22,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-09-10 08:46:22,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1198 transitions. [2019-09-10 08:46:22,406 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1198 transitions. Word has length 113 [2019-09-10 08:46:22,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:22,407 INFO L475 AbstractCegarLoop]: Abstraction has 719 states and 1198 transitions. [2019-09-10 08:46:22,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:22,407 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1198 transitions. [2019-09-10 08:46:22,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:46:22,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:22,410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:22,410 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:22,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:22,410 INFO L82 PathProgramCache]: Analyzing trace with hash 551083111, now seen corresponding path program 1 times [2019-09-10 08:46:22,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:22,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:22,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:22,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:22,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:22,531 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 08:46:22,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:22,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:22,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:22,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:22,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:22,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:22,534 INFO L87 Difference]: Start difference. First operand 719 states and 1198 transitions. Second operand 3 states. [2019-09-10 08:46:22,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:22,575 INFO L93 Difference]: Finished difference Result 1213 states and 2015 transitions. [2019-09-10 08:46:22,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:22,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 08:46:22,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:22,584 INFO L225 Difference]: With dead ends: 1213 [2019-09-10 08:46:22,585 INFO L226 Difference]: Without dead ends: 1213 [2019-09-10 08:46:22,585 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 08:46:22,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2019-09-10 08:46:22,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1211. [2019-09-10 08:46:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1211 states. [2019-09-10 08:46:22,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 2014 transitions. [2019-09-10 08:46:22,621 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 2014 transitions. Word has length 116 [2019-09-10 08:46:22,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:22,621 INFO L475 AbstractCegarLoop]: Abstraction has 1211 states and 2014 transitions. [2019-09-10 08:46:22,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:22,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 2014 transitions. [2019-09-10 08:46:22,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:46:22,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:22,625 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:22,625 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:22,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:22,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1790000478, now seen corresponding path program 1 times [2019-09-10 08:46:22,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:22,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:22,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:22,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:22,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:22,795 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 08:46:22,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:22,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:22,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:22,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:22,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:22,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:22,797 INFO L87 Difference]: Start difference. First operand 1211 states and 2014 transitions. Second operand 3 states. [2019-09-10 08:46:22,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:22,845 INFO L93 Difference]: Finished difference Result 2157 states and 3571 transitions. [2019-09-10 08:46:22,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:22,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-09-10 08:46:22,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:22,859 INFO L225 Difference]: With dead ends: 2157 [2019-09-10 08:46:22,860 INFO L226 Difference]: Without dead ends: 2157 [2019-09-10 08:46:22,860 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 08:46:22,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2019-09-10 08:46:22,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 2155. [2019-09-10 08:46:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2155 states. [2019-09-10 08:46:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 3570 transitions. [2019-09-10 08:46:22,960 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 3570 transitions. Word has length 119 [2019-09-10 08:46:22,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:22,961 INFO L475 AbstractCegarLoop]: Abstraction has 2155 states and 3570 transitions. [2019-09-10 08:46:22,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:22,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 3570 transitions. [2019-09-10 08:46:22,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:46:22,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:22,964 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:22,965 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:22,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:22,965 INFO L82 PathProgramCache]: Analyzing trace with hash -750482868, now seen corresponding path program 1 times [2019-09-10 08:46:22,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:22,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:22,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:22,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:22,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:23,182 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 08:46:23,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:23,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:46:23,183 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:23,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:46:23,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:46:23,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:46:23,185 INFO L87 Difference]: Start difference. First operand 2155 states and 3570 transitions. Second operand 6 states. [2019-09-10 08:46:23,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:23,548 INFO L93 Difference]: Finished difference Result 6251 states and 10394 transitions. [2019-09-10 08:46:23,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:46:23,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-09-10 08:46:23,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:23,585 INFO L225 Difference]: With dead ends: 6251 [2019-09-10 08:46:23,586 INFO L226 Difference]: Without dead ends: 6251 [2019-09-10 08:46:23,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:46:23,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6251 states. [2019-09-10 08:46:23,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6251 to 4917. [2019-09-10 08:46:23,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4917 states. [2019-09-10 08:46:23,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4917 states to 4917 states and 8155 transitions. [2019-09-10 08:46:23,778 INFO L78 Accepts]: Start accepts. Automaton has 4917 states and 8155 transitions. Word has length 122 [2019-09-10 08:46:23,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:23,779 INFO L475 AbstractCegarLoop]: Abstraction has 4917 states and 8155 transitions. [2019-09-10 08:46:23,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:46:23,779 INFO L276 IsEmpty]: Start isEmpty. Operand 4917 states and 8155 transitions. [2019-09-10 08:46:23,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:46:23,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:23,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:23,784 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:23,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:23,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1856300748, now seen corresponding path program 1 times [2019-09-10 08:46:23,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:23,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:23,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:23,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:23,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:23,951 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 08:46:23,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:23,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:46:23,952 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:23,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:46:23,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:46:23,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:46:23,955 INFO L87 Difference]: Start difference. First operand 4917 states and 8155 transitions. Second operand 4 states. [2019-09-10 08:46:24,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:24,108 INFO L93 Difference]: Finished difference Result 8315 states and 13836 transitions. [2019-09-10 08:46:24,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:46:24,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-10 08:46:24,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:24,155 INFO L225 Difference]: With dead ends: 8315 [2019-09-10 08:46:24,156 INFO L226 Difference]: Without dead ends: 8315 [2019-09-10 08:46:24,156 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 08:46:24,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8315 states. [2019-09-10 08:46:24,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8315 to 7261. [2019-09-10 08:46:24,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7261 states. [2019-09-10 08:46:24,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7261 states to 7261 states and 12058 transitions. [2019-09-10 08:46:24,444 INFO L78 Accepts]: Start accepts. Automaton has 7261 states and 12058 transitions. Word has length 123 [2019-09-10 08:46:24,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:24,445 INFO L475 AbstractCegarLoop]: Abstraction has 7261 states and 12058 transitions. [2019-09-10 08:46:24,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:46:24,445 INFO L276 IsEmpty]: Start isEmpty. Operand 7261 states and 12058 transitions. [2019-09-10 08:46:24,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:46:24,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:24,455 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:24,456 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:24,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:24,463 INFO L82 PathProgramCache]: Analyzing trace with hash -193895636, now seen corresponding path program 1 times [2019-09-10 08:46:24,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:24,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:24,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:24,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:24,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:24,585 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 08:46:24,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:24,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:24,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:24,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:24,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:24,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:24,588 INFO L87 Difference]: Start difference. First operand 7261 states and 12058 transitions. Second operand 3 states. [2019-09-10 08:46:24,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:24,726 INFO L93 Difference]: Finished difference Result 11087 states and 18414 transitions. [2019-09-10 08:46:24,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:24,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-10 08:46:24,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:24,790 INFO L225 Difference]: With dead ends: 11087 [2019-09-10 08:46:24,791 INFO L226 Difference]: Without dead ends: 11087 [2019-09-10 08:46:24,791 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 08:46:24,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11087 states. [2019-09-10 08:46:25,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11087 to 11085. [2019-09-10 08:46:25,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11085 states. [2019-09-10 08:46:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11085 states to 11085 states and 18413 transitions. [2019-09-10 08:46:25,121 INFO L78 Accepts]: Start accepts. Automaton has 11085 states and 18413 transitions. Word has length 124 [2019-09-10 08:46:25,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:25,121 INFO L475 AbstractCegarLoop]: Abstraction has 11085 states and 18413 transitions. [2019-09-10 08:46:25,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 11085 states and 18413 transitions. [2019-09-10 08:46:25,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:46:25,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:25,130 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:25,131 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:25,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:25,131 INFO L82 PathProgramCache]: Analyzing trace with hash 383149854, now seen corresponding path program 1 times [2019-09-10 08:46:25,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:25,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:25,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:25,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:25,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:25,288 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 08:46:25,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:25,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:25,289 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:25,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:25,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:25,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:25,291 INFO L87 Difference]: Start difference. First operand 11085 states and 18413 transitions. Second operand 3 states. [2019-09-10 08:46:25,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:25,412 INFO L93 Difference]: Finished difference Result 16360 states and 27102 transitions. [2019-09-10 08:46:25,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:25,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-10 08:46:25,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:25,456 INFO L225 Difference]: With dead ends: 16360 [2019-09-10 08:46:25,456 INFO L226 Difference]: Without dead ends: 16360 [2019-09-10 08:46:25,456 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 08:46:25,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16360 states. [2019-09-10 08:46:25,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16360 to 16358. [2019-09-10 08:46:25,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16358 states. [2019-09-10 08:46:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16358 states to 16358 states and 27101 transitions. [2019-09-10 08:46:25,860 INFO L78 Accepts]: Start accepts. Automaton has 16358 states and 27101 transitions. Word has length 124 [2019-09-10 08:46:25,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:25,861 INFO L475 AbstractCegarLoop]: Abstraction has 16358 states and 27101 transitions. [2019-09-10 08:46:25,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:25,861 INFO L276 IsEmpty]: Start isEmpty. Operand 16358 states and 27101 transitions. [2019-09-10 08:46:25,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:46:25,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:25,864 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:25,864 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:25,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:25,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1772358637, now seen corresponding path program 1 times [2019-09-10 08:46:25,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:25,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:25,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:25,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:25,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:26,054 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 08:46:26,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:26,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:46:26,055 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:26,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:46:26,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:46:26,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:46:26,057 INFO L87 Difference]: Start difference. First operand 16358 states and 27101 transitions. Second operand 4 states. [2019-09-10 08:46:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:26,267 INFO L93 Difference]: Finished difference Result 27616 states and 45746 transitions. [2019-09-10 08:46:26,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:46:26,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-10 08:46:26,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:26,340 INFO L225 Difference]: With dead ends: 27616 [2019-09-10 08:46:26,340 INFO L226 Difference]: Without dead ends: 27616 [2019-09-10 08:46:26,341 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 08:46:26,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27616 states. [2019-09-10 08:46:27,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27616 to 24206. [2019-09-10 08:46:27,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24206 states. [2019-09-10 08:46:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24206 states to 24206 states and 40030 transitions. [2019-09-10 08:46:27,334 INFO L78 Accepts]: Start accepts. Automaton has 24206 states and 40030 transitions. Word has length 124 [2019-09-10 08:46:27,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:27,334 INFO L475 AbstractCegarLoop]: Abstraction has 24206 states and 40030 transitions. [2019-09-10 08:46:27,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:46:27,335 INFO L276 IsEmpty]: Start isEmpty. Operand 24206 states and 40030 transitions. [2019-09-10 08:46:27,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:46:27,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:27,337 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:27,338 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:27,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:27,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1935100896, now seen corresponding path program 1 times [2019-09-10 08:46:27,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:27,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:27,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:27,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:27,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:27,429 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 08:46:27,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:27,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:27,429 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:27,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:27,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:27,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:27,431 INFO L87 Difference]: Start difference. First operand 24206 states and 40030 transitions. Second operand 3 states. [2019-09-10 08:46:27,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:27,563 INFO L93 Difference]: Finished difference Result 33968 states and 56016 transitions. [2019-09-10 08:46:27,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:27,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-10 08:46:27,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:27,644 INFO L225 Difference]: With dead ends: 33968 [2019-09-10 08:46:27,646 INFO L226 Difference]: Without dead ends: 33968 [2019-09-10 08:46:27,646 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 08:46:27,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33968 states. [2019-09-10 08:46:28,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33968 to 33966. [2019-09-10 08:46:28,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33966 states. [2019-09-10 08:46:28,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33966 states to 33966 states and 56015 transitions. [2019-09-10 08:46:28,270 INFO L78 Accepts]: Start accepts. Automaton has 33966 states and 56015 transitions. Word has length 124 [2019-09-10 08:46:28,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:28,270 INFO L475 AbstractCegarLoop]: Abstraction has 33966 states and 56015 transitions. [2019-09-10 08:46:28,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:28,270 INFO L276 IsEmpty]: Start isEmpty. Operand 33966 states and 56015 transitions. [2019-09-10 08:46:28,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:46:28,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:28,272 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:28,273 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:28,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:28,273 INFO L82 PathProgramCache]: Analyzing trace with hash 388299538, now seen corresponding path program 1 times [2019-09-10 08:46:28,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:28,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:28,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:28,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:28,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:28,357 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 08:46:28,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:28,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:28,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:28,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:28,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:28,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:28,359 INFO L87 Difference]: Start difference. First operand 33966 states and 56015 transitions. Second operand 3 states. [2019-09-10 08:46:28,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:28,523 INFO L93 Difference]: Finished difference Result 50505 states and 82976 transitions. [2019-09-10 08:46:28,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:28,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-10 08:46:28,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:28,637 INFO L225 Difference]: With dead ends: 50505 [2019-09-10 08:46:28,637 INFO L226 Difference]: Without dead ends: 50505 [2019-09-10 08:46:28,638 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 08:46:28,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50505 states. [2019-09-10 08:46:30,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50505 to 50503. [2019-09-10 08:46:30,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50503 states. [2019-09-10 08:46:30,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50503 states to 50503 states and 82975 transitions. [2019-09-10 08:46:30,228 INFO L78 Accepts]: Start accepts. Automaton has 50503 states and 82975 transitions. Word has length 124 [2019-09-10 08:46:30,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:30,228 INFO L475 AbstractCegarLoop]: Abstraction has 50503 states and 82975 transitions. [2019-09-10 08:46:30,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:30,229 INFO L276 IsEmpty]: Start isEmpty. Operand 50503 states and 82975 transitions. [2019-09-10 08:46:30,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:46:30,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:30,230 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:30,231 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:30,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:30,231 INFO L82 PathProgramCache]: Analyzing trace with hash 834404827, now seen corresponding path program 1 times [2019-09-10 08:46:30,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:30,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:30,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:30,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:30,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:30,582 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 08:46:30,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:30,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:46:30,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:30,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:46:30,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:46:30,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:46:30,584 INFO L87 Difference]: Start difference. First operand 50503 states and 82975 transitions. Second operand 7 states. [2019-09-10 08:46:31,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:31,524 INFO L93 Difference]: Finished difference Result 185533 states and 303001 transitions. [2019-09-10 08:46:31,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:46:31,525 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2019-09-10 08:46:31,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:32,021 INFO L225 Difference]: With dead ends: 185533 [2019-09-10 08:46:32,022 INFO L226 Difference]: Without dead ends: 185533 [2019-09-10 08:46:32,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:46:32,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185533 states. [2019-09-10 08:46:35,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185533 to 140526. [2019-09-10 08:46:35,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140526 states. [2019-09-10 08:46:35,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140526 states to 140526 states and 228854 transitions. [2019-09-10 08:46:35,810 INFO L78 Accepts]: Start accepts. Automaton has 140526 states and 228854 transitions. Word has length 125 [2019-09-10 08:46:35,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:35,810 INFO L475 AbstractCegarLoop]: Abstraction has 140526 states and 228854 transitions. [2019-09-10 08:46:35,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:46:35,811 INFO L276 IsEmpty]: Start isEmpty. Operand 140526 states and 228854 transitions. [2019-09-10 08:46:35,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:46:35,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:35,812 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:35,813 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:35,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:35,813 INFO L82 PathProgramCache]: Analyzing trace with hash 44251610, now seen corresponding path program 1 times [2019-09-10 08:46:35,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:35,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:35,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:35,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:35,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:37,763 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 08:46:37,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:37,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:46:37,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:37,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:46:37,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:46:37,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:46:37,766 INFO L87 Difference]: Start difference. First operand 140526 states and 228854 transitions. Second operand 4 states. [2019-09-10 08:46:38,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:38,503 INFO L93 Difference]: Finished difference Result 274258 states and 446065 transitions. [2019-09-10 08:46:38,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:46:38,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-10 08:46:38,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:38,972 INFO L225 Difference]: With dead ends: 274258 [2019-09-10 08:46:38,972 INFO L226 Difference]: Without dead ends: 274258 [2019-09-10 08:46:38,972 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 08:46:39,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274258 states. [2019-09-10 08:46:42,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274258 to 206983. [2019-09-10 08:46:42,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206983 states. [2019-09-10 08:46:46,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206983 states to 206983 states and 336259 transitions. [2019-09-10 08:46:46,441 INFO L78 Accepts]: Start accepts. Automaton has 206983 states and 336259 transitions. Word has length 126 [2019-09-10 08:46:46,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:46,441 INFO L475 AbstractCegarLoop]: Abstraction has 206983 states and 336259 transitions. [2019-09-10 08:46:46,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:46:46,441 INFO L276 IsEmpty]: Start isEmpty. Operand 206983 states and 336259 transitions. [2019-09-10 08:46:46,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:46:46,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:46,447 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:46,447 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:46,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:46,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1913506038, now seen corresponding path program 1 times [2019-09-10 08:46:46,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:46,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:46,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:46,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:46,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:46,768 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 08:46:46,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:46,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:46:46,768 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:46,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:46:46,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:46:46,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:46:46,770 INFO L87 Difference]: Start difference. First operand 206983 states and 336259 transitions. Second operand 6 states. [2019-09-10 08:46:47,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:47,823 INFO L93 Difference]: Finished difference Result 298853 states and 485650 transitions. [2019-09-10 08:46:47,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:46:47,823 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-09-10 08:46:47,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:48,267 INFO L225 Difference]: With dead ends: 298853 [2019-09-10 08:46:48,267 INFO L226 Difference]: Without dead ends: 298853 [2019-09-10 08:46:48,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:46:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298853 states. [2019-09-10 08:46:54,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298853 to 236143. [2019-09-10 08:46:54,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236143 states. [2019-09-10 08:46:55,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236143 states to 236143 states and 382864 transitions. [2019-09-10 08:46:55,150 INFO L78 Accepts]: Start accepts. Automaton has 236143 states and 382864 transitions. Word has length 128 [2019-09-10 08:46:55,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:55,150 INFO L475 AbstractCegarLoop]: Abstraction has 236143 states and 382864 transitions. [2019-09-10 08:46:55,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:46:55,151 INFO L276 IsEmpty]: Start isEmpty. Operand 236143 states and 382864 transitions. [2019-09-10 08:46:55,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:46:55,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:55,152 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:55,152 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:55,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:55,152 INFO L82 PathProgramCache]: Analyzing trace with hash -206799924, now seen corresponding path program 1 times [2019-09-10 08:46:55,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:55,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:55,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:55,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:55,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:55,435 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 08:46:55,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:55,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:46:55,436 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:55,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:46:55,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:46:55,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:46:55,437 INFO L87 Difference]: Start difference. First operand 236143 states and 382864 transitions. Second operand 6 states. [2019-09-10 08:47:01,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:01,460 INFO L93 Difference]: Finished difference Result 458661 states and 744366 transitions. [2019-09-10 08:47:01,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:47:01,461 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-09-10 08:47:01,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:02,152 INFO L225 Difference]: With dead ends: 458661 [2019-09-10 08:47:02,152 INFO L226 Difference]: Without dead ends: 458661 [2019-09-10 08:47:02,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:47:02,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458661 states. [2019-09-10 08:47:07,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458661 to 420175. [2019-09-10 08:47:07,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420175 states. [2019-09-10 08:47:07,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420175 states to 420175 states and 680951 transitions. [2019-09-10 08:47:07,979 INFO L78 Accepts]: Start accepts. Automaton has 420175 states and 680951 transitions. Word has length 131 [2019-09-10 08:47:07,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:07,980 INFO L475 AbstractCegarLoop]: Abstraction has 420175 states and 680951 transitions. [2019-09-10 08:47:07,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:47:07,980 INFO L276 IsEmpty]: Start isEmpty. Operand 420175 states and 680951 transitions. [2019-09-10 08:47:07,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 08:47:07,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:07,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:07,981 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:07,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:07,982 INFO L82 PathProgramCache]: Analyzing trace with hash -2117739481, now seen corresponding path program 1 times [2019-09-10 08:47:07,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:07,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:07,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:07,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:07,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:08,137 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 08:47:08,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:08,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:47:08,137 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:08,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:47:08,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:47:08,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:47:08,139 INFO L87 Difference]: Start difference. First operand 420175 states and 680951 transitions. Second operand 5 states. [2019-09-10 08:47:15,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:15,069 INFO L93 Difference]: Finished difference Result 704189 states and 1133895 transitions. [2019-09-10 08:47:15,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:47:15,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-09-10 08:47:15,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:16,270 INFO L225 Difference]: With dead ends: 704189 [2019-09-10 08:47:16,270 INFO L226 Difference]: Without dead ends: 704189 [2019-09-10 08:47:16,271 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 08:47:17,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704189 states. [2019-09-10 08:47:25,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704189 to 426087. [2019-09-10 08:47:25,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426087 states. [2019-09-10 08:47:36,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426087 states to 426087 states and 686818 transitions. [2019-09-10 08:47:36,219 INFO L78 Accepts]: Start accepts. Automaton has 426087 states and 686818 transitions. Word has length 132 [2019-09-10 08:47:36,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:36,219 INFO L475 AbstractCegarLoop]: Abstraction has 426087 states and 686818 transitions. [2019-09-10 08:47:36,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:47:36,220 INFO L276 IsEmpty]: Start isEmpty. Operand 426087 states and 686818 transitions. [2019-09-10 08:47:36,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 08:47:36,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:36,230 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:36,230 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:36,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:36,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1363205167, now seen corresponding path program 1 times [2019-09-10 08:47:36,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:36,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:36,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:36,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:36,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:36,377 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:47:36,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:36,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:36,377 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:36,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:36,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:36,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:36,378 INFO L87 Difference]: Start difference. First operand 426087 states and 686818 transitions. Second operand 3 states. [2019-09-10 08:47:37,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:37,312 INFO L93 Difference]: Finished difference Result 352549 states and 566757 transitions. [2019-09-10 08:47:37,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:37,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-09-10 08:47:37,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:38,090 INFO L225 Difference]: With dead ends: 352549 [2019-09-10 08:47:38,090 INFO L226 Difference]: Without dead ends: 352549 [2019-09-10 08:47:38,092 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 08:47:38,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352549 states. [2019-09-10 08:47:50,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352549 to 352314. [2019-09-10 08:47:50,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352314 states. [2019-09-10 08:47:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352314 states to 352314 states and 566406 transitions. [2019-09-10 08:47:50,747 INFO L78 Accepts]: Start accepts. Automaton has 352314 states and 566406 transitions. Word has length 166 [2019-09-10 08:47:50,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:50,747 INFO L475 AbstractCegarLoop]: Abstraction has 352314 states and 566406 transitions. [2019-09-10 08:47:50,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:50,747 INFO L276 IsEmpty]: Start isEmpty. Operand 352314 states and 566406 transitions. [2019-09-10 08:47:50,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 08:47:50,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:50,757 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:50,758 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:50,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:50,758 INFO L82 PathProgramCache]: Analyzing trace with hash -378000093, now seen corresponding path program 1 times [2019-09-10 08:47:50,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:50,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:50,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:50,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:50,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:50,937 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 08:47:50,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:50,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:47:50,938 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:50,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:47:50,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:47:50,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:47:50,939 INFO L87 Difference]: Start difference. First operand 352314 states and 566406 transitions. Second operand 6 states. [2019-09-10 08:47:53,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:53,125 INFO L93 Difference]: Finished difference Result 438426 states and 705461 transitions. [2019-09-10 08:47:53,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:47:53,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2019-09-10 08:47:53,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:53,768 INFO L225 Difference]: With dead ends: 438426 [2019-09-10 08:47:53,769 INFO L226 Difference]: Without dead ends: 438426 [2019-09-10 08:47:53,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:47:54,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438426 states. [2019-09-10 08:48:04,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438426 to 402140. [2019-09-10 08:48:04,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402140 states. [2019-09-10 08:48:05,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402140 states to 402140 states and 646378 transitions. [2019-09-10 08:48:05,633 INFO L78 Accepts]: Start accepts. Automaton has 402140 states and 646378 transitions. Word has length 166 [2019-09-10 08:48:05,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:05,633 INFO L475 AbstractCegarLoop]: Abstraction has 402140 states and 646378 transitions. [2019-09-10 08:48:05,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:48:05,634 INFO L276 IsEmpty]: Start isEmpty. Operand 402140 states and 646378 transitions. [2019-09-10 08:48:05,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 08:48:05,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:05,641 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:48:05,641 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:05,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:05,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1111279008, now seen corresponding path program 1 times [2019-09-10 08:48:05,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:05,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:05,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:05,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:05,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:05,816 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:48:05,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:48:05,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:48:05,817 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 168 with the following transitions: [2019-09-10 08:48:05,820 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [35], [38], [40], [43], [45], [48], [50], [53], [55], [58], [60], [63], [65], [68], [70], [73], [75], [78], [80], [83], [85], [88], [90], [93], [95], [98], [100], [103], [105], [108], [110], [113], [115], [118], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [189], [192], [195], [198], [201], [204], [207], [210], [213], [216], [219], [222], [225], [229], [232], [254], [257], [260], [262], [264], [299], [302], [324], [332], [334], [369], [372], [375], [378], [381], [384], [391], [399], [401], [404], [405], [407], [416], [419], [430], [433], [445], [463], [466], [512], [522], [532], [542], [548], [552], [556], [560], [562], [565], [611], [621], [631], [641], [661], [664], [710], [720], [730], [740], [750], [754], [758], [760], [763], [809], [819], [829], [839], [1456], [1457], [1461], [1462], [1463] [2019-09-10 08:48:05,893 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:48:05,893 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:48:06,158 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:48:06,681 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:48:06,684 INFO L272 AbstractInterpreter]: Visited 146 different actions 438 times. Merged at 54 different actions 272 times. Widened at 26 different actions 30 times. Performed 1520 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1520 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 7 fixpoints after 4 different actions. Largest state had 297 variables. [2019-09-10 08:48:06,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:06,689 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:48:07,413 INFO L227 lantSequenceWeakener]: Weakened 109 states. On average, predicates are now at 89.26% of their original sizes. [2019-09-10 08:48:07,413 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:48:40,254 INFO L420 sIntCurrentIteration]: We unified 166 AI predicates to 166 [2019-09-10 08:48:40,255 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:48:40,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:48:40,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [105] imperfect sequences [5] total 108 [2019-09-10 08:48:40,257 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:40,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-10 08:48:40,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-10 08:48:40,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1682, Invalid=9238, Unknown=0, NotChecked=0, Total=10920 [2019-09-10 08:48:40,263 INFO L87 Difference]: Start difference. First operand 402140 states and 646378 transitions. Second operand 105 states. [2019-09-10 08:54:30,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:30,182 INFO L93 Difference]: Finished difference Result 1577094 states and 2501560 transitions. [2019-09-10 08:54:30,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 401 states. [2019-09-10 08:54:30,182 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 167 [2019-09-10 08:54:30,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:35,878 INFO L225 Difference]: With dead ends: 1577094 [2019-09-10 08:54:35,878 INFO L226 Difference]: Without dead ends: 1577094 [2019-09-10 08:54:35,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 442 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81219 ImplicationChecksByTransitivity, 88.8s TimeCoverageRelationStatistics Valid=27584, Invalid=169108, Unknown=0, NotChecked=0, Total=196692 [2019-09-10 08:54:37,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577094 states. [2019-09-10 08:55:08,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577094 to 576270. [2019-09-10 08:55:08,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576270 states. [2019-09-10 08:55:09,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576270 states to 576270 states and 925490 transitions. [2019-09-10 08:55:09,893 INFO L78 Accepts]: Start accepts. Automaton has 576270 states and 925490 transitions. Word has length 167 [2019-09-10 08:55:09,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:09,894 INFO L475 AbstractCegarLoop]: Abstraction has 576270 states and 925490 transitions. [2019-09-10 08:55:09,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-10 08:55:09,894 INFO L276 IsEmpty]: Start isEmpty. Operand 576270 states and 925490 transitions. [2019-09-10 08:55:09,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 08:55:09,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:09,910 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:55:09,911 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:09,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:09,911 INFO L82 PathProgramCache]: Analyzing trace with hash 15777973, now seen corresponding path program 1 times [2019-09-10 08:55:09,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:09,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:09,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:09,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:09,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:10,025 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:55:10,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:10,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:10,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:10,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:10,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:10,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:10,027 INFO L87 Difference]: Start difference. First operand 576270 states and 925490 transitions. Second operand 3 states. [2019-09-10 08:55:25,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:25,676 INFO L93 Difference]: Finished difference Result 1132862 states and 1811895 transitions. [2019-09-10 08:55:25,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:25,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-10 08:55:25,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:28,035 INFO L225 Difference]: With dead ends: 1132862 [2019-09-10 08:55:28,035 INFO L226 Difference]: Without dead ends: 1132862 [2019-09-10 08:55:28,035 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 08:55:29,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132862 states. [2019-09-10 08:55:47,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132862 to 1132860. [2019-09-10 08:55:47,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132860 states. [2019-09-10 08:56:18,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132860 states to 1132860 states and 1811894 transitions. [2019-09-10 08:56:18,630 INFO L78 Accepts]: Start accepts. Automaton has 1132860 states and 1811894 transitions. Word has length 168 [2019-09-10 08:56:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:18,630 INFO L475 AbstractCegarLoop]: Abstraction has 1132860 states and 1811894 transitions. [2019-09-10 08:56:18,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:18,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1132860 states and 1811894 transitions. [2019-09-10 08:56:18,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 08:56:18,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:18,646 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:56:18,646 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:18,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:18,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1241231083, now seen corresponding path program 1 times [2019-09-10 08:56:18,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:18,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:18,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:18,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:18,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:56:18,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:18,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:18,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:18,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:18,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:18,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:18,765 INFO L87 Difference]: Start difference. First operand 1132860 states and 1811894 transitions. Second operand 3 states. [2019-09-10 08:56:42,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:42,975 INFO L93 Difference]: Finished difference Result 2220297 states and 3534618 transitions. [2019-09-10 08:56:42,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:42,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-10 08:56:42,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:47,732 INFO L225 Difference]: With dead ends: 2220297 [2019-09-10 08:56:47,733 INFO L226 Difference]: Without dead ends: 2220297 [2019-09-10 08:56:47,733 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 08:56:49,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220297 states.