java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:13:55,262 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:13:55,264 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:13:55,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:13:55,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:13:55,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:13:55,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:13:55,281 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:13:55,282 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:13:55,283 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:13:55,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:13:55,285 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:13:55,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:13:55,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:13:55,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:13:55,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:13:55,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:13:55,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:13:55,292 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:13:55,294 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:13:55,296 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:13:55,297 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:13:55,298 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:13:55,299 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:13:55,302 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:13:55,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:13:55,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:13:55,306 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:13:55,308 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:13:55,309 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:13:55,309 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:13:55,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:13:55,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:13:55,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:13:55,315 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:13:55,315 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:13:55,315 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:13:55,316 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:13:55,316 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:13:55,317 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:13:55,317 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:13:55,318 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:13:55,343 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:13:55,343 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:13:55,343 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:13:55,344 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:13:55,344 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:13:55,345 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:13:55,345 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:13:55,345 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:13:55,345 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:13:55,345 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:13:55,346 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:13:55,346 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:13:55,347 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:13:55,347 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:13:55,347 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:13:55,347 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:13:55,347 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:13:55,347 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:13:55,348 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:13:55,348 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:13:55,348 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:13:55,348 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:13:55,349 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:13:55,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:13:55,349 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:13:55,349 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:13:55,350 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:13:55,350 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:13:55,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:13:55,350 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:13:55,387 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:13:55,398 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:13:55,402 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:13:55,403 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:13:55,406 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:13:55,406 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-10 07:13:55,485 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bfd67f18/0fdcc7317d03414881476b7a55185acb/FLAGa2978cac7 [2019-09-10 07:13:56,067 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:13:56,068 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-10 07:13:56,081 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bfd67f18/0fdcc7317d03414881476b7a55185acb/FLAGa2978cac7 [2019-09-10 07:13:56,335 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bfd67f18/0fdcc7317d03414881476b7a55185acb [2019-09-10 07:13:56,346 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:13:56,347 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:13:56,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:13:56,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:13:56,352 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:13:56,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:13:56" (1/1) ... [2019-09-10 07:13:56,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3840f152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:56, skipping insertion in model container [2019-09-10 07:13:56,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:13:56" (1/1) ... [2019-09-10 07:13:56,366 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:13:56,443 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:13:56,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:13:56,981 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:13:57,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:13:57,134 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:13:57,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:57 WrapperNode [2019-09-10 07:13:57,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:13:57,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:13:57,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:13:57,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:13:57,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:57" (1/1) ... [2019-09-10 07:13:57,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:57" (1/1) ... [2019-09-10 07:13:57,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:57" (1/1) ... [2019-09-10 07:13:57,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:57" (1/1) ... [2019-09-10 07:13:57,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:57" (1/1) ... [2019-09-10 07:13:57,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:57" (1/1) ... [2019-09-10 07:13:57,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:57" (1/1) ... [2019-09-10 07:13:57,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:13:57,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:13:57,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:13:57,228 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:13:57,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:13:57,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:13:57,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:13:57,317 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:13:57,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:13:57,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:13:57,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:13:57,318 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:13:57,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:13:57,318 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:13:57,319 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:13:57,319 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:13:57,320 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:13:57,320 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:13:57,321 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:13:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:13:57,323 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:13:57,323 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:13:57,323 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:13:57,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:13:57,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:13:58,814 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:13:58,814 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:13:58,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:13:58 BoogieIcfgContainer [2019-09-10 07:13:58,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:13:58,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:13:58,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:13:58,823 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:13:58,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:13:56" (1/3) ... [2019-09-10 07:13:58,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc1d455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:13:58, skipping insertion in model container [2019-09-10 07:13:58,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:57" (2/3) ... [2019-09-10 07:13:58,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc1d455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:13:58, skipping insertion in model container [2019-09-10 07:13:58,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:13:58" (3/3) ... [2019-09-10 07:13:58,834 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-10 07:13:58,846 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:13:58,871 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:13:58,892 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:13:58,931 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:13:58,932 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:13:58,932 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:13:58,932 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:13:58,932 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:13:58,933 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:13:58,933 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:13:58,933 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:13:58,978 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states. [2019-09-10 07:13:59,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:13:59,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:59,023 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] [2019-09-10 07:13:59,026 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:59,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:59,032 INFO L82 PathProgramCache]: Analyzing trace with hash -911000536, now seen corresponding path program 1 times [2019-09-10 07:13:59,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:59,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:59,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:59,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:59,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:59,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:59,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:59,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:13:59,483 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:59,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:13:59,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:13:59,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:13:59,506 INFO L87 Difference]: Start difference. First operand 335 states. Second operand 4 states. [2019-09-10 07:13:59,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:59,684 INFO L93 Difference]: Finished difference Result 341 states and 551 transitions. [2019-09-10 07:13:59,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:13:59,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-10 07:13:59,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:59,702 INFO L225 Difference]: With dead ends: 341 [2019-09-10 07:13:59,703 INFO L226 Difference]: Without dead ends: 331 [2019-09-10 07:13:59,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:13:59,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-10 07:13:59,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2019-09-10 07:13:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-09-10 07:13:59,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 505 transitions. [2019-09-10 07:13:59,774 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 505 transitions. Word has length 83 [2019-09-10 07:13:59,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:59,774 INFO L475 AbstractCegarLoop]: Abstraction has 331 states and 505 transitions. [2019-09-10 07:13:59,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:13:59,774 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 505 transitions. [2019-09-10 07:13:59,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 07:13:59,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:59,779 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] [2019-09-10 07:13:59,780 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:59,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:59,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1025067494, now seen corresponding path program 1 times [2019-09-10 07:13:59,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:59,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:59,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:59,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:59,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:00,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:00,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:00,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:00,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:00,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:00,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:00,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:00,020 INFO L87 Difference]: Start difference. First operand 331 states and 505 transitions. Second operand 3 states. [2019-09-10 07:14:00,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:00,097 INFO L93 Difference]: Finished difference Result 487 states and 750 transitions. [2019-09-10 07:14:00,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:00,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-10 07:14:00,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:00,102 INFO L225 Difference]: With dead ends: 487 [2019-09-10 07:14:00,102 INFO L226 Difference]: Without dead ends: 487 [2019-09-10 07:14:00,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:00,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-09-10 07:14:00,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 485. [2019-09-10 07:14:00,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-09-10 07:14:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 749 transitions. [2019-09-10 07:14:00,140 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 749 transitions. Word has length 114 [2019-09-10 07:14:00,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:00,143 INFO L475 AbstractCegarLoop]: Abstraction has 485 states and 749 transitions. [2019-09-10 07:14:00,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 749 transitions. [2019-09-10 07:14:00,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 07:14:00,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:00,154 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 07:14:00,154 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:00,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:00,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1815110171, now seen corresponding path program 1 times [2019-09-10 07:14:00,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:00,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:00,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:00,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:00,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:00,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:00,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:00,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:00,320 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:00,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:00,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:00,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:00,321 INFO L87 Difference]: Start difference. First operand 485 states and 749 transitions. Second operand 3 states. [2019-09-10 07:14:00,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:00,362 INFO L93 Difference]: Finished difference Result 748 states and 1163 transitions. [2019-09-10 07:14:00,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:00,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 07:14:00,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:00,370 INFO L225 Difference]: With dead ends: 748 [2019-09-10 07:14:00,370 INFO L226 Difference]: Without dead ends: 748 [2019-09-10 07:14:00,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:00,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-09-10 07:14:00,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 746. [2019-09-10 07:14:00,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-09-10 07:14:00,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1162 transitions. [2019-09-10 07:14:00,406 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1162 transitions. Word has length 116 [2019-09-10 07:14:00,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:00,407 INFO L475 AbstractCegarLoop]: Abstraction has 746 states and 1162 transitions. [2019-09-10 07:14:00,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:00,407 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1162 transitions. [2019-09-10 07:14:00,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 07:14:00,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:00,411 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] [2019-09-10 07:14:00,411 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:00,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:00,412 INFO L82 PathProgramCache]: Analyzing trace with hash -276878061, now seen corresponding path program 1 times [2019-09-10 07:14:00,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:00,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:00,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:00,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:00,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:00,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:00,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:00,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:00,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:00,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:00,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:00,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:00,514 INFO L87 Difference]: Start difference. First operand 746 states and 1162 transitions. Second operand 3 states. [2019-09-10 07:14:00,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:00,559 INFO L93 Difference]: Finished difference Result 1171 states and 1829 transitions. [2019-09-10 07:14:00,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:00,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-10 07:14:00,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:00,566 INFO L225 Difference]: With dead ends: 1171 [2019-09-10 07:14:00,567 INFO L226 Difference]: Without dead ends: 1171 [2019-09-10 07:14:00,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:00,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2019-09-10 07:14:00,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1169. [2019-09-10 07:14:00,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1169 states. [2019-09-10 07:14:00,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1828 transitions. [2019-09-10 07:14:00,600 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1828 transitions. Word has length 118 [2019-09-10 07:14:00,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:00,601 INFO L475 AbstractCegarLoop]: Abstraction has 1169 states and 1828 transitions. [2019-09-10 07:14:00,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:00,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1828 transitions. [2019-09-10 07:14:00,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 07:14:00,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:00,606 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] [2019-09-10 07:14:00,606 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:00,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:00,607 INFO L82 PathProgramCache]: Analyzing trace with hash 2034189920, now seen corresponding path program 1 times [2019-09-10 07:14:00,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:00,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:00,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:00,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:00,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:00,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:00,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:00,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:00,692 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:00,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:00,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:00,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:00,693 INFO L87 Difference]: Start difference. First operand 1169 states and 1828 transitions. Second operand 3 states. [2019-09-10 07:14:00,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:00,740 INFO L93 Difference]: Finished difference Result 1814 states and 2831 transitions. [2019-09-10 07:14:00,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:00,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-10 07:14:00,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:00,752 INFO L225 Difference]: With dead ends: 1814 [2019-09-10 07:14:00,752 INFO L226 Difference]: Without dead ends: 1814 [2019-09-10 07:14:00,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:00,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2019-09-10 07:14:00,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1812. [2019-09-10 07:14:00,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1812 states. [2019-09-10 07:14:00,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 2830 transitions. [2019-09-10 07:14:00,841 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 2830 transitions. Word has length 120 [2019-09-10 07:14:00,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:00,841 INFO L475 AbstractCegarLoop]: Abstraction has 1812 states and 2830 transitions. [2019-09-10 07:14:00,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:00,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2830 transitions. [2019-09-10 07:14:00,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 07:14:00,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:00,848 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 07:14:00,848 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:00,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:00,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1700990007, now seen corresponding path program 1 times [2019-09-10 07:14:00,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:00,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:00,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:00,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:00,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:00,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:00,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:00,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:00,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:00,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:00,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:00,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:00,942 INFO L87 Difference]: Start difference. First operand 1812 states and 2830 transitions. Second operand 3 states. [2019-09-10 07:14:00,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:00,993 INFO L93 Difference]: Finished difference Result 2689 states and 4165 transitions. [2019-09-10 07:14:00,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:00,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-10 07:14:00,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:01,009 INFO L225 Difference]: With dead ends: 2689 [2019-09-10 07:14:01,009 INFO L226 Difference]: Without dead ends: 2689 [2019-09-10 07:14:01,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:01,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2689 states. [2019-09-10 07:14:01,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2689 to 2687. [2019-09-10 07:14:01,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2687 states. [2019-09-10 07:14:01,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 4164 transitions. [2019-09-10 07:14:01,088 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 4164 transitions. Word has length 122 [2019-09-10 07:14:01,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:01,089 INFO L475 AbstractCegarLoop]: Abstraction has 2687 states and 4164 transitions. [2019-09-10 07:14:01,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:01,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 4164 transitions. [2019-09-10 07:14:01,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 07:14:01,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:01,098 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 07:14:01,098 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:01,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:01,098 INFO L82 PathProgramCache]: Analyzing trace with hash -2140897977, now seen corresponding path program 1 times [2019-09-10 07:14:01,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:01,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:01,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:01,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:01,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:01,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:01,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:01,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:14:01,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:01,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:14:01,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:14:01,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:14:01,501 INFO L87 Difference]: Start difference. First operand 2687 states and 4164 transitions. Second operand 7 states. [2019-09-10 07:14:02,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:02,218 INFO L93 Difference]: Finished difference Result 11301 states and 17133 transitions. [2019-09-10 07:14:02,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:14:02,219 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-09-10 07:14:02,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:02,285 INFO L225 Difference]: With dead ends: 11301 [2019-09-10 07:14:02,285 INFO L226 Difference]: Without dead ends: 11301 [2019-09-10 07:14:02,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:14:02,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11301 states. [2019-09-10 07:14:02,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11301 to 11293. [2019-09-10 07:14:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11293 states. [2019-09-10 07:14:02,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11293 states to 11293 states and 17129 transitions. [2019-09-10 07:14:02,595 INFO L78 Accepts]: Start accepts. Automaton has 11293 states and 17129 transitions. Word has length 124 [2019-09-10 07:14:02,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:02,596 INFO L475 AbstractCegarLoop]: Abstraction has 11293 states and 17129 transitions. [2019-09-10 07:14:02,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:14:02,596 INFO L276 IsEmpty]: Start isEmpty. Operand 11293 states and 17129 transitions. [2019-09-10 07:14:02,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 07:14:02,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:02,632 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 07:14:02,632 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:02,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:02,633 INFO L82 PathProgramCache]: Analyzing trace with hash 65222622, now seen corresponding path program 1 times [2019-09-10 07:14:02,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:02,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:02,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:02,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:02,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:02,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:02,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:02,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:02,906 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:02,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:02,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:02,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:02,909 INFO L87 Difference]: Start difference. First operand 11293 states and 17129 transitions. Second operand 3 states. [2019-09-10 07:14:03,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:03,061 INFO L93 Difference]: Finished difference Result 19700 states and 29632 transitions. [2019-09-10 07:14:03,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:03,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-10 07:14:03,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:03,171 INFO L225 Difference]: With dead ends: 19700 [2019-09-10 07:14:03,171 INFO L226 Difference]: Without dead ends: 19700 [2019-09-10 07:14:03,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:03,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19700 states. [2019-09-10 07:14:03,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19700 to 19698. [2019-09-10 07:14:03,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19698 states. [2019-09-10 07:14:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19698 states to 19698 states and 29631 transitions. [2019-09-10 07:14:03,645 INFO L78 Accepts]: Start accepts. Automaton has 19698 states and 29631 transitions. Word has length 126 [2019-09-10 07:14:03,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:03,646 INFO L475 AbstractCegarLoop]: Abstraction has 19698 states and 29631 transitions. [2019-09-10 07:14:03,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:03,646 INFO L276 IsEmpty]: Start isEmpty. Operand 19698 states and 29631 transitions. [2019-09-10 07:14:03,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 07:14:03,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:03,801 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 07:14:03,801 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:03,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:03,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1951025456, now seen corresponding path program 1 times [2019-09-10 07:14:03,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:03,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:03,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:03,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:03,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:03,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:03,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:03,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:03,892 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:03,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:03,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:03,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:03,893 INFO L87 Difference]: Start difference. First operand 19698 states and 29631 transitions. Second operand 3 states. [2019-09-10 07:14:04,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:04,002 INFO L93 Difference]: Finished difference Result 21894 states and 32935 transitions. [2019-09-10 07:14:04,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:04,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-10 07:14:04,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:04,051 INFO L225 Difference]: With dead ends: 21894 [2019-09-10 07:14:04,051 INFO L226 Difference]: Without dead ends: 21894 [2019-09-10 07:14:04,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:04,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21894 states. [2019-09-10 07:14:04,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21894 to 21892. [2019-09-10 07:14:04,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21892 states. [2019-09-10 07:14:04,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21892 states to 21892 states and 32934 transitions. [2019-09-10 07:14:04,505 INFO L78 Accepts]: Start accepts. Automaton has 21892 states and 32934 transitions. Word has length 126 [2019-09-10 07:14:04,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:04,505 INFO L475 AbstractCegarLoop]: Abstraction has 21892 states and 32934 transitions. [2019-09-10 07:14:04,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:04,506 INFO L276 IsEmpty]: Start isEmpty. Operand 21892 states and 32934 transitions. [2019-09-10 07:14:04,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 07:14:04,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:04,714 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 07:14:04,715 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:04,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:04,715 INFO L82 PathProgramCache]: Analyzing trace with hash 7426086, now seen corresponding path program 1 times [2019-09-10 07:14:04,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:04,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:04,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:04,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:04,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:04,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:04,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:04,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:04,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:04,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:04,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:04,837 INFO L87 Difference]: Start difference. First operand 21892 states and 32934 transitions. Second operand 3 states. [2019-09-10 07:14:04,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:04,969 INFO L93 Difference]: Finished difference Result 34200 states and 51261 transitions. [2019-09-10 07:14:04,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:04,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-10 07:14:04,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:05,043 INFO L225 Difference]: With dead ends: 34200 [2019-09-10 07:14:05,043 INFO L226 Difference]: Without dead ends: 34200 [2019-09-10 07:14:05,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:05,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34200 states. [2019-09-10 07:14:06,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34200 to 34198. [2019-09-10 07:14:06,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34198 states. [2019-09-10 07:14:06,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34198 states to 34198 states and 51260 transitions. [2019-09-10 07:14:06,213 INFO L78 Accepts]: Start accepts. Automaton has 34198 states and 51260 transitions. Word has length 126 [2019-09-10 07:14:06,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:06,214 INFO L475 AbstractCegarLoop]: Abstraction has 34198 states and 51260 transitions. [2019-09-10 07:14:06,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:06,214 INFO L276 IsEmpty]: Start isEmpty. Operand 34198 states and 51260 transitions. [2019-09-10 07:14:06,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 07:14:06,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:06,285 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 07:14:06,285 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:06,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:06,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1965979855, now seen corresponding path program 1 times [2019-09-10 07:14:06,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:06,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:06,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:06,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:06,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:06,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:06,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:06,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:06,365 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:06,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:06,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:06,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:06,367 INFO L87 Difference]: Start difference. First operand 34198 states and 51260 transitions. Second operand 3 states. [2019-09-10 07:14:06,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:06,529 INFO L93 Difference]: Finished difference Result 46909 states and 70040 transitions. [2019-09-10 07:14:06,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:06,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-10 07:14:06,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:06,632 INFO L225 Difference]: With dead ends: 46909 [2019-09-10 07:14:06,632 INFO L226 Difference]: Without dead ends: 46909 [2019-09-10 07:14:06,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:06,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46909 states. [2019-09-10 07:14:07,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46909 to 46907. [2019-09-10 07:14:07,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46907 states. [2019-09-10 07:14:07,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46907 states to 46907 states and 70039 transitions. [2019-09-10 07:14:07,635 INFO L78 Accepts]: Start accepts. Automaton has 46907 states and 70039 transitions. Word has length 126 [2019-09-10 07:14:07,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:07,636 INFO L475 AbstractCegarLoop]: Abstraction has 46907 states and 70039 transitions. [2019-09-10 07:14:07,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:07,636 INFO L276 IsEmpty]: Start isEmpty. Operand 46907 states and 70039 transitions. [2019-09-10 07:14:07,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 07:14:07,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:07,717 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 07:14:07,718 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:07,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:07,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1195527623, now seen corresponding path program 1 times [2019-09-10 07:14:07,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:07,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:07,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:07,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:07,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:07,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:07,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:07,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:14:07,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:07,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:14:07,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:14:07,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:14:07,818 INFO L87 Difference]: Start difference. First operand 46907 states and 70039 transitions. Second operand 5 states. [2019-09-10 07:14:09,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:09,441 INFO L93 Difference]: Finished difference Result 72889 states and 107937 transitions. [2019-09-10 07:14:09,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:14:09,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-09-10 07:14:09,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:09,578 INFO L225 Difference]: With dead ends: 72889 [2019-09-10 07:14:09,578 INFO L226 Difference]: Without dead ends: 72889 [2019-09-10 07:14:09,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:14:09,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72889 states. [2019-09-10 07:14:10,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72889 to 72887. [2019-09-10 07:14:10,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72887 states. [2019-09-10 07:14:10,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72887 states to 72887 states and 107936 transitions. [2019-09-10 07:14:10,774 INFO L78 Accepts]: Start accepts. Automaton has 72887 states and 107936 transitions. Word has length 128 [2019-09-10 07:14:10,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:10,774 INFO L475 AbstractCegarLoop]: Abstraction has 72887 states and 107936 transitions. [2019-09-10 07:14:10,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:14:10,774 INFO L276 IsEmpty]: Start isEmpty. Operand 72887 states and 107936 transitions. [2019-09-10 07:14:10,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 07:14:10,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:10,868 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 07:14:10,868 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:10,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:10,868 INFO L82 PathProgramCache]: Analyzing trace with hash -217394905, now seen corresponding path program 1 times [2019-09-10 07:14:10,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:10,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:10,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:10,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:10,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:10,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:10,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:10,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:10,960 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:10,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:10,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:10,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:10,961 INFO L87 Difference]: Start difference. First operand 72887 states and 107936 transitions. Second operand 3 states. [2019-09-10 07:14:11,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:11,178 INFO L93 Difference]: Finished difference Result 65509 states and 95773 transitions. [2019-09-10 07:14:11,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:11,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-10 07:14:11,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:11,286 INFO L225 Difference]: With dead ends: 65509 [2019-09-10 07:14:11,286 INFO L226 Difference]: Without dead ends: 65509 [2019-09-10 07:14:11,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:11,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65509 states. [2019-09-10 07:14:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65509 to 65507. [2019-09-10 07:14:13,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65507 states. [2019-09-10 07:14:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65507 states to 65507 states and 95772 transitions. [2019-09-10 07:14:13,519 INFO L78 Accepts]: Start accepts. Automaton has 65507 states and 95772 transitions. Word has length 128 [2019-09-10 07:14:13,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:13,519 INFO L475 AbstractCegarLoop]: Abstraction has 65507 states and 95772 transitions. [2019-09-10 07:14:13,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:13,520 INFO L276 IsEmpty]: Start isEmpty. Operand 65507 states and 95772 transitions. [2019-09-10 07:14:13,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 07:14:13,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:13,563 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 07:14:13,564 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:13,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:13,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1115908038, now seen corresponding path program 1 times [2019-09-10 07:14:13,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:13,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:13,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:13,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:13,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:13,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:13,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:13,705 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:13,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:13,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:13,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:13,707 INFO L87 Difference]: Start difference. First operand 65507 states and 95772 transitions. Second operand 3 states. [2019-09-10 07:14:13,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:13,832 INFO L93 Difference]: Finished difference Result 33559 states and 48689 transitions. [2019-09-10 07:14:13,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:13,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-10 07:14:13,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:13,879 INFO L225 Difference]: With dead ends: 33559 [2019-09-10 07:14:13,879 INFO L226 Difference]: Without dead ends: 33559 [2019-09-10 07:14:13,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:13,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33559 states. [2019-09-10 07:14:14,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33559 to 33557. [2019-09-10 07:14:14,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33557 states. [2019-09-10 07:14:14,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33557 states to 33557 states and 48688 transitions. [2019-09-10 07:14:14,394 INFO L78 Accepts]: Start accepts. Automaton has 33557 states and 48688 transitions. Word has length 128 [2019-09-10 07:14:14,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:14,394 INFO L475 AbstractCegarLoop]: Abstraction has 33557 states and 48688 transitions. [2019-09-10 07:14:14,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:14,395 INFO L276 IsEmpty]: Start isEmpty. Operand 33557 states and 48688 transitions. [2019-09-10 07:14:14,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 07:14:14,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:14,422 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 07:14:14,423 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:14,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:14,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1673717793, now seen corresponding path program 1 times [2019-09-10 07:14:14,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:14,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:14,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:14,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:14,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:14,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:14,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:14,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:14,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:14,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:14,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:14,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:14,915 INFO L87 Difference]: Start difference. First operand 33557 states and 48688 transitions. Second operand 3 states. [2019-09-10 07:14:14,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:14,984 INFO L93 Difference]: Finished difference Result 17443 states and 25145 transitions. [2019-09-10 07:14:14,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:14,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-10 07:14:14,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:15,007 INFO L225 Difference]: With dead ends: 17443 [2019-09-10 07:14:15,007 INFO L226 Difference]: Without dead ends: 17443 [2019-09-10 07:14:15,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:15,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17443 states. [2019-09-10 07:14:15,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17443 to 17441. [2019-09-10 07:14:15,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17441 states. [2019-09-10 07:14:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17441 states to 17441 states and 25144 transitions. [2019-09-10 07:14:15,214 INFO L78 Accepts]: Start accepts. Automaton has 17441 states and 25144 transitions. Word has length 128 [2019-09-10 07:14:15,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:15,215 INFO L475 AbstractCegarLoop]: Abstraction has 17441 states and 25144 transitions. [2019-09-10 07:14:15,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:15,215 INFO L276 IsEmpty]: Start isEmpty. Operand 17441 states and 25144 transitions. [2019-09-10 07:14:15,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 07:14:15,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:15,226 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 07:14:15,226 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:15,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:15,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1368528636, now seen corresponding path program 1 times [2019-09-10 07:14:15,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:15,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:15,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:15,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:15,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:15,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:15,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:15,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:14:15,404 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:15,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:14:15,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:14:15,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:14:15,405 INFO L87 Difference]: Start difference. First operand 17441 states and 25144 transitions. Second operand 7 states. [2019-09-10 07:14:15,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:15,888 INFO L93 Difference]: Finished difference Result 61515 states and 87582 transitions. [2019-09-10 07:14:15,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:14:15,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2019-09-10 07:14:15,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:15,970 INFO L225 Difference]: With dead ends: 61515 [2019-09-10 07:14:15,970 INFO L226 Difference]: Without dead ends: 61515 [2019-09-10 07:14:15,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:14:16,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61515 states. [2019-09-10 07:14:17,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61515 to 33706. [2019-09-10 07:14:17,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33706 states. [2019-09-10 07:14:17,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33706 states to 33706 states and 47695 transitions. [2019-09-10 07:14:17,490 INFO L78 Accepts]: Start accepts. Automaton has 33706 states and 47695 transitions. Word has length 128 [2019-09-10 07:14:17,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:17,490 INFO L475 AbstractCegarLoop]: Abstraction has 33706 states and 47695 transitions. [2019-09-10 07:14:17,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:14:17,491 INFO L276 IsEmpty]: Start isEmpty. Operand 33706 states and 47695 transitions. [2019-09-10 07:14:17,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 07:14:17,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:17,509 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 07:14:17,509 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:17,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:17,510 INFO L82 PathProgramCache]: Analyzing trace with hash 908994833, now seen corresponding path program 1 times [2019-09-10 07:14:17,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:17,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:17,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:17,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:17,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:17,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:17,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:17,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:14:17,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:17,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:14:17,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:14:17,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:14:17,630 INFO L87 Difference]: Start difference. First operand 33706 states and 47695 transitions. Second operand 6 states. [2019-09-10 07:14:17,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:17,865 INFO L93 Difference]: Finished difference Result 62594 states and 87227 transitions. [2019-09-10 07:14:17,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:14:17,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-09-10 07:14:17,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:17,939 INFO L225 Difference]: With dead ends: 62594 [2019-09-10 07:14:17,939 INFO L226 Difference]: Without dead ends: 62594 [2019-09-10 07:14:17,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:14:17,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62594 states. [2019-09-10 07:14:18,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62594 to 34938. [2019-09-10 07:14:18,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34938 states. [2019-09-10 07:14:18,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34938 states to 34938 states and 48927 transitions. [2019-09-10 07:14:18,399 INFO L78 Accepts]: Start accepts. Automaton has 34938 states and 48927 transitions. Word has length 131 [2019-09-10 07:14:18,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:18,400 INFO L475 AbstractCegarLoop]: Abstraction has 34938 states and 48927 transitions. [2019-09-10 07:14:18,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:14:18,400 INFO L276 IsEmpty]: Start isEmpty. Operand 34938 states and 48927 transitions. [2019-09-10 07:14:18,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:14:18,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:18,420 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:14:18,420 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:18,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:18,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1876311282, now seen corresponding path program 1 times [2019-09-10 07:14:18,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:18,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:18,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:18,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:18,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:18,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:18,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:18,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:18,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:18,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:18,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:18,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:18,497 INFO L87 Difference]: Start difference. First operand 34938 states and 48927 transitions. Second operand 3 states. [2019-09-10 07:14:18,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:18,654 INFO L93 Difference]: Finished difference Result 51167 states and 70200 transitions. [2019-09-10 07:14:18,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:18,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-09-10 07:14:18,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:18,729 INFO L225 Difference]: With dead ends: 51167 [2019-09-10 07:14:18,730 INFO L226 Difference]: Without dead ends: 51167 [2019-09-10 07:14:18,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:18,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51167 states. [2019-09-10 07:14:19,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51167 to 49685. [2019-09-10 07:14:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49685 states. [2019-09-10 07:14:19,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49685 states to 49685 states and 68571 transitions. [2019-09-10 07:14:19,451 INFO L78 Accepts]: Start accepts. Automaton has 49685 states and 68571 transitions. Word has length 132 [2019-09-10 07:14:19,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:19,451 INFO L475 AbstractCegarLoop]: Abstraction has 49685 states and 68571 transitions. [2019-09-10 07:14:19,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:19,452 INFO L276 IsEmpty]: Start isEmpty. Operand 49685 states and 68571 transitions. [2019-09-10 07:14:19,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:14:19,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:19,486 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 07:14:19,487 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:19,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:19,487 INFO L82 PathProgramCache]: Analyzing trace with hash 844346502, now seen corresponding path program 1 times [2019-09-10 07:14:19,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:19,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:19,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:19,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:19,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:19,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:19,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:19,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:19,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:19,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:19,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:19,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:19,559 INFO L87 Difference]: Start difference. First operand 49685 states and 68571 transitions. Second operand 3 states. [2019-09-10 07:14:19,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:19,804 INFO L93 Difference]: Finished difference Result 82365 states and 111365 transitions. [2019-09-10 07:14:19,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:19,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-09-10 07:14:19,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:19,945 INFO L225 Difference]: With dead ends: 82365 [2019-09-10 07:14:19,945 INFO L226 Difference]: Without dead ends: 82137 [2019-09-10 07:14:19,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:20,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82137 states. [2019-09-10 07:14:21,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82137 to 81767. [2019-09-10 07:14:21,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81767 states. [2019-09-10 07:14:21,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81767 states to 81767 states and 110607 transitions. [2019-09-10 07:14:21,162 INFO L78 Accepts]: Start accepts. Automaton has 81767 states and 110607 transitions. Word has length 132 [2019-09-10 07:14:21,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:21,162 INFO L475 AbstractCegarLoop]: Abstraction has 81767 states and 110607 transitions. [2019-09-10 07:14:21,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:21,163 INFO L276 IsEmpty]: Start isEmpty. Operand 81767 states and 110607 transitions. [2019-09-10 07:14:21,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:14:21,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:21,229 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 07:14:21,229 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:21,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:21,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1658001551, now seen corresponding path program 1 times [2019-09-10 07:14:21,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:21,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:21,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:21,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:21,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:21,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:21,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:21,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:14:21,344 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:21,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:14:21,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:14:21,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:14:21,345 INFO L87 Difference]: Start difference. First operand 81767 states and 110607 transitions. Second operand 7 states. [2019-09-10 07:14:22,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:22,530 INFO L93 Difference]: Finished difference Result 195611 states and 262787 transitions. [2019-09-10 07:14:22,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:14:22,532 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2019-09-10 07:14:22,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:22,791 INFO L225 Difference]: With dead ends: 195611 [2019-09-10 07:14:22,791 INFO L226 Difference]: Without dead ends: 195611 [2019-09-10 07:14:22,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:14:22,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195611 states. [2019-09-10 07:14:24,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195611 to 81939. [2019-09-10 07:14:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81939 states. [2019-09-10 07:14:24,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81939 states to 81939 states and 110801 transitions. [2019-09-10 07:14:24,755 INFO L78 Accepts]: Start accepts. Automaton has 81939 states and 110801 transitions. Word has length 132 [2019-09-10 07:14:24,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:24,755 INFO L475 AbstractCegarLoop]: Abstraction has 81939 states and 110801 transitions. [2019-09-10 07:14:24,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:14:24,755 INFO L276 IsEmpty]: Start isEmpty. Operand 81939 states and 110801 transitions. [2019-09-10 07:14:24,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:14:24,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:24,822 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 07:14:24,822 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:24,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:24,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1351755653, now seen corresponding path program 1 times [2019-09-10 07:14:24,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:24,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:24,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:24,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:24,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:24,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:24,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:24,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:24,892 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:24,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:24,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:24,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:24,893 INFO L87 Difference]: Start difference. First operand 81939 states and 110801 transitions. Second operand 3 states. [2019-09-10 07:14:25,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:25,522 INFO L93 Difference]: Finished difference Result 161984 states and 217767 transitions. [2019-09-10 07:14:25,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:25,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-09-10 07:14:25,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:25,763 INFO L225 Difference]: With dead ends: 161984 [2019-09-10 07:14:25,763 INFO L226 Difference]: Without dead ends: 161984 [2019-09-10 07:14:25,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:25,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161984 states. [2019-09-10 07:14:29,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161984 to 161535. [2019-09-10 07:14:29,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161535 states. [2019-09-10 07:14:29,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161535 states to 161535 states and 217309 transitions. [2019-09-10 07:14:29,812 INFO L78 Accepts]: Start accepts. Automaton has 161535 states and 217309 transitions. Word has length 132 [2019-09-10 07:14:29,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:29,813 INFO L475 AbstractCegarLoop]: Abstraction has 161535 states and 217309 transitions. [2019-09-10 07:14:29,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:29,813 INFO L276 IsEmpty]: Start isEmpty. Operand 161535 states and 217309 transitions. [2019-09-10 07:14:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:14:29,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:29,950 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 07:14:29,950 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:29,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:29,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1848849120, now seen corresponding path program 1 times [2019-09-10 07:14:29,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:29,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:29,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:29,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:29,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:30,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:30,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:14:30,050 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:30,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:14:30,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:14:30,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:14:30,052 INFO L87 Difference]: Start difference. First operand 161535 states and 217309 transitions. Second operand 6 states. [2019-09-10 07:14:31,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:31,673 INFO L93 Difference]: Finished difference Result 246201 states and 329070 transitions. [2019-09-10 07:14:31,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:14:31,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-09-10 07:14:31,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:31,970 INFO L225 Difference]: With dead ends: 246201 [2019-09-10 07:14:31,971 INFO L226 Difference]: Without dead ends: 244921 [2019-09-10 07:14:31,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:14:32,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244921 states. [2019-09-10 07:14:37,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244921 to 236176. [2019-09-10 07:14:37,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236176 states. [2019-09-10 07:14:37,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236176 states to 236176 states and 316382 transitions. [2019-09-10 07:14:37,501 INFO L78 Accepts]: Start accepts. Automaton has 236176 states and 316382 transitions. Word has length 132 [2019-09-10 07:14:37,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:37,501 INFO L475 AbstractCegarLoop]: Abstraction has 236176 states and 316382 transitions. [2019-09-10 07:14:37,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:14:37,501 INFO L276 IsEmpty]: Start isEmpty. Operand 236176 states and 316382 transitions. [2019-09-10 07:14:37,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:14:37,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:37,606 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 07:14:37,607 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:37,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:37,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1824231082, now seen corresponding path program 1 times [2019-09-10 07:14:37,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:37,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:37,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:37,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:37,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:37,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:37,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:14:37,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:37,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:14:37,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:14:37,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:14:37,719 INFO L87 Difference]: Start difference. First operand 236176 states and 316382 transitions. Second operand 7 states. [2019-09-10 07:14:44,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:44,156 INFO L93 Difference]: Finished difference Result 558675 states and 748424 transitions. [2019-09-10 07:14:44,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 07:14:44,157 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2019-09-10 07:14:44,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:44,928 INFO L225 Difference]: With dead ends: 558675 [2019-09-10 07:14:44,928 INFO L226 Difference]: Without dead ends: 558675 [2019-09-10 07:14:44,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:14:45,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558675 states. [2019-09-10 07:14:48,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558675 to 236643. [2019-09-10 07:14:48,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236643 states. [2019-09-10 07:14:48,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236643 states to 236643 states and 316997 transitions. [2019-09-10 07:14:48,860 INFO L78 Accepts]: Start accepts. Automaton has 236643 states and 316997 transitions. Word has length 132 [2019-09-10 07:14:48,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:48,860 INFO L475 AbstractCegarLoop]: Abstraction has 236643 states and 316997 transitions. [2019-09-10 07:14:48,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:14:48,860 INFO L276 IsEmpty]: Start isEmpty. Operand 236643 states and 316997 transitions. [2019-09-10 07:14:48,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:14:48,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:48,963 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 07:14:48,963 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:48,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:48,963 INFO L82 PathProgramCache]: Analyzing trace with hash 783261860, now seen corresponding path program 1 times [2019-09-10 07:14:48,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:48,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:48,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:48,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:48,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:49,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:49,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:49,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:14:49,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:49,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:14:49,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:14:49,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:14:49,044 INFO L87 Difference]: Start difference. First operand 236643 states and 316997 transitions. Second operand 5 states. [2019-09-10 07:14:51,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:51,421 INFO L93 Difference]: Finished difference Result 436537 states and 581484 transitions. [2019-09-10 07:14:51,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:14:51,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-09-10 07:14:51,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:52,033 INFO L225 Difference]: With dead ends: 436537 [2019-09-10 07:14:52,033 INFO L226 Difference]: Without dead ends: 436537 [2019-09-10 07:14:52,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:14:52,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436537 states. [2019-09-10 07:15:00,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436537 to 436128. [2019-09-10 07:15:00,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436128 states. [2019-09-10 07:15:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436128 states to 436128 states and 580969 transitions. [2019-09-10 07:15:02,256 INFO L78 Accepts]: Start accepts. Automaton has 436128 states and 580969 transitions. Word has length 132 [2019-09-10 07:15:02,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:02,257 INFO L475 AbstractCegarLoop]: Abstraction has 436128 states and 580969 transitions. [2019-09-10 07:15:02,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:15:02,257 INFO L276 IsEmpty]: Start isEmpty. Operand 436128 states and 580969 transitions. [2019-09-10 07:15:02,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:15:02,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:02,456 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 07:15:02,456 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:02,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:02,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1304932114, now seen corresponding path program 1 times [2019-09-10 07:15:02,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:02,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:02,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:02,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:02,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:02,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:15:02,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:02,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:15:02,579 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:02,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:15:02,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:15:02,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:15:02,580 INFO L87 Difference]: Start difference. First operand 436128 states and 580969 transitions. Second operand 7 states. [2019-09-10 07:15:06,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:06,234 INFO L93 Difference]: Finished difference Result 1045300 states and 1389271 transitions. [2019-09-10 07:15:06,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 07:15:06,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2019-09-10 07:15:06,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:17,009 INFO L225 Difference]: With dead ends: 1045300 [2019-09-10 07:15:17,010 INFO L226 Difference]: Without dead ends: 1045300 [2019-09-10 07:15:17,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:15:17,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045300 states. [2019-09-10 07:15:24,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045300 to 439037. [2019-09-10 07:15:24,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439037 states. [2019-09-10 07:15:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439037 states to 439037 states and 584852 transitions. [2019-09-10 07:15:25,286 INFO L78 Accepts]: Start accepts. Automaton has 439037 states and 584852 transitions. Word has length 132 [2019-09-10 07:15:25,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:25,287 INFO L475 AbstractCegarLoop]: Abstraction has 439037 states and 584852 transitions. [2019-09-10 07:15:25,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:15:25,287 INFO L276 IsEmpty]: Start isEmpty. Operand 439037 states and 584852 transitions. [2019-09-10 07:15:25,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:15:25,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:25,479 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 07:15:25,479 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:25,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:25,480 INFO L82 PathProgramCache]: Analyzing trace with hash -619029604, now seen corresponding path program 1 times [2019-09-10 07:15:25,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:25,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:25,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:25,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:25,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:25,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:15:25,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:25,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:15:25,551 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:25,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:15:25,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:15:25,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:25,554 INFO L87 Difference]: Start difference. First operand 439037 states and 584852 transitions. Second operand 3 states. [2019-09-10 07:15:32,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:32,973 INFO L93 Difference]: Finished difference Result 871352 states and 1152212 transitions. [2019-09-10 07:15:32,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:15:32,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-09-10 07:15:32,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:35,458 INFO L225 Difference]: With dead ends: 871352 [2019-09-10 07:15:35,459 INFO L226 Difference]: Without dead ends: 871352 [2019-09-10 07:15:35,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:35,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871352 states. [2019-09-10 07:15:51,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871352 to 868729. [2019-09-10 07:15:51,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868729 states. [2019-09-10 07:15:53,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868729 states to 868729 states and 1149574 transitions. [2019-09-10 07:15:53,515 INFO L78 Accepts]: Start accepts. Automaton has 868729 states and 1149574 transitions. Word has length 132 [2019-09-10 07:15:53,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:53,515 INFO L475 AbstractCegarLoop]: Abstraction has 868729 states and 1149574 transitions. [2019-09-10 07:15:53,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:15:53,516 INFO L276 IsEmpty]: Start isEmpty. Operand 868729 states and 1149574 transitions. [2019-09-10 07:16:02,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:16:02,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:02,838 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 07:16:02,838 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:02,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:02,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1583520351, now seen corresponding path program 1 times [2019-09-10 07:16:02,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:02,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:02,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:02,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:02,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:02,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:02,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:02,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:16:02,918 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:02,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:16:02,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:16:02,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:16:02,919 INFO L87 Difference]: Start difference. First operand 868729 states and 1149574 transitions. Second operand 5 states. [2019-09-10 07:16:06,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:06,343 INFO L93 Difference]: Finished difference Result 1040963 states and 1367414 transitions. [2019-09-10 07:16:06,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:16:06,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-09-10 07:16:06,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:08,033 INFO L225 Difference]: With dead ends: 1040963 [2019-09-10 07:16:08,033 INFO L226 Difference]: Without dead ends: 1038612 [2019-09-10 07:16:08,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:16:08,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038612 states. [2019-09-10 07:16:27,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038612 to 1036231. [2019-09-10 07:16:27,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036231 states. [2019-09-10 07:16:44,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036231 states to 1036231 states and 1362676 transitions. [2019-09-10 07:16:44,812 INFO L78 Accepts]: Start accepts. Automaton has 1036231 states and 1362676 transitions. Word has length 132 [2019-09-10 07:16:44,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:44,812 INFO L475 AbstractCegarLoop]: Abstraction has 1036231 states and 1362676 transitions. [2019-09-10 07:16:44,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:16:44,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1036231 states and 1362676 transitions. [2019-09-10 07:16:45,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:16:45,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:45,057 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 07:16:45,057 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:45,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:45,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1232720105, now seen corresponding path program 1 times [2019-09-10 07:16:45,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:45,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:45,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:45,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:45,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:45,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:45,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:45,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:16:45,170 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:45,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:16:45,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:16:45,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:16:45,171 INFO L87 Difference]: Start difference. First operand 1036231 states and 1362676 transitions. Second operand 7 states. [2019-09-10 07:17:10,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:10,314 INFO L93 Difference]: Finished difference Result 2312880 states and 3042602 transitions. [2019-09-10 07:17:10,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 07:17:10,314 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2019-09-10 07:17:10,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:14,974 INFO L225 Difference]: With dead ends: 2312880 [2019-09-10 07:17:14,974 INFO L226 Difference]: Without dead ends: 2312880 [2019-09-10 07:17:14,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:17:16,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312880 states. [2019-09-10 07:17:43,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312880 to 1039673. [2019-09-10 07:17:43,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039673 states. [2019-09-10 07:18:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039673 states to 1039673 states and 1367515 transitions. [2019-09-10 07:18:02,425 INFO L78 Accepts]: Start accepts. Automaton has 1039673 states and 1367515 transitions. Word has length 132 [2019-09-10 07:18:02,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:02,425 INFO L475 AbstractCegarLoop]: Abstraction has 1039673 states and 1367515 transitions. [2019-09-10 07:18:02,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:18:02,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1039673 states and 1367515 transitions. [2019-09-10 07:18:02,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:18:02,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:02,681 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 07:18:02,681 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:02,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:02,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1336129724, now seen corresponding path program 1 times [2019-09-10 07:18:02,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:02,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:02,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:02,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:02,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:02,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:18:02,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:02,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:18:02,760 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:02,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:18:02,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:18:02,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:18:02,762 INFO L87 Difference]: Start difference. First operand 1039673 states and 1367515 transitions. Second operand 3 states. [2019-09-10 07:18:16,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:16,976 INFO L93 Difference]: Finished difference Result 2059431 states and 2682999 transitions. [2019-09-10 07:18:16,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:18:16,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-09-10 07:18:16,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:22,552 INFO L225 Difference]: With dead ends: 2059431 [2019-09-10 07:18:22,553 INFO L226 Difference]: Without dead ends: 2059431 [2019-09-10 07:18:22,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:18:23,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059431 states. [2019-09-10 07:19:16,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059431 to 2056444. [2019-09-10 07:19:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056444 states.